Theorems · Theorem · field theory
RatFunc.irreducible_minpolyX
∀ {K : Type u_1} [inst : Field K] (f : RatFunc K), (¬∃ c, f = RatFunc.C c) → Irreducible (f.minpolyX ↥K⟮f⟯)- Cited by
- 1 results in Mathlib
- Foundations
- Depth 143 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Field
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites26
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
- Setstatement · cited by 53,352
- RingHomstatement · cited by 10,189
- Fieldstatement and proof · cited by 7,404
- Polynomialstatement and proof · cited by 5,681
- Algebra.algebraMapproof · cited by 4,706
- Polynomial.natDegreeproof · cited by 1,105
- IntermediateFieldstatement · cited by 988
- Polynomial.mapproof · cited by 806
- Algebra.adjoinproof · cited by 535
- Irreduciblestatement and proof · cited by 496
- IntermediateField.adjoinstatement and proof · cited by 382
Cited by1
Results whose statement or proof uses this declaration.
- RatFunc.finrank_eq_max_natDegreeproof · cited by 1