Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 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.

In characteristic p, a degree-p extension is cyclic exactly when it is generated by a root of xp−x−a with a∈F and that polynomial irreducible

Statement

Let F be a field of characteristic p>0, and let K/F be a finite extension of degree p. Then the following are equivalent:

  1. K/F is cyclic.
  2. There exists α∈K and a∈F such that αp−α=a and xp−x−a is irreducible over F.

When these conditions hold, the roots of xp−x−a in K are exactly α+i for i∈Fp, so K is already the splitting field and its Galois group is generated by α↦α+1.

Facts & Assumptions

Given: A field F of characteristic p>0 and a degree-p extension K/F.

[F1]

A cyclic extension is a finite Galois extension with cyclic Galois group (A cyclic extension is a finite Galois extension with cyclic Galois group).

[L1]

In a cyclic extension, trace zero is equivalent to being of the form α−σ(α) (Additive Hilbert 90: trace zero is the image of α↦α−σ(α)).

[L2]

A finite extension is Galois exactly when it is the splitting field of a separable polynomial (Equivalent characterizations of a finite Galois extension).

Proof

technique · direct
1.1F1L1choose

For the forward direction, assume K/F is cyclic and choose a generator σ of its Galois group. Since [K:F]=p and char⁡F=p, one has Tr⁡K/F(−1)=−p=0. By [L1], choose α∈K with −1=α−σ(α), so σ(α)=α+1.

1.2L2algebra

For the converse direction, assume αp−α=a∈F and xp−x−a is irreducible. For each i∈Fp one has (α+i)p−(α+i)=αp−α=a, so the roots of the polynomial are exactly α+i for i∈Fp. Thus all roots lie in F(α), the derivative is −1≠0, and [L2] makes F(α)/F Galois. Because the polynomial is irreducible of degree p, this extension has degree p.

2.1step 1.1algebra

In characteristic p, one has (α+1)p−(α+1)=αp−α, so the element a:=αp−α is fixed by σ and therefore lies in F. Also α∉F because step 1.1 gives σ(α)≠α. Since [K:F]=p is prime and F⊆F(α)⊆K, one must have F(α)=K. The polynomial xp−x−a∈F[x] has root α and degree p=[F(α):F], so it is the minimal polynomial of α over F and is irreducible.

2.2step 1.2algebra

The rule τ(α)=α+1 permutes the root set and fixes F, so it extends to an F-automorphism of F(α). Its p-th power fixes α and each smaller positive power moves α, so τ has order p. A degree-p finite Galois extension has at most p automorphisms, hence exactly the cyclic group generated by τ. Therefore F(α)/F is cyclic of degree p.

3.1step 1.2step 2.1step 2.2∎

Steps 2.1 and 2.2 prove the equivalence, and the displayed root set in step 1.2 proves the final sentence.

Depends on

Used by

Dependency tree · two levels

26 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