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 simple residue root determines a coprime residue factorisation
Statement
Let be a field, let , and let satisfy and . Then there exists such that and the factors and are coprime.
Facts & Assumptions
Given: A field , a polynomial , and a simple root of .
Polynomial division by a monic linear polynomial is valid over any commutative ring, in particular over a field (The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution).
Proof
Since , polynomial division by gives a factorization for some .
Differentiating the identity of step 1.1 and evaluating at yields The left side is nonzero by hypothesis, so . Therefore does not divide , which is equivalent to in .
Thus a simple residue root determines a coprime residue factorization.
Depends on
Used by
Dependency tree · two levels
11 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
- The Stacks Project, Section 10.153: Henselian local rings (standard reference, not scraped)