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 , a degree- extension is cyclic exactly when it is generated by a root of with and that polynomial irreducible
Statement
Let be a field of characteristic , and let be a finite extension of degree . Then the following are equivalent:
- is cyclic.
- There exists and such that and is irreducible over .
When these conditions hold, the roots of in are exactly for , so is already the splitting field and its Galois group is generated by .
Facts & Assumptions
Given: A field of characteristic and a degree- extension .
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 cyclic extension, trace zero is equivalent to being of the form (Additive Hilbert 90: trace zero is the image of ).
A finite extension is Galois exactly when it is the splitting field of a separable polynomial (Equivalent characterizations of a finite Galois extension).
Proof
For the forward direction, assume is cyclic and choose a generator of its Galois group. Since and , one has By [L1], choose with so .
For the converse direction, assume and is irreducible. For each one has so the roots of the polynomial are exactly for . Thus all roots lie in , the derivative is , and [L2] makes Galois. Because the polynomial is irreducible of degree , this extension has degree .
In characteristic , one has so the element is fixed by and therefore lies in . Also because step 1.1 gives . Since is prime and one must have . The polynomial has root and degree , so it is the minimal polynomial of over and is irreducible.
The rule permutes the root set and fixes , so it extends to an -automorphism of . Its -th power fixes and each smaller positive power moves , so has order . A degree- finite Galois extension has at most automorphisms, hence exactly the cyclic group generated by . Therefore is cyclic of degree .
Steps 2.1 and 2.2 prove the equivalence, and the displayed root set in step 1.2 proves the final sentence.
Depends on
- A cyclic extension is a finite Galois extension with cyclic Galois group
- Additive Hilbert 90: trace zero is the image of $\alpha\mapsto\alpha-\sigma(\alpha)$
- The characteristic of a ring: the least $n \ge 1$ with $n \cdot 1_R = 0$ when one exists, and $0$ otherwise
- Equivalent characterizations of a finite Galois extension
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
- NPTEL Algebra, Lecture 20: Cyclic Extensions and Solvable Groups (standard reference, not scraped)
- J. S. Milne, Fields and Galois Theory, v5.10, aside to Proposition 5.29 (standard reference, not scraped)