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 minimal polynomial of over is
Example
Let , with the nonnegative real square roots supplied by the completeness of (The Cauchy-sequence reals have the least-upper-bound property) and Square roots exist: a unique with ; the positives are . Its minimal polynomial over is so .
Facts & Assumptions
Given: The real number .
Eisenstein's criterion proves irreducibility over under its prime divisibility hypotheses (Eisenstein criterion over the integers).
The polynomial-ring universal property gives substitution homomorphisms such as (Universal property of : a coefficient homomorphism and the image of determine a unique ring homomorphism).
A root of a nonzero polynomial is algebraic (Algebraic and transcendental elements and algebraic extensions), and the minimal polynomial of an algebraic element is the monic irreducible polynomial generating its evaluation kernel (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).
Its degree equals the degree of the associated simple extension (A simple algebraic extension is its minimal-polynomial quotient and has power basis and degree ).
The real numbers are a complete ordered field, so the displayed nonnegative square roots exist and square to their radicands (The Cauchy-sequence reals have the least-upper-bound property, Square roots exist: a unique with ; the positives are ).
Verification
From one obtains , hence .
Substitution from [F2] gives , which satisfies [F1] at and is therefore irreducible.
Substitution by is inverse to substitution by , so a factorization of would produce one of . Thus is irreducible.
Since is monic, irreducible, and annihilates , [F3] identifies it as the minimal polynomial; [F4] gives degree .
Depends on
- Algebraic and transcendental elements and algebraic extensions
- 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$
- Eisenstein criterion over the integers
- Universal property of $R[x]$: a coefficient homomorphism and the image of $x$ determine a unique ring homomorphism
- The Cauchy-sequence reals have the least-upper-bound property
- Square roots exist: a unique $\sqrt{a} \ge 0$ with $(\sqrt{a})^2 = a$; the positives are $\{x^2 : x \neq 0\}$
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 108 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
- J. S. Milne, Fields and Galois Theory (standard reference, not scraped)