How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced — the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted — a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated — a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Lagrange's theorem: for every subgroup of a finite group
Statement
Let be a finite group and . Then
Consequently, under the canonical embedding , divides .
Facts & Assumptions
Given: A finite group and a subgroup .
The distinct left cosets of partition (The left cosets of a subgroup partition the group).
The subgroup, every coset, and are finite; every coset has cardinality and (In a finite group, the subgroup, every coset and the set of cosets are finite, Every left or right coset of is equinumerous with , The coset set and the index of a subgroup).
For a finite partition , one has ; if every summand has the same value , then (The sum rule: a finite disjoint union is finite with and , and a sum over a finite index set splits along a partition, The sum over a finite index set, and its product form).
The order of a finite group is the unique natural equinumerous with its underlying set, hence agrees with finite cardinality (The order of a finite group and the order of an element, with when no positive power of is the identity, The cardinality of a finite set).
The embedding preserves multiplication, and in means for some integer (The naturals embed in the integers, Divisibility in : when for some integer ).
Proof
Apply the finite partition sum to the coset partition: .
Every summand equals , and there are summands, so the constant-sum clause gives .
Applying gives , so .
Depends on
- In a finite group, the subgroup, every coset and the set of cosets are finite
- The left cosets of a subgroup partition the group
- Every left or right coset of $H$ is equinumerous with $H$
- The coset set $G/H$ and the index $[G:H]$ of a subgroup
- The order $|G|$ of a finite group and the order $\operatorname{ord}(g)$ of an element, with $\operatorname{ord}(g) = \infty$ when no positive power of $g$ is the identity
- The cardinality $\lvert A\rvert$ of a finite set
- The sum rule: a finite disjoint union is finite with $\lvert A \cup B\rvert = \lvert A\rvert + \lvert B\rvert$ and $\lvert\bigcup_{i \in I} A_i\rvert = \sum_{i \in I}\lvert A_i\rvert$, and a sum over a finite index set splits along a partition
- The sum $\sum_{i \in S} a_i$ over a finite index set, and its product form
- Divisibility in $\mathbb{Z}$: $d \mid a$ when $a = dq$ for some integer $q$
- The naturals embed in the integers
Used by
- Every subgroup of index p in a finite p-group is normal Corollary
- For K≤ H≤ G with G finite, [G:K]=[G:H][H:K] Corollary
- If [G:N] is finite then |G/N|=[G:N]; for finite G this equals |G|/|N| Corollary
- Orbit-stabiliser cardinality: |G· x|=[G:Gₓ] whenever either side is finite, and |G|=|Gₓ| |G· x| for finite G Corollary
- The order of every element of a finite group divides the order of the group Corollary
- The product set HK of two subgroups need not be a subgroup Counterexample
- The subgroup ⟨(1 2 3),(1 2)(3 4)⟩≤ S₄ has order 12 but no subgroup of order 6, so Cauchy's theorem does not extend to composite divisors Counterexample
- [G:G]=1 and, for finite G, [G:{e}]=|G| Example
- A₄ has no subgroup of order 6 Example
- The subgroup orders in Sym({1,2,3}) are 1,2,3 and 6 Example
- Every subgroup of a finite p-group has order a power of p Lemma
- A finite abelian group is the internal direct product of its primary components Theorem
- A p-primary component has the full p-power order and is the unique subgroup of that order Theorem
- Cauchy's theorem for finite abelian groups Theorem
- Every nontrivial finite abelian group is an internal direct product of indecomposable subgroups Theorem
- If [G:H]=n<∞, then Core_G(H) is normal in G, [G:Core_G(H)]∣ n!, and only finitely many subgroups contain H Theorem
- The conjugates of a proper subgroup do not cover a finite group Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 101 results over 26 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- UCL lecture notes, Cosets and Lagrange's theorem (standard reference, not scraped)
- Thomas W. Judson, Abstract Algebra: Theory and Applications, §6.2: Lagrange's Theorem (standard reference, not scraped)