Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24
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.

Burnside Basis Theorem

Statement

A subset X of a finite p-group P is a minimal generating set if and only if the quotient map restricts to a bijection from X onto a basis of P/Φ(P). Equivalently, the indexed family (xΦ(P))xX is a basis.

The restricted-bijection clause is essential: the image set alone would forget whether two distinct elements of X lie in the same Frattini coset. Every basis in this theorem has d(P) members (The generator rank d(P) of a finite p-group).

Facts & Assumptions

Given: A finite p-group P, the quotient map π:PP/Φ(P), and a subset XP.

[L1]

A subset S of a finite group G generates G if and only if its image generates G/Φ(G) (Generation of a finite group is detected modulo its Frattini subgroup).

[F1]

A subset X is a minimal generating set when it generates and no proper subset generates (Minimal generating sets of a group).

[L2]

Every finite elementary abelian p-group has a basis; every independent subset extends to a basis, every spanning subset contains a basis, and all bases have the same finite size (Finite elementary abelian p-groups have bases, basis extension, and a well-defined dimension, Fp-spanning sets, independence, and bases in an elementary abelian p-group).

[L3]

For a finite p-group P, the quotient P/Φ(P) is elementary abelian (The Frattini quotient is the largest elementary abelian quotient of a finite p-group).

Proof

technique · direct
1.1

For the forward direction, suppose X is minimally generating. By [L1], π(X) spans. If xX mapped to zero, or if distinct x,yX had the same image, deleting one of them would leave the same spanning image and [L1] would make a proper subset generate, contrary to [F1]. Thus πX is injective. Any proper subset of π(X) that spanned would likewise pull back to a proper generating subset of X, so π(X) spans and no proper subset of it does. By [L2] it contains a basis B; since B spans, the failure of every proper subset to span forces B=π(X), so π(X) is itself a basis.

givenL1F1L2L3algebra
1.2

For the reverse direction, suppose πX is a bijection onto a basis. The basis spans, so [L1] gives X=P. Removing any xX removes its distinct basis vector; the remaining basis vectors do not span, so [L1] says X{x} does not generate. Thus X is minimal by [F1].

givenL1F1L2L3algebra
2.1

Steps 1.1 and 1.2 prove both implications. For P=1, the quotient has the empty basis and the empty set is the minimal generating set, so the same statement applies.

step 1.1step 1.2

Depends on

Used by

Dependency tree · two levels

21 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