Ivan Shishkin, Rye (1878)

Problems/Riemann integration

Cesàro Theorem

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. 1–10First steps / middle schoolPremiers pas / collège
  2. 11–25Beginner / high schoolDébutant / lycée
  3. 26–50Intermediate / undergraduateIntermédiaire / licence
  4. 51–70Advanced / graduateAvancé / master
  5. 71–90Expert / specializedExpert / spécialisé
  6. 91–100Research levelNiveau recherche
These levels are approximate guides.Ces niveaux sont des repères approximatifs.
·
ReviewedReviewed by darktoaster
·
English
EnglishFrançais
  1. Let uu be a sequence of complex numbers that converges toward a complex ll. Show that we also have the convergence
    1n∑k=0n−1uk⟶n→+∞l\frac{1}{n}\sum_{k=0}^{n-1}u_{k}\underset{n\to+\infty}{\longrightarrow}l
  2. Let ff be a real continuous function such that f(x)⟶x→+∞lf(x)\underset{x\to+\infty}{\longrightarrow}l where l∈Cl\in\mathbb{C}. Show that:
    1x∫0xf(t) dt⟶x→+∞l\frac{1}{x}\int_{0}^{x}f(t)\,\mathrm{d}t\underset{x\to+\infty}{\longrightarrow}l
  3. Is there a converse to either of the two previous statements?
    In other words, does convergence in the mean always imply the convergence of the sequence or continuous function in question?
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 Anduril

Discussions1 useful vote

Let (an)n∈N∗(a_n)_{n \in \mathbb{N}^*} be a sequence of complex numbers such that lim⁡n→∞an=ℓ∈C\lim_{n \to \infty} a_n = \ell \in \mathbb{C}. Then:

lim⁡n→∞1n∑k=1nak=ℓ\lim_{n \to \infty} \frac{1}{n} \sum_{k=1}^n a_k = \ell

Setting ∀n∈N∗,bn=an−ℓ\forall n \in \N^{*}, b_n = a_n - \ell, we can assume without loss of generality that ℓ=0\ell = 0.

Let ε>0\varepsilon > 0. Since bn→0b_n \to 0, there exists N∈N∗N \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:

∣1n∑k=1nbk∣≤1n∑k=1N∣bk∣+1n∑k=N+1n∣bk∣≤MNn+n−Nnε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=1N∣bk∣M_N = \sum_{k=1}^N |b_k| is a fixed constant independent of nn.

Since lim⁡n→∞MNn=0\lim_{n \to \infty} \frac{M_N}{n} = 0, there exists N′≥NN' \ge N such that:

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

Thus, for all n>N′n > N':

∣1n∑k=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.