Real Analysis | Sequences and the ε-N definition of convergence.

1. Formula
   Observation

   Left board writes "a: N -> R".

2. Audio
   Observation

   Speaker says a sequence is a function whose domain is the natural numbers and often we think of it like a list.

a

A sequence viewed as a function from the natural numbers to the real numbers.

Domain is N; codomain is R.

1. Formula
   Observation

   Left board writes "write: $a_n = a(n)$, $a_1$, $a_2$, $a_3$, ...".

2. Audio
   Observation

   Speaker says we generally write a sub n instead of a of n, or we have this list of numbers a1, a2, a3, and so on.

$a_n$

The nth term of the sequence, equal to $a(n)$.

n is a natural number.

1. Formula
   Observation

   Board uses N in "a: N -> R" and in the convergence definition.

2. Audio
   Observation

   Speaker explicitly says the domain is the natural numbers and later notes that the natural numbers are a discrete set.

N

The set of natural numbers used as the domain of a sequence.

Index set for sequences.

1. Formula
   Observation

   Board writes "a: N -> R".

2. Audio
   Observation

   Speaker says the function goes from the natural numbers to the real numbers.

R

The real numbers, serving as the codomain of the sequence.

Codomain for sequence values.

1. Formula
   Observation

   Definition line says "converges to L" and inequality uses |$a_n - L$| < epsilon.

2. Diagram
   Observation

   Middle picture labels a horizontal center line as L.

3. Audio
   Observation

   Speaker says a sequence converges to a limit of L.

L

The proposed limit of the sequence.

A real number appearing in the convergence condition.

1. Formula
   Observation

   Board writes "for every epsilon > 0" and "|$a_n - L$| < epsilon".

2. Diagram
   Observation

   Middle picture labels upper and lower dashed lines as L + epsilon and L - epsilon.

3. Audio
   Observation

   Speaker describes epsilon as a very, very, very small number.

epsilon

A positive tolerance measuring how close sequence terms must be to the limit after some index.

epsilon > 0.

1. Formula
   Observation

   Board writes "there is N in N s.t." and "for n >= N".

2. Diagram
   Observation

   Middle picture marks an index N on the horizontal axis.

3. Audio
   Observation

   Speaker says there is a natural number capital N such that after some point in the sequence, all later terms lie within epsilon of L.

N

A threshold natural number beyond which all sequence terms satisfy the epsilon-closeness condition.

N is a natural number; later indices satisfy n >= N.

1. Formula
   Observation

   Board writes "$a_n$" and "for n >= N".

2. Diagram
   Observation

   Horizontal axis lists 1, 2, 3, 4, 5, 6, ..., N, $N+1$, ... .

3. Audio
   Observation

   Speaker refers to all n bigger than this capital N.

1. Audio says "bigger than" while the board writes "n >= N"; the displayed formula is the stronger visible evidence.

n

A natural-number index of a sequence term.

n in N, especially n >= N in the convergence condition.

1. Formula
   Observation

   Board writes |$a_n - L$| < epsilon.

2. Audio
   Observation

   Speaker says "a sub n minus L, its absolute value, is less than epsilon".

|$a_n - L$|

Absolute distance between the nth term and the limit L.

Defined for real-valued sequence terms and real limit L.

1. Formula
   Observation

   Lower-left box writes "write: lim_{n -> infinity} $a_n = L$".

2. Audio
   Observation

   Speaker says generally we write the limit as n goes to infinity of a sub n equals L.

lim_{n -> infinity} $a_n = L$

Standard notation asserting that the sequence ($a_n$) converges to L.

Used when the epsilon-N convergence condition holds.

1. Formula
   Observation

   The board repeatedly uses $a_n$ in the convergence definition and in the scratch-work inequality $|a_n-L|<\varepsilon$.

2. Audio
   Observation

   The lecturer refers to "the nth value in the sequence" when setting up $\left|\frac{1}{n^2}-0\right|<\varepsilon$.

