Lemma 10.1.2 — zeros of a rational function
ProvedPutermanMDP.Sensitive.rational_zerosLet be a real interval and be rational, meaning for real polynomials with throughout . If vanishes at some point of , then
This is the chapter's rational-function dichotomy used in the existence argument.
Formalization Note The printed hypothesis of at least one zero is retained, although FINDINGS records that it is unnecessary.
import Mathlib
namespace PutermanMDP.Sensitive
theorem rational_zeros (I : Set ℝ) (hI : Set.OrdConnected I) (f : ℝ → ℝ)
(hf : ∃ p q : Polynomial ℝ, (∀ x ∈ I, q.eval x ≠ 0) ∧
∀ x ∈ I, f x = p.eval x / q.eval x)
(hzero : ∃ x ∈ I, f x = 0) :
(∀ x ∈ I, f x = 0) ∨ {x : ℝ | x ∈ I ∧ f x = 0}.Finite := by sorry
end PutermanMDP.Sensitive
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Let be order-connected: whenever , the whole interval lies in . Let , and assume:
- there are real polynomials and such that for every and
- has at least one zero in .
The conclusion is a disjunction (at least one of the two holds):
- for every ; or
- the set is finite.
Nothing is said about outside .
Degenerate cases. Hypothesis 2 forces to be nonempty. Hypothesis 1 then forces to be a nonzero polynomial. If is a single point, both alternatives of the conclusion hold.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.