Reflexive: every a R a. Symmetric: a R b ⇒ b R a. Transitive: a R b and b R c ⇒ a R c. To prove a property you need a general argument; to disprove it, one counterexample is enough.
| Property | To prove it | To disprove it |
|---|---|---|
| Reflexive | Show (a, a) ∈ R for an arbitrary a ∈ A | Find one a with (a, a) ∉ R |
| Symmetric | Assume (a, b) ∈ R, deduce (b, a) ∈ R | Find one (a, b) ∈ R with (b, a) ∉ R |
| Transitive | Assume (a, b), (b, c) ∈ R, deduce (a, c) ∈ R | Find (a, b), (b, c) ∈ R with (a, c) ∉ R |
Testing a relation given as a list of pairs
- Reflexive check Is every (a, a) present for each a in the set? One missing pair is enough to say no.
- Symmetric check For each listed (a, b) with a ≠ b, is (b, a) also listed?
- Transitive check For every chain (a, b), (b, c) in the list, is (a, c) listed too? Include chains that use pairs like (a, a).
- Conclude Equivalence relation only if all three answers are yes.
Key takeaways: a relation in A is a subset of A × A. The empty and universal relations are the two extremes. Reflexive needs every (a, a); symmetric needs every pair reversed; transitive needs every chain completed. Prove with a general argument, disprove with one counterexample, and remember that the three properties are independent of one another.