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.
for monic irreducible is a field extension containing the root with unique reduced representatives
Statement
Let be monic and irreducible, and put and . Then is a field extension of , , and every element of has a unique representative with (with allowed). In particular, if , every element is uniquely
Facts & Assumptions
Given: A field and a monic irreducible polynomial .
For nonconstant , the quotient is a field if and only if is irreducible (For a nonconstant in , the ideal is maximal and is a field exactly when is irreducible).
If in , each has unique with and either or (Division algorithm for polynomials over a field).
Evaluation at an element is the unique homomorphism extending the coefficient map and sending to that element (Universal property of : a coefficient homomorphism and the image of determine a unique ring homomorphism).
A field extension identifies the base field with an injectively embedded subfield (Field extensions, generated subrings , generated subfields , and simple extensions).
Proof
Irreducibility makes nonconstant, and [F1] makes a field.
The constant-class map is injective: if a constant lies in , then ; uniqueness in [F2], comparing with , forces .
In , by the quotient arithmetic; equivalently this is evaluation at from [F3].
By [F2], write with or ; hence , so every class has a reduced representative.
Thus the constant-class map supplies the field extension .
If two reduced representatives give the same class, then . Applying uniqueness in [F2] to shows and .
Writing the unique reduced polynomial coefficientwise yields the displayed unique expression; when it consists only of , and the zero class is represented by the zero polynomial.
Depends on
- Field extensions, generated subrings $F[S]$, generated subfields $F(S)$, and simple extensions
- For a nonconstant $p$ in $F[x]$, the ideal $(p)$ is maximal and $F[x]/(p)$ is a field exactly when $p$ is irreducible
- Division algorithm for polynomials over a field
- Universal property of $R[x]$: a coefficient homomorphism and the image of $x$ determine a unique ring homomorphism
Used by
- Every nonconstant polynomial over a field has a root in some field extension Corollary
- The four-element field (ℤ/2)[x]/(x²+x+1) Example
- ℂ=ℝ[x]/(x²+1) is a field, every element is uniquely a+bi, and every nonzero element has inverse (a-bi)/(a²+b²) Theorem
- Universal property of adjoining a root of an irreducible polynomial Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 54 results over 13 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, Extension Fields (standard reference, not scraped)