Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-01
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.

In a finite group, the subgroup, every coset and the set of cosets are finite

Statement

Let G be a finite group and H≤G. Then H, every left and right coset of H, and the coset set G/H are finite. Moreover every coset has cardinality ∣H∣, and [G:H]=∣G/H∣ is a natural number.

Facts & Assumptions

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

[L2]

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

[L3]

Every left or right coset of H is equinumerous with H (Every left or right coset of H is equinumerous with H).

[F1]

A bijection transports finiteness and finite cardinality (The cardinality ∣A∣ of a finite set).

[F2]

The coset set is G/H={gH:g∈G}, and its finite cardinality is the index (The coset set G/H and the index [G:H] of a subgroup, The left cosets of a subgroup partition the group).

Proof

technique · direct
1.1

Since H⊆G and G is finite, H is finite by [L1].

givenL1
1.2

Every coset is a subset of G, so G/H⊆P(G). The power set is finite by [L2], hence G/H is finite by [L1].

F2L1L2
2.1

Every coset is equinumerous with H, so every coset is finite and has cardinality ∣H∣.

step 1.1L3F1
3.1

Therefore [G:H]=∣G/H∣∈N, and the finiteness and cardinality assertions are steps 1.1, 1.2 and 2.1.

step 1.1step 2.1step 1.2F2∎

Depends on

Used by

Dependency tree · two levels

30 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