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.
A degree-four polynomial can be reducible over without having a rational root
Statement refuted
A polynomial over a field is irreducible whenever it has no root in that field.
Facts & Assumptions
Given: The polynomial .
A root is equivalent to divisibility by the corresponding linear polynomial (Factor theorem over a commutative ring).
The rational numbers form a field (The rationals form a field).
The rational numbers form an ordered field, so squares are nonnegative and positive constants remain positive when added (The rationals form a totally ordered field).
Counterexample
The displayed equality is a factorization in the field polynomial ring [L2] into two positive-degree nonunits, so is reducible.
For every rational , [L3] gives and , so and has no rational root; by [L1] it has no rational linear factor, yet step 1.1 shows it reducible.
Depends on
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: 37 results over 12 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, example after Theorem 23.8 (standard reference, not scraped)