Theory of univariate polynomials

We define the multiset of roots of a polynomial, and prove basic results about it.

Main definitions

• Polynomial.roots p: The multiset containing all the roots of p, including their multiplicities.
• Polynomial.rootSet p E: The set of distinct roots of p in an algebra E.

Main statements

• Polynomial.C_leadingCoeff_mul_prod_multiset_X_sub_C: If a polynomial has as many roots as its degree, it can be written as the product of its leading coefficient with ∏ (X - a) where a ranges through its roots.

noncomputable def Polynomial.roots {R : Type u} [CommRing R] [IsDomain R] (p : Polynomial R) : Multiset R

roots p noncomputably gives a multiset containing all the roots of p, including their multiplicities.

Equations

• p.roots = if h : p = 0 then ∅ else Classical.choose ⋯

theorem Polynomial.roots_def {R : Type u} [CommRing R] [IsDomain R] [DecidableEq R] (p : Polynomial R) [Decidable (p = 0)] : p.roots = if h : p = 0 then ∅ else Classical.choose ⋯

@[simp]

theorem Polynomial.roots_zero {R : Type u} [CommRing R] [IsDomain R] : roots 0 = 0

theorem Polynomial.card_roots {R : Type u} [CommRing R] [IsDomain R] {p : Polynomial R} (hp0 : p ≠ 0) : ↑p.roots.card ≤ p.degree

theorem Polynomial.card_roots' {R : Type u} [CommRing R] [IsDomain R] (p : Polynomial R) : p.roots.card ≤ p.natDegree

theorem Polynomial.card_roots_sub_C {R : Type u} [CommRing R] [IsDomain R] {p : Polynomial R} {a : R} (hp0 : 0 < p.degree) : ↑(p - C a).roots.card ≤ p.degree

theorem Polynomial.card_roots_sub_C' {R : Type u} [CommRing R] [IsDomain R] {p : Polynomial R} {a : R} (hp0 : 0 < p.degree) : (p - C a).roots.card ≤ p.natDegree

@[simp]

theorem Polynomial.count_roots {R : Type u} {a : R} [CommRing R] [IsDomain R] [DecidableEq R] (p : Polynomial R) : Multiset.count a p.roots = rootMultiplicity a p

@[simp]

theorem Polynomial.mem_roots' {R : Type u} {a : R} [CommRing R] [IsDomain R] {p : Polynomial R} : a ∈ p.roots ↔ p ≠ 0 ∧ p.IsRoot a

theorem Polynomial.mem_roots {R : Type u} {a : R} [CommRing R] [IsDomain R] {p : Polynomial R} (hp : p ≠ 0) : a ∈ p.roots ↔ p.IsRoot a

theorem Polynomial.ne_zero_of_mem_roots {R : Type u} {a : R} [CommRing R] [IsDomain R] {p : Polynomial R} (h : a ∈ p.roots) : p ≠ 0

theorem Polynomial.isRoot_of_mem_roots {R : Type u} {a : R} [CommRing R] [IsDomain R] {p : Polynomial R} (h : a ∈ p.roots) : p.IsRoot a

theorem Polynomial.mem_roots_map_of_injective {R : Type u} {S : Type v} [CommRing R] [IsDomain R] [Semiring S] {p : Polynomial S} {f : S →+* R} (hf : Function.Injective ⇑f) {x : R} (hp : p ≠ 0) : x ∈ (map f p).roots ↔ eval₂ f x p = 0

theorem Polynomial.mem_roots_iff_aeval_eq_zero {R : Type u} [CommRing R] [IsDomain R] {p : Polynomial R} {x : R} (w : p ≠ 0) : x ∈ p.roots ↔ (aeval x) p = 0

theorem Polynomial.card_le_degree_of_subset_roots {R : Type u} [CommRing R] [IsDomain R] {p : Polynomial R} {Z : Finset R} (h : Z.val ⊆ p.roots) : Z.card ≤ p.natDegree

theorem Polynomial.finite_setOf_isRoot {R : Type u} [CommRing R] [IsDomain R] {p : Polynomial R} (hp : p ≠ 0) : {x : R | p.IsRoot x}.Finite

theorem Polynomial.eq_zero_of_infinite_isRoot {R : Type u} [CommRing R] [IsDomain R] (p : Polynomial R) (h : {x : R | p.IsRoot x}.Infinite) : p = 0

