An equivalence relation on a set is a binary relation that is reflexive, symmetric and transitive: every satisfies ; implies ; and , imply . Each of these quantifiers ranges over the entire specified set. The separate entries below test these three properties.
This is an equivalence relation. The difference is an even integer, proving reflexivity. If then , proving that the relation is symmetric. If and then , proving transitivity. Its equivalence classes are the translates ; two real numbers need not be integers themselves to belong to the same class.
For nonzero complex numbers, . Since is positive real, the condition is equivalent to . This is an equivalence relation. The ratio gives reflexivity; the reciprocal of a nonzero real ratio shows that the relation is symmetric; and gives transitivity. An equivalence class is a real line through zero with zero removed, or equivalently all nonzero complex numbers with the same argument modulo .
This is not an equivalence relation. For , , so reflexivity fails. It is symmetric, because is the conjugate of , and an integer is real. It also fails transitivity: take and . Then are integers but is not. A single failure would suffice, but these examples identify exactly which properties break.
This is not an equivalence relation. With the usual convention that zero is a perfect square, gives reflexivity, and changing the sign of shows that the relation is symmetric. However because , and because , whereas is neither a positive nor a negative perfect square: . Thus transitivity fails. If “perfect square” were restricted to positive squares, reflexivity would fail as well, leaving the same negative classification.
Articles by others on the same topic
There are currently no matching articles.