Theorems · Theorem · field theory
RatFunc.minpolyX_map
∀ {K : Type u_1} [inst : Field K] (f : RatFunc K) (A : Type u_2) [inst_1 : CommRing A] [inst_2 : Algebra K A]
[inst_3 : Algebra (↥K[f]) A] (B : Type u_3) [inst_4 : CommRing B] [inst_5 : Algebra K B] [inst_6 : Algebra (↥K[f]) B]
[inst_7 : Algebra A B] [IsScalarTower K A B] [IsScalarTower (↥K[f]) A B],
Polynomial.map (algebraMap A B) (f.minpolyX A) = f.minpolyX B- Cited by
- 1 results in Mathlib
- Foundations
- Depth 128 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites20
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Setstatement · cited by 53,352
- CommRingstatement and proof · cited by 17,173
- Algebrastatement and proof · cited by 11,388
- Fieldstatement and proof · cited by 7,404
- Polynomialstatement · cited by 5,681
- Algebra.algebraMapstatement and proof · cited by 4,706
- IsScalarTowerstatement and proof · cited by 3,896
- Polynomial.Cproof · cited by 1,598
- Subalgebrastatement · cited by 1,353
- Polynomial.mapstatement and proof · cited by 806
- Algebra.adjoinstatement and proof · cited by 535
Cited by1
Results whose statement or proof uses this declaration.
- RatFunc.irreducible_minpolyXproof · cited by 1