Ivan Shishkin, Rye (1878)

Problems/Riemann integrationUnreviewed

Théorème de Cesaro

by Sequoia·
32
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.
·
Français
FrançaisEnglish
Unreviewed. This problem has not been reviewed by trusted users yet.
  1. Soit uu une suite complexe convergeant vers un complexe ll. Montrer que
    1nk=0n1ukn+l.\frac{1}{n}\sum_{k=0}^{n-1}u_{k}\underset{n\to+\infty}{\longrightarrow}l.
  2. Soit ff une fonction complexe continue telle que f(x)x+lf(x)\underset{x\to+\infty}{\longrightarrow}l avec lCl\in\mathbb{C}. Montrer que
    1x0xf(t)dtx+l.\frac{1}{x}\int_{0}^{x}f(t)\,\mathrm{d}t\underset{x\to+\infty}{\longrightarrow}l.
  3. A-t-on la réciproque d’une des propositions précédentes ? Autrement dit, est-ce que la convergence en valeur moyenne implique toujours la convergence de la suite / fonction continue considérée ?
I solved itMark it doneAdd to my listKeep it in your list

Solutions

1
Reveal solutionsAre you sure? Give it a try first.
Potential issue reported

Solution by AndurilEN

Discussions0 useful votes

Let (an)nN(a_n)_{n \in \mathbb{N}^*} be a sequence of complex numbers such that limnan=C\lim_{n \to \infty} a_n = \ell \in \mathbb{C}. Then:

limn1nk=1nak=\lim_{n \to \infty} \frac{1}{n} \sum_{k=1}^n a_k = \ell

Setting bn=anb_n = a_n - \ell, we can assume without loss of generality that =0\ell = 0.

Let ε>0\varepsilon > 0. Since bn0b_n \to 0, there exists NNN \in \mathbb{N}^* such that:

k>N,bkε2\forall k > N, \quad |b_k| \le \frac{\varepsilon}{2}

For any n>Nn > N, split the sum into two parts:

1nk=1nbk1nk=1Nbk+1nk=N+1nbkMNn+nNnε2<MNn+ε2\left| \frac{1}{n} \sum_{k=1}^n b_k \right| \le \frac{1}{n} \sum_{k=1}^N |b_k| + \frac{1}{n} \sum_{k=N+1}^n |b_k| \le \frac{M_N}{n} + \frac{n - N}{n} \frac{\varepsilon}{2} < \frac{M_N}{n} + \frac{\varepsilon}{2}

where MN=k=1NbkM_N = \sum_{k=1}^N |b_k| is a fixed constant independent of nn.

Since limnMNn=0\lim_{n \to \infty} \frac{M_N}{n} = 0, there exists NNN' \ge N such that:

n>N,MNn<ε2\forall n > N', \quad \frac{M_N}{n} < \frac{\varepsilon}{2}

Thus, for all n>Nn > N':

1nk=1nak<ε2+ε2=ε\left| \frac{1}{n} \sum_{k=1}^n a_k - \ell \right| < \frac{\varepsilon}{2} + \frac{\varepsilon}{2} = \varepsilon

For the second question, same reasoning.

As counterexamples, you can consider un=(1)nu_{n}=(-1)^{n} and f=sinf=sin.

Still, there are some converse results such as when the sequence / function is real and monotonous (or more generally if we already know that it has a limit - finite or not).

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.