Theorems · Theorem · field theory
Polynomial.irreducible_comp
∀ {K : Type u} [inst : Field K] {f g : Polynomial K},
f.Monic →
g.Monic →
Irreducible f →
(∀ (E : Type u) [inst_1 : Field E] [inst_2 : Algebra K E] (x : E),
minpoly K x = f →
Irreducible
(Polynomial.map (algebraMap K ↥K⟮x⟯) g - Polynomial.C (IntermediateField.AdjoinSimple.gen K x))) →
Irreducible (f.comp g)Let f, g be monic polynomials over K. If f is irreducible, and g(x) - α is irreducible
in K⟮α⟯ with α a root of f, then f(g(x)) is irreducible.
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 134 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.
Cites78
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 and proof · cited by 53,352
- Algebrastatement and proof · cited by 11,388
- RingHomstatement · cited by 10,189
- Top.topproof · cited by 9,680
- Fieldstatement and proof · cited by 7,404
- Polynomialstatement and proof · cited by 5,681
- Algebra.algebraMapstatement and proof · cited by 4,706
- Set.univproof · cited by 3,945
- mul_oneproof · cited by 3,885
- Factproof · cited by 2,726
- Module.finrankproof · cited by 1,770
Cited by1
Results whose statement or proof uses this declaration.
- X_pow_mul_sub_C_irreducibleproof · cited by 1