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 polynomial is irreducible over
Example
The polynomial is irreducible in .
Facts & Assumptions
Given: The polynomial .
A reduced rational root of an integer polynomial has numerator dividing the constant coefficient and denominator dividing the leading coefficient (Rational root theorem).
A quadratic over a field is irreducible exactly when it has no root in that field (A polynomial of degree two or three over a field is irreducible exactly when it has no root in the field).
An integer is prime when it exceeds and has no positive divisors other than and itself (Prime and composite integers: is prime when and its only positive divisors are and ).
A divisor of a nonzero integer has absolute value at most the absolute value of that integer (If and then and ; hence the set of divisors of a nonzero integer is bounded above by ).
Integer absolute value is given by the positive and negative cases (The absolute value of an integer).
Integer absolute value is nonnegative and vanishes exactly at zero (Absolute value in : ; exactly when ; ; ; ; and exactly when ).
The integers form an ordered ring (The integers form a totally ordered ring).
The natural numbers embed in the integers preserving their arithmetic (The naturals embed in the integers).
The natural-number order is discrete (Discreteness: is the immediate successor).
The rational numbers form a field (The rationals form a field).
Verification
Facts [L3] through [L9] show that the positive divisors of are and the only positive divisor of is . Hence [L3] makes prime, and [L1] forces a reduced rational root to have denominator and numerator in the complete list .
Evaluating gives , respectively, so none is a root; [L10] supplies the field hypothesis and [L2] therefore makes the quadratic irreducible over .
Depends on
- Rational root theorem
- A polynomial of degree two or three over a field is irreducible exactly when it has no root in the field
- The rationals form a field
- Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$
- If $d \mid a$ and $a \ne 0$ then $d \ne 0$ and $|d| \le |a|$; hence the set of divisors of a nonzero integer is bounded above by $|a|$
- The absolute value $|a|$ of an integer
- Absolute value in $\mathbb{Z}$: $|a| \ge 0$; $|a| = 0$ exactly when $a = 0$; $|-a| = |a|$; $|ab| = |a|\,|b|$; $-|a| \le a \le |a|$; and $|a| \le c$ exactly when $-c \le a \le c$
- The integers form a totally ordered ring
- The naturals embed in the integers
- Discreteness: $\sigma(n)$ is the immediate successor
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: 84 results over 24 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
- Thomas W. Judson, Abstract Algebra: Theory and Applications, examples after Theorem 17.8 (standard reference, not scraped)