theorem Polynomial.exists_max_root {R : Type u} [CommRing R] [IsDomain R] [LinearOrder R] (p : Polynomial R) (hp : p ≠ 0) : ∃ (x₀ : R), ∀ (x : R), p.IsRoot x → x ≤ x₀

theorem Polynomial.exists_min_root {R : Type u} [CommRing R] [IsDomain R] [LinearOrder R] (p : Polynomial R) (hp : p ≠ 0) : ∃ (x₀ : R), ∀ (x : R), p.IsRoot x → x₀ ≤ x

theorem Polynomial.eq_of_infinite_eval_eq {R : Type u} [CommRing R] [IsDomain R] (p q : Polynomial R) (h : {x : R | eval x p = eval x q}.Infinite) : p = q

theorem Polynomial.roots_mul {R : Type u} [CommRing R] [IsDomain R] {p q : Polynomial R} (hpq : p * q ≠ 0) : (p * q).roots = p.roots + q.roots

theorem Polynomial.roots.le_of_dvd {R : Type u} [CommRing R] [IsDomain R] {p q : Polynomial R} (h : q ≠ 0) : p ∣ q → p.roots ≤ q.roots

theorem Polynomial.mem_roots_sub_C' {R : Type u} [CommRing R] [IsDomain R] {p : Polynomial R} {a x : R} : x ∈ (p - C a).roots ↔ p ≠ C a ∧ eval x p = a

theorem Polynomial.mem_roots_sub_C {R : Type u} [CommRing R] [IsDomain R] {p : Polynomial R} {a x : R} (hp0 : 0 < p.degree) : x ∈ (p - C a).roots ↔ eval x p = a

@[simp]

theorem Polynomial.roots_X_sub_C {R : Type u} [CommRing R] [IsDomain R] (r : R) : (X - C r).roots = {r}

@[simp]

theorem Polynomial.roots_X_add_C {R : Type u} [CommRing R] [IsDomain R] (r : R) : (X + C r).roots = {-r}

@[simp]

theorem Polynomial.roots_X {R : Type u} [CommRing R] [IsDomain R] : X.roots = {0}

@[simp]

theorem Polynomial.roots_C {R : Type u} [CommRing R] [IsDomain R] (x : R) : (C x).roots = 0

@[simp]

theorem Polynomial.roots_one {R : Type u} [CommRing R] [IsDomain R] : roots 1 = ∅

@[simp]

theorem Polynomial.roots_C_mul {R : Type u} {a : R} [CommRing R] [IsDomain R] (p : Polynomial R) (ha : a ≠ 0) : (C a * p).roots = p.roots

@[simp]

theorem Polynomial.roots_smul_nonzero {R : Type u} {a : R} [CommRing R] [IsDomain R] (p : Polynomial R) (ha : a ≠ 0) : (a • p).roots = p.roots

@[simp]

theorem Polynomial.roots_neg {R : Type u} [CommRing R] [IsDomain R] (p : Polynomial R) : (-p).roots = p.roots

@[simp]

theorem Polynomial.roots_C_mul_X_sub_C_of_IsUnit {R : Type u} [CommRing R] [IsDomain R] (b : R) (a : Rˣ) : (C ↑a * X - C b).roots = {↑a⁻¹ * b}

@[simp]

theorem Polynomial.roots_C_mul_X_add_C_of_IsUnit {R : Type u} [CommRing R] [IsDomain R] (b : R) (a : Rˣ) : (C ↑a * X + C b).roots = {-(↑a⁻¹ * b)}

theorem Polynomial.roots_list_prod {R : Type u} [CommRing R] [IsDomain R] (L : List (Polynomial R)) : 0 ∉ L → L.prod.roots = (↑L).bind roots

theorem Polynomial.roots_multiset_prod {R : Type u} [CommRing R] [IsDomain R] (m : Multiset (Polynomial R)) : 0 ∉ m → m.prod.roots = m.bind roots

theorem Polynomial.roots_prod {R : Type u} [CommRing R] [IsDomain R] {ι : Type u_1} (f : ι → Polynomial R) (s : Finset ι) : s.prod f ≠ 0 → (s.prod f).roots = s.val.bind fun (i : ι) => (f i).roots

