Left Cosets Partition a Group and All Have the Same Cardinality
theoremAlgebrathm:coset-partition-2026aLet be a \reftext{def:group-2026a}{group}, written multiplicatively, with identity element and inverses as in \ref{thm:group-identity-inverse-uniqueness-2026a}, and let be a \reftext{def:subgroup-2026a}{subgroup} of . For let be the \reftext{def:left-coset-order-index-2026a}{left coset} determined by . Then for all the following hold.
- . In particular every element of lies in at least one left coset, and is itself a left coset.
- if and only if .
- If , then . Consequently every element of lies in exactly one left coset of .
- The map is a \reftext{def:bijection-sets-2026a}{bijection} from onto . In particular, if \reftext{def:number-of-elements-2026a}{has elements} for some \reftext{def:natural-numbers-2026a}{natural number} , then every left coset has elements.
Prerequisites
No prerequisites tracked.
Dependents
No dependents yet.
Dependent proofs
No dependent proofs yet.
Authors
Loading…