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 nonzero polynomial over a field is separable exactly when its gcd with its derivative is
Statement
Let be a field and let . Then is separable over if and only if in .
Facts & Assumptions
Given: A field and a nonzero polynomial .
In any extension field, a root of is repeated exactly when it is also a root of (A root is repeated exactly when it is also a root of the formal derivative).
The monic gcd of two base-field polynomials is unchanged after a field extension (The monic gcd of two base-field polynomials is unchanged after extending the coefficient field).
If is irreducible, then is a field (For a nonconstant in , the ideal is maximal and is a field exactly when is irreducible).
Every nonzero nonunit polynomial over a field has an irreducible factor (Every nonzero nonunit polynomial over a field factors into irreducible polynomials).
A coefficient homomorphism and a chosen image of determine an evaluation homomorphism (Universal property of : a coefficient homomorphism and the image of determine a unique ring homomorphism).
The canonical map is a surjective ring homomorphism with kernel (The canonical projection is a surjective ring homomorphism with kernel ).
For polynomials not both zero over a field, their monic gcd is a polynomial linear combination of them (Bézout identity and the Euclidean algorithm for polynomials over a field).
Proof
If , [L2] says that the gcd remains in every extension field, and [L7] supplies a Bézout identity there. A common root of and would evaluate that identity to by [L5], so [L1] shows that has no repeated root and is separable.
Conversely, if , then is a nonconstant nonunit and [L4] supplies an irreducible factor of . Fact [L3] makes a field. No nonzero constant lies in because a nonconstant polynomial cannot divide it, so [L6] makes the canonical map injective and identifies with a subfield of . Under the evaluation map of [L5], the residue class of is a common root in of , hence of , , and .
By [L1], the common root from step 1.2 is a repeated root of , so a separable must have ; combined with step 1.1, this proves the biconditional.
Depends on
- A root is repeated exactly when it is also a root of the formal derivative
- The monic gcd of two base-field polynomials is unchanged after extending the coefficient field
- Bézout identity and the Euclidean algorithm for polynomials over a field
- For a nonconstant $p$ in $F[x]$, the ideal $(p)$ is maximal and $F[x]/(p)$ is a field exactly when $p$ is irreducible
- Every nonzero nonunit polynomial over a field factors into irreducible polynomials
- Universal property of $R[x]$: a coefficient homomorphism and the image of $x$ determine a unique ring homomorphism
- The canonical projection $R\to R/I$ is a surjective ring homomorphism with kernel $I$
Used by
- An irreducible polynomial over a field is separable exactly when its derivative is nonzero Corollary
- Fₚ is the union of its finite subfields and is an infinite algebraic extension Example
- xᵖ-t is irreducible and inseparable over Fₚ(t) Example
- If a is not a pth power in a characteristic-p field, then x^pⁿ-a is irreducible for every n≥1 Lemma
- A field is perfect exactly when it has characteristic zero or its Frobenius map is surjective Theorem
- In characteristic p, every irreducible polynomial is uniquely g(x^pᵉ) with g irreducible and separable Theorem
- tⁿ-1 is separable over K exactly when the characteristic does not divide n, and then a splitting field carries n distinct n-th roots of unity Theorem
Dependency tree · two levels
30 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)