$a_n$

The $n$th term of a sequence; in the example it is instantiated as $a_n=\frac{1}{n^2}$.

$n\in\mathbb{N}$, with values in $\mathbb{R}$

1. Formula
   Observation

   The left panel defines convergence to $L$ via $|a_n-L|<\varepsilon$ for all $n\ge N$.

2. Audio
   Observation

   The lecturer says "what it takes to show that a sequence converges to a value of L."

$L$

The proposed limit of the sequence.

$L\in\mathbb{R}$; in Example 1, $L=0$

1. Formula
   Observation

   Top-left board states "Def: A sequence is a function whose domain is N" and "i.e. a: N -> R".

2. Audio
   Observation

   Speaker says formally by a sequence I mean a function whose domain is the natural numbers.

The video defines a sequence as a function with domain the natural numbers and codomain the real numbers. This makes the sequence an indexed family of real values rather than merely an informal list.

1. Domain is $\mathbb{N}$.

2. Codomain shown on the board is $\mathbb{R}$.

1. a
2. N
3. R

1. Formula
   Observation

   Board writes "write: $a_n = a(n)$, $a_1$, $a_2$, $a_3$, ...".

2. Audio
   Observation

   Speaker says we generally write a sub n instead of a of n, or we have this list of numbers a1, a2, a3, and so on.

The same object can be written either as a function $a(n)$ or as the indexed list $a_1$, $a_2$, $a_3$, ... . The video explicitly ties these notations together through the subscript notation $a_n = a(n)$.

1. n ranges over natural numbers.

1. Formal definition of a sequence
2. $a_n$

1. Formula
   Observation

   Middle-left board writes "Def: We say a sequence {$a_n$}_{$n=1$}^$\infty$ converges to L if for every epsilon > 0 there is N in N s.t. |$a_n - L$| < epsilon for n >= N".

2. Audio
   Observation

   Speaker reads the definition aloud: for every epsilon bigger than zero, there is a natural number N such that the absolute value of a sub n minus L is less than epsilon for all n bigger than this capital N.

1. Audio says "bigger than" while the board shows "n >= N"; the displayed inequality is clearer.

A sequence converges to L when every positive tolerance epsilon can be met by choosing a threshold index N so that all later terms lie within epsilon of L. The quantifier order is essential: epsilon is arbitrary first, then N may depend on epsilon.

1. The sequence is real-valued.

2. epsilon is any positive real number.

3. N is a natural number depending on epsilon.

4. The inequality must hold for all indices n >= N.

1. Formal definition of a sequence
2. L
3. epsilon
4. N
5. n
6. |$a_n - L$|

1. Formula
   Observation

   Lower-left box writes "write: lim_{n -> infinity} $a_n = L$".

2. Audio
   Observation

   Speaker says generally we write this thing, which should be familiar from calculus, the limit as n goes to infinity of a sub n equals L.

Once the epsilon-N condition is satisfied, the video introduces the compact notation saying that the limit of the sequence is L.

1. Used when the sequence converges to L under the epsilon-N definition.

1. Epsilon-N definition of convergence
2. lim_{n -> infinity} $a_n = L$

1. Formula
   Observation

   Red box on the board says "A sequence that does not converge is said to diverge".

2. Audio
   Observation

   Speaker says furthermore we say that a sequence is divergent if it does not converge.

The video defines divergence negatively: a sequence diverges exactly when it does not satisfy the epsilon-N convergence condition to any limit.

1. Applies to the same class of real sequences discussed earlier.

1. Epsilon-N definition of convergence

1. Diagram
   Observation

   Middle panel titled "picture" shows horizontal axis labeled 1, 2, 3, 4, 5, 6, ..., N, $N+1$, ... and vertical levels L, L+epsilon, L-epsilon with orange dots scattered before N and confined between the dashed lines after N.

2. Audio
   Observation

   Speaker says let's look at a graphical representation of this L and epsilon and N stuff, and explains that the sequence can jump around until it hits N, but after that all values must be within the band distance epsilon from L.

The middle diagram translates the logical definition into a picture: the horizontal axis records indices, the vertical axis records term values, the center line is the candidate limit L, and the two dashed lines form the epsilon-band. Terms before N may behave irregularly; terms from N onward must stay inside the band.

1. The picture illustrates the condition |$a_n - L$| < epsilon for n >= N.

2. It does not assert monotonicity or any specific formula for $a_n$.

1. Epsilon-N definition of convergence
2. Diagram of terms entering an epsilon-band

1. Formula
   Observation

   Top-left board: "Def: A sequence is a function whose domain is $\mathbb{N}$" and "$\alpha:\mathbb{N}\to\mathbb{R}$".

2. Formula
   Observation

   Below that, the board writes "$a_n=\alpha(n)$" and lists "$a_1,a_2,a_3,\ldots$".

The board defines a sequence as a function whose domain is the natural numbers. It is written abstractly as $\alpha:\mathbb{N}\to\mathbb{R}$, and the $n$th term is denoted $a_n=\alpha(n)$. The displayed list $a_1,a_2,a_3,\ldots$ shows the sequence as an ordered collection of real values indexed by natural numbers.

1. Domain is $\mathbb{N}$.

2. Values are real numbers.

1. Formula
   Observation

   Left panel: "We say a sequence $\sum_{n=1}^{\infty} a_n$ converges to $L$ if for every $\varepsilon>0$ there is $N\in\mathbb{N}$ s.t. $|a_n-L|<\varepsilon$ for $n\ge N$."

2. Formula
   Observation

   Bottom-left notation box: "write: $\lim_{n\to\infty} a_n=L$".

1. The board uses summation-style notation $\sum_{n=1}^{\infty} a_n$ where sequence notation $(a_n)_{n=1}^{\infty}$ would be more standard; the surrounding definition clearly concerns convergence of the sequence terms $a_n$ rather than a series sum.

A sequence converges to $L$ exactly when, for every positive tolerance $\varepsilon$, one can find a natural-number cutoff $N$ so that every later term satisfies $|a_n-L|<\varepsilon$. The board also records the shorthand notation $\lim_{n\to\infty}a_n=L$ for this property.

1. $\varepsilon$ is arbitrary but fixed and positive.

2. $N$ may depend on $\varepsilon$.

3. The inequality must hold for every index $n\ge N$.

1. Sequence as a function on $\mathbb{N}$

1. Formula
   Observation

   Lower-left red box reads: "A sequence that does not converge is said to diverge."

The lecture explicitly contrasts convergence with divergence by stating that any sequence which does not converge is called divergent.

1. Applies to sequences under the preceding convergence definition.

1. Epsilon-N definition of sequence convergence

1. Audio
   Observation

   "you always start with some scratch work, and you start with this goal of the absolute value of a sub n minus l is less than epsilon"

2. Formula
   Observation

   Right panel yellow box: "Scratch work: Manipulate $|a_n-L|<\varepsilon$ until $n>$ some stuff w/ $\varepsilon$'s".

The lecturer presents scratch work as the exploratory phase before the formal proof. One begins from the desired inequality $|a_n-L|<\varepsilon$ and algebraically manipulates it until the index $n$ is isolated on one side, producing a condition of the form $n>$ some expression involving $\varepsilon$. That expression is then named $N$.

1. Used when trying to prove convergence by the epsilon-N definition.

2. The manipulation is preliminary work, not yet the formal proof.

1. Epsilon-N definition of sequence convergence

1. Audio
   Observation

   "then you launch into the formal proof, and the formal proof has this structure"

2. Formula
   Observation

   Right panel lower box: "Proof: Given $\varepsilon>0$, set $N=$ some stuff w/ $\varepsilon$'s. Observe that if $n\ge N$, then ... $|a_n-L|<\varepsilon$."

After scratch work identifies a candidate threshold, the formal proof is written in a fixed order: first take an arbitrary $\varepsilon>0$, then define $N$ using the expression found in scratch work, then assume $n\ge N$, and finally reverse the earlier algebraic steps to conclude $|a_n-L|<\varepsilon$.

1. $\varepsilon$ is arbitrary and positive.

2. $N$ must be chosen before assuming $n\ge N$.

3. The final chain of implications must end in the defining inequality.

1. Epsilon-N definition of sequence convergence
2. Scratch-work stage of an epsilon-N proof

1. Formula
   Observation

   Left board definition reads: We say a sequence converges to L if for every $ε>0$ there is N∈ℕ s.t. |$a_n-L$|<ε for $n\ge N$.

2. Audio
   Observation

   The instructor applies this pattern with $L=0$ and $a_n=1/n^2$ in the proof.

A sequence converges to a limit L when, for every positive tolerance ε, one can find a natural-number threshold N such that every later term of the sequence lies within distance ε of L.

1. ε is any positive real number

2. N must be a natural number

3. the inequality must hold for all $n\ge N$

1. Audio
   Observation

   Speaker says these notions are only the same because the natural numbers are a discrete set.

1. The statement is verbal only; no formal proof or counterexample is given in the clip.

The function notation $a(n)$ and the list notation $a_1$, $a_2$, $a_3$, ... describe the same object because the indexing set $\mathbb{N}$ is discrete.

1. A sequence is being viewed either as a function $\mathbb{N} \to \mathbb{R}$ or as an ordered list of real numbers.

No additional quantifiers are stated beyond the implicit comparison of the two notations.

1. Audio
   Observation

   "then you perform all of these steps in reverse that you used to manipulate this inequality into this inequality until you're left with a sub n minus l is less than epsilon"

2. Formula
   Observation

   The proof template ends with $|a_n-L|<\varepsilon$ after the line "Observe that if $n\ge N$, then ...".

In the outlined method, once scratch work has transformed $|a_n-L|<\varepsilon$ into a condition isolating $n$, the formal proof proceeds by reversing those same algebraic steps, starting from $n\ge N$ and ending again at $|a_n-L|<\varepsilon$.

1. The scratch work consists of reversible algebraic manipulations.

2. $N$ is chosen from the expression obtained in scratch work.

3. The proof assumes $n\ge N$.

For an arbitrary $\varepsilon>0$ and the corresponding chosen $N$, for all $n\ge N$.

1. Formula
   Observation

   Middle panel heading: "Example 1: $\lim_{n\to\infty}\frac{1}{n^2}=0$".

2. Audio
   Observation

   "So from calculus, you probably have a good feeling that that should be equal to zero, so we're actually going to show that that limit is equal to zero."

1. Within this 120-second excerpt, the lecturer states the target result and begins the scratch work, but the full formal proof is not completed on screen.

The example aims to prove $\displaystyle \lim_{n\to\infty}\frac{1}{n^2}=0$ using the epsilon-N definition of convergence.

1. The sequence is $a_n=\frac{1}{n^2}$.

2. The proposed limit is $L=0$.

For every $\varepsilon>0$, there should exist $N\in\mathbb{N}$ such that for all $n\ge N$, $\left|\frac{1}{n^2}-0\right|<\varepsilon$.

1. Audio
   Observation

   The instructor says this is possible by the Archimedean principle and explains that for every real number there is a natural number bigger than that real number.

2. Formula
   Observation

   Proof line uses N∈ℕ s.t. N>√($1/ε$).

For every real number x there exists a natural number N such that $N>x$; here x=√($1/ε$), so such an N exists.

1. $ε>0$

2. therefore $1/ε$ is a positive real number

3. therefore √($1/ε$) is a positive real number

∀x∈ℝ ∃N∈ℕ ($N>x$)

1. Formula
   Observation

   Board heading states Example 1: $\lim _{n\to \infty } 1/n^2 = 0$ and the proof ends with the same statement.

2. Audio
   Observation

   The instructor concludes that the limit as n goes to infinity of 1 over n squared equals zero.

The sequence with nth term $1/n^2$ converges to 0.

1. n ranges over natural numbers

2. convergence is meant in the ε-N sense

$\lim_{n\to\infty}\frac{1}{n^2}=0$

1. Formula
   Observation

   The middle header states `Example 2: $\lim_{n \to \infty} (1 - \frac{1}{n}) = 1$`.

2. Audio
   Observation

   The speaker says they will "show that that limit is equal to 1."

3. Formula
   Observation

   The proof column ends with `$\lim_{n \to \infty} 1 - \frac{1}{n} = 1$`.

$\lim_{n \to \infty} \left(1 - \frac{1}{n}\right) = 1$.

1. The sequence is defined by $a_n = 1 - 1/n$ for $n \in \mathbb{N}$.

2. The proposed limit is $L = 1$.

Universal quantification over epsilon > 0 and existential quantification over $N \in \mathbb{N}$ are handled through the epsilon-N proof.

1. Audio
   Observation

   After choosing `$N > 1/\varepsilon$`, the speaker says, "that's possible by the Archimedean principle."

1. The board does not write a separate formal statement of the Archimedean principle in this clip; only the spoken justification is present.

For every $\varepsilon > 0$, there exists $N \in \mathbb{N}$ such that $N > 1/\varepsilon$.

1. $\varepsilon > 0$.

$\forall \varepsilon > 0$, $\exists N \in \mathbb{N}$.

1. Audio
   Observation

   Speaker says what this tells you is that for any epsilon, which you can think of as a very, very, very small number, after some point in the sequence, capital N, the sequence values are always within this very, very small number of this limit L.

2. Formula
   Observation

   The displayed definition contains |$a_n - L$| < epsilon for n >= N.

1. Expression

   $$\forall \epsilon > 0, \exists N \in \mathbb{N} \text{ such that } |a_n - L| < \epsilon \text{ for } n \ge N$$
   Explanation

   Start from the displayed epsilon-N definition of convergence.

   Justification

   Directly read from the board definition.

   Shown in the video
2. Expression

   $$|a_n - L| < \epsilon$$
   Explanation

   The inequality says the distance from $a_n$ to L is less than epsilon.

   Justification

   Meaning of absolute value as distance on the real line.

   Derived from the video
3. Expression

   $$a_n \in (L-\epsilon, L+\epsilon) \text{ for all } n \ge N$$
   Explanation

   Therefore every sufficiently late term lies inside the open interval centered at L with radius epsilon.

   Justification

   Equivalent rewriting of the absolute-value inequality.

   Derived from the video

The verbal explanation matches the formal definition: convergence means eventual membership in every epsilon-neighborhood of L.

1. Formula
   Observation

   Right panel upper box: "Scratch work: Manipulate $|a_n-L|<\varepsilon$ until $n>$ some stuff w/ $\varepsilon$'s".

2. Formula
   Observation

   Right panel lower box: "Proof: Given $\varepsilon>0$, set $N=$ some stuff w/ $\varepsilon$'s. Observe that if $n\ge N$, then ... $|a_n-L|<\varepsilon$."

3. Audio
   Observation

   The lecturer explains starting from the goal inequality, isolating $n$, naming the resulting expression $N$, and then writing the formal proof by reversing the scratch-work steps.

1. Expression

   $$|a_n-L|<\varepsilon$$
   Explanation

   Begin with the defining inequality that one wants to force to hold.

   Justification

   This is the target condition in the epsilon-N definition of convergence.

   Shown in the video
2. Expression

   $$n>\text{some expression involving }\varepsilon$$
   Explanation

   Manipulate the inequality algebraically until the index $n$ is isolated on one side.

   Justification

   This is the scratch-work stage described on the board and in the audio.

   Shown in the video
3. Expression

   $$N:=\text{that expression}$$
   Explanation

   Name the isolated expression as the candidate threshold $N$.

   Justification

   The lecturer says the expression found in scratch work is what one calls capital $N$.

   Shown in the video
4. Expression

   $$\text{Given }\varepsilon>0,\ \text{set }N=\cdots$$
   Explanation

   Start the formal proof by fixing an arbitrary positive $\varepsilon$ and defining $N$ from the scratch-work result.

   Justification

   This matches the lower-right proof template.

   Shown in the video
5. Expression

   $$\text{If }n\ge N,\ \text{then }\cdots$$
   Explanation

   Assume an index beyond the threshold and retrace the algebra in reverse.

   Justification

   The lecturer explicitly says to perform the scratch-work steps in reverse.

   Shown in the video
6. Expression

   $$|a_n-L|<\varepsilon$$
   Explanation

   Conclude the defining inequality, thereby verifying convergence to $L$.

   Justification

   This is exactly the condition required by the definition.

   Shown in the video

The general method is: derive a candidate $N$ from scratch work, then prove the result formally by assuming $n\ge N$ and reversing the algebra to obtain $|a_n-L|<\varepsilon$.

1. Formula
   Observation

   Middle panel scratch work shows $\left|\frac{1}{n^2}-0\right|<\varepsilon$.

2. Formula
   Observation

   Subsequent lines show $\left|\frac{1}{n^2}\right|<\varepsilon$ and then $\frac{1}{n^2}<\varepsilon$.

3. Audio
   Observation

   "this simplifies down to one over n squared in absolute values, which is less than epsilon. n squared is always positive, so that means I can get rid of the absolute values."

1. The excerpt stops before the lecturer solves for $n$ explicitly or writes the final choice of $N$.

1. Expression

   $$\left|\frac{1}{n^2}-0\right|<\varepsilon$$
   Explanation

   Instantiate the general target inequality with $a_n=\frac{1}{n^2}$ and $L=0$.

   Justification

   This directly applies the epsilon-N definition to Example 1.

   Shown in the video
2. Expression

   $$\left|\frac{1}{n^2}\right|<\varepsilon$$
   Explanation

   Simplify subtraction by zero inside the absolute value.

   Justification

   Arithmetic simplification shown on the board.

   Shown in the video
3. Expression

   $$\frac{1}{n^2}<\varepsilon$$
   Explanation

   Remove the absolute value because the quantity is positive.

   Justification

   The lecturer states that $n^2$ is always positive, hence $\frac{1}{n^2}>0$.

   Shown in the video

Within this clip, the scratch work has reduced the convergence requirement to $\frac{1}{n^2}<\varepsilon$; the next algebraic isolation of $n$ is not yet shown.

1. Formula
   Observation

   Visible chain on middle board: |$1/n^2-0$|<ε, $1/n^2<ε$, $n^2>1/ε$, n>√($1/ε$).

2. Audio
   Observation

   Instructor explicitly narrates reciprocation and square-root extraction.

1. Expression

   $$\left|\frac{1}{n^2}-0\right|<\varepsilon$$
   Explanation

   Start from the convergence requirement with $L=0$ and $a_n=1/n^2$.

   Justification

   Definition of convergence used in the left-board statement.

   Shown in the video
2. Expression

   $$\frac{1}{n^2}<\varepsilon$$
   Explanation

   Since $1/n^2$ is positive, the absolute value can be removed.

   Justification

   Positivity of $1/n^2$ for natural n.

   Shown in the video
3. Expression

   $$n^2>\frac{1}{\varepsilon}$$
   Explanation

   Reciprocate both sides, which reverses the inequality direction.

   Justification

   Algebraic rule for reciprocals of positive quantities.

   Shown in the video
4. Expression

   $$n>\sqrt{\frac{1}{\varepsilon}}$$
   Explanation

   Take square roots of both sides to isolate n.

   Justification

   Square-root function preserves order on positive reals.

   Shown in the video