Procedure
Testing a relation for reflexive, symmetric, transitive
Algebra • Relations and Functions
Statement
A relation on a set is reflexive if for every ; symmetric if ; transitive if and . A property fails as soon as one case breaks it, and holds only if it is proved for every case.
How to use it
- 1For reflexive, try a negative number, zero, and a fraction: one failure is enough.
- 2For transitive, write both given conditions and chain them; use what the first condition forces, such as a number being non-negative.
Worked example
On the real numbers, means . Is reflexive? Is it transitive?
Step-by-step
- 1for every , so is reflexive.
- 2() and (), but is false
Why: One failing chain is enough.
- 3So is not transitive.
Answer
reflexive, not transitive
Watch out
Checking a few examples never proves a property; it can only disprove it.