@[simp]

theorem Polynomial.roots_pow {R : Type u} [CommRing R] [IsDomain R] (p : Polynomial R) (n : ℕ) : (p ^ n).roots = n • p.roots

theorem Polynomial.roots_X_pow {R : Type u} [CommRing R] [IsDomain R] (n : ℕ) : (X ^ n).roots = n • {0}

theorem Polynomial.roots_C_mul_X_pow {R : Type u} {a : R} [CommRing R] [IsDomain R] (ha : a ≠ 0) (n : ℕ) : (C a * X ^ n).roots = n • {0}

@[simp]

theorem Polynomial.roots_monomial {R : Type u} {a : R} [CommRing R] [IsDomain R] (ha : a ≠ 0) (n : ℕ) : ((monomial n) a).roots = n • {0}

theorem Polynomial.roots_prod_X_sub_C {R : Type u} [CommRing R] [IsDomain R] (s : Finset R) : (∏ a ∈ s, (X - C a)).roots = s.val

@[simp]

theorem Polynomial.roots_multiset_prod_X_sub_C {R : Type u} [CommRing R] [IsDomain R] (s : Multiset R) : (Multiset.map (fun (a : R) => X - C a) s).prod.roots = s

theorem Polynomial.card_roots_X_pow_sub_C {R : Type u} [CommRing R] [IsDomain R] {n : ℕ} (hn : 0 < n) (a : R) : (X ^ n - C a).roots.card ≤ n

def Polynomial.nthRoots {R : Type u} [CommRing R] [IsDomain R] (n : ℕ) (a : R) : Multiset R

nthRoots n a noncomputably returns the solutions to x ^ n = a.

Equations

• Polynomial.nthRoots n a = (Polynomial.X ^ n - Polynomial.C a).roots

@[simp]

theorem Polynomial.mem_nthRoots {R : Type u} [CommRing R] [IsDomain R] {n : ℕ} (hn : 0 < n) {a x : R} : x ∈ nthRoots n a ↔ x ^ n = a

@[simp]

theorem Polynomial.nthRoots_zero {R : Type u} [CommRing R] [IsDomain R] (r : R) : nthRoots 0 r = 0

@[simp]

theorem Polynomial.nthRoots_zero_right {R : Type u_1} [CommRing R] [IsDomain R] (n : ℕ) : nthRoots n 0 = Multiset.replicate n 0

theorem Polynomial.card_nthRoots {R : Type u} [CommRing R] [IsDomain R] (n : ℕ) (a : R) : (nthRoots n a).card ≤ n

@[simp]

theorem Polynomial.nthRoots_two_eq_zero_iff {R : Type u} [CommRing R] [IsDomain R] {r : R} : nthRoots 2 r = 0 ↔ ¬IsSquare r

def Polynomial.nthRootsFinset (n : ℕ) {R : Type u_1} (a : R) [CommRing R] [IsDomain R] : Finset R

The multiset nthRoots ↑n a as a Finset. Previously nthRootsFinset n was defined to be nthRoots n (1 : R) as a Finset. That situation can be recovered by setting a to be (1 : R)

Equations

• Polynomial.nthRootsFinset n a = (Polynomial.nthRoots n a).toFinset

theorem Polynomial.nthRootsFinset_def (n : ℕ) {R : Type u_1} (a : R) [CommRing R] [IsDomain R] [DecidableEq R] : nthRootsFinset n a = (nthRoots n a).toFinset

@[simp]

theorem Polynomial.mem_nthRootsFinset {R : Type u} [CommRing R] [IsDomain R] {n : ℕ} (h : 0 < n) (a : R) {x : R} : x ∈ nthRootsFinset n a ↔ x ^ n = a

@[simp]

theorem Polynomial.nthRootsFinset_zero {R : Type u} [CommRing R] [IsDomain R] (a : R) : nthRootsFinset 0 a = ∅

theorem Polynomial.map_mem_nthRootsFinset {R : Type u} {n : ℕ} [CommRing R] [IsDomain R] {S : Type u_1} {F : Type u_2} [CommRing S] [IsDomain S] [FunLike F R S] [MonoidHomClass F R S] {a x : R} (hx : x ∈ nthRootsFinset n a) (f : F) : f x ∈ nthRootsFinset n (f a)

