Theorems · Theorem · field theory
isPurelyInseparable_iff_minpoly_eq_X_sub_C_pow
∀ (F : Type u) {E : Type v} [inst : Field F] [inst_1 : Field E] [inst_2 : Algebra F E] (q : ℕ) [hF : ExpChar F q],
IsPurelyInseparable F E ↔
∀ (x : E), ∃ n, Polynomial.map (algebraMap F E) (minpoly F x) = (Polynomial.X - Polynomial.C x) ^ q ^ nA field extension E / F of exponential characteristic q is purely inseparable
if and only if for every element x of E, the minimal polynomial of x over F is of form
(X - x) ^ (q ^ n) for some natural number n.
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 188 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites15
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- Algebrastatement and proof · cited by 11,388
- RingHomstatement · cited by 10,189
- Ringproof · cited by 7,463
- Fieldstatement and proof · cited by 7,404
- Polynomialstatement · cited by 5,681
- Algebra.algebraMapstatement and proof · cited by 4,706
- IsDomainproof · cited by 2,196
- Polynomial.Xstatement and proof · cited by 1,639
- Polynomial.Cstatement and proof · cited by 1,598
- Polynomial.mapstatement and proof · cited by 806
- minpolystatement and proof · cited by 439
Cited by1
Results whose statement or proof uses this declaration.
- IsPurelyInseparable.minpoly_eq_X_sub_C_powproof · cited by 0