Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck 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 xn−a, all roots are ζα with ζn=1

Statement

Let n≥1, let F be a field, and let a∈F. Suppose an extension E/F contains a nonzero root α of xn−a. Then a≠0, and for β∈E, βn=a⟺β=ζα for some ζ∈E with ζn=1. Consequently, if μn(E)={ζ∈E:ζn=1} and E contains every root of xn−a, 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=a∈F.

[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=αn≠0, 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=aa−1=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 · 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