Documentation

RealClosedField.SturmTarski.Theorem

theorem sturm_tarski_interval {R : Type u_1} [Field R] [IsRealClosed R] (a b : R) (p q : Polynomial R) (hab : a < b) (hpa : Polynomial.eval a p 0) (hpb : Polynomial.eval b p 0) :
def rootsAbove {R : Type u_1} [Field R] [IsRealClosed R] (f : Polynomial R) (a : R) :
Equations
Instances For
    def tarskiQuery_above {R : Type u_1} [Field R] [IsRealClosed R] (p q : Polynomial R) (a : R) :
    Equations
    Instances For
      def rootsBelow {R : Type u_1} [Field R] [IsRealClosed R] (f : Polynomial R) (b : R) :
      Equations
      Instances For
        def tarskiQuery_below {R : Type u_1} [Field R] [IsRealClosed R] (p q : Polynomial R) (b : R) :
        Equations
        Instances For
          def tarskiQuery_R {R : Type u_1} [Field R] [IsRealClosed R] (p q : Polynomial R) :
          Equations
          Instances For
            theorem seq_sgn_pos_inf_seqEvalSgn {R : Type u_1} [Field R] [IsRealClosed R] (ub : R) (ps : List (Polynomial R)) (key : xub, ppps, sgn (Polynomial.eval x pp) = sgn_pos_inf pp) :
            theorem sturm_tarski_above {R : Type u_1} [Field R] [IsRealClosed R] (a : R) (p q : Polynomial R) (hpa : Polynomial.eval a p 0) :
            theorem seq_sgn_neg_inf_seqEvalSgn {R : Type u_1} [Field R] [IsRealClosed R] (lb : R) (ps : List (Polynomial R)) (key : xlb, ppps, sgn (Polynomial.eval x pp) = sgn_neg_inf pp) :
            theorem sturm_tarski_below {R : Type u_1} [Field R] [IsRealClosed R] (b : R) (p q : Polynomial R) (hpa : Polynomial.eval b p 0) :
            theorem sturm_interval {R : Type u_1} [Field R] [IsRealClosed R] (a b : R) (p : Polynomial R) (hab : a < b) (hpa : Polynomial.eval a p 0) (hpb : Polynomial.eval b p 0) :
            theorem sturm_above {R : Type u_1} [Field R] [IsRealClosed R] (a : R) (p : Polynomial R) (hpa : Polynomial.eval a p 0) :
            theorem sturm_below {R : Type u_1} [Field R] [IsRealClosed R] (b : R) (p : Polynomial R) (hpa : Polynomial.eval b p 0) :