Theorems · Theorem · field theory
minpoly.iterateFrobenius_of_isSeparable
∀ {F : Type u} {E : Type v} [inst : Field F] [inst_1 : Field E] [inst_2 : Algebra F E] (q : ℕ) [hF : ExpChar F q]
[inst_3 : ExpChar E q] (n : ℕ) {a : E},
IsSeparable F a → minpoly F ((iterateFrobenius E q n) a) = Polynomial.map (iterateFrobenius F q n) (minpoly F a)For an extension E / F of exponential characteristic q and a separable element a : E, the
minimal polynomial of a ^ q ^ n equals the minimal polynomial of a mapped via (⬝ ^ q ^ n).
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 198 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites33
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
- Fieldstatement and proof · cited by 7,404
- Polynomialstatement · cited by 5,681
- Algebra.algebraMapproof · cited by 4,706
- le_reflproof · cited by 2,061
- Module.finrankproof · cited by 1,770
- map_zeroproof · cited by 1,614
- Polynomial.natDegreeproof · cited by 1,105
- IntermediateFieldproof · cited by 988
- Polynomial.mapstatement and proof · cited by 806
Cited by1
Results whose statement or proof uses this declaration.
- minpoly.frobenius_of_isSeparableproof · cited by 0