Ivan Shishkin, Rye (1878)

Problems/Real functionUnreviewed

Bernstein’s theorem

by Sequoia·
49
Difficulty scaleÉchelle de difficulté

This score reflects both the level of the required concepts and the difficulty of the solution.Ce score tient compte à la fois du niveau des notions nécessaires et de la difficulté de la résolution.

  1. 110First steps / middle schoolPremiers pas / collège
  2. 1125Beginner / high schoolDébutant / lycée
  3. 2650Intermediate / undergraduateIntermédiaire / licence
  4. 5170Advanced / graduateAvancé / master
  5. 7190Expert / specializedExpert / spécialisé
  6. 91100Research levelNiveau recherche
These levels are approximate guides.Ces niveaux sont des repères approximatifs.
·
English
EnglishFrançais
Unreviewed. This problem has not been reviewed by trusted users yet.

Let fC(]a,a[,R)f \in \mathcal{C}^{\infty}(]-a,a[,\mathbb{R}) be such that nN,f(n)0\forall n \in \mathbb{N}, f^{(n)} \geqslant 0. The goal is to show that ff is analytic, that is, expandable as a power series at every point of its domain of definition.

  1. By considering gx0:xf(x+x0)g_{x_0} : x \longmapsto f(x+x_0) with x0]a,a[x_0 \in \, ]-a,a[, so that gx0g_{x_0} is defined on ]a+x0,ax0[]-a+|x_0|, a-|x_0|[, show that it suffices to show that ff is expandable as a power series in a neighborhood of 00 in order to conclude.

We now seek to show that ff is expandable as a power series in a neighborhood of 00.

  1. Show that:
    nN,x]a,a[,f(x)=k=0nf(k)(0)k!xk+Rn(x)\forall n \in \mathbb{N}, \forall x \in \, ]-a,a[, \quad f(x) = \sum_{k=0}^{n} \frac{f^{(k)}(0)}{k!} x^k + R_n(x)where RnR_n will be expressed by means of an integral.

  2. Consider b]0,a[b \in \, ]0,a[. Show that, for every natural number nn and every real number xx of ]b,b[]-b,b[, we have the bound:
    nN,x]b,b[,Rn(x)(xb)n+1Rn(b)(xb)n+1f(b)\forall n \in \mathbb{N}, \forall x \in \, ]-b,b[, \quad |R_n(x)| \leqslant \left(\frac{|x|}{b}\right)^{n+1} R_n(b) \leqslant \left(\frac{|x|}{b}\right)^{n+1} f(b)

Then deduce Bernstein’s theorem.

  1. Application: Let f:[0,1]Rf : [0,1] \to \mathbb{R} be not identically zero such that nN,f(n)0\forall n \in \mathbb{N}, f^{(n)} \geqslant 0. Show that ff vanishes at most once.
I solved itMark it doneAdd to my listKeep it in your list

Solutions

0
Report

For an unclear, ambiguous, or possibly incorrect statement, please use the Discussion tab on the right. Report content that needs moderator intervention, such as dangerous, clearly non-mathematical, or plagiarized content.