Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-13
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.

After adjoining one nonzero root α of xna, all roots are ζα with ζn=1

Statement

Let n1, let F be a field, and let aF. Suppose an extension E/F contains a nonzero root α of xna. Then a0, and for βE, βn=aβ=ζα for some ζE with ζn=1. Consequently, if μn(E)={ζE:ζn=1} and E contains every root of xna, its splitting field inside E is F(α,μn(E)).

Facts & Assumptions

Given: A positive integer n, a field extension E/F, and a nonzero αE satisfying αn=aF.

[F1]

Every nonzero field element is a unit (Field).

[F3]

A splitting field is generated over the base by all roots of the polynomial (Polynomials that split and splitting fields of a polynomial or a family of polynomials).

Proof

technique · direct, both directions
1.1

Since α0, [F1] gives α1. Also a=αn0, because a product of nonzero field elements is nonzero.

F1
1.2

Conversely, if β=ζα and ζn=1, then [F2] gives βn=ζnαn=a.

F2
2.1

If βn=a, put ζ=βα1. By [F2], ζn=βn(αn)1=aa1=1, and β=ζα.

F1F2step 1.1
3.1

Thus the root set in E is exactly αμn(E). The field generated by that set equals F(α,μn(E)): it contains α=1α, and from any root ζα it recovers ζ=(ζα)α1; the reverse containment follows because each ζα is a root. Now [F3] gives the splitting-field assertion.

F1F3step 2.1step 1.2

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 55 results over 16 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources