Relation (mathematics): Difference between revisions
imported>Richard Pinch (subpages) |
imported>Richard Pinch (def of n-ary relation) |
||
Line 9: | Line 9: | ||
:<math>R^\top = \{ (y,x) \in Y \times X : (x,y) \in R \} . \, </math> | :<math>R^\top = \{ (y,x) \in Y \times X : (x,y) \in R \} . \, </math> | ||
More generally, we may define an ''n''-ary relation to be a subset of the product of ''n'' sets <math>R \subseteq X _1\times \cdots \times X_n</math>. | |||
Revision as of 12:32, 3 November 2008
A relation between sets X and Y is a subset of the Cartesian product, . We write to indicate that , and say that x "stands in the relation R to" y, or that x "is related by R to" y.
The composition of a relation R between X and Y and a relation S between Y and Z is
The transpose of a relation R between X and Y is the relation between Y and X defined by
More generally, we may define an n-ary relation to be a subset of the product of n sets .
Relations on a set
A relation R on a set X is a relation between X and itself, that is, a subset of .
- R is reflexive if for all .
- R is symmetric if ; that is, .
- R is transitive if ; that is, .
An equivalence relation is one which is reflexive, symmetric and transitive.
Functions
We say that a relation R is functional if it satisfies the condition that every occurs in exactly one pair . We then define the value of the function at x to be that unique y. We thus identify a function with its graph.