Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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.

The Frattini subgroup of a nontrivial cyclic p-group

Example

If P=g has order pn with n1, then Φ(P)=gp and d(P)=1. For n=1, this says Φ(P)=1.

Facts & Assumptions

Given: A cyclic group P=g of order pn with n1.

[L1]

For every finite p-group P, Φ(P)=PPp (Φ(P)=PPp for a finite p-group).

[L2]

If G=g has finite order m, then ord(ga)=m/gcd(a,m) (In a cyclic group of order m, ga has order m/gcd(a,m)).

[F1]

The subgroup generated by a subset is the smallest subgroup containing it, and a group is cyclic when it is generated by one element (The subgroup S generated by a subset, the cyclic subgroup g, and cyclic groups).

[F2]

The generator rank d(P) is the common size of a basis of P/Φ(P) (The generator rank d(P) of a finite p-group).

Verification

technique · direct
1.1

Every pth power in P is a power of gp, and conversely gp is a pth power, so [F1] gives Pp=gp. The group is abelian, so P=1. By [L2], gp has order pn1, including order one at n=1, and [L3] is consistent with this cyclic subgroup description.

givenL2F1L3algebra
2.1

Formula [L1] gives Φ(P)=gp. The quotient has order p, so its nonidentity coset gΦ(P) is a one-vector basis; hence [F2] gives d(P)=1.

step 1.1L1F2algebra

Depends on

Used by

Dependency tree · two levels

25 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