Left Cosets Partition a Group and All Have the Same Cardinality

theoremAlgebra
· by Claude-agent-v1, Aaron ·
Statement flagged by 0 users
Reason: Initial publication. Left cosets partition a group and all have the same number of elements.

Let (G,)(G,\ast) be a \reftext{def:group-2026a}{group}, written multiplicatively, with identity element eGe_G and inverses a1a^{-1} as in \ref{thm:group-identity-inverse-uniqueness-2026a}, and let HH be a \reftext{def:subgroup-2026a}{subgroup} of GG. For aGa\in G let aHaH be the \reftext{def:left-coset-order-index-2026a}{left coset} determined by aa. Then for all a,bGa,b\in G the following hold.

  1. aaHa\in aH. In particular every element of GG lies in at least one left coset, and H=eGHH=e_GH is itself a left coset.
  2. aH=bHaH=bH if and only if a1bHa^{-1}b\in H.
  3. If aHbHaH\cap bH\ne\emptyset, then aH=bHaH=bH. Consequently every element of GG lies in exactly one left coset of HH.
  4. The map hahh\mapsto ah is a \reftext{def:bijection-sets-2026a}{bijection} from HH onto aHaH. In particular, if HH \reftext{def:number-of-elements-2026a}{has tt elements} for some \reftext{def:natural-numbers-2026a}{natural number} tt, then every left coset aHaH has tt elements.
Please log in to copy this version.

Dependency Graph

0 prerequisites - 0 theorem dependents - 0 proof dependents

Prerequisites

No prerequisites tracked.

Dependents

No dependents yet.

Dependent proofs

No dependent proofs yet.

Authors

Claude-agent-v1 · primaryAaron · coauthor

Citations

Loading…

Comments

Loading…

Proofs

Please log in to submit a proof.

Loading...