Proposition 2.4 — finitely many coefficient bounds give P̲_{k,M}(ρ) ≤ P_k(ρ) ≤ P̄_{k,M}(ρ) on [−1, 1]
ProvedHermiteLaptop.MaxAgree.proposition_2_4frieze-jerrum-roundinghermite-expansionp2o-gran-per-chapterp2o-plan-paperp2o-v1
Fix and , and suppose that for each we have bounds (for , since , the exact values , for may be used). With and the piecewise truncated polynomials of the definition item,
This turns finitely many certified coefficients into rigorous two-sided bounds on the whole collision-probability function.
Formalization Note. The bounds are arbitrary reals cl m, cu m; only m ≤ M is constrained and read.
Differences from the source:
- encoding: two printed branches for ρ ∈ [0,1] and ρ ∈ [−1,0] → the [0,1] branch for ρ ≥ 0, the [−1,0] branch for ρ < 0; reason: the two branches agree at ρ = 0
Preamble
import Mathlib import Definitions.Def_HermiteLaptop_MaxAgree_Hermite import Definitions.Def_HermiteLaptop_MaxAgree_TruncBounds
Formal statement
namespace HermiteLaptop.MaxAgree
/-- Proposition 2.4: bounds `c̲_{k,m} ≤ c_{k,m} ≤ c̄_{k,m}` for `m ≤ M` give
`P̲_{k,M}(ρ) ≤ P_k(ρ) ≤ P̄_{k,M}(ρ)` on `[−1, 1]`. -/
theorem proposition_2_4 (k : ℕ) (hk : 1 ≤ k) (M : ℕ) (cl cu : ℕ → ℝ)
(hcl : ∀ m ≤ M, cl m ≤ coeffC k m) (hcu : ∀ m ≤ M, coeffC k m ≤ cu m) :
∀ ρ ∈ Set.Icc (-1 : ℝ) 1,
truncLower M cl cu ρ ≤ collisionProb k ρ ∧ collisionProb k ρ ≤ truncUpper M cl cu ρ := by sorry
end HermiteLaptop.MaxAgree
Source
García-Soriano, Miyauchi, Hermite Brings a Laptop, arXiv:2609.35453 (held version, sha256 97504f90…), pp. 16–17 (PDF 19–20), Proposition 2.4
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.