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.
is normal and inseparable with trivial automorphism group
Statement refuted
The assertion that every finite normal extension is separable, or that every nontrivial finite normal extension has a nontrivial relative automorphism, is false. For every prime , is normal and inseparable of degree with trivial automorphism group.
Facts & Assumptions
Given: A prime , a transcendental element , the purely inseparable extension definition (Purely inseparable algebraic extensions), and the criterion that is irreducible when is not a -th power (If is not a th power in a characteristic- field, then is irreducible for every ).
Every purely inseparable algebraic extension is normal (Every purely inseparable algebraic extension is normal).
Counterexample
Put . The element is not a -th power in the rational-function field , as the valuation at the prime of a -th power is divisible by . Hence is irreducible over , while in it equals .
Step 1.1 gives degree and shows that every element of the extension has a power in the base field, so the extension is purely inseparable and not separable. By [L1] it is normal. This includes the smallest prime .
A base-field automorphism must send to another root of its minimal polynomial, but step 1.1 shows that is the unique root. Thus every such automorphism fixes and is the identity on .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
12 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, Example 3.8 (standard reference, not scraped)
- K. Conrad, The Galois Correspondence, positive-characteristic examples (standard reference, not scraped)