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 evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element
Statement
Let be a field extension and . Evaluation is the unique -algebra homomorphism If is transcendental, its kernel is zero. If is algebraic, there is a unique monic irreducible polynomial such that and, for every , The polynomial is the minimal polynomial of over .
Facts & Assumptions
Given: A field extension and an element .
Given a unital homomorphism of commutative rings and , there is a unique homomorphism extending and sending to (Universal property of : a coefficient homomorphism and the image of determine a unique ring homomorphism).
Every ideal of is generated by one polynomial (For every field , is a principal ideal domain).
An element is algebraic precisely when some nonzero polynomial evaluates to zero at it (Algebraic and transcendental elements and algebraic extensions).
Proof
Apply [F1] to the inclusion and ; this gives the stated evaluation homomorphism and its uniqueness.
By [F3], is transcendental exactly when .
Suppose is algebraic. Then the kernel is a nonzero proper ideal, so [F2] gives for a nonzero nonconstant .
Multiplying by the inverse of its leading coefficient does not change its principal ideal, so choose the generator monic.
For any , if and only if belongs to the kernel, which is equivalent to and hence to .
If with both and nonconstant, then ; since is a field, one factor evaluates to zero and lies in , impossible because its degree is smaller than . Thus is irreducible.
If is another monic polynomial with the same property, then and by step 3.2; equal degree and monicity give .
Depends on
Used by
- An extension that is both separable and purely inseparable is trivial Corollary
- An irreducible polynomial in ℝ[x] has degree 1 or 2 Corollary
- Assuming Choice, any two algebraic closures are base-isomorphic Corollary
- Assuming Choice, conjugates in an algebraic closure are related by a base automorphism Corollary
- ℂ/ℝ has power basis 1,i and degree 2 Corollary
- Every algebraic extension of a perfect field is separable Corollary
- Stem fields of a monic irreducible polynomial are uniquely F-isomorphic when their distinguished roots are matched Corollary
- An annihilating polynomial need not be minimal: √2 is a root of both x²-2 and x⁴-4 Counterexample
- A normal algebraic extension is one in which every minimal polynomial with a root in the extension splits there Definition
- Conjugate algebraic elements over a field Definition
- Separable algebraic elements and separable extensions Definition
- A normal basis of F₈ over F₂ Example
- Gal(F₈/F₂) is cyclic of order three with no proper intermediate field Example
- ℚ(√2)≅ℚ[x]/(x²-2) with basis 1,√2 Example
- The four roots of t⁴+t+1 over F₂ are the Frobenius powers of any one of them Example
- The full S₃ correspondence for the splitting field of x³-2 Example
- The minimal polynomial of √2+√3 over ℚ is x⁴-4x²+1 Example
- The splitting field of x²-2 over ℚ is ℚ(√2), with roots ±√2 Example
- FALSE: an algebraic closure is unique up to a unique base-field isomorphism False statement
- FALSE: every basis of a finite field over a subfield is a normal basis False statement
- A base-field isomorphism extends across simple adjunctions of corresponding roots of an irreducible polynomial Lemma
- A quadratic extension in characteristic not 2 is obtained by adjoining a square root Lemma
- A simple finite extension has only finitely many intermediate fields Lemma
- If p is a prime not dividing n, a rational minimal polynomial of a primitive n-th root of unity also kills its p-th power Lemma
- Minimal polynomials of integral elements over an integrally closed domain have coefficients in the domain Lemma
- A field is algebraically closed exactly when every nonconstant polynomial splits, equivalently when it has no nontrivial finite extension Proposition
- A nonempty intersection of normal subextensions inside a common algebraic extension is normal Proposition
- A normal extension generated by finitely many elements is the splitting field of the product of their minimal polynomials Proposition
- If K/F is normal and F⊆ E⊆ K, then K/E is normal Proposition
- Φₙ is irreducible over K exactly when [K(ζₙ):K]=φ(n), exactly when the embedding into (ℤ/n)^× is onto Proposition
- A base-field isomorphism extends to an isomorphism between splitting fields of corresponding polynomials Theorem
- A degree-n polynomial has a splitting field spanned over F by at most n! explicit root monomials Theorem
- A monic irreducible of degree d over F_q has the d distinct roots α,α^q,…,α^qᵈ⁻¹ Theorem
- A positive-degree separable polynomial is irreducible exactly when its Galois group is transitive on the roots Theorem
- A real number is algebraically constructible exactly when it lies in a finite tower of real quadratic adjunctions Theorem
- A simple algebraic extension is its minimal-polynomial quotient and has power basis 1,a,…,aⁿ⁻¹ and degree n Theorem
- A simple transcendental extension consists exactly of rational expressions in its generator Theorem
- An algebraic extension generated by elements whose minimal polynomials split in it is normal Theorem
- Over F_q, x^qⁿ-x is the product of all monic irreducibles whose degrees divide n Theorem
- The minimal and characteristic polynomials have exactly the same monic irreducible factors Theorem
…and 2 more results.
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
- T. Judson, Abstract Algebra: Theory and Applications, Extension Fields (standard reference, not scraped)
- J. S. Milne, Fields and Galois Theory (standard reference, not scraped)