Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 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.

The maximal subgroups of the dihedral group of order eight as Frattini hyperplanes

Example

For D=Dih⁡(C4)=⟨r,s⟩, the maximal subgroups are

⟨r⟩,⟨r2,s⟩,⟨r2,rs⟩.

Modulo Φ(D)=⟨r2⟩, these are the hyperplanes of (Z/2)2.

Facts & Assumptions

Given: The dihedral group D=Dih⁡(C4) of order eight.

[L1]

For D=Dih⁡(C4) one has Φ(D)=⟨r2⟩, and for the dihedral group of order eight and Q8 the Frattini subgroup has order two and the Frattini quotient is (Z/2)2 (The Frattini subgroups of the dihedral and quaternion groups of order eight).

[L2]

If π:P→E=P/Φ(P) is the quotient map, the maximal subgroups of P are exactly π−1(ker⁡λ)=ker⁡(λ∘π) for nonzero Fp-linear homomorphisms λ:E→Z/p (Maximal subgroups of a finite p-group are the inverse images of Frattini hyperplanes).

Verification

technique · direct
1.1givenL1algebra

The three displayed subgroups have order four, are distinct, and contain Φ(D)=⟨r2⟩ from [L1]. Since D has order eight, each is maximal.

2.1step 1.1L2algebra∎

Use the quotient basis (rΦ(D),sΦ(D)). The quotient images of the displayed subgroups are the lines spanned by (1,0), (0,1), and (1,1), which are respectively the kernels of (a,b)↦b, (a,b)↦a, and (a,b)↦a+b. These are precisely the hyperplanes described by [L2].

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

16 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