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.
Irreducible polynomial coefficients in a complete valuation ring
Statement
Let F be complete nonarchimedean. If is monic irreducible of positive degree and , then every coefficient of f has absolute value at most one.
Facts & Assumptions
Given: The data and hypotheses of the statement.
Hensel factor lifting over a complete valued field: Let F be complete nonarchimedean, A its valuation ring, and k its residue field. Suppose has nonzero reduction , where is monic and . Then for , with h monic of degree , , . No discreteness or monicity of g is assumed. In particular, a simple residue root of a monic polynomial lifts uniquely to a simple root in A.
Proof
Suppose some coefficient has value greater than one. Choose one of maximal value, say , and put . All coefficients of g lie in A, its constant and leading coefficients reduce to zero, and some intermediate coefficient reduces to a nonzero element. Consequently with and .
The two residue factors are coprime, so nonmonic Hensel lifting gives with h monic of degree r. Both factors have positive degree, since . Multiplying back by contradicts irreducibility. Thus no coefficient exceeds one. Degree one and f=T are included without contradiction to the zero constant-term case.
Depends on
Used by
Dependency tree · two levels
2 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
- §6, proof of Theorem 6.4, p.11 (standard reference, not scraped)