Theorems · Theorem · field theory
minpoly.natSepDegree_eq_one_iff_eq_X_sub_C_pow
∀ {F : Type u} {E : Type v} [inst : Field F] [inst_1 : Ring E] [IsDomain E] [inst_3 : Algebra F E] (q : ℕ)
[hF : ExpChar F q] {x : E},
(minpoly F x).natSepDegree = 1 ↔
∃ n, Polynomial.map (algebraMap F E) (minpoly F x) = (Polynomial.X - Polynomial.C x) ^ q ^ nThe minimal polynomial of an element x of E / F of exponential characteristic q has
separable degree one if and only if the minimal polynomial is of the form
(X - x) ^ (q ^ n) for some n : ℕ.
- Defined in
- Mathlib.FieldTheory.SeparableDegree
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 185 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites47
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 and proof · cited by 10,189
- Ringstatement and proof · cited by 7,463
- Fieldstatement and proof · cited by 7,404
- Polynomialstatement and proof · cited by 5,681
- Algebra.algebraMapstatement and proof · cited by 4,706
- one_mulproof · cited by 2,841
- IsDomainstatement and proof · cited by 2,196
- Polynomial.Xstatement and proof · cited by 1,639
- Polynomial.Cstatement and proof · cited by 1,598
- Polynomial.coeffproof · cited by 1,045
Cited by1
Results whose statement or proof uses this declaration.
- isPurelyInseparable_iff_minpoly_eq_X_sub_C_powproof · cited by 1