-
Notifications
You must be signed in to change notification settings - Fork 175
feat: Voronovskaja-type formula for the Bézier variant of the Bernstein operators #1444
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
base: main
Are you sure you want to change the base?
Changes from 3 commits
File filter
Filter by extension
Conversations
Jump to
Diff view
Diff view
There are no files selected for viewing
| Original file line number | Diff line number | Diff line change | ||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| @@ -0,0 +1,114 @@ | ||||||||||||||
| /- | ||||||||||||||
| Copyright 2025 The Formal Conjectures Authors. | ||||||||||||||
|
|
||||||||||||||
| Licensed under the Apache License, Version 2.0 (the "License"); | ||||||||||||||
| you may not use this file except in compliance with the License. | ||||||||||||||
| You may obtain a copy of the License at | ||||||||||||||
|
|
||||||||||||||
| https://www.apache.org/licenses/LICENSE-2.0 | ||||||||||||||
|
|
||||||||||||||
| Unless required by applicable law or agreed to in writing, software | ||||||||||||||
| distributed under the License is distributed on an "AS IS" BASIS, | ||||||||||||||
| WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | ||||||||||||||
| See the License for the specific language governing permissions and | ||||||||||||||
| limitations under the License. | ||||||||||||||
| -/ | ||||||||||||||
|
|
||||||||||||||
| import FormalConjectures.Util.ProblemImports | ||||||||||||||
|
|
||||||||||||||
| open Topology Filter Real unitInterval Polynomial | ||||||||||||||
|
|
||||||||||||||
| /-! | ||||||||||||||
| # Voronovskaja-type Formula for the Bezier Variant of the Bernstein Operators | ||||||||||||||
|
|
||||||||||||||
| *References:* | ||||||||||||||
|
|
||||||||||||||
| * [A problem in Constructive theory of functions, Szopol 2010](https://www.math.bas.bg/mathmod/Proceedings_CTF/CTF-2010/files_CTF-2010/Open_problems.pdf?utm_source=perplexity) | ||||||||||||||
|
|
||||||||||||||
| The Bézier-type Bernstein operators $B_{n,\alpha}$ for $\alpha > 0$ are defined for | ||||||||||||||
| $f : [0,1] \to \mathbb{R}$ by | ||||||||||||||
| \[ | ||||||||||||||
| (B_{n,\alpha} f)(x) | ||||||||||||||
| = \sum_{k=0}^n f\!\left(\frac{k}{n}\right) | ||||||||||||||
| \left( J_{n,k}(x)^{\alpha} - J_{n,k+1}(x)^{\alpha} \right), | ||||||||||||||
| \] | ||||||||||||||
| where | ||||||||||||||
| \[ | ||||||||||||||
| J_{n,k}(x) = \sum_{j=k}^n p_{n,j}(x), | ||||||||||||||
| \qquad | ||||||||||||||
| p_{n,j}(x) = \binom{n}{j} x^j(1-x)^{n-j}, | ||||||||||||||
| \] | ||||||||||||||
| and $J_{n,n+1}(x) = 0$. | ||||||||||||||
|
|
||||||||||||||
| In the classical case $\alpha = 1$, these operators reduce to the usual Bernstein operators. | ||||||||||||||
| For sufficiently smooth $f$, one has the classical Voronovskaja asymptotic formula | ||||||||||||||
| \[ | ||||||||||||||
| \lim_{n \to \infty} n\bigl( B_{n,1} f(x) - f(x) \bigr) | ||||||||||||||
| = \tfrac{1}{2} x(1-x) f''(x). | ||||||||||||||
| \] | ||||||||||||||
|
|
||||||||||||||
| ## Known Results | ||||||||||||||
| * For $\alpha = 1$, the asymptotics are completely understood. | ||||||||||||||
| * Numerical experiments indicate that for $\alpha \neq 1$ the quantity | ||||||||||||||
| \[ | ||||||||||||||
| \sqrt{n}\,\bigl( B_{n,\alpha} f(x) - f(x) \bigr) | ||||||||||||||
| \] | ||||||||||||||
| may converge to a non-zero limit. | ||||||||||||||
|
|
||||||||||||||
| ## The Problem | ||||||||||||||
| Determine the asymptotic behaviour of the Bézier-type Bernstein operators for $\alpha \neq 1$: | ||||||||||||||
| \textbf{Existence of the limit:} | ||||||||||||||
| Prove (or disprove) the existence of the limit | ||||||||||||||
| \[ | ||||||||||||||
| \lim_{n \to \infty} | ||||||||||||||
| \sqrt{n}\,\bigl( B_{n,\alpha} f(x) - f(x) \bigr), | ||||||||||||||
| \] | ||||||||||||||
| at least for functions $f$ that are twice differentiable at $x \in (0,1)$. | ||||||||||||||
| \item \textbf{Explicit form of the limit:} | ||||||||||||||
| If the limit exists, determine an explicit expression for it in terms of $f$, $x$, and $\alpha$. | ||||||||||||||
| -/ | ||||||||||||||
|
|
||||||||||||||
| /-- | ||||||||||||||
| Cumulative sum `J_{n,k}(x) = ∑_{j=k}^n p_{n,j}(x)` | ||||||||||||||
| -/ | ||||||||||||||
| noncomputable def BernsteinTail (n k : ℕ) : Polynomial ℝ := | ||||||||||||||
| ∑ j ∈ Finset.Icc k n, | ||||||||||||||
| bernsteinPolynomial ℝ n j | ||||||||||||||
|
||||||||||||||
| noncomputable def BernsteinTail (n k : ℕ) : Polynomial ℝ := | |
| ∑ j ∈ Finset.Icc k n, | |
| bernsteinPolynomial ℝ n j | |
| noncomputable def bernsteinTail (n k : ℕ) : ℝ[X] := | |
| ∑ j ∈ .Icc k n, bernsteinPolynomial ℝ n j |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Same here
Outdated
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
| noncomputable def BezierBernstein (n : ℕ) (α : ℝ) (f : ℝ → ℝ) (x : ℝ) : ℝ := | |
| noncomputable def bezierBernstein (n : ℕ) (α : ℝ) (f : ℝ → ℝ) (x : ℝ) : ℝ := |
Outdated
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
| ∑ k ∈ Finset.range (n+1), | |
| f (k/n) * (((BernsteinTail n k).eval x) ^ α - ((BernsteinTail n k + 1).eval x) ^ α) | |
| ∑ k ∈ .range (n+1), | |
| f (k/n) * ((bernsteinTail n k).eval x ^ α - (bernsteinTail n k + 1).eval x ^ α) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Can you latex this?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
No need to write this, the tag already contains this info
| This is already in the literature; here we state it. |
Outdated
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
This doesn't do at all what you think. This is the syntax for a default value. You instead want
| (f : ℝ → ℝ) (x : ℝ) (hx : x ∈ I) | |
| (f'' : ℝ := iteratedDerivWithin 2 f I x) : | |
| Tendsto (fun (n : ℕ) => n • (BezierBernstein n 1 f x - f x)) | |
| (f : ℝ → ℝ) (x : ℝ) (hx : x ∈ I) : | |
| let f'' : ℝ := iteratedDerivWithin 2 f I x | |
| Tendsto (fun (n : ℕ) => n • (BezierBernstein n 1 f x - f x)) |
Outdated
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Same here
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Can you put this at the end of the doc?