mathlib3 documentation

data.polynomial.div

Division of univariate polynomials #

THIS FILE IS SYNCHRONIZED WITH MATHLIB4. Any changes to this file require a corresponding PR to mathlib4.

The main defs are div_by_monic and mod_by_monic. The compatibility between these is given by mod_by_monic_add_div. We also define root_multiplicity.

source
theorem polynomial.X_dvd_iff {R : Type u} [comm_semiring R] {f : polynomial R} :
polynomial.X ∣ f ↔ f.coeff 0 = 0
source
theorem polynomial.X_pow_dvd_iff {R : Type u} [comm_semiring R] {f : polynomial R} {n : ℕ} :
polynomial.X ^ n ∣ f ↔ ∀ (d : ℕ), d < n → f.coeff d = 0
source
theorem polynomial.multiplicity_finite_of_degree_pos_of_monic {R : Type u} [comm_semiring R] {p q : polynomial R} (hp : 0 < p.degree) (hmp : p.monic) (hq : q ≠ 0) :
multiplicity.finite p q
source
theorem polynomial.div_wf_lemma {R : Type u} [ring R] {p q : polynomial R} (h : q.degree ≤ p.degree ∧ p ≠ 0) (hq : q.monic) :
(p - ⇑polynomial.C p.leading_coeff * polynomial.X ^ (p.nat_degree - q.nat_degree) * q).degree < p.degree
source
noncomputable def polynomial.div_mod_by_monic_aux {R : Type u} [ring R] (p : polynomial R) {q : polynomial R} :
q.monic → polynomial R × polynomial R

See div_by_monic.

Equations
source
noncomputable def polynomial.div_by_monic {R : Type u} [ring R] (p q : polynomial R) :
polynomial R

div_by_monic gives the quotient of p by a monic polynomial q.

Equations
source
noncomputable def polynomial.mod_by_monic {R : Type u} [ring R] (p q : polynomial R) :
polynomial R

mod_by_monic gives the remainder of p by a monic polynomial q.

Equations
source
theorem polynomial.degree_mod_by_monic_lt {R : Type u} [ring R] [nontrivial R] (p : polynomial R) {q : polynomial R} (hq : q.monic) :
(p %ₘ q).degree < q.degree
source
@[simp]
theorem polynomial.zero_mod_by_monic {R : Type u} [ring R] (p : polynomial R) :
0 %ₘ p = 0
source
@[simp]
theorem polynomial.zero_div_by_monic {R : Type u} [ring R] (p : polynomial R) :
0 /ₘ p = 0
source
@[simp]
theorem polynomial.mod_by_monic_zero {R : Type u} [ring R] (p : polynomial R) :
p %ₘ 0 = p
source
@[simp]
theorem polynomial.div_by_monic_zero {R : Type u} [ring R] (p : polynomial R) :
p /ₘ 0 = 0
source
theorem polynomial.div_by_monic_eq_of_not_monic {R : Type u} [ring R] {q : polynomial R} (p : polynomial R) (hq : ¬q.monic) :
p /ₘ q = 0
source
theorem polynomial.mod_by_monic_eq_of_not_monic {R : Type u} [ring R] {q : polynomial R} (p : polynomial R) (hq : ¬q.monic) :
p %ₘ q = p
source
theorem polynomial.mod_by_monic_eq_self_iff {R : Type u} [ring R] {p q : polynomial R} [nontrivial R] (hq : q.monic) :
p %ₘ q = p ↔ p.degree < q.degree
source
theorem polynomial.degree_mod_by_monic_le {R : Type u} [ring R] (p : polynomial R) {q : polynomial R} (hq : q.monic) :
(p %ₘ q).degree ≤ q.degree
source
theorem polynomial.mod_by_monic_eq_sub_mul_div {R : Type u} [comm_ring R] (p : polynomial R) {q : polynomial R} (hq : q.monic) :
p %ₘ q = p - q * (p /ₘ q)
source
theorem polynomial.mod_by_monic_add_div {R : Type u} [comm_ring R] (p : polynomial R) {q : polynomial R} (hq : q.monic) :
p %ₘ q + q * (p /ₘ q) = p
source
theorem polynomial.div_by_monic_eq_zero_iff {R : Type u} [comm_ring R] {p q : polynomial R} [nontrivial R] (hq : q.monic) :
p /ₘ q = 0 ↔ p.degree < q.degree
source
theorem polynomial.degree_add_div_by_monic {R : Type u} [comm_ring R] {p q : polynomial R} (hq : q.monic) (h : q.degree ≤ p.degree) :
q.degree + (p /ₘ q).degree = p.degree
source
theorem polynomial.degree_div_by_monic_le {R : Type u} [comm_ring R] (p q : polynomial R) :
(p /ₘ q).degree ≤ p.degree
source
theorem polynomial.degree_div_by_monic_lt {R : Type u} [comm_ring R] (p : polynomial R) {q : polynomial R} (hq : q.monic) (hp0 : p ≠ 0) (h0q : 0 < q.degree) :
(p /ₘ q).degree < p.degree
source
theorem polynomial.nat_degree_div_by_monic {R : Type u} [comm_ring R] (f : polynomial R) {g : polynomial R} (hg : g.monic) :
(f /ₘ g).nat_degree = f.nat_degree - g.nat_degree
source
theorem polynomial.div_mod_by_monic_unique {R : Type u} [comm_ring R] {f g : polynomial R} (q r : polynomial R) (hg : g.monic) (h : r + g * q = f ∧ r.degree < g.degree) :
f /ₘ g = q ∧ f %ₘ g = r
source
theorem polynomial.map_mod_div_by_monic {R : Type u} {S : Type v} [comm_ring R] {p q : polynomial R} [comm_ring S] (f : R →+* S) (hq : q.monic) :
polynomial.map f (p /ₘ q) = polynomial.map f p /ₘ polynomial.map f q ∧ polynomial.map f (p %ₘ q) = polynomial.map f p %ₘ polynomial.map f q
source
theorem polynomial.map_div_by_monic {R : Type u} {S : Type v} [comm_ring R] {p q : polynomial R} [comm_ring S] (f : R →+* S) (hq : q.monic) :
polynomial.map f (p /ₘ q) = polynomial.map f p /ₘ polynomial.map f q
source
theorem polynomial.map_mod_by_monic {R : Type u} {S : Type v} [comm_ring R] {p q : polynomial R} [comm_ring S] (f : R →+* S) (hq : q.monic) :
polynomial.map f (p %ₘ q) = polynomial.map f p %ₘ polynomial.map f q
source
theorem polynomial.dvd_iff_mod_by_monic_eq_zero {R : Type u} [comm_ring R] {p q : polynomial R} (hq : q.monic) :
p %ₘ q = 0 ↔ q ∣ p
source
theorem polynomial.map_dvd_map {R : Type u} {S : Type v} [comm_ring R] [comm_ring S] (f : R →+* S) (hf : function.injective ⇑f) {x y : polynomial R} (hx : x.monic) :
polynomial.map f x ∣ polynomial.map f y ↔ x ∣ y
source
@[simp]
theorem polynomial.mod_by_monic_one {R : Type u} [comm_ring R] (p : polynomial R) :
p %ₘ 1 = 0
source
@[simp]
theorem polynomial.div_by_monic_one {R : Type u} [comm_ring R] (p : polynomial R) :
p /ₘ 1 = p
source
@[simp]
theorem polynomial.mod_by_monic_X_sub_C_eq_C_eval {R : Type u} [comm_ring R] (p : polynomial R) (a : R) :
p %ₘ (polynomial.X - ⇑polynomial.C a) = ⇑polynomial.C (polynomial.eval a p)
source
theorem polynomial.mul_div_by_monic_eq_iff_is_root {R : Type u} {a : R} [comm_ring R] {p : polynomial R} :
(polynomial.X - ⇑polynomial.C a) * (p /ₘ (polynomial.X - ⇑polynomial.C a)) = p ↔ p.is_root a
source
theorem polynomial.dvd_iff_is_root {R : Type u} {a : R} [comm_ring R] {p : polynomial R} :
polynomial.X - ⇑polynomial.C a ∣ p ↔ p.is_root a
source
theorem polynomial.X_sub_C_dvd_sub_C_eval {R : Type u} {a : R} [comm_ring R] {p : polynomial R} :
polynomial.X - ⇑polynomial.C a ∣ p - ⇑polynomial.C (polynomial.eval a p)
source
theorem polynomial.mem_span_C_X_sub_C_X_sub_C_iff_eval_eval_eq_zero {R : Type u} {a : R} [comm_ring R] {b : polynomial R} {P : polynomial (polynomial R)} :
P ∈ ideal.span {⇑polynomial.C (polynomial.X - ⇑polynomial.C a), polynomial.X - ⇑polynomial.C b} ↔ polynomial.eval a (polynomial.eval b P) = 0
source
theorem polynomial.mod_by_monic_X {R : Type u} [comm_ring R] (p : polynomial R) :
p %ₘ polynomial.X = ⇑polynomial.C (polynomial.eval 0 p)
source
theorem polynomial.eval₂_mod_by_monic_eq_self_of_root {R : Type u} {S : Type v} [comm_ring R] [comm_ring S] {f : R →+* S} {p q : polynomial R} (hq : q.monic) {x : S} (hx : polynomial.eval₂ f x q = 0) :
polynomial.eval₂ f x (p %ₘ q) = polynomial.eval₂ f x p
source
theorem polynomial.sum_mod_by_monic_coeff {R : Type u} [comm_ring R] {p q : polynomial R} (hq : q.monic) {n : ℕ} (hn : q.degree ≤ ↑n) :
finset.univ.sum (λ (i : fin n), ⇑(polynomial.monomial ↑i) ((p %ₘ q).coeff ↑i)) = p %ₘ q
source
theorem polynomial.sub_dvd_eval_sub {R : Type u} [comm_ring R] (a b : R) (p : polynomial R) :
a - b ∣ polynomial.eval a p - polynomial.eval b p
source
theorem polynomial.mul_div_mod_by_monic_cancel_left {R : Type u} [comm_ring R] (p : polynomial R) {q : polynomial R} (hmo : q.monic) :
q * p /ₘ q = p
source
theorem polynomial.not_is_field (R : Type u) [comm_ring R] :
¬is_field (polynomial R)
source
theorem polynomial.ker_eval_ring_hom {R : Type u} [comm_ring R] (x : R) :
ring_hom.ker (polynomial.eval_ring_hom x) = ideal.span {polynomial.X - ⇑polynomial.C x}
source
noncomputable def polynomial.decidable_dvd_monic {R : Type u} [comm_ring R] {q : polynomial R} (p : polynomial R) (hq : q.monic) :
decidable (q ∣ p)

An algorithm for deciding polynomial divisibility. The algorithm is "compute p %ₘ q and compare to 0". See polynomial.mod_by_monic for the algorithm that computes %ₘ.

Equations
source
theorem polynomial.multiplicity_X_sub_C_finite {R : Type u} [comm_ring R] {p : polynomial R} (a : R) (h0 : p ≠ 0) :
multiplicity.finite (polynomial.X - ⇑polynomial.C a) p
source
noncomputable def polynomial.root_multiplicity {R : Type u} [comm_ring R] (a : R) (p : polynomial R) :
ℕ

The largest power of X - C a which divides p. This is computable via the divisibility algorithm polynomial.decidable_dvd_monic.

Equations
source
theorem polynomial.root_multiplicity_eq_multiplicity {R : Type u} [comm_ring R] (p : polynomial R) (a : R) :
polynomial.root_multiplicity a p = dite (p = 0) (λ (h0 : p = 0), 0) (λ (h0 : ¬p = 0), (multiplicity (polynomial.X - ⇑polynomial.C a) p).get _)
source
@[simp]
theorem polynomial.root_multiplicity_zero {R : Type u} [comm_ring R] {x : R} :
polynomial.root_multiplicity x 0 = 0
source
@[simp]
theorem polynomial.root_multiplicity_eq_zero_iff {R : Type u} [comm_ring R] {p : polynomial R} {x : R} :
polynomial.root_multiplicity x p = 0 ↔ p.is_root x → p = 0
source
theorem polynomial.root_multiplicity_eq_zero {R : Type u} [comm_ring R] {p : polynomial R} {x : R} (h : ¬p.is_root x) :
polynomial.root_multiplicity x p = 0
source
@[simp]
theorem polynomial.root_multiplicity_pos' {R : Type u} [comm_ring R] {p : polynomial R} {x : R} :
0 < polynomial.root_multiplicity x p ↔ p ≠ 0 ∧ p.is_root x
source
theorem polynomial.root_multiplicity_pos {R : Type u} [comm_ring R] {p : polynomial R} (hp : p ≠ 0) {x : R} :
0 < polynomial.root_multiplicity x p ↔ p.is_root x
source
@[simp]
theorem polynomial.root_multiplicity_C {R : Type u} [comm_ring R] (r a : R) :
polynomial.root_multiplicity a (⇑polynomial.C r) = 0
source
theorem polynomial.pow_root_multiplicity_dvd {R : Type u} [comm_ring R] (p : polynomial R) (a : R) :
(polynomial.X - ⇑polynomial.C a) ^ polynomial.root_multiplicity a p ∣ p
source
theorem polynomial.div_by_monic_mul_pow_root_multiplicity_eq {R : Type u} [comm_ring R] (p : polynomial R) (a : R) :
p /ₘ (polynomial.X - ⇑polynomial.C a) ^ polynomial.root_multiplicity a p * (polynomial.X - ⇑polynomial.C a) ^ polynomial.root_multiplicity a p = p
source
theorem polynomial.eval_div_by_monic_pow_root_multiplicity_ne_zero {R : Type u} [comm_ring R] {p : polynomial R} (a : R) (hp : p ≠ 0) :
polynomial.eval a (p /ₘ (polynomial.X - ⇑polynomial.C a) ^ polynomial.root_multiplicity a p) ≠ 0