theorem Polynomial.map_mem_nthRootsFinset_one {R : Type u} {n : ℕ} [CommRing R] [IsDomain R] {S : Type u_1} {F : Type u_2} [CommRing S] [IsDomain S] [FunLike F R S] [RingHomClass F R S] {x : R} (hx : x ∈ nthRootsFinset n 1) (f : F) : f x ∈ nthRootsFinset n 1

theorem Polynomial.mul_mem_nthRootsFinset {R : Type u} {n : ℕ} [CommRing R] [IsDomain R] {η₁ η₂ a₁ a₂ : R} (hη₁ : η₁ ∈ nthRootsFinset n a₁) (hη₂ : η₂ ∈ nthRootsFinset n a₂) : η₁ * η₂ ∈ nthRootsFinset n (a₁ * a₂)

theorem Polynomial.ne_zero_of_mem_nthRootsFinset {R : Type u} {n : ℕ} [CommRing R] [IsDomain R] {η a : R} (ha : a ≠ 0) (hη : η ∈ nthRootsFinset n a) : η ≠ 0

theorem Polynomial.one_mem_nthRootsFinset {R : Type u} {n : ℕ} [CommRing R] [IsDomain R] (hn : 0 < n) : 1 ∈ nthRootsFinset n 1

theorem Polynomial.nthRoots_two_one {R : Type u} [CommRing R] [IsDomain R] : nthRoots 2 1 = {-1, 1}

theorem Polynomial.zero_of_eval_zero {R : Type u} [CommRing R] [IsDomain R] [Infinite R] (p : Polynomial R) (h : ∀ (x : R), eval x p = 0) : p = 0

theorem Polynomial.funext {R : Type u} [CommRing R] [IsDomain R] [Infinite R] {p q : Polynomial R} (ext : ∀ (r : R), eval r p = eval r q) : p = q

@[reducible, inline]

noncomputable abbrev Polynomial.aroots {T : Type w} [CommRing T] (p : Polynomial T) (S : Type u_1) [CommRing S] [IsDomain S] [Algebra T S] : Multiset S

Given a polynomial p with coefficients in a ring T and a T-algebra S, aroots p S is the multiset of roots of p regarded as a polynomial over S.

Equations

• p.aroots S = (Polynomial.map (algebraMap T S) p).roots

theorem Polynomial.aroots_def {T : Type w} [CommRing T] (p : Polynomial T) (S : Type u_1) [CommRing S] [IsDomain S] [Algebra T S] : p.aroots S = (map (algebraMap T S) p).roots

theorem Polynomial.mem_aroots' {S : Type v} {T : Type w} [CommRing T] [CommRing S] [IsDomain S] [Algebra T S] {p : Polynomial T} {a : S} : a ∈ p.aroots S ↔ map (algebraMap T S) p ≠ 0 ∧ (aeval a) p = 0

theorem Polynomial.mem_aroots {S : Type v} {T : Type w} [CommRing T] [CommRing S] [IsDomain S] [Algebra T S] [NoZeroSMulDivisors T S] {p : Polynomial T} {a : S} : a ∈ p.aroots S ↔ p ≠ 0 ∧ (aeval a) p = 0

theorem Polynomial.aroots_mul {S : Type v} {T : Type w} [CommRing T] [CommRing S] [IsDomain S] [Algebra T S] [NoZeroSMulDivisors T S] {p q : Polynomial T} (hpq : p * q ≠ 0) : (p * q).aroots S = p.aroots S + q.aroots S

@[simp]

theorem Polynomial.aroots_X_sub_C {S : Type v} {T : Type w} [CommRing T] [CommRing S] [IsDomain S] [Algebra T S] (r : T) : (X - C r).aroots S = {(algebraMap T S) r}

@[simp]

theorem Polynomial.aroots_X {S : Type v} {T : Type w} [CommRing T] [CommRing S] [IsDomain S] [Algebra T S] : X.aroots S = {0}

@[simp]

theorem Polynomial.aroots_C {S : Type v} {T : Type w} [CommRing T] [CommRing S] [IsDomain S] [Algebra T S] (a : T) : (C a).aroots S = 0

@[simp]

theorem Polynomial.aroots_zero {T : Type w} [CommRing T] (S : Type u_1) [CommRing S] [IsDomain S] [Algebra T S] : aroots 0 S = 0

