Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck 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.

Inversion on C3 is detected on its Frattini quotient

Example

Inversion on C3 is a nontrivial automorphism of order two, and its action on the Frattini quotient is nontrivial. Thus Hall–Burnside detects it; the theorem does not assert that coprime automorphisms are absent.

Facts & Assumptions

Given: The cyclic group C3=g.

[L1]

If P=g has order pn with n1, then Φ(P)=gp and d(P)=1 (The Frattini subgroup of a nontrivial cyclic p-group).

[L2]

If a p-subgroup of Aut(P) acts trivially on P/Φ(P), then it is trivial (Hall–Burnside: coprime automorphisms are detected on the Frattini quotient).

[L3]

For Cn=g, every unit class [a](Z/n)× defines the automorphism gga ( Aut(Cn)(Z/nZ)×).

Verification

technique · direct
1.1

By [L1], Φ(C3)=g3=1. The unit [1]3 gives inversion by [L3]; it sends g to g1=g2g and its square is the identity, so it is a nonidentity automorphism of order two.

givenL1L3algebra
2.1

Since the Frattini subgroup is trivial, the induced quotient action is the same nontrivial inversion. This is consistent with [L2], which forbids this order-two subgroup from acting trivially because 2 is coprime to 3.

step 1.1L2

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

19 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