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 a nonconstant in , the ideal is maximal and is a field exactly when is irreducible
Statement
Let be a field and let be nonconstant. The following are equivalent:
- is irreducible;
- the principal ideal is maximal;
- the quotient ring is a field.
Facts & Assumptions
Given: A field and a nonconstant polynomial .
The monic gcd of two polynomials is a polynomial linear combination of them (Bézout identity and the Euclidean algorithm for polynomials over a field).
The principal ideal is the smallest ideal containing (The ideal generated by a subset and principal ideals).
A maximal ideal is a proper ideal with no proper ideal strictly between it and the whole ring (Prime ideals and maximal ideals in a commutative ring).
In the quotient ring , multiplication is (The quotient ring with ).
For a commutative ring , the quotient is a field if and only if is maximal ( is a field if and only if is a maximal ideal).
An irreducible element is a nonzero nonunit with no factorization into two nonunits (Irreducible and prime elements of an integral domain).
Proof
In a commutative ring the multiples of form an ideal containing and lie in every ideal containing , so [L2] identifies with the set of multiples of . Suppose is irreducible and is a nonzero residue class; then . If a common divisor of were a nonunit, a factorization and [L6] would make a unit, so would be associate to and would imply , a contradiction. Thus every common divisor is a unit, and [L1] gives , whence [L4] gives ; every nonzero class is invertible, so the quotient is a field.
Conversely, suppose the quotient is a field and . By [L4], the two residue classes have product zero, so one is zero; say . The characterization established in step 1.1 gives , and hence . A direct leading-coefficient argument shows that has no zero divisors, because is a field, so cancellation of the nonzero polynomial gives and makes a unit. The other case similarly makes a unit, and [L6] makes irreducible.
Steps 1.1 and 2.1 prove that irreducibility is equivalent to quotient fieldness, and [L5] identifies quotient fieldness with maximality of in the sense of [L3].
Depends on
- Bézout identity and the Euclidean algorithm for polynomials over a field
- The ideal generated by a subset and principal ideals
- Prime ideals and maximal ideals in a commutative ring
- The quotient ring $R/I$ with $(r+I)(s+I)=rs+I$
- $R/M$ is a field if and only if $M$ is a maximal ideal
- Irreducible and prime elements of an integral domain
Used by
- ℚ[x]/(x²-1) is not a field: reducibility creates nonzero zero divisors Counterexample
- A normal basis of F₈ over F₂ Example
- F₄=F₂[t]/(t²+t+1) with complete addition and multiplication tables Example
- F₈=F₂[t]/(t³+t+1) and its power table Example
- F₉=F₃[t]/(t²+1) and a generator of its multiplicative group Example
- Frobenius on F₄ swaps the two non-prime-field elements Example
- Gal(F₈/F₂) is cyclic of order three with no proper intermediate field Example
- The four roots of t⁴+t+1 over F₂ are the Frobenius powers of any one of them Example
- The residue class of t generates F₈^× Example
- FALSE: every basis of a finite field over a subfield is a normal basis False statement
- A nonzero polynomial over a field is separable exactly when its gcd with its derivative is 1 Theorem
- A simple algebraic extension is its minimal-polynomial quotient and has power basis 1,a,…,aⁿ⁻¹ and degree n Theorem
- F[x]/(p) for monic irreducible p is a field extension containing the root x+(p) with unique reduced representatives Theorem
Dependency tree · two levels
20 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
- Thomas W. Judson, Abstract Algebra: Theory and Applications, Theorem 17.22 (standard reference, not scraped)