Equations
- cauchyIndex p q a b = ∑ x ∈ rootsInInterval p a b, jump_val p q x
Instances For
Equations
- cross p a b = variation (Polynomial.eval a p) (Polynomial.eval b p)
Instances For
theorem
cross_no_root
{R : Type u_1}
[Field R]
[IsRealClosed R]
{a b : R}
{p : Polynomial R}
(hab : a < b)
(hxnroot : rootsInInterval p a b = ∅)
:
theorem
cauchyIndex_poly_mod
{R : Type u_1}
[Field R]
[IsRealClosed R]
(p q : Polynomial R)
(a b : R)
:
theorem
cauchyIndex_smult_1
{R : Type u_1}
[Field R]
[IsRealClosed R]
(p q : Polynomial R)
(a b c : R)
:
@[simp]
theorem
cindex_poly_z_1
{R : Type u_1}
[Field R]
[IsRealClosed R]
(p q : Polynomial R)
(a b : R)
(hp : p = 0)
:
@[simp]
theorem
cindex_poly_z_2
{R : Type u_1}
[Field R]
[IsRealClosed R]
(p q : Polynomial R)
(a b : R)
(hq : q = 0)
:
theorem
cindex_poly_const
{R : Type u_1}
[Field R]
[IsRealClosed R]
(p q : Polynomial R)
(a b x : R)
(hp_const : Polynomial.C x = p)
:
theorem
cindex_poly_mult
{R : Type u_1}
[Field R]
[IsRealClosed R]
{p q p' : Polynomial R}
{a b : R}
(hp' : p' ≠ 0)
:
theorem
cindex_poly_cross
{R : Type u_1}
[Field R]
[IsRealClosed R]
{p : Polynomial R}
{a b : R}
(hab : a < b)
(hpa_nroot : Polynomial.eval a p ≠ 0)
(hpb_nroot : Polynomial.eval b p ≠ 0)
:
theorem
cindex_poly_inverse_add
{R : Type u_1}
[Field R]
[IsRealClosed R]
{p q : Polynomial R}
(a b : R)
(hpq_coprime : IsCoprime p q)
:
theorem
cindex_poly_inverse_add_cross
{R : Type u_1}
[Field R]
[IsRealClosed R]
(p q : Polynomial R)
(a b : R)
(hab : a < b)
(hapq : Polynomial.eval a (p * q) ≠ 0)
(hbpq : Polynomial.eval b (p * q) ≠ 0)
:
cauchyIndex p q a b + cauchyIndex q p a b = variation (Polynomial.eval a (p * q)) (Polynomial.eval b (p * q))
theorem
cindex_poly_congr
{R : Type u_1}
[Field R]
[IsRealClosed R]
(p q : Polynomial R)
(a a' b b' : R)
(haa' : a < a')
(hb'b : b' < b)
(ha'b' : a' < b')
(hpx : ∀ (x : R), a < x ∧ x ≤ a' ∨ b' ≤ x ∧ x < b → Polynomial.eval x p ≠ 0)
: