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 root is repeated exactly when it is also a root of the formal derivative
Statement
Let be a field extension, let , and let be a root of . Then is a repeated root of if and only if .
Facts & Assumptions
Given: A field extension , a nonzero polynomial , and a root of .
The root is repeated exactly when divides the image of in (Repeated roots in extension fields and separable polynomials).
Formal differentiation is linear and satisfies and (Linearity, power rule, Leibniz rule and the degree bound for the formal derivative).
A polynomial over a commutative ring vanishes at exactly when it is divisible by (Factor theorem over a commutative ring).
Proof
If is repeated, [L1] gives , and [L2] gives , so evaluation at yields .
Conversely, [L3] gives ; [L2] gives , so , and the assumption with [L3] gives .
Substituting the factorization from step 1.2 gives , so [L1] makes repeated; together with step 1.1 this proves the biconditional.
Depends on
Used by
- In characteristic 2, x²+1=(x+1)² has zero derivative and a repeated root Example
- In characteristic p, the roots of x^pⁿ-x form a subfield and are all simple Lemma
- A nonzero polynomial over a field is separable exactly when its gcd with its derivative is 1 Theorem
- Over F_q, x^qⁿ-x is the product of all monic irreducibles whose degrees divide n Theorem
- The discriminant is ∏_i<j(αᵢ-αⱼ)² and vanishes exactly when a monic polynomial has a repeated root Theorem
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
- Brian Conrad, Differential Criterion and Primitivity, Proposition 1.2 (standard reference, not scraped)