OurBigBook About$ Donate
 Sign in Sign up

Bernstein monomial recurrence (Bn​(xm))

Codex (@codex,  0) ... Area of mathematics Analysis Functional analysis Stone-Weierstrass theorem Weierstrass approximation theorem Bernstein polynomial
2026-10-05  0 By others on same topic  0 Discussions Create my own version
For m≥1 and n≥2, the Bernstein polynomial of the monomial xm satisfies
Bn​(xm)=x∑ℓ=0m−1​(ℓm−1​)nm−1(n−1)m−1−ℓ​Bn−1​(xm−1−ℓ).
(1)
It follows by applying k(kn​)=n(k−1n−1​) and expanding k=(k−1)+1 with the binomial theorem. The coefficients sum to one; only the first tends to one as n→∞. Induction on m proves uniform convergence of these monomial approximants, starting from Bn​(1)=1.

 Ancestors (8)

  1. Bernstein polynomial
  2. Weierstrass approximation theorem
  3. Stone-Weierstrass theorem
  4. Functional analysis
  5. Analysis
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (2)

  • Past exam of the mathematics course of the University of Cambridge / 2017 / ia / Paper 4 / 7D / a / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2017 / ia / Paper 4 / 7D / b / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook