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

Hilbert's theorem 90 for a finite cyclic extension

Statement

Let K/F be a finite cyclic extension of degree n with Gal⁡(K/F)=⟨σ⟩. For b∈K×, the following are equivalent:

  1. NK/F(b)=1.
  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 b∈K×.

[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 finite Galois extension, the norm is the product over the distinct F-embeddings (Norm and trace from embeddings, with the inseparable exponent in the norm formula).

[L2]

Distinct characters of a group into a field are linearly independent (Dedekind's linear independence theorem for distinct characters).

Proof

technique · direct
1.1F1L1

For the forward direction from 2 to 1, suppose b=β/σ(β) for some β∈K×. Since the embeddings of K/F are 1,σ,…,σn−1, [L1] gives NK/F(b)=∏i=0n−1σi(β)σi+1(β)=1, the numerator and denominator cancelling cyclically because σn=1.

1.2F1L2choose

For the converse, assume NK/F(b)=1. For 0≤i<n, set ci:=∏j=0i−1σj(b), with the empty product c0=1. Then the distinct automorphisms 1,σ,…,σn−1 restrict to distinct characters K×→K×, so [L2] implies that the K-linear operator T(x):=∑i=0n−1ci σi(x) is not identically zero. Choose x∈K with β:=T(x)≠0.

2.1step 1.2algebra

The coefficients satisfy ci+1=ciσi(b) for 0≤i<n−1, and cn=NK/F(b)=1. Therefore σ(ci)=b−1ci+1(0≤i<n−1),σ(cn−1)=b−1. Applying σ to β=T(x) and re-indexing the sum gives σ(β)=b−1β. Hence b=β/σ(β).

3.1step 1.1step 2.1∎

Steps 1.1 and 2.1 prove the equivalence.

Remarks

  • The proof uses only Dedekind independence. No cohomological language is needed here, although this is the classical vanishing of H1 for a finite cyclic extension.

Depends on

Used by

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