Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (gpt-5.6-terra)audited 2026-08-26
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.

Over Q(ω), the splitting field of x32 is a cyclic cubic extension

Example

Let ω be a primitive cube root of unity and put F=Q(ω). Then x32 is irreducible over F, and its splitting field is

F(23),

which is a cyclic extension of degree 3 over F.

Facts & Assumptions

Given: The field F=Q(ω) and the polynomial x32.

[L1]

Norm and trace are given by the embedding formulas (Norm and trace from embeddings, with the inseparable exponent in the norm formula).

[L2]

Over a base containing μ3, a degree-three extension is cyclic exactly when it is generated by a root of an irreducible cubic x3a (If μnF and charFn, then a degree-n extension is cyclic exactly when it is F(α) with αnF and xnαn irreducible).

Verification

technique · direct
1.1

The field F/Q has degree 2. If 2=β3 for some βF, then taking norms from F to Q gives 4=NF/Q(2)=NF/Q(β)3, which is impossible because no rational cube equals 4. So 2 is not a cube in F. Hence x32 has no root in F and is irreducible there.

L1algebra
2.1

Since ωF, all roots of x32 are 23, ω23, ω223, so they all lie in F(23). The irreducibility from step 1.1 and [L2] therefore make F(23)/F cyclic of degree 3.

L2step 1.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

17 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