@[simp]

theorem Polynomial.aroots_one {S : Type v} {T : Type w} [CommRing T] [CommRing S] [IsDomain S] [Algebra T S] : aroots 1 S = 0

@[simp]

theorem Polynomial.aroots_neg {S : Type v} {T : Type w} [CommRing T] [CommRing S] [IsDomain S] [Algebra T S] (p : Polynomial T) : (-p).aroots S = p.aroots S

@[simp]

theorem Polynomial.aroots_C_mul {S : Type v} {T : Type w} [CommRing T] [CommRing S] [IsDomain S] [Algebra T S] [NoZeroSMulDivisors T S] {a : T} (p : Polynomial T) (ha : a ≠ 0) : (C a * p).aroots S = p.aroots S

@[simp]

theorem Polynomial.aroots_smul_nonzero {S : Type v} {T : Type w} [CommRing T] [CommRing S] [IsDomain S] [Algebra T S] [NoZeroSMulDivisors T S] {a : T} (p : Polynomial T) (ha : a ≠ 0) : (a • p).aroots S = p.aroots S

@[simp]

theorem Polynomial.aroots_pow {S : Type v} {T : Type w} [CommRing T] [CommRing S] [IsDomain S] [Algebra T S] (p : Polynomial T) (n : ℕ) : (p ^ n).aroots S = n • p.aroots S

theorem Polynomial.aroots_X_pow {S : Type v} {T : Type w} [CommRing T] [CommRing S] [IsDomain S] [Algebra T S] (n : ℕ) : (X ^ n).aroots S = n • {0}

theorem Polynomial.aroots_C_mul_X_pow {S : Type v} {T : Type w} [CommRing T] [CommRing S] [IsDomain S] [Algebra T S] [NoZeroSMulDivisors T S] {a : T} (ha : a ≠ 0) (n : ℕ) : (C a * X ^ n).aroots S = n • {0}

@[simp]

theorem Polynomial.aroots_monomial {S : Type v} {T : Type w} [CommRing T] [CommRing S] [IsDomain S] [Algebra T S] [NoZeroSMulDivisors T S] {a : T} (ha : a ≠ 0) (n : ℕ) : ((monomial n) a).aroots S = n • {0}

@[simp]

theorem Polynomial.aroots_map (R : Type u) (S : Type v) {T : Type w} [CommRing R] [IsDomain R] [CommRing T] (p : Polynomial T) [CommRing S] [Algebra T S] [Algebra S R] [Algebra T R] [IsScalarTower T S R] : (map (algebraMap T S) p).aroots R = p.aroots R

def Polynomial.rootSet {T : Type w} [CommRing T] (p : Polynomial T) (S : Type u_1) [CommRing S] [IsDomain S] [Algebra T S] : Set S

The set of distinct roots of p in S.

If you have a non-separable polynomial, use Polynomial.aroots for the multiset where multiple roots have the appropriate multiplicity.

Equations

• p.rootSet S = ↑(p.aroots S).toFinset

theorem Polynomial.rootSet_def {T : Type w} [CommRing T] (p : Polynomial T) (S : Type u_1) [CommRing S] [IsDomain S] [Algebra T S] [DecidableEq S] : p.rootSet S = ↑(p.aroots S).toFinset

@[simp]

theorem Polynomial.rootSet_C {S : Type v} {T : Type w} [CommRing T] [CommRing S] [IsDomain S] [Algebra T S] (a : T) : (C a).rootSet S = ∅

@[simp]

theorem Polynomial.rootSet_zero {T : Type w} [CommRing T] (S : Type u_1) [CommRing S] [IsDomain S] [Algebra T S] : rootSet 0 S = ∅

@[simp]

theorem Polynomial.rootSet_one {T : Type w} [CommRing T] (S : Type u_1) [CommRing S] [IsDomain S] [Algebra T S] : rootSet 1 S = ∅

@[simp]

theorem Polynomial.rootSet_neg {T : Type w} [CommRing T] (p : Polynomial T) (S : Type u_1) [CommRing S] [IsDomain S] [Algebra T S] : (-p).rootSet S = p.rootSet S

instance Polynomial.rootSetFintype {T : Type w} [CommRing T] (p : Polynomial T) (S : Type u_1) [CommRing S] [IsDomain S] [Algebra T S] : Fintype ↑(p.rootSet S)

Equations

• p.rootSetFintype S = FinsetCoe.fintype (p.aroots S).toFinset

theorem Polynomial.rootSet_finite {T : Type w} [CommRing T] (p : Polynomial T) (S : Type u_1) [CommRing S] [IsDomain S] [Algebra T S] : (p.rootSet S).Finite

theorem Polynomial.bUnion_roots_finite {R : Type u_1} {S : Type u_2} [Semiring R] [CommRing S] [IsDomain S] [DecidableEq S] (m : R →+* S) (d : ℕ) {U : Set R} (h : U.Finite) : (⋃ (f : Polynomial R), ⋃ (_ : f.natDegree ≤ d ∧ ∀ (i : ℕ), f.coeff i ∈ U), ↑(map m f).roots.toFinset).Finite

The set of roots of all polynomials of bounded degree and having coefficients in a finite set is finite.

theorem Polynomial.mem_rootSet' {T : Type w} [CommRing T] {p : Polynomial T} {S : Type u_1} [CommRing S] [IsDomain S] [Algebra T S] {a : S} : a ∈ p.rootSet S ↔ map (algebraMap T S) p ≠ 0 ∧ (aeval a) p = 0

theorem Polynomial.mem_rootSet {T : Type w} [CommRing T] {p : Polynomial T} {S : Type u_1} [CommRing S] [IsDomain S] [Algebra T S] [NoZeroSMulDivisors T S] {a : S} : a ∈ p.rootSet S ↔ p ≠ 0 ∧ (aeval a) p = 0

theorem Polynomial.mem_rootSet_of_ne {T : Type w} [CommRing T] {p : Polynomial T} {S : Type u_1} [CommRing S] [IsDomain S] [Algebra T S] [NoZeroSMulDivisors T S] (hp : p ≠ 0) {a : S} : a ∈ p.rootSet S ↔ (aeval a) p = 0

theorem Polynomial.rootSet_maps_to' {T : Type w} [CommRing T] {p : Polynomial T} {S : Type u_1} {S' : Type u_2} [CommRing S] [IsDomain S] [Algebra T S] [CommRing S'] [IsDomain S'] [Algebra T S'] (hp : map (algebraMap T S') p = 0 → map (algebraMap T S) p = 0) (f : S →ₐ[T] S') : Set.MapsTo (⇑f) (p.rootSet S) (p.rootSet S')

theorem Polynomial.ne_zero_of_mem_rootSet {S : Type v} {T : Type w} [CommRing T] {p : Polynomial T} [CommRing S] [IsDomain S] [Algebra T S] {a : S} (h : a ∈ p.rootSet S) : p ≠ 0

theorem Polynomial.aeval_eq_zero_of_mem_rootSet {S : Type v} {T : Type w} [CommRing T] {p : Polynomial T} [CommRing S] [IsDomain S] [Algebra T S] {a : S} (hx : a ∈ p.rootSet S) : (aeval a) p = 0

theorem Polynomial.rootSet_mapsTo {T : Type w} [CommRing T] {p : Polynomial T} {S : Type u_1} {S' : Type u_2} [CommRing S] [IsDomain S] [Algebra T S] [CommRing S'] [IsDomain S'] [Algebra T S'] [NoZeroSMulDivisors T S'] (f : S →ₐ[T] S') : Set.MapsTo (⇑f) (p.rootSet S) (p.rootSet S')

theorem Polynomial.mem_rootSet_of_injective {R : Type u} {S : Type v} [CommRing R] [IsDomain R] [CommRing S] {p : Polynomial S} [Algebra S R] (h : Function.Injective ⇑(algebraMap S R)) {x : R} (hp : p ≠ 0) : x ∈ p.rootSet R ↔ (aeval x) p = 0

@[simp]

theorem Polynomial.nthRootsFinset_toSet {R : Type u} [CommRing R] [IsDomain R] {n : ℕ} (h : 0 < n) (a : R) : ↑(nthRootsFinset n a) = {r : R | r ^ n = a}

theorem Polynomial.eq_zero_of_natDegree_lt_card_of_eval_eq_zero {R : Type u_1} [CommRing R] [IsDomain R] (p : Polynomial R) {ι : Type u_2} [Fintype ι] {f : ι → R} (hf : Function.Injective f) (heval : ∀ (i : ι), eval (f i) p = 0) (hcard : p.natDegree < Fintype.card ι) : p = 0

theorem Polynomial.eq_zero_of_natDegree_lt_card_of_eval_eq_zero' {R : Type u_1} [CommRing R] [IsDomain R] (p : Polynomial R) (s : Finset R) (heval : ∀ i ∈ s, eval i p = 0) (hcard : p.natDegree < s.card) : p = 0

theorem Polynomial.eq_zero_of_forall_eval_zero_of_natDegree_lt_card {R : Type u} [CommRing R] [IsDomain R] (f : Polynomial R) (hf : ∀ (r : R), eval r f = 0) (hfR : ↑f.natDegree < Cardinal.mk R) : f = 0

theorem Polynomial.exists_eval_ne_zero_of_natDegree_lt_card {R : Type u} [CommRing R] [IsDomain R] (f : Polynomial R) (hf : f ≠ 0) (hfR : ↑f.natDegree < Cardinal.mk R) : ∃ (r : R), eval r f ≠ 0

theorem Polynomial.monic_multisetProd_X_sub_C {R : Type u} [CommRing R] (s : Multiset R) : (Multiset.map (fun (a : R) => X - C a) s).prod.Monic

theorem Polynomial.monic_prod_X_sub_C {R : Type u} [CommRing R] {α : Type u_1} (b : α → R) (s : Finset α) : (∏ a ∈ s, (X - C (b a))).Monic

theorem Polynomial.monic_finprod_X_sub_C {R : Type u} [CommRing R] {α : Type u_1} (b : α → R) : (∏ᶠ (k : α), (X - C (b k))).Monic

theorem Polynomial.prod_multiset_root_eq_finset_root {R : Type u} [CommRing R] [IsDomain R] {p : Polynomial R} [DecidableEq R] : (Multiset.map (fun (a : R) => X - C a) p.roots).prod = ∏ a ∈ p.roots.toFinset, (X - C a) ^ rootMultiplicity a p

theorem Polynomial.prod_multiset_X_sub_C_dvd {R : Type u} [CommRing R] [IsDomain R] (p : Polynomial R) : (Multiset.map (fun (a : R) => X - C a) p.roots).prod ∣ p

The product ∏ (X - a) for a inside the multiset p.roots divides p.

theorem Multiset.prod_X_sub_C_dvd_iff_le_roots {R : Type u} [CommRing R] [IsDomain R] {p : Polynomial R} (hp : p ≠ 0) (s : Multiset R) : (map (fun (a : R) => Polynomial.X - Polynomial.C a) s).prod ∣ p ↔ s ≤ p.roots

A Galois connection.

theorem Polynomial.exists_prod_multiset_X_sub_C_mul {R : Type u} [CommRing R] [IsDomain R] (p : Polynomial R) : ∃ (q : Polynomial R), (Multiset.map (fun (a : R) => X - C a) p.roots).prod * q = p ∧ p.roots.card + q.natDegree = p.natDegree ∧ q.roots = 0

theorem Polynomial.C_leadingCoeff_mul_prod_multiset_X_sub_C {R : Type u} [CommRing R] [IsDomain R] {p : Polynomial R} (hroots : p.roots.card = p.natDegree) : C p.leadingCoeff * (Multiset.map (fun (a : R) => X - C a) p.roots).prod = p

A polynomial p that has as many roots as its degree can be written p = p.leadingCoeff * ∏(X - a), for a in p.roots.

theorem Polynomial.prod_multiset_X_sub_C_of_monic_of_roots_card_eq {R : Type u} [CommRing R] [IsDomain R] {p : Polynomial R} (hp : p.Monic) (hroots : p.roots.card = p.natDegree) : (Multiset.map (fun (a : R) => X - C a) p.roots).prod = p

A monic polynomial p that has as many roots as its degree can be written p = ∏(X - a), for a in p.roots.

theorem Polynomial.Monic.isUnit_leadingCoeff_of_dvd {R : Type u} [CommRing R] [IsDomain R] {a p : Polynomial R} (hp : p.Monic) (hap : a ∣ p) : IsUnit a.leadingCoeff

theorem Polynomial.Monic.irreducible_iff_degree_lt {R : Type u} [CommRing R] [IsDomain R] {p : Polynomial R} (p_monic : p.Monic) (p_1 : p ≠ 1) : Irreducible p ↔ ∀ (q : Polynomial R), q.degree ≤ ↑(p.natDegree / 2) → q ∣ p → IsUnit q

To check a monic polynomial is irreducible, it suffices to check only for divisors that have smaller degree.

See also: Polynomial.Monic.irreducible_iff_natDegree.

theorem Polynomial.le_rootMultiplicity_map {A : Type u_1} {B : Type u_2} [CommRing A] [CommRing B] {p : Polynomial A} {f : A →+* B} (hmap : map f p ≠ 0) (a : A) : rootMultiplicity a p ≤ rootMultiplicity (f a) (map f p)

theorem Polynomial.eq_rootMultiplicity_map {A : Type u_1} {B : Type u_2} [CommRing A] [CommRing B] {p : Polynomial A} {f : A →+* B} (hf : Function.Injective ⇑f) (a : A) : rootMultiplicity a p = rootMultiplicity (f a) (map f p)

theorem Polynomial.count_map_roots {A : Type u_1} {B : Type u_2} [CommRing A] [CommRing B] [IsDomain A] [DecidableEq B] {p : Polynomial A} {f : A →+* B} (hmap : map f p ≠ 0) (b : B) : Multiset.count b (Multiset.map (⇑f) p.roots) ≤ rootMultiplicity b (map f p)

theorem Polynomial.count_map_roots_of_injective {A : Type u_1} {B : Type u_2} [CommRing A] [CommRing B] [IsDomain A] [DecidableEq B] (p : Polynomial A) {f : A →+* B} (hf : Function.Injective ⇑f) (b : B) : Multiset.count b (Multiset.map (⇑f) p.roots) ≤ rootMultiplicity b (map f p)

theorem Polynomial.map_roots_le {A : Type u_1} {B : Type u_2} [CommRing A] [CommRing B] [IsDomain A] [IsDomain B] {p : Polynomial A} {f : A →+* B} (h : map f p ≠ 0) : Multiset.map (⇑f) p.roots ≤ (map f p).roots

theorem Polynomial.map_roots_le_of_injective {A : Type u_1} {B : Type u_2} [CommRing A] [CommRing B] [IsDomain A] [IsDomain B] (p : Polynomial A) {f : A →+* B} (hf : Function.Injective ⇑f) : Multiset.map (⇑f) p.roots ≤ (map f p).roots

theorem Polynomial.card_roots_le_map {A : Type u_1} {B : Type u_2} [CommRing A] [CommRing B] [IsDomain A] [IsDomain B] {p : Polynomial A} {f : A →+* B} (h : map f p ≠ 0) : p.roots.card ≤ (map f p).roots.card

theorem Polynomial.card_roots_le_map_of_injective {A : Type u_1} {B : Type u_2} [CommRing A] [CommRing B] [IsDomain A] [IsDomain B] {p : Polynomial A} {f : A →+* B} (hf : Function.Injective ⇑f) : p.roots.card ≤ (map f p).roots.card

theorem Polynomial.roots_map_of_injective_of_card_eq_natDegree {A : Type u_1} {B : Type u_2} [CommRing A] [CommRing B] [IsDomain A] [IsDomain B] {p : Polynomial A} {f : A →+* B} (hf : Function.Injective ⇑f) (hroots : p.roots.card = p.natDegree) : Multiset.map (⇑f) p.roots = (map f p).roots

theorem Polynomial.roots_map_of_map_ne_zero_of_card_eq_natDegree {A : Type u_1} {B : Type u_2} [CommRing A] [CommRing B] [IsDomain A] [IsDomain B] {p : Polynomial A} (f : A →+* B) (h : map f p ≠ 0) (hroots : p.roots.card = p.natDegree) : Multiset.map (⇑f) p.roots = (map f p).roots

theorem Polynomial.Monic.roots_map_of_card_eq_natDegree {A : Type u_1} {B : Type u_2} [CommRing A] [CommRing B] [IsDomain A] [IsDomain B] {p : Polynomial A} (hm : p.Monic) (f : A →+* B) (hroots : p.roots.card = p.natDegree) : Multiset.map (⇑f) p.roots = (Polynomial.map f p).roots