Difference between revisions of "Equivalence relation"
Jump to navigation
Jump to search
m (added cat) |
(more info) |
||
| Line 1: | Line 1: | ||
| − | An '''equivalence relation''' is a mathematical [[relation]] which is [[Reflexivity|reflexive]], [[Symmetry|symmetric]], and [[Transitivity|transitive]]. [[Equality]] and set [[Member|membership]] are the most basic equivalence relations, which is why they are often called trivial equivalence relations. | + | An '''equivalence relation''' is a mathematical [[relation]] which is [[Reflexivity|reflexive]], [[Symmetry|symmetric]], and [[Transitivity|transitive]]. [[Equality]] and set [[Member|membership]] are the most basic equivalence relations, which is why they are often called trivial equivalence relations. Every equivalence relation is constructed from [[Irreducibility|irreducible]] equivalences. |
[[Congruence|Congruence relations]] are examples of equivalence relations, as is the j-invariant of [[Elliptic_curve|elliptic curves]]. | [[Congruence|Congruence relations]] are examples of equivalence relations, as is the j-invariant of [[Elliptic_curve|elliptic curves]]. | ||
Revision as of 20:14, March 2, 2008
An equivalence relation is a mathematical relation which is reflexive, symmetric, and transitive. Equality and set membership are the most basic equivalence relations, which is why they are often called trivial equivalence relations. Every equivalence relation is constructed from irreducible equivalences.
Congruence relations are examples of equivalence relations, as is the j-invariant of elliptic curves.
An equivalence relation on a set S partitions S into disjoint subsets, known as equivalence classes. Two objects in the same equivalence class are said to be equivalent.
Equivalence relations are the mathematical foundation for forming quotients.