Calculus / Chinese

Using the Cauchy criterion to disprove a limit

Charles队长 · Bilibili · 1:11

Bilibili · Charles队长Original video

IN THIS VIDEO

01Negating the Cauchy condition
02Oscillatory Behavior
03Choosing Epsilon Strategically

FROM THE LEARNING NOTES

\exists \varepsilon > 0, \forall N, \exists m,n > N : |a_n - a_m| \ge \varepsilon

Negating the Cauchy condition

SELECTED MOMENT

General Proof & Conclusion

SUGGESTED PREPARATION

Definition of Sequence Limits
Cauchy Sequences
Real Number Completeness Axiom
Quantifier Logic (Negation)

READ & KEEP

The explanation, unpacked.

Reviewed learning material · Video analysis · English

Read the full overview

This video demonstrates how to prove that the limit of the sequence $a_n = (-1)^n$ does not exist by using the contrapositive of the Cauchy Convergence Principle. It defines the negative condition ( $\exists \varepsilon > 0, \forall N, \dots$ ), selects $\varepsilon=1$ , and uses visual examples with specific indices ( $N=3, 6, \dots$ ) to show that adjacent terms always maintain a distance of at least 2. Finally, it generalizes this finding to conclude that since the sequence is not a Cauchy sequence, its limit cannot exist.

Use the learning inspector for key ideas and moments, or open the reading tabs for the complete notes.

Chapters

0:00Introduction & Definition 0:08Visualizing Specific Cases 0:52General Proof & Conclusion

Learning script

Generated from the video's visuals and explanation; not verbatim speech.

The video aims to disprove the existence of a limit for the sequence $a_n = (-1)^n$ using the reverse proposition of the Cauchy Convergence Principle. The screen displays the formal definition: there exists an $\varepsilon > 0$ such that for any $N$ , we can find $m, n > N$ where the distance between terms $|a_n - a_m| \ge \varepsilon$ . A coordinate system plots the sequence points oscillating strictly between $y=1$ and $y=-1$ .

To satisfy the condition, we fix $\varepsilon = 1$ . The animation tests various thresholds for $N$ . For instance, if $N=3$ , choosing subsequent indices $m=4$ and $n=5$ yields values $1$ and $-1$ , resulting in a difference of magnitude $2$ , which is clearly greater than or equal to our chosen epsilon. This pattern repeats for larger $N$ values like $6, 11,$ and $15$ . Regardless of how far out we go, picking consecutive integers ensures one term is positive and the other negative, maintaining a constant separation of $2$ .

Synthesizing these observations into a rigorous proof: For ANY arbitrary integer $N$ , let us constructively choose $m = N+1$ and $n = N+2$ . Since these are consecutive integers, their parity differs, meaning $a_m$ and $a_n$ will have opposite signs ( $1$ and $-1$ ). Consequently, $|a_n - a_m| = 2$ . Because $2 \ge 1$ (our selected $\varepsilon$ ), the negation of the Cauchy criterion holds true. Therefore, $(a_n)$ fails to be a Cauchy sequence. By the completeness of real numbers, a non-Cauchy sequence implies divergence, proving the limit does not exist.

Knowledge cards

Negating the Cauchy condition

While the standard theorem states convergence iff Cauchy, the logical inverse allows us to test for divergence. We look for a 'barrier' distance $\varepsilon$ that prevents tail elements from clustering together indefinitely. If such an $\varepsilon$ exists alongside infinite pairs violating it, the sequence diverges.

\exists \varepsilon > 0, \forall N, \exists m,n > N : |a_n - a_m| \ge \varepsilon

Oscillatory Behavior

The sequence $(-1)^n$ represents pure oscillation without decay. Unlike convergent sequences where amplitude shrinks towards zero, here the gap remains maximal forever. Geometrically, the dots form two parallel lines separated by distance 2, making them impossible to fit inside an arbitrarily small interval eventually.

a_n = (-1)^n

Choosing Epsilon Strategically

Selecting $\varepsilon = 1$ is crucial because it sits below the maximum possible jump size of 2 but above 0. Any value less than 2 would technically work, but 1 provides a clear margin. Setting up this threshold simplifies the arithmetic verification later on.

\varepsilon = 1

Index Construction Technique

Instead of searching randomly, the proof relies on structural properties. Picking neighbors $N+1$ and $N+2$ exploits the alternating nature of powers of -1. One index must be odd and the other even, guaranteeing distinct function outputs regardless of where they appear on the number line.

|a_{N+2} - a_{N+1}| = 2 \ge 1

Logical Implication Chain

Failure of the Cauchy property directly maps to failure of convergence in complete metric spaces like $\mathbb{R}$ . Showing the sequence isn't Cauchy serves as sufficient evidence that no finite limit point attracts all sufficiently large terms simultaneously.

(a_n) \notin \text{Cauchy} \implies \lim a_n \neq L

Explore the knowledge in this video

Open video knowledge graph →

Limits ProofAt 0:54
Why this connection?
The reviewed neighboring-term card constructs indices $n=N+1$ and $m=N+2$ for every cutoff N. For $a_n=(-1)^n$ , their distance is always 2, so choosing $\varepsilon=1$ disproves the Cauchy condition and hence convergence. The argument excludes every possible real limit, rather than just one guessed value.

Using the Cauchy criterion to disprove a limit

The explanation, unpacked.

Chapters

Learning script

Knowledge cards

Negating the Cauchy condition

Oscillatory Behavior

Choosing Epsilon Strategically

Index Construction Technique

Logical Implication Chain

Explore the knowledge in this video

Connect the next step

In another language

A different approach