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.
Irreducibility after reduction modulo a prime implies irreducibility over when the leading coefficient survives
Statement
Let be primitive and of positive degree, and let be prime. Suppose does not divide the leading coefficient of . If the coefficientwise reduction is irreducible, then is irreducible in .
Facts & Assumptions
Given: A primitive positive-degree polynomial and a prime not dividing its leading coefficient.
A rational factorization of a primitive integer polynomial clears to a factorization into primitive integer polynomials of the same positive degrees (Gauss lemma: primitive factorisations over can be cleared to primitive factorisations over ).
A coefficient ring homomorphism extends to a polynomial-ring homomorphism (Universal property of : a coefficient homomorphism and the image of determine a unique ring homomorphism).
The quotient map has kernel (The canonical projection is a surjective ring homomorphism with kernel ).
The ring is the quotient (For every , the congruence-class ring is the quotient ring ).
A prime is an integer greater than with no positive divisors other than and itself (Prime and composite integers: is prime when and its only positive divisors are and ).
For prime , the ring is a field (For every prime , the two operations on make it a field).
Proof
Suppose for contradiction that is reducible over ; [L1] gives with primitive of positive degree.
Reduce coefficients using [L2], [L3], and [L4]. Neither nor is zero, since primitivity forbids from dividing every coefficient; and because the leading coefficient of survives, , so both reductions retain positive degree.
Thus is a factorization into two nonunits in the polynomial ring over the field of [L6], contradicting the assumed irreducibility of ; therefore is irreducible over .
Depends on
- Gauss lemma: primitive factorisations over $\mathbb Q$ can be cleared to primitive factorisations over $\mathbb Z$
- Universal property of $R[x]$: a coefficient homomorphism and the image of $x$ determine a unique ring homomorphism
- The canonical projection $R\to R/I$ is a surjective ring homomorphism with kernel $I$
- For every $n\in\mathbb N$, the congruence-class ring $\mathbb Z/n$ is the quotient ring $\mathbb Z/n\mathbb Z$
- Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$
- For every prime $p$, the two operations on $\mathbb{Z}/p$ make it a field
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 108 results over 23 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
- Neil Donaldson, Math 120B Notes, Theorem 23.13(1) (standard reference, not scraped)
- Keith Conrad, Irreducibility Tests in Q[T], Appendix A.3 (standard reference, not scraped)