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.
is irreducible over
Statement
The polynomial is irreducible in .
Facts & Assumptions
Given: The polynomial .
The real numbers form an ordered field (The reals form a totally ordered field).
In an ordered field, the square of every nonzero element is positive (Squares of nonzero elements are positive).
A polynomial of degree two or three over a field is irreducible if and only if 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).
Proof
For , either , so , or [F2] gives . Thus by the ordered-field laws in [F1].
Hence has no real root.
Since it has degree two, [F3] now gives its irreducibility over .
Depends on
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 35 results over 11 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)