Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck 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.

Additive Hilbert 90: trace zero is the image of αασ(α)

Statement

Let K/F be a finite cyclic extension of degree n with Gal(K/F)=σ. For bK, the following are equivalent:

  1. TrK/F(b)=0.
  2. There exists αK with b=ασ(α).

Facts & Assumptions

Given: A finite cyclic extension K/F of degree n, a generator σ of its Galois group, and an element bK.

[F1]

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

[L1]

In a finite separable extension, the trace map is surjective (The trace map of a finite separable extension is surjective).

Proof

technique · direct
1.1

For the forward direction from 2 to 1, suppose b=ασ(α). Summing the conjugates gives TrK/F(b)=i=0n1σi(ασ(α))=i=0n1(σi(α)σi+1(α))=0, again by telescoping and σn=1.

F1algebra
1.2

For the converse, assume TrK/F(b)=0. By [F1] and [L1], choose cK with TrK/F(c)=1. Define α:=i=0n1(j=0i1σj(b))σi(c), where the inner sum is 0 for i=0.

F1L1choose
2.1

Put si=j=0i1σj(b), so s0=0, sn=TrK/F(b)=0, and si=b+σ(si1) for 1in1, while 0=sn=b+σ(sn1). Applying σ to the coefficients as well gives σ(α)=i=0n1σ(si)σi+1(c)=σ(sn1)c+i=1n1σ(si1)σi(c). Therefore every coefficient of ασ(α) is b, so ασ(α)=bi=0n1σi(c)=bTrK/F(c)=b.

step 1.2algebra
3.1

Steps 1.1 and 2.1 prove the equivalence.

step 1.1step 2.1

Remarks

  • This is the additive engine behind Artin-Schreier theory. The next theorem applies it to the trace-zero element 1 in characteristic p.

Depends on

Used by

Dependency tree · two levels

4 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