Root Finding Tactic #
The root_bound tactic proves ∀ x ∈ I, f x ≠ 0 using interval arithmetic.
Runtime facts from a retained no-root certificate.
- checker : Lean.Name
- verifier : Lean.Name
- verification : VerificationUsage
- taylorDepth : ℕ
Instances For
@[instance_reducible]
Expected and invariant failures from no-root certification.
- unsupported (expression detail : String) : RootBoundFailure
- rejected (detail : String) : RootBoundFailure
- transportFailure (detail : String) : RootBoundFailure
- internalFailure (detail : String) : RootBoundFailure
Instances For
@[instance_reducible]
@[instance_reducible]
Equations
Equations
- One or more equations did not get rendered due to their size.
Instances For
Typed root-bound implementation. Every non-success restores the caller's complete tactic state.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The root_bound tactic.
Automatically proves root-related properties using interval arithmetic.
Usage:
root_bound- uses default Taylor depth of 10root_bound 20- uses Taylor depth of 20
Supports goals of the form:
∀ x ∈ I, f x ≠ 0(proves no root exists in interval)
Equations
- One or more equations did not get rendered due to their size.