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.
A base-field isomorphism extends to an isomorphism between splitting fields of corresponding polynomials
Statement
Let be a field isomorphism, let , and put . If is a splitting field of and is a splitting field of , then extends to a field isomorphism .
Facts & Assumptions
Given: The fields, polynomial, splitting fields, and base isomorphism in the Statement.
Strong induction permits proving the assertion from all smaller polynomial degrees (Strong (complete) induction).
A minimal polynomial is monic irreducible and divides every polynomial vanishing at its element (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).
A base isomorphism extends uniquely across adjunctions of chosen corresponding roots of a transported irreducible polynomial (A base-field isomorphism extends across simple adjunctions of corresponding roots of an irreducible polynomial).
Coefficient transport carries roots and factorizations to the corresponding roots and factorizations (A field isomorphism transports polynomials coefficientwise and carries roots, factorizations, and splitting to roots, factorizations, and splitting).
For every field , the polynomial ring is a unique factorisation domain (For every field , is a unique factorisation domain).
A root supplies a linear factor, and a splitting field is generated by all roots (Factor theorem over a commutative ring, Polynomials that split and splitting fields of a polynomial or a family of polynomials).
Proof
Let assert the theorem for every such datum of degree . If , both root sets are empty, so and ; the required extension is .
Let and assume for all . Choose a root of , and let be its minimal polynomial over . By [F2], . Thus divides in . Since is a product of linear factors there, unique factorisation in from [F5] makes split over ; choose a root of .
By [F3], extends to an isomorphism . Factor in . Applying coefficient transport by gives with , and .
The field is a splitting field of over : it splits , and it is generated by together with the other roots of , which are the roots of . Similarly, is a splitting field of over . The induction hypothesis extends to an isomorphism .
The base case and inductive step establish for all by [F1].
Depends on
- A base-field isomorphism extends across simple adjunctions of corresponding roots of an irreducible polynomial
- A field isomorphism transports polynomials coefficientwise and carries roots, factorizations, and splitting to roots, factorizations, and splitting
- Factor theorem over a commutative ring
- The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element
- For every field $F$, $F[x]$ is a unique factorisation domain
- Strong (complete) induction
- Polynomials that split and splitting fields of a polynomial or a family of polynomials
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 64 results over 16 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- T. Judson, Abstract Algebra: Theory and Applications, Theorem 21.13 (standard reference, not scraped)
- J. S. Milne, Fields and Galois Theory, Proposition 2.11 (standard reference, not scraped)