Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-08-03 (gpt-5.6-sol-codex-subscription)
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: ∣G∣=[G:H]∣H∣ for every subgroup H of a finite group G

Statement

Let G be a finite group and H≤G. Then

∣G∣=[G:H] ∣H∣.

Consequently, under the canonical embedding ι:N→Z, ι(∣H∣) divides ι(∣G∣).

Facts & Assumptions

Given: A finite group G and a subgroup H≤G.

[L1]

The distinct left cosets of H partition G (The left cosets of a subgroup partition the group).

[L2]

The subgroup, every coset, and G/H are finite; every coset has cardinality ∣H∣ and ∣G/H∣=[G:H] (In a finite group, the subgroup, every coset and the set of cosets are finite, Every left or right coset of H is equinumerous with H, The coset set G/H and the index [G:H] of a subgroup).

[F1]

The order ∣G∣ of a finite group is the unique natural equinumerous with its underlying set, hence agrees with finite cardinality (The order ∣G∣ of a finite group and the order ord⁡(g) of an element, with ord⁡(g)=∞ when no positive power of g is the identity, The cardinality ∣A∣ of a finite set).

[L4]

The embedding ι preserves multiplication, and d∣a in Z means a=dq for some integer q (The naturals embed in the integers, Divisibility in Z: d∣a when a=dq for some integer q).

Proof

technique · direct
1.1

Apply the finite partition sum to the coset partition: ∣G∣=∑C∈G/H∣C∣.

L1L2L3F1
2.1

Every summand equals ∣H∣, and there are ∣G/H∣=[G:H] summands, so the constant-sum clause gives ∣G∣=[G:H]∣H∣.

step 1.1L2L3
3.1

Applying ι gives ι(∣G∣)=ι(∣H∣)ι([G:H]), so ι(∣H∣)∣ι(∣G∣).

step 2.1L4∎

Depends on

Used by

…and 35 more results.

Dependency tree · two levels

49 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources