Mathematical logic and foundations Theorem
Equivalence classes form a partition
Builds on Equivalence classPartition of a set
Statement
Let be an equivalence relation on a set . Then the set of equivalence classes is a partition of .
Remarks
Each class is nonempty, because by reflexivity. If and have a common element, then by symmetry and transitivity, so . The left cosets of a subgroup of a group form such a partition. This fact is the key step in Lagrange's theorem.
Reading path
To understand this page from the ground up, read these 27 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Element definition
- Proposition concept
- Set definition
- Conjunction definition
- Disjunction definition
- Implication definition
- Predicate definition
- Empty set object
- Family of sets definition
- Ordered pair definition
- Intersection definition
- Union definition
- Set-builder notation concept
- Existential quantifier definition
- Universal quantifier definition
- Disjoint sets definition
- Cartesian product definition
- Subset definition
- Union of a family of sets definition
- Binary relation definition
- Partition of a set definition
- Reflexive relation definition
- Symmetric relation definition
- Transitive relation definition
- Equivalence relation definition
- Equivalence class definition
- Equivalence classes form a partition statement
Where this leads
30 pages build on this one.
- A finite group is nilpotent iff it is the product of its Sylow subgroups
- Groups of prime order are cyclic
- Correspondence between equivalence relations and partitions
- Order of an element divides the order of the group
- Fixed points of a p-group action
- Second Sylow theorem
- Groups of order p squared are abelian
- The number of Sylow subgroups is the index of the normaliser
- The alternating group A5 is simple
- Abelian simple groups have prime order
- Cauchy's theorem
- The number of Sylow subgroups divides the index
- Converse of Lagrange's theorem fails for the alternating group A4
- Third Sylow theorem
- Frattini argument
- Size of an orbit times the size of the stabiliser
- First Sylow theorem
- Groups of order pq
- Burnside's lemma
- g to the order of the group is the identity
- Lagrange's theorem
- Galois group of a prime degree polynomial with two nonreal roots
- Nichols–Zoeller theorem
- Hall's theorem on solvable groups
- Proof that the order of an element divides the order of the group
- Hall subgroup
- Sylow theorems
- Frattini subgroup
- Proof that groups of prime order are cyclic
- Proof of Lagrange's theorem
Further reading
- Web https://en.wikipedia.org/wiki/Partition_of_a_set, Partitions and equivalence relations
About this page
| Tag | 01HT2CH8BH |
|---|---|
| URI | m2://01HT2CH8BH |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 03E20 |
| Status | This copy of the site has no build data. Run m2 status 01HT2CH8BH. |
| Uses | Equivalence class, Partition of a set |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.