Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-11
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.

If [G:H]=n<∞, then Core⁡G(H)⊴G, [G:Core⁡G(H)]∣n!, and only finitely many subgroups contain H

Statement

Let H≤G have finite index [G:H]=n, and put N=Core⁡G(H). Then N⊴G, the index [G:N] divides n!, and there are only finitely many subgroups K with H≤K≤G.

Facts & Assumptions

Given: A group G, a subgroup H≤G of finite index n, and N:=Core⁡G(H).

[L1]

The action on G/H gives a homomorphism ρ:G→Sym⁡(G/H) whose kernel is N (Left multiplication on G/H is transitive, has stabiliser H at H, and has kernel Core⁡G(H)).

[L2]

The core N is normal in G, lies in H, and contains every normal subgroup of G lying in H (Core⁡G(H) is the largest normal subgroup of G contained in H).

[L3]

First isomorphism gives G/ker⁡ρ≅im⁡ρ (First isomorphism theorem for groups: G/ker⁡f≅im⁡f).

[L6]

The order of a subgroup of a finite group divides the order of the group (Lagrange's theorem: ∣G∣=[G:H]∣H∣ for every subgroup H of a finite group G).

[L8]

The power set of a finite set is finite (∣P(A)∣=2∣A∣ for finite A).

[L10]

For a finite-index subgroup, the index is the cardinality of its coset set (The coset set G/H and the index [G:H] of a subgroup, The cardinality ∣A∣ of a finite set).

Proof

technique · direct
1.1

By [L1] and [L2], the coset action has kernel N⊴G with N≤H, and its image is a subgroup of Sym⁡(G/H).

L1L2L4
2.1

By [L3], G/N≅im⁡ρ. The set G/H has n elements by [L10], so [L5] gives ∣Sym⁡(G/H)∣=n!; [L6] therefore gives ∣G/N∣=∣im⁡ρ∣∣n!, that is, [G:N]∣n! by [L10].

step 1.1L3L4L5L6L10
3.1

Every subgroup K containing H also contains N by [L2]. If π(x)∈π[K], then π(x)=π(k) for some k∈K, so k−1x∈N≤K and hence x∈K; thus K=π−1[π[K]]. Therefore K↦π[K] injects the set of such overgroups into the power set of the now known finite set G/N, which is finite by [L8] and [L9].

step 2.1L2L7L8L9
4.1

Thus the core is normal and finite-index, its index divides n!, and the collection of subgroups containing H is finite.

step 1.1step 2.1step 3.1∎

Depends on

Used by

Dependency tree · two levels

73 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