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.
The full correspondence for the splitting field of
Example
Let be the real cube root of , let with , and put . Define
Then . Its fixed-field table, with products of automorphisms read right to left, is
| Subgroup | Fixed field |
|---|---|
The three order-two subgroups correspond to three cubic fields that are not normal over . Among the strict intermediate fields, is the single normal one.
Facts & Assumptions
Given: Eisenstein's irreducibility criterion at (Eisenstein criterion over the integers) and the degree formulas in The fundamental theorem of finite Galois theory.
An intermediate field is Galois exactly when its corresponding subgroup is normal (Normal subgroups, conjugate fields, and quotient groups in the Galois correspondence).
For a finite extension with , being Galois, being the splitting field of a separable polynomial, , and are equivalent (Equivalent characterizations of a finite Galois extension).
For algebraic over a field there is a unique monic irreducible generating the kernel of evaluation at , and exactly when (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).
If is algebraic over with minimal polynomial of degree , then is an -basis of and (A simple algebraic extension is its minimal-polynomial quotient and has power basis and degree ).
For fields with and finite, is finite and (Tower law for finite extensions: ).
Verification
Eisenstein at makes irreducible over , so by [L3] it is the minimal polynomial of and by [L4] . Since is real, , whereas the two roots of are nonreal; that quadratic therefore has no root in , is irreducible over , and by [L3] and [L4] gives . By [L5], . The three cube roots of are , all in , and they generate over because ; hence is the splitting field of over .
The displayed maps permute the three roots and preserve the defining relations, so they are automorphisms. Direct calculation gives and , and the six maps are distinct. The three roots of are distinct, so that polynomial is separable and step 1.1 makes its splitting field; by [L2], is finite Galois with . The six maps therefore exhaust the automorphism group.
Each listed generator fixes its displayed field: fixes , fixes , while sends to and to , so it fixes , and sends to and to , so it fixes . Each of is a root of the irreducible and is a root of the irreducible , so by [L3] and [L4] the four fields have degrees and over , matching the indices of the corresponding subgroups. Each displayed field therefore sits inside the fixed field of its subgroup with the same finite degree over , so the two coincide, and the fundamental theorem's bijection makes the table complete.
The subgroup is normal in , while none of the three order-two subgroups is normal. By [L1], is Galois and the three cubic fields are not; the base and splitting fields give the two normal endpoints.
Depends on
- The fundamental theorem of finite Galois theory
- Equivalent characterizations of a finite Galois extension
- Normal subgroups, conjugate fields, and quotient groups in the Galois correspondence
- Eisenstein criterion over the integers
- The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element
- A simple algebraic extension is its minimal-polynomial quotient and has power basis $1,a,\ldots,a^{n-1}$ and degree $n$
- Tower law for finite extensions: $[L:F]=[L:K][K:F]$
Used by
Dependency tree · two levels
38 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
- K. Conrad, The Galois Correspondence, Examples 4.6 and 5.8 (standard reference, not scraped)
- J. S. Milne, Fields and Galois Theory, v5.10, Chapter 3 (standard reference, not scraped)