Are my ideas as for the convergence right?

  • Context: MHB 
  • Thread starter Thread starter evinda
  • Start date Start date
  • Tags Tags
    Convergence Ideas
Click For Summary
SUMMARY

The discussion centers on the convergence of sequences, specifically proving that if the subsequences \(a_{2n}\) and \(a_{2n+1}\) converge to a real number \(a\), then the entire sequence \(a_n\) also converges to \(a\). The participants confirm that the limit holds by demonstrating that for any \(\epsilon > 0\), there exists an \(N\) such that \(|a_n - a| < \epsilon\) for all \(n \geq N\). Additionally, they analyze the convergence of the sequence \(\left( \frac{x_1+x_2+\dots+x_n}{n}\right)\) where \(x_n\) is defined as 0 for even \(n\) and 1 for odd \(n\), concluding that it converges to \(\frac{1}{2}\).

PREREQUISITES
  • Understanding of sequence convergence in real analysis
  • Familiarity with the epsilon-delta definition of limits
  • Basic knowledge of subsequences and their properties
  • Ability to manipulate inequalities in mathematical proofs
NEXT STEPS
  • Study the epsilon-delta definition of convergence in detail
  • Explore properties of subsequences in real analysis
  • Learn about the Bolzano-Weierstrass theorem and its implications for convergence
  • Investigate the concept of Cesàro summation and its applications in sequence convergence
USEFUL FOR

Mathematics students, educators, and anyone interested in real analysis, particularly those focusing on sequence convergence and limit proofs.

evinda
Gold Member
MHB
Messages
3,741
Reaction score
0
Hello! (Wave)

I am looking at the following exercise:

  1. Let $(a_n)$ be a sequence of real numbers such that $a_{2n} \to a$ and $a_{2n+1} \to a$ for some real number $a$. Show that $a_n \to a$.
  2. We are given the sequence $x_n=0$ if $n$ is even, $x_n=1$ if $n$ is odd. Check as for the convergence the sequence $\left( \frac{x_1+x_2+\dots+x_n}{n}\right)$.

I have thought the following:

  1. Since $a_{2n} \to a$, we have that $\forall \epsilon>0 \ \exists n_1$ such that $|a_{2n}-a|<\epsilon, \forall n \geq n_1$.

    Since $a_{2n+1} \to a$, we have that $\forall \epsilon>0 \ \exists n_2$ such that $|a_{2n+1}-a|<\epsilon, \forall n \geq n_2$.

    Then we have that $|a_n-a|<\epsilon, \forall n \geq \max \{ n_1,n_2\}$ and $\forall \epsilon$ and thus $a_n \to a$.

    Is this right? (Thinking)
  2. We have that $0 \leq \frac{x_1+x_2+\dots+x_n}{n} \leq \frac{\frac{n}{2}}{n}=\frac{1}{2}$.

    Does this help somehow? (Thinking)
 
Physics news on Phys.org
evinda said:
Hello! (Wave)

I am looking at the following exercise:

  1. Let $(a_n)$ be a sequence of real numbers such that $a_{2n} \to a$ and $a_{2n+1} \to a$ for some real number $a$. Show that $a_n \to a$.
  2. We are given the sequence $x_n=0$ if $n$ is even, $x_n=1$ if $n$ is odd. Check as for the convergence the sequence $\left( \frac{x_1+x_2+\dots+x_n}{n}\right)$.

I have thought the following:

1. Since $a_{2n} \to a$, we have that $\forall \epsilon>0 \ \exists n_1$ such that $|a_{2n}-a|<\epsilon, \forall n \geq n_1$.

Since $a_{2n+1} \to a$, we have that $\forall \epsilon>0 \ \exists n_2$ such that $|a_{2n+1}-a|<\epsilon, \forall n \geq n_2$.

Then we have that $|a_n-a|<\epsilon, \forall n \geq \max \{ n_1,n_2\}$ and $\forall \epsilon$ and thus $a_n \to a$.

Is this right?

Hey evinda!

Yep. (Nod)

evinda said:
2. We have that $0 \leq \frac{x_1+x_2+\dots+x_n}{n} \leq \frac{\frac{n}{2}}{n}=\frac{1}{2}$.

Does this help somehow?

Don't we have:
$$\frac n2 \le x_1+...+x_n \le \frac{n+1}2$$
? (Wondering)
 
Klaas van Aarsen said:
Don't we have:
$$\frac n2 \le x_1+...+x_n \le \frac{n+1}2$$
? (Wondering)

How do we get this inequality?

The sum $x_1+\dots+x_n$ has $n$ summands. If $n$ is even, then the half, namely $\frac{n}{2}$ summands will be equal to $1$.
If $n$ is odd, then $\frac{n-1}{2}$ summands will be equal to $1$.

Or am I wrong? (Thinking)
 
evinda said:
How do we get this inequality?

The sum $x_1+\dots+x_n$ has $n$ summands. If $n$ is even, then the half, namely $\frac{n}{2}$ summands will be equal to $1$.
If $n$ is odd, then $\frac{n-1}{2}$ summands will be equal to $1$.

Or am I wrong?

Consider $n=1$, which is odd, so we have $x_1=1$.
But $\frac{n-1}{2} = \frac{1-1}{2} = 0 \ne 1$, isn't it? (Thinking)
 
Klaas van Aarsen said:
Consider $n=1$, which is odd, so we have $x_1=1$.
But $\frac{n-1}{2} = \frac{1-1}{2} = 0 \ne 1$, isn't it? (Thinking)

Oh yes, right... If $n$ is odd, then $\frac{n-1}{2}+1=\frac{n+1}{2}$ summands will be equal to $1$, right? (Thinking)

That's why we get $\frac{n}{2}\leq x_1+\dots+x_n \leq \frac{n+1}{2}$.

Then we have that $\frac{1}{2} \leq \frac{x_1+x_2+\dots+x_n}{n} \leq \frac{1}{2} \left( 1+\frac{1}{n}\right) \Rightarrow \frac{1}{2} \leq \lim_{n \to +\infty} \frac{x_1+ x_2+\dots+ x_n}{n} \leq \lim_{n \to +\infty} \frac{1}{2} \left( 1+\frac{1}{n} \right)=\frac{1}{2}$ and so the sequence $\frac{x_1+x_2+\dots+x_n}{n}$ converges to $\frac{1}{2}$.

Right?
 
(Nod)
 
Klaas van Aarsen said:
(Nod)

Nice, thank you... (Smile)
 

Similar threads

  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 17 ·
Replies
17
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
Replies
1
Views
2K