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 be a finite cyclic extension of degree with . For , the following are equivalent:
- .
- There exists with
Facts & Assumptions
Given: A finite cyclic extension of degree , a generator of its Galois group, and an element .
A cyclic extension is a finite Galois extension with cyclic Galois group (A cyclic extension is a finite Galois extension with cyclic Galois group).
In a finite Galois extension, the norm is the product over the distinct -embeddings (Norm and trace from embeddings, with the inseparable exponent in the norm formula).
Distinct characters of a group into a field are linearly independent (Dedekind's linear independence theorem for distinct characters).
Proof
For the forward direction from 2 to 1, suppose for some . Since the embeddings of are , [L1] gives the numerator and denominator cancelling cyclically because .
For the converse, assume . For , set with the empty product . Then the distinct automorphisms restrict to distinct characters , so [L2] implies that the -linear operator is not identically zero. Choose with .
The coefficients satisfy for , and . Therefore Applying to and re-indexing the sum gives Hence .
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 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
- J. S. Milne, Fields and Galois Theory, v5.10, Theorem 5.23 and Corollary 5.25 (standard reference, not scraped)
- S. R. Ghorpade, Lectures on Field Theory and Ramification Theory, Section 1.3 (standard reference, not scraped)