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.
An irreducible polynomial over has degree or an even degree
Statement
If is irreducible, then or is even.
Facts & Assumptions
Given: An irreducible polynomial .
Every odd-degree real polynomial has a real root (Every odd-degree real polynomial has a real root).
For a commutative ring , an element , and a polynomial , one has if and only if divides (Factor theorem over a commutative ring).
Proof
Suppose is odd. Then [L1] gives with .
By [L2], the linear polynomial divides . Since is irreducible and is nonconstant, this forces to be associated to , so .
Therefore an irreducible real polynomial can have odd degree only in the linear case. If it is not linear, its degree is not odd and hence is even.
Depends on
Used by
Dependency tree · two levels
9 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Keith Conrad, Applications of Galois Theory, Theorem 2.1 (standard reference, not scraped)
- J. S. Milne, Fields and Galois Theory, v5.10, Chapter 5 (standard reference, not scraped)