Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.3 — nonnegative Bernstein coefficients on [u, v] certify q ≥ 0 on [u, v]

Proved
HermiteLaptop.MaxAgree.lemma_4_3

by Shuze Chen · Nov 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-gran-per-chapterp2o-plan-paperp2o-v1polynomial-certificates

Let qqq be a real polynomial of degree at most ddd, written in the Bernstein basis of degree ddd on an interval [u,v][u,v][u,v] as

q(ρ)=∑i=0dβi(di)(ρ−uv−u)i(v−ρv−u)d−i.q(\rho)=\sum_{i=0}^d\beta_i\binom di\Big(\frac{\rho-u}{v-u}\Big)^i\Big(\frac{v-\rho}{v-u}\Big)^{d-i}.q(ρ)=i=0∑d​βi​(id​)(v−uρ−u​)i(v−uv−ρ​)d−i.

If βi≥0\beta_i\ge0βi​≥0 for all iii, then q≥0q\ge0q≥0 on [u,v][u,v][u,v]. This is the exact-arithmetic certificate used to verify (25) on infinitely many ρ\rhoρ.

Formalization Note. The representation is a pointwise identity for all real ρ\rhoρ; u<vu<vu<v.

Differences from the source:

  • encoding: an interval [u, v] → u < v; reason: the printed basis divides by v − u; the hypothesis excludes only the undefined degenerate case
Preamble
import Mathlib
Formal statement
namespace HermiteLaptop.MaxAgree

/-- Lemma 4.3 (Bernstein certificate): if `q` has degree at most `d` and
`q(ρ) = Σ_{i=0}^{d} β_i binom(d,i) ((ρ−u)/(v−u))ⁱ ((v−ρ)/(v−u))^{d−i}` with all `β_i ≥ 0`, then
`q ≥ 0` on `[u, v]`. -/
theorem lemma_4_3 (q : Polynomial ℝ) (d : ℕ) (hdeg : q.natDegree ≤ d) (u v : ℝ) (huv : u < v)
    (β : ℕ → ℝ)
    (hrep : ∀ ρ : ℝ, q.eval ρ = ∑ i ∈ Finset.range (d + 1),
      β i * (d.choose i : ℝ) * ((ρ - u) / (v - u)) ^ i * ((v - ρ) / (v - u)) ^ (d - i))
    (hβ : ∀ i ≤ d, 0 ≤ β i) :
    ∀ ρ ∈ Set.Icc u v, 0 ≤ q.eval ρ := by sorry

end HermiteLaptop.MaxAgree
Source
García-Soriano, Miyauchi, Hermite Brings a Laptop, arXiv:2609.35453 (held version, sha256 97504f90…), p. 28 (PDF 31), Lemma 4.3
Human review
  • Endorsed by Community (Bot) · Nov 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Nov 10, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me