Calculus / Chinese

Why the cutoff N in a limit proof is not unique

Charles队长 · Bilibili · 1:13

Bilibili · Charles队长Original video

IN THIS VIDEO

01Non-uniqueness of N in Limit Definition
02Basic Solution Method
03Scaling Method (Denominator Reduction)

FROM THE LEARNING NOTES

\lim_{n\to\infty} a_n = A \iff \forall \varepsilon > 0, \exists N \in \mathbb{N}^+, \text{s.t. } \forall n > N, |a_n - A| < \varepsilon

Non-uniqueness of N in Limit Definition

SELECTED MOMENT

Method 1: Basic Algebraic Derivation

SUGGESTED PREPARATION

Definition of sequence limit
Inequality properties and scaling techniques

READ & KEEP

The explanation, unpacked.

Reviewed learning material · Video analysis · English

Read the full overview

This video visually demonstrates the epsilon-N definition of sequence limits using Geometer's Sketchpad. It shows that for the same limit problem, different inequality scaling techniques yield different valid values for N.

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

Chapters

0:00Introduction and Visualization 0:17Method 1: Basic Algebraic Derivation 0:32Method 2: Scaling Technique A 0:48Method 3: Scaling Technique B 1:04Conclusion

Learning script

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

A limit proof needs an effective cutoff, not a unique answer. Once all later terms are within ε of the limit, the requirement is met. The animation compares three ways of obtaining such a cutoff for the same sequence.

For n>√3 the error is 9/(n²−3). Solving the error inequality directly gives n>√( $9/ε+3$ ). Choose an integer cutoff guaranteeing this condition.

For $n\ge 3$ , n²− $3\ge n$ ²/2, so the error is bounded by $18/n$ ². Requiring n>√( $18/ε$ ), together with the stated range restriction, gives another valid cutoff.

For $n\ge 3$ , the sharper bound n²− $3\ge 2n$ ²/3 gives error at most $13.5/n$ ². Different bounds can therefore yield different integer cutoffs.

Different valid values of N do not conflict. Each must guarantee the error condition for every $n>N$ , and any larger cutoff works too. Existence and control of all later terms matter, rather than uniqueness or minimality.

Knowledge cards

Non-uniqueness of N in Limit Definition

When proving sequence limits, the integer N satisfying the condition for a given $\varepsilon > 0$ is not unique. Any N large enough works. The video derives three distinct values (7, 10, 9) for the same example.

\lim_{n\to\infty} a_n = A \iff \forall \varepsilon > 0, \exists N \in \mathbb{N}^+, \text{s.t. } \forall n > N, |a_n - A| < \varepsilon

Basic Solution Method

Directly solving the absolute value inequality algebraically to find the range of n. This is rigorous but can be computationally intensive compared to estimation methods. Use this equivalence only for n>√3.

|f(n) - 3| = \left| \frac{9}{n^2 - 3} \right| < \varepsilon \Rightarrow n > \sqrt{\frac{9}{\varepsilon} + 3}

Scaling Method (Denominator Reduction)

Simplifies calculation by reducing the denominator to increase the fraction's value (e.g., replacing $n^2 - 3$ with $n^2/2$ ). This typically yields a larger, simpler N. This bound holds for $n\ge 3$ ; the cutoff must also satisfy that restriction.

n^2 - 3 \geqslant \frac{n^2}{2} \Rightarrow |f(n) - 3| \leqslant \frac{18}{n^2} < \varepsilon \Rightarrow n > \sqrt{\frac{18}{\varepsilon}}

Alternative Scaling Strategy

A compromise scaling approach where $n^2 - 3$ is bounded below by $2n^2/3$ . This results in a coefficient of 13.5, further illustrating the flexibility in finding N. This bound holds for $n\ge 3$ ; the cutoff must also satisfy that restriction.

n^2 - 3 \geqslant \frac{2n^2}{3} \Rightarrow |f(n) - 3| \leqslant \frac{13.5}{n^2} < \varepsilon \Rightarrow n > \sqrt{\frac{13.5}{\varepsilon}}

Explore the knowledge in this video

Open video knowledge graph →

Limits ExplanationAt 0:00
Why this connection?
The same sequence-limit example admits cutoffs $N=7$ ,10,9. The epsilon-N definition requires a sufficiently large cutoff rather than a unique smallest one. The supporting estimates retain their domains: direct equivalence for n>√3 and the displayed denominator bounds for $n\ge 3$ .

Questions this video answers

Meet the concept

Find a method

Understand why

Understand why

Find a method

Meet the concept

Why the cutoff N in a limit proof is not unique

The explanation, unpacked.

Chapters

Learning script

Knowledge cards

Non-uniqueness of N in Limit Definition

Basic Solution Method

Scaling Method (Denominator Reduction)

Alternative Scaling Strategy

Explore the knowledge in this video

Questions this video answers

What is the significance of the phrase 'existence and control of all later terms' in limit proofs?+

How does the scaling technique n2−3≥n2/2n^2-3 \ge n^2/2n2−3≥n2/2 simplify the error bound for n≥3n \ge 3n≥3?+

Why is the condition n≥3n \ge 3n≥3 required for the scaling bounds n2/2n^2/2n2/2 and 2n2/32n^2/32n2/3?+

Why does the epsilon-N definition of a sequence limit allow different valid values for N?+

How do you solve for N directly from the error inequality 9n2−3<ε\frac{9}{n^2-3} < \varepsilonn2−39​<ε?+

What is the error bound derived from the scaling n2−3≥2n2/3n^2-3 \ge 2n^2/3n2−3≥2n2/3 for n≥3n \ge 3n≥3?+

Connect the next step

In another language

A different approach