When a relation is defined on a single set, we can ask useful questions about it. Is every element related to itself? If is related to , is related to ? If is related to and to , is related to ? The answers sort relations into types: reflexive, symmetric, transitive, and the important combinations called equivalence relations and partial orders. This lesson defines each type and tests real examples.
Throughout, is a relation on a non-empty set , that is, a relation from to .
The definitions
Reflexive. is reflexive if for every . Every element is related to itself.
Symmetric. is symmetric if . Every pair comes with its reverse.
Transitive. is transitive if and . Two links in a chain imply a direct link.
Equivalence relation. is an equivalence relation if it is reflexive, symmetric and transitive.
Antisymmetric. is antisymmetric if and . Two different elements are never related both ways.
Partial order. is a partial order if it is reflexive, antisymmetric and transitive.
To show that a property holds, you must check it for every element or every pair. To show that it fails, one counterexample is enough.
Testing finite relations
Example 1
Let and . Which properties does have?
Reflexive? but . So is not reflexive.
Symmetric? and ; and . Every pair has its reverse, so is symmetric.
Transitive? and , but . So is not transitive.
Antisymmetric? and , but . So is not antisymmetric.
Example 2
Let and . Is reflexive, symmetric, transitive, an equivalence relation?
Reflexive. , and are all in , so yes.
Symmetric. but . So no.
Transitive. and , but . So no.
So is reflexive only, and it is not an equivalence relation. (Some chains do work, such as , but one failing chain is enough.)
Testing relations given by a rule
Example 3
is a relation on the set of all real numbers, given by . Which properties does have?
Reflexive. For every real , , so . Yes.
Symmetric. If then , since . Yes.
Transitive. Take , , . Then and , so and . But , so . Not transitive.
The number 0 links a negative number to a positive one, and that breaks the chain.
Example 4
Let be the set of words in an English dictionary, and let . Which properties does have?
Reflexive. Every word shares all its letters with itself. Yes.
Symmetric. If and share a letter, then and share it. Yes.
Transitive. "cat" and "bat" share the letters a and t; "bat" and "bill" share the letter b. But "cat" and "bill" have no letter in common. Not transitive.
Example 5
For real numbers and , define is an irrational number. Which properties does have?
Reflexive. , which is irrational. So for every . Yes.
Symmetric. Take and : , which is irrational, so . But , which is rational, so . Not symmetric.
Transitive. It is tempting to argue that adding two irrational numbers gives an irrational number, but that is false: and are irrational and their sum is 0. A counterexample: take , , .
- , irrational, so .
- , irrational, so .
- , rational, so .
So is not transitive. It is reflexive, but neither symmetric nor transitive.
An equivalence relation
Example 6
On the set of integers, define is divisible by 3. Show that is an equivalence relation.
Reflexive. , divisible by 3.
Symmetric. If , then , also divisible by 3.
Transitive. If and , then adding, , divisible by 3.
So is an equivalence relation. It sorts the integers into three groups according to their remainder on division by 3: , and . Two integers are related exactly when they are in the same group. Every equivalence relation splits its set into groups in this way.
A partial order
Example 7
Show that " divides " is a partial order on .
Reflexive. Every divides itself.
Antisymmetric. If divides and divides , then and (for natural numbers), so .
Transitive. If and , then , so divides .
It is not symmetric: 2 divides 6 but 6 does not divide 2. The relation on is another partial order.
Practice
- Let and . Show that is an equivalence relation.
- Let and . Which of reflexive, symmetric, transitive, antisymmetric does have?
- Let and . Which properties does have?
- On the set of lines in a plane, is "is perpendicular to" reflexive, symmetric, transitive?
- On , define if is even. Is an equivalence relation?
- On , is the relation reflexive, symmetric, transitive?
- On , define if . Which properties does have?
- On , define if is divisible by 5. Show that is an equivalence relation, and say how many groups it splits into.
- Write the smallest relation on that contains and is both reflexive and symmetric.
- Is the void relation on a non-empty set reflexive? Is the universal relation an equivalence relation?
Answers
Show answers
- All are present, so reflexive; the only pairs with different entries are and , so symmetric; every chain, such as , gives a pair in , so transitive.
- Not reflexive (no ); not symmetric ( but no ); transitive (the only chain is , and ); antisymmetric.
- Reflexive; not symmetric; not transitive ( but no ); antisymmetric.
- Not reflexive (no line is perpendicular to itself); symmetric; not transitive (if and , then is parallel to , not perpendicular).
- Yes: is even; ; and if and are even, then is even.
- Not reflexive, not symmetric, but transitive.
- Reflexive and symmetric, but not transitive: and , but .
- Same proof as Example 6 with 5 in place of 3. It splits into 5 groups, by remainder 0, 1, 2, 3, 4.
- No: the void relation contains no . Yes: contains every pair, so it is reflexive, symmetric and transitive.