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.
In characteristic , has zero derivative and a repeated root
Example
In , the polynomial has repeated root and has formal derivative .
Facts & Assumptions
Given: The quotient field and the polynomial .
A root is repeated exactly when it is also a root of the formal derivative (A root is repeated exactly when it is also a root of the formal derivative).
The power and Leibniz rules hold for formal derivatives over any commutative ring (Linearity, power rule, Leibniz rule and the degree bound for the formal derivative).
The ring is the quotient ring , so and (For every , the congruence-class ring is the quotient ring ).
An integer is prime when it exceeds and has no positive divisors other than and itself (Prime and composite integers: is prime when and its only positive divisors are and ).
For prime , the ring is a field (For every prime , the two operations on make it a field).
Verification
A direct divisor check using [L4] shows that is prime, so [L5] licenses the field . By [L3], and , so is a repeated root.
By [L2], in , so both and vanish, agreeing with the criterion [L1].
Depends on
- A root is repeated exactly when it is also a root of the formal derivative
- Linearity, power rule, Leibniz rule and the degree bound for the formal derivative
- For every $n\in\mathbb N$, the congruence-class ring $\mathbb Z/n$ is the quotient ring $\mathbb Z/n\mathbb Z$
- Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$
- For every prime $p$, the two operations on $\mathbb{Z}/p$ make it a field
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: 90 results over 21 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
- Brian Conrad, Differential Criterion and Primitivity, Section 1 (standard reference, not scraped)