theorem
no_zero_in_sturmSeq
{R : Type u_1}
[Field R]
[IsRealClosed R]
(p q : Polynomial R)
:
0 ∉ sturmSeq p q
Equations
- seqEvalSgn k [] = []
- seqEvalSgn k (a :: as) = ↑(sgn (Polynomial.eval k a)) :: seqEvalSgn k as
Instances For
Equations
- seqVarSturm_ab p q a b = seqVar_ab (sturmSeq p q) a b
Instances For
Equations
- seqVarAbove_a P a = ↑(seqVar (seqEval a P)) - ↑(seqVar (seq_sgn_pos_inf P))
Instances For
Equations
- seqVarBelow_b P b = ↑(seqVar (seq_sgn_neg_inf P)) - ↑(seqVar (seqEval b P))
Instances For
Equations
- seqVarR P = ↑(seqVar (seq_sgn_neg_inf P)) - ↑(seqVar (seq_sgn_pos_inf P))
Instances For
Equations
- seqVarAboveSturm p q a = seqVarAbove_a (sturmSeq p q) a
Instances For
Equations
- seqVarBelowSturm p q b = seqVarBelow_b (sturmSeq p q) b
Instances For
Equations
- seqVarRSturm p q = seqVarR (sturmSeq p q)
Instances For
@[irreducible]
@[simp]
@[simp]
@[simp]
theorem
cauchyIndex_poly_taq
{R : Type u_1}
[Field R]
[IsRealClosed R]
(p q : Polynomial R)
(a b : R)
:
theorem
changes_itv_smods_rec
{R : Type u_1}
[Field R]
[IsRealClosed R]
{a b : R}
{p q : Polynomial R}
(hpqa : Polynomial.eval a (p * q) ≠ 0)
(hpqb : Polynomial.eval b (p * q) ≠ 0)
:
theorem
cauchyIndex_poly_rec
{R : Type u_1}
[Field R]
[IsRealClosed R]
(p q : Polynomial R)
(a b : R)
(hab : a < b)
(ha : Polynomial.eval a (p * q) ≠ 0)
(hb : Polynomial.eval b (p * q) ≠ 0)
:
@[irreducible]
theorem
changes_smods_congr
{R : Type u_1}
[Field R]
[IsRealClosed R]
(p q : Polynomial R)
(a a' : R)
(haa' : a ≠ a')
(hpa : Polynomial.eval a p ≠ 0)
(no_root : ∀ p' ∈ sturmSeq p q, ∀ (x : R), a < x ∧ x ≤ a' ∨ a' ≤ x ∧ x < a → Polynomial.eval x p' ≠ 0)
:
theorem
changes_itv_smods_congr
{R : Type u_1}
[Field R]
[IsRealClosed R]
(p q : Polynomial R)
(a a' b b' : R)
(hpa : Polynomial.eval a p ≠ 0)
(hpb : Polynomial.eval b p ≠ 0)
(haa' : a < a')
(hb'b : b' < b)
(no_root : ∀ p' ∈ sturmSeq p q, ∀ (x : R), a < x ∧ x ≤ a' ∨ b' ≤ x ∧ x < b → Polynomial.eval x p' ≠ 0)
:
theorem
cauchyIndex_sturmSeq
{R : Type u_1}
[Field R]
[IsRealClosed R]
(p q : Polynomial R)
(a b : R)
(hpa : Polynomial.eval a p ≠ 0)
(hpb : Polynomial.eval b p ≠ 0)
(hab : a < b)
: