Difference between revisions of "Equivalence class"
From Maths
(→Equivalence classes are either the same or disjoint: - Proof) |
|||
Line 13: | Line 13: | ||
==Equivalence classes are either the same or disjoint== | ==Equivalence classes are either the same or disjoint== | ||
− | |||
− | |||
− | |||
− | |||
− | |||
This is the motivation for how [[Coset|cosets]] partition groups. | This is the motivation for how [[Coset|cosets]] partition groups. | ||
Latest revision as of 20:00, 14 November 2015
Contents
[hide]Definition
Given an Equivalence relation ∼ the equivalence class of a is denoted as follows:
[a]={b|a∼b}
Notations
An equivalence class may be denoted by [a] where a is the representative of it. There is an alternative representation:
- ˆa, where again a is the representative of the class.[1]
I quite like the hat notation, however I recommend one avoids using it when there are multiple Equivalence relations at play.
If there are multiple ones, then we can write for example [a]∼1 for a class in ∼1 and [f]∼2 for ∼2
Equivalence relations partition sets
An equivalence relation is a partition
Equivalence classes are either the same or disjoint
This is the motivation for how cosets partition groups.
References
- Jump up ↑ Functional Analysis - George Bachman and Lawrence Narici
TODO: Add proofs and whatnot