Theorems · Definition · field theory
RatFunc.minpolyX
{K : Type u_1} →
[inst : Field K] →
(f : RatFunc K) → (A : Type u_2) → [inst_1 : CommRing A] → [Algebra K A] → [Algebra (↥K[f]) A] → Polynomial AThe minimal polynomial of X over K⟮f⟯. It is defined as f.num - f * f.denom, viewed
as a polynomial with coefficients in A, where A is a K[f]-algebra.
- Cited by
- 12 results in Mathlib
- Foundations
- Depth 127 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites14
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.algebraMapproof · cited by 4,706
- Polynomial.Cproof · cited by 1,598
- Subalgebrastatement · cited by 1,353
- Polynomial.mapproof · cited by 806
- Algebra.adjoinstatement and proof · cited by 535
- RatFuncstatement and proof · cited by 301
Cited by12
Results whose statement or proof uses this declaration.
- RatFunc.eq_C_of_minpolyX_coeff_eq_zerostatement and proof · cited by 3
- RatFunc.isAlgebraic_adjoin_simple_Xproof · cited by 3
- RatFunc.minpolyX_aeval_Xstatement · cited by 2
- RatFunc.C_minpolyXstatement · cited by 2
- RatFunc.minpolyX_eq_zero_iffstatement and proof · cited by 2
- RatFunc.natDegree_minpolyXstatement and proof · cited by 2
- RatFunc.irreducible_minpolyXstatement and proof · cited by 1
- RatFunc.irreducible_minpolyX'statement and proof · cited by 1
- RatFunc.minpolyX_mapstatement · cited by 1
- RatFunc.finrank_eq_max_natDegreeproof · cited by 1
- RatFunc.natDegree_num_le_natDegree_minpolyXstatement and proof · cited by 1
- RatFunc.natDegree_denom_le_natDegree_minpolyXstatement and proof · cited by 0