Relation (mathematics): Difference between revisions
Jump to navigation
Jump to search
imported>Richard Pinch (new article, needs work) |
imported>Richard Pinch (subpages) |
||
Line 1: | Line 1: | ||
{{subpages}} | |||
A '''relation''' between sets ''X'' and ''Y'' is a [[subset]] of the [[Cartesian product]], <math>R \subseteq X \times Y</math>. We write <math>x~R~y</math> to indicate that <math>(x,y) \in R</math>, and say that ''x'' "stands in the relation ''R'' to" ''y'', or that ''x'' "is related by ''R'' to" ''y''. | A '''relation''' between sets ''X'' and ''Y'' is a [[subset]] of the [[Cartesian product]], <math>R \subseteq X \times Y</math>. We write <math>x~R~y</math> to indicate that <math>(x,y) \in R</math>, and say that ''x'' "stands in the relation ''R'' to" ''y'', or that ''x'' "is related by ''R'' to" ''y''. | ||
Revision as of 14:40, 2 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
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.