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 not a field: reducibility creates nonzero zero divisors
Statement refuted
The quotient by any nonconstant polynomial over a field is a field.
Counterexample
In the rational field (The rationals form a field), take The two classes and are nonzero, but their product is zero.
Facts & Assumptions
Given: The quotient .
Division by a nonzero polynomial gives a unique remainder of smaller degree (Division algorithm for polynomials over a field).
is a field if and only if the nonconstant polynomial is irreducible (For a nonconstant in , the ideal is maximal and is a field exactly when is irreducible).
Verification
Neither nor lies in : each already has degree below , so uniqueness of the remainder in [F1] would otherwise make it zero.
Yet , so the product of their nonzero classes is zero.
Thus has nonzero zero divisors and is not a field, agreeing with [F2] because is 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: 46 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)