Timeline for Power of an order relation
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 14, 2011 at 20:32 | comment | added | Joel David Hamkins | Composition is associative, so it doesn't matter how you group the compositions. As for the domain and range, the situation for composing relations is just like that for composing functions, in that the codomain of one relation should generally line up with the domain of the next, but one can in any case make the definition exactly as I made it, if one understands a binary relation as a set of ordered pairs. | |
| Aug 14, 2011 at 18:07 | comment | added | Andrew-George Hondrari | Already figured, thanks anyway; what about <∘<∘< ? What are the couples implied and how are they mixed in the conditions for that to be true? I mean let there be (A,B;<) , (C,D;<) , (E,F;<) , a<∘<∘<f , what does that imply? What are the existance conditions, and for what couples? And what are the included sets that work along with this composition? ; if for (A,B;<) , (C,D;<) , a<∘<d <=> ∃ x∈B∩C so that (a,x)∈< and (x,d)∈< | |
| Aug 14, 2011 at 17:51 | vote | accept | Andrew-George Hondrari | ||
| Aug 14, 2011 at 12:30 | history | edited | Joel David Hamkins | CC BY-SA 3.0 |
Variable order in function composition
|
| Aug 14, 2011 at 11:25 | history | edited | Joel David Hamkins | CC BY-SA 3.0 |
added 211 characters in body; added 5 characters in body
|
| Aug 14, 2011 at 11:17 | history | edited | Joel David Hamkins | CC BY-SA 3.0 |
added 8 characters in body
|
| Aug 14, 2011 at 11:05 | history | answered | Joel David Hamkins | CC BY-SA 3.0 |