Skip to content
Back to exploration
Mathematical modeling / English

The Bolzano Weierstrass Theorem

Mike, the Mathematician · YouTube · 7:43

Open original
READ & KEEP

The explanation, unpacked.

Saves 0

Reviewed learning material · Video analysis · English
Read the full overview

This video segment introduces the Bolzano-Weierstrass theorem, which states that any bounded sequence of real numbers contains a convergent subsequence. The instructor sets up the proof by defining a bounded sequence and illustrating its bounds on the real line. He clarifies a common misconception that boundedness implies convergence, noting that a sequence can oscillate within its bounds. The proof strategy begins by constructing a nested collection of closed intervals, starting with splitting the initial bounding interval into two halves at its midpoint. This 150-second whiteboard excerpt presents the beginning of a proof of the Bolzano-Weierstrass theorem. Starting from a bounded real sequence {ana_n} contained in [c0c_0,d0d_0], the instructor bisects the interval at c1=(c0+d0)/2c_1=(c_0+d_0)/2, labels the two halves I1,1I_{1,1} and I1,2I_{1,2}, and argues that at least one half contains infinitely many sequence terms. That chosen half is renamed I~1\widetilde{I}_1. He then sets up the inductive nested family I~1\widetilde{I}_1 ⊇ I~2\widetilde{I}_2 ⊇ ... ⊇ I~k\widetilde{I}_k and records the key length formula |I~k\widetilde{I}_k|=(d0−c0d_0-c_0)/2^k. This 150-second whiteboard segment completes the nested-interval proof of the Bolzano-Weierstrass theorem. Starting from a bounded real sequence {ana_n} with c0≤an≤d0c_0 \le a_n \le d_0, the instructor extends an already begun induction by splitting Ĩ_k in half to obtain Ĩ_{k+1k+1} that still contains infinitely many sequence terms. He records the length formula |Ĩ_k|=(d0−c0d_0-c_0)/2^k, invokes the nested interval property to get a point a in ⋂_{n=1n=1}^∞\infty Ĩ_n, then selects anka_{n_k}∈Ĩ_k. Finally he bounds |ank−aa_{n_k}-a| by the interval length and concludes ank→aa_{n_k}\to a, thereby constructing a convergent subsequence. This 13-second video clip presents the conclusion of a whiteboard lecture proving the Bolzano-Weierstrass theorem. The instructor verbally confirms the completion of the proof while the camera holds on a fully written blackboard. The board details the step-by-step construction of a convergent subsequence from a bounded sequence of real numbers. Key elements visible include the initial bounding interval, the recursive bisection method to create nested intervals each containing infinitely many sequence terms, the application of the Nested Interval Property to identify a limit point, and the final use of the Comparison Test to prove the subsequence's convergence.

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

Chapters

0:00Introduction and Theorem Statement0:47Proof Setup: Bounded Sequences and Oscillation1:48Proof Strategy: Method of Nested Intervals2:30Theorem statement and bounded setup2:40Bisecting [c0c_0,d0d_0] at the midpoint3:18Choosing a half-interval with infinitely many terms4:06Nested intervals and length formula5:00Setup: bounded sequence and existing nested intervals5:20Inductive halving to construct Ĩ_{k+1k+1}6:00Nested interval property and the common point a6:37Choosing anka_{n_k} and proving convergence7:30Conclusion of the Bolzano-Weierstrass Proof

Learning script

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

The video begins with a title card displaying "The Bolzano-Weierstrass Theorem" and the presenter's name. The presenter then appears and states the goal of the video: to prove the Bolzano-Weierstrass theorem.

The presenter writes the theorem statement on the board: "Any bounded sequence of real numbers contains a convergent subsequence." He reads this statement aloud, establishing the core mathematical claim to be proven.

To begin the proof, the presenter defines a sequence {an}n=1∞\{a_n\}_{n=1}^{\infty} and assumes it is a bounded sequence of real numbers. He draws a horizontal line to represent the real number line R\mathbb{R}.

On the real line, he marks two points, c0c_0 and d0d_0, and draws a bracketed interval between them. He explains that because the sequence is bounded, all its terms reside within this closed interval [c0,d0][c_0, d_0].

The presenter addresses a potential misconception: a bounded sequence does not necessarily converge. He illustrates this by explaining that the sequence could oscillate back and forth between c0c_0 and d0d_0 without settling on a single limit, which would still satisfy the condition of being bounded.

He clarifies the objective: to extract a convergent *subsequence* from this bounded sequence. To achieve this, he introduces the strategy of building a nested collection of closed intervals.

The presenter formalizes the concept of boundedness by writing the inequality c0≤an≤d0c_0 \le a_n \le d_0 for all nn on the board. This mathematically defines the interval [c0,d0][c_0, d_0] that contains every term of the sequence.

He initiates the nested intervals method by cutting the initial interval [c0,d0][c_0, d_0] into two parts at its midpoint. He writes the union of the two resulting closed sub-intervals: [c0,c0+d02]∪[c0+d02,d0]\left[c_0, \frac{c_0+d_0}{2}\right] \cup \left[\frac{c_0+d_0}{2}, d_0\right]. The video ends as he is about to explain the next step in selecting one of these sub-intervals.

The clip begins with the theorem already written at the top: "Bolzano-Weierstrass: Any bounded sequence of real numbers contains a convergent subsequence." Below it, the proof setup states that {ana_n}_{n=1n=1}^∞\infty is a bounded sequence and that c0≤an≤d0c_0 \le a_n \le d_0 for all n. A number line shows the interval [c0c_0,d0d_0] and its midpoint.

The instructor now performs the first bisection. He names the midpoint c1c_1, where c1=(c0+d0)/2c_1=(c_0+d_0)/2, and rewrites the original interval as [c0c_0,c1c_1] ∪ [c1c_1,d0d_0]. He then labels these two closed halves as I1,1I_{1,1} and I1,2I_{1,2}, so the board displays I1,1I_{1,1} ∪ I1,2I_{1,2}.

Next comes the key selection step. He writes that one of these intervals contains infinitely many of the ana_n terms. The justification is verbal and elementary: if both halves contained only finitely many terms, then their union would contain only finitely many terms, contradicting the fact that the sequence itself is infinite. Therefore at least one half must contain infinitely many sequence elements.

That chosen half is given a special name: I~1\widetilde{I}_1. The instructor explicitly says I~1\widetilde{I}_1 is either I1,1I_{1,1} or I1,2I_{1,2}, and it is the one that still contains infinitely many terms of the sequence. This notation records the result of the first inductive choice.

He then moves to the general pattern. In green, he writes the nested chain I~1\widetilde{I}_1 ⊇ I~2\widetilde{I}_2 ⊇ I~3\widetilde{I}_3 ⊇ ... ⊇ I~k\widetilde{I}_k, explaining that this is the collection being constructed by induction. Each new interval is obtained by repeating the same bisection-and-selection procedure inside the previous one.

Finally, he records the size of the kth interval. Because each step halves the length, the board shows |I~k\widetilde{I}_k|=(d0−c0d_0-c_0)/2^k. This formula is the quantitative part of the construction: the nested intervals shrink geometrically, which is what will later force the subsequence to converge.

The board states the theorem: any bounded sequence of real numbers contains a convergent subsequence. Here the sequence is written as {ana_n}_{n=1n=1}^∞\infty and is bounded by c0≤an≤d0c_0 \le a_n \le d_0 for all n.

The proof is already in inductive form. Assuming intervals Ĩ_1 ⊇ Ĩ_2 ⊇ ... ⊇ Ĩ_k have been built, each with infinitely many sequence terms, the instructor splits Ĩ_k into two halves and chooses a half that still contains infinitely many ana_n; that chosen half is called Ĩ_{k+1k+1}.

Because each step is a bisection, the interval length obeys |Ĩ_k| = (d0−c0d_0 - c_0)/2^k. This formula is the quantitative reason the construction forces the intervals to shrink to zero size.

Having produced a nested sequence of closed intervals, the instructor invokes the nested interval property. It guarantees a point a that lies in every interval, written on the board as a ∈ ⋂_{n=1n=1}^∞\infty Ĩ_n.

Next, for each k, choose a term anka_{n_k} from the original sequence that lies in Ĩ_k. This is possible because each Ĩ_k was constructed to contain infinitely many terms of {ana_n}.

Since both anka_{n_k} and a belong to Ĩ_k, their distance is at most the length of that interval: |ank−aa_{n_k} - a| ≤ |Ĩ_k| = (d0−c0d_0 - c_0)/2^k.

As k grows, (d0−c0d_0 - c_0)/2^k tends to 0. Therefore the comparison argument gives ank→aa_{n_k} \to a, so the original bounded sequence indeed has a convergent subsequence.

The video opens on a static shot of a blackboard filled with the complete proof of the Bolzano-Weierstrass theorem. The instructor's voiceover concludes the session, stating, "And that's the proof of Bolzano-Weierstrass. Thank you very much." The board systematically lays out the argument: starting with a bounded sequence {an}n=1∞\{a_n\}_{n=1}^{\infty} constrained within [c0,d0][c_0, d_0], it demonstrates how repeatedly bisecting the interval guarantees finding a nested sequence of closed intervals I~k\widetilde{I}_k, each holding infinitely many terms. By invoking the Nested Interval Property, a unique limit point aa is identified in their intersection. Finally, selecting terms aqka_{q_k} from each interval and applying the Comparison Test to the bound ∣aqk−a∣≤d0−c02k|a_{q_k} - a| \le \frac{d_0 - c_0}{2^k} rigorously proves that the subsequence converges to aa.

Knowledge cards

01

Bolzano-Weierstrass Theorem

This fundamental theorem in real analysis states that every bounded sequence of real numbers has a convergent subsequence. It guarantees the existence of a limit point for the sequence's values, even if the sequence itself does not converge.

Any bounded sequence of real numbers contains a convergent subsequence.\text{Any bounded sequence of real numbers contains a convergent subsequence.}
02

Definition of a Bounded Sequence

A sequence of real numbers {an}\{a_n\} is bounded if there exist real numbers c0c_0 and d0d_0 such that every term of the sequence is trapped between them. This means the sequence's values do not grow infinitely large in either the positive or negative direction.

c0≤an≤d0 for all nc_0 \le a_n \le d_0 \text{ for all } n
03

Misconception: Boundedness vs. Convergence

It is a common error to assume that a bounded sequence must converge. However, a sequence can be bounded yet fail to converge by oscillating indefinitely between different values within its bounding interval. The Bolzano-Weierstrass theorem resolves this by guaranteeing a convergent *subsequence*, not necessarily convergence of the original sequence.

04

Method of Nested Intervals

This is a proof technique used to establish the Bolzano-Weierstrass theorem. It involves starting with a closed interval containing all terms of a bounded sequence and repeatedly dividing it in half. By carefully selecting one of the halves at each step, one constructs a sequence of nested, shrinking intervals whose intersection contains the limit of a convergent subsequence.

[c0,c0+d02]∪[c0+d02,d0]\left[c_0, \frac{c_0+d_0}{2}\right] \cup \left[\frac{c_0+d_0}{2}, d_0\right]
05

Bolzano-Weierstrass theorem statement

The segment opens with the theorem written on the board: every bounded sequence of real numbers contains a convergent subsequence. The proof setup immediately specializes to a bounded sequence {ana_n} with all terms lying between c0c_0 and d0d_0.

Any bounded sequence of real numbers contains a convergent subsequence.\text{Any bounded sequence of real numbers contains a convergent subsequence.}
06

Initial enclosing interval [c0c_0,d0d_0]

Boundedness gives real numbers c0c_0 and d0d_0 such that c0≤an≤d0c_0 \le a_n \le d_0 for every n. This interval is the starting region for the nested-interval proof.

c0≤an≤d0for all nc_0 \le a_n \le d_0 \quad \text{for all } n
07

First bisection at the midpoint

The midpoint of [c0c_0,d0d_0] is named c1c_1, and the interval is split into two closed halves: [c0c_0,c1c_1] and [c1c_1,d0d_0]. These are then denoted I1,1I_{1,1} and I1,2I_{1,2}.

c1=c0+d02,[c0,d0]=[c0,c1]∪[c1,d0]=I1,1∪I1,2c_1=\frac{c_0+d_0}{2},\quad [c_0,d_0]=[c_0,c_1]\cup[c_1,d_0]=I_{1,1}\cup I_{1,2}
08

One half must contain infinitely many terms

Since the whole sequence is infinite and the two halves cover the original interval, at least one half must contain infinitely many terms. If both halves were finite, their union would be finite, contradicting the infinitude of the sequence.

09

Definition of I~1\widetilde{I}_1

The chosen half-interval that contains infinitely many sequence terms is renamed I~1\widetilde{I}_1. It is either I1,1I_{1,1} or I1,2I_{1,2}.

I~1∈{I1,1,I1,2}\widetilde{I}_1\in\{I_{1,1},I_{1,2}\}
10

Nested interval construction

Repeating the same bisection-and-selection process produces a nested family of closed intervals. The board displays the finite stage I~1\widetilde{I}_1 ⊇ I~2\widetilde{I}_2 ⊇ I~3\widetilde{I}_3 ⊇ ... ⊇ I~k\widetilde{I}_k as the inductive pattern.

I~1⊇I~2⊇I~3⊇⋯⊇I~k\widetilde{I}_1 \supseteq \widetilde{I}_2 \supseteq \widetilde{I}_3 \supseteq \cdots \supseteq \widetilde{I}_k
11

Length of the kth chosen interval

Each step halves the interval length, so the kth chosen interval has length (d0−c0d_0-c_0)/2^k. This shrinking property is the core quantitative estimate in the proof.

∣I~k∣=d0−c02k|\widetilde{I}_k|=\frac{d_0-c_0}{2^k}
12

Bolzano-Weierstrass theorem statement

The clip begins from the theorem written on the board: every bounded sequence of real numbers contains a convergent subsequence. The specific sequence under consideration is {ana_n}_{n=1n=1}^∞\infty with c0≤an≤d0c_0 \le a_n \le d_0 for all n.

Any bounded sequence of real numbers contains a convergent subsequence.\text{Any bounded sequence of real numbers contains a convergent subsequence.}
13

Inductive nested-interval construction

Assuming Ĩ_1 ⊇ Ĩ_2 ⊇ ... ⊇ Ĩ_k have already been chosen so that each contains infinitely many terms of the sequence, the instructor splits Ĩ_k in half and selects a half that still contains infinitely many ana_n. That selected half is named Ĩ_{k+1k+1}. This is the inductive step that lets the construction continue for all k.

Split I~k in half s.t. infinitely many an are in I~k+1.\text{Split } \widetilde{I}_k \text{ in half s.t. infinitely many } a_n \text{ are in } \widetilde{I}_{k+1}.
14

Length of the nested intervals

Repeated halving gives an explicit formula for the interval length. If the original bounding interval has length d0−c0d_0 - c_0, then the kth nested interval has length (d0−c0d_0 - c_0)/2^k. This formula is used later to force the distance between chosen subsequence terms and the intersection point to go to zero.

∣I~k∣=d0−c02k|\widetilde{I}_k| = \frac{d_0 - c_0}{2^k}
15

Nested interval property

Once a nested sequence of closed intervals has been constructed, the proof invokes the nested interval property to obtain a common point a lying in all of them. On the board this is written as a ∈ ⋂_{n=1n=1}^∞n\infty _n.

∃a∈⋂n=1∞I~n\exists a \in \bigcap_{n=1}^{\infty} \widetilde{I}_n
16

Constructing the convergent subsequence

For each k, choose a term anka_{n_k} of the original sequence that lies in Ĩ_k. Because both anka_{n_k} and the common point a lie in Ĩ_k, one gets |ank−aa_{n_k}-a| ≤ (d0−c0d_0-c_0)/2^k. Since the right-hand side tends to 0, the comparison argument yields ank→aa_{n_k} \to a, completing the proof.

∣ank−a∣≤d0−c02k→0⇒ank→a|a_{n_k} - a| \leq \frac{d_0 - c_0}{2^k} \to 0 \quad \Rightarrow \quad a_{n_k} \to a
17

Bolzano-Weierstrass Theorem

States that any bounded sequence of real numbers must contain at least one convergent subsequence. This is a fundamental result in real analysis connecting boundedness with compactness in Euclidean spaces.

18

Proof Strategy: Interval Bisection

The proof begins by taking the initial bounding interval [c0,d0][c_0, d_0] and splitting it in half. Since the original sequence has infinitely many terms, at least one of the two halves must also contain infinitely many terms. This process is repeated recursively to generate a nested sequence of closed intervals I~1⊇I~2⊇…\widetilde{I}_1 \supseteq \widetilde{I}_2 \supseteq \dots, where the length of the kk-th interval is d0−c02k\frac{d_0 - c_0}{2^k}.

∣I~k∣=d0−c02k|\widetilde{I}_k| = \frac{d_0 - c_0}{2^k}
19

Role of the Nested Interval Property

Because we have constructed a nested sequence of non-empty closed intervals whose lengths approach zero, the Nested Interval Property of the real numbers guarantees that their infinite intersection contains exactly one point, denoted as aa. This point serves as the candidate limit for the subsequence.

a∈⋂n=1∞I~na \in \bigcap_{n=1}^{\infty} \widetilde{I}_n
20

Establishing Convergence via Comparison

To prove the subsequence converges to aa, a term aqka_{q_k} is picked from each interval I~k\widetilde{I}_k. Since both aqka_{q_k} and aa reside in I~k\widetilde{I}_k, their distance is bounded by the interval's length: ∣aqk−a∣≤d0−c02k|a_{q_k} - a| \le \frac{d_0 - c_0}{2^k}. As k→∞k \to \infty, the upper bound goes to 0, so by the Comparison Test, aqk→aa_{q_k} \to a.

∣aqk−a∣≤d0−c02k  ⟹  aqk→a|a_{q_k} - a| \le \frac{d_0 - c_0}{2^k} \implies a_{q_k} \to a

Detailed learning notes

Explore conditions, steps and evidence. Supplementary explanations are labeled separately from content shown in the video.

Symbols · 22

\{ana_n\}_{n=1n=1}^{∞\infty}

Clear evidence
Shown in the video
Evidence
  1. Audio
    Observation

    The speaker says, "So let's let our sequence a sub n, n goes from one to infinity, be such a bounded sequence."

  2. Formula
    Observation

    He writes the sequence notation on the board.

Symbol

\{ana_n\}_{n=1n=1}^{∞\infty}

Meaning

A sequence of real numbers indexed by natural numbers starting at 1.

Domain

n∈Nn \in \mathbb{N}, n≥1n \ge 1

c0c_0, d0d_0

Clear evidence
Shown in the video
Evidence
  1. Audio
    Observation

    The speaker says, "let's call this point over here c zero, d zero, some closed c zero, d zero, where all of the sequence resides."

  2. Diagram
    Observation

    He draws a horizontal line representing the real line and marks two points labeled c0c_0 and d0d_0 with a bracketed interval between them.

Symbol

c0c_0, d0d_0

Meaning

Real numbers defining the endpoints of a closed interval that contains all terms of the bounded sequence.

Domain

c0c_0, d0∈Rd_0 \in \mathbb{R}

c0≤an≤d0 for all nc_0 \le a_n \le d_0 \text{ for all } n

Clear evidence
Shown in the video
Evidence
  1. Audio
    Observation

    The speaker says, "since the sequence is bounded, we have c zero less than or equal to a sub n less than or equal to d zero for all n."

  2. Formula
    Observation

    He writes the inequality on the board.

Symbol

c0≤an≤d0 for all nc_0 \le a_n \le d_0 \text{ for all } n

Meaning

The mathematical definition of the sequence being bounded within the interval [c0c_0, d0d_0].

Domain

n∈Nn \in \mathbb{N}, n≥1n \ge 1

{ana_n}_{n=1n=1}^∞\infty

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    Top board text reads "Let {ana_n}_{n=1n=1}^∞\infty be such a bounded sequence."

Symbol

{ana_n}_{n=1n=1}^∞\infty

Meaning

A bounded sequence of real numbers used as the object in the Bolzano-Weierstrass argument.

Domain

Sequence indexed by positive integers n.

c0c_0, d0d_0

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    Top board text reads "We have c0≤an≤d0c_0 \le a_n \le d_0 for all n."

  2. Diagram
    Observation

    A number line shows endpoints labeled c0c_0 and d0d_0 with the sequence points inside that interval.

Symbol

c0c_0, d0d_0

Meaning

Lower and upper bounds of the initial closed interval [c0c_0,d0d_0] containing all terms of the bounded sequence.

Domain

Real numbers with c0≤d0c_0 \le d_0.

(c0+d0c_0+d_0)/2

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    The midpoint label on the number line is written as (c0+d0c_0+d_0)/2.

Symbol

(c0+d0c_0+d_0)/2

Meaning

Midpoint of the initial interval [c0c_0,d0d_0], used to split it into two halves.

Domain

Real number between c0c_0 and d0d_0.

c1c_1

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    The instructor writes [c0c_0,c1c_1] ∪ [c1c_1,d0d_0].

  2. Audio
    Observation

    He says he will call the middle point c1c_1.

Symbol

c1c_1

Meaning

The midpoint of [c0c_0,d0d_0], introduced as the dividing point for the first bisection step.

Domain

Real number with c1=(c0+d0)/2c_1=(c_0+d_0)/2.

I1,1I_{1,1}, I1,2I_{1,2}

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    The board shows I1,1I_{1,1} ∪ I1,2I_{1,2}.

  2. Audio
    Observation

    He names the two subintervals I1,1I_{1,1} and I1,2I_{1,2}.

Symbol

I1,1I_{1,1}, I1,2I_{1,2}

Meaning

The two half-intervals obtained from splitting [c0c_0,d0d_0] at c1c_1.

Domain

Closed subintervals of [c0c_0,d0d_0].

I~1\widetilde{I}_1

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    The board adds "call this I~1\widetilde{I}_1".

  2. Audio
    Observation

    He says one of the two intervals contains infinitely many ana_n terms and calls it I1I_1 tilde.

Symbol

I~1\widetilde{I}_1

Meaning

The chosen one of I1,1I_{1,1} or I1,2I_{1,2} that contains infinitely many terms of the sequence.

Domain

A closed interval selected from the first bisection.

I~1\widetilde{I}_1,I~2\widetilde{I}_2,I~3\widetilde{I}_3,…\ldots,I~k\widetilde{I}_k

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    Green writing shows I~1\widetilde{I}_1 ⊇ I~2\widetilde{I}_2 ⊇ I~3\widetilde{I}_3 ⊇ ... ⊇ I~k\widetilde{I}_k.

  2. Audio
    Observation

    He says they have constructed this nested collection.

Symbol

I~1\widetilde{I}_1,I~2\widetilde{I}_2,I~3\widetilde{I}_3,…\ldots,I~k\widetilde{I}_k

Meaning

A finite displayed stage of a nested family of chosen intervals in the induction construction.

Domain

Closed intervals with reverse inclusion ordering.

|I~k\widetilde{I}_k|

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    Green writing shows |I~k\widetilde{I}_k| = (d0−c0d_0-c_0)/2^k.

  2. Audio
    Observation

    He states the length of IkI_k tilde is half the length of the overall thing, giving (d0−c0d_0-c_0)/2^k.

Symbol

|I~k\widetilde{I}_k|

Meaning

Length (measure) of the kth chosen nested interval.

Domain

Nonnegative real number.

{ana_n}_{n=1n=1}^∞\infty

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    The board states "Let {ana_n}_{n=1n=1}^∞\infty be such a bounded sequence" and repeatedly refers to the terms ana_n.

Symbol

{ana_n}_{n=1n=1}^∞\infty

Meaning

A bounded sequence of real numbers whose convergent subsequence is being constructed.

Domain

Sequence indexed by positive integers n ∈ ℕ; each term ana_n ∈ ℝ.

Knowledge points · 16

Definition of a Bounded Sequence

Clear evidence
Shown in the video
Evidence
  1. Audio
    Observation

    The speaker states the condition for a bounded sequence.

  2. Formula
    Observation

    The inequality c0≤an≤d0c_0 \le a_n \le d_0 is written on the board.

Definition
Explanation

A sequence of real numbers is bounded if there exist real numbers c0c_0 and d0d_0 such that every term of the sequence lies within the closed interval [c0c_0, d0d_0].

Formula
c0≤an≤d0 for all nc_0 \le a_n \le d_0 \text{ for all } n
Conditions
  1. The sequence consists of real numbers.

  2. c0c_0 and d0d_0 are fixed real numbers.

Method of Nested Intervals for Subsequence Extraction

Clear evidence
Shown in the video
Evidence
  1. Audio
    Observation

    The speaker explains the idea of building a nested collection of closed intervals by cutting the initial interval into two parts.

  2. Formula
    Observation

    He writes the union of the two sub-intervals on the board.

Method
Explanation

To extract a convergent subsequence from a bounded sequence, one constructs a nested collection of closed intervals. This is initiated by dividing the initial bounding interval [c0c_0, d0d_0] into two halves at its midpoint.

Formula
[c0,c0+d02]∪[c0+d02,d0]\left[c_0, \frac{c_0+d_0}{2}\right] \cup \left[\frac{c_0+d_0}{2}, d_0\right]
Conditions
  1. An initial closed interval containing all terms of the sequence must exist.

Prerequisites
  1. Definition of a Bounded Sequence

Bolzano-Weierstrass theorem statement shown on board

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    Title text on the board reads "Bolzano-Weierstrass: Any bounded sequence of real numbers contains a convergent subsequence."

Definition
Explanation

The clip opens with the theorem statement written across the top: every bounded sequence of real numbers has a convergent subsequence. The rest of the segment develops the bisection/nested-interval construction used to prove it.

Formula
Any bounded sequence of real numbers contains a convergent subsequence.\text{Any bounded sequence of real numbers contains a convergent subsequence.}
Conditions
  1. The sequence consists of real numbers.

  2. The sequence is bounded.

Initial enclosing interval for the bounded sequence

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    Board text: "Let {ana_n}_{n=1n=1}^∞\infty be such a bounded sequence. We have c0≤an≤d0c_0 \le a_n \le d_0 for all n."

  2. Diagram
    Observation

    A number line marks c0c_0, the midpoint, and d0d_0, with the sequence contained in that interval.

Definition
Explanation

Because the sequence is bounded, all its terms lie in some closed interval [c0c_0,d0d_0]. This interval is the starting object for the proof, and the midpoint (c0+d0c_0+d_0)/2 is drawn explicitly on the number line.

Formula
c0≤an≤d0for all nc_0 \le a_n \le d_0 \quad \text{for all } n
Conditions
  1. {ana_n} is bounded.

  2. c0c_0 and d0d_0 are chosen as lower and upper bounds.

Prerequisites
  1. Bolzano-Weierstrass theorem statement shown on board

Splitting [c0c_0,d0d_0] into two half-intervals

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    The instructor writes [c0c_0,(c0+d0c_0+d_0)/2] ∪ [(c0+d0c_0+d_0)/2,d0d_0].

  2. Formula
    Observation

    He then rewrites the same split as [c0c_0,c1c_1] ∪ [c1c_1,d0d_0].

  3. Audio
    Observation

    He says he will call the middle point c1c_1.

Method
Explanation

The proof begins by cutting the initial interval at its midpoint. The two resulting closed subintervals are named I1,1I_{1,1} and I1,2I_{1,2}. This is the first step of the nested-interval construction.

Formula
[c0,d0]=[c0,c1]∪[c1,d0],c1=c0+d02[c_0,d_0]=[c_0,c_1]\cup[c_1,d_0],\quad c_1=\frac{c_0+d_0}{2}
Conditions
  1. Use the midpoint of the current interval.

  2. Both subintervals remain closed.

Prerequisites
  1. Initial enclosing interval for the bounded sequence

At least one half-interval contains infinitely many sequence terms

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    Blue writing states "One of these intervals contains infinitely many of the ana_n".

  2. Audio
    Observation

    He explains that if both contained only finitely many terms, the whole sequence would be finite, contradicting that it is infinite.

Method
Explanation

After splitting [c0c_0,d0d_0], the instructor argues by contradiction that at least one of the two halves must contain infinitely many terms of the sequence. If both halves had only finitely many terms, their union would contain only finitely many terms, which is impossible because the sequence has infinitely many terms.

Formula
Conditions
  1. The original interval contains all terms of an infinite sequence.

  2. The interval is split into two pieces.

Prerequisites
  1. Splitting [c0c_0,d0d_0] into two half-intervals

Naming the chosen infinite-content interval as I~1\widetilde{I}_1

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    Board text adds "call this I~1\widetilde{I}_1".

  2. Audio
    Observation

    He says I1I_1 tilde is either I1,1I_{1,1} or I1,2I_{1,2}.

Definition
Explanation

Once one of the two half-intervals is identified as containing infinitely many terms, it is renamed I~1\widetilde{I}_1. This notation records the selection step needed to build the nested family.

Formula
I~1∈{I1,1,I1,2}\widetilde{I}_1\in\{I_{1,1},I_{1,2}\}
Conditions
  1. Choose one of the two subintervals that contains infinitely many ana_n terms.

Prerequisites
  1. At least one half-interval contains infinitely many sequence terms

Inductive construction of a nested interval family

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    Green writing shows I~1\widetilde{I}_1 ⊇ I~2\widetilde{I}_2 ⊇ I~3\widetilde{I}_3 ⊇ ... ⊇ I~k\widetilde{I}_k.

  2. Audio
    Observation

    He says there is at least one step in the induction and assumes we have constructed this nested collection.

Method
Explanation

The proof proceeds by induction: after choosing I~1\widetilde{I}_1, repeat the same bisection-and-selection process to obtain I~2\widetilde{I}_2, I~3\widetilde{I}_3, and so on, each contained in the previous one. The displayed chain records the nested structure being built.

Formula
I~1⊇I~2⊇I~3⊇⋯⊇I~k\widetilde{I}_1 \supseteq \widetilde{I}_2 \supseteq \widetilde{I}_3 \supseteq \cdots \supseteq \widetilde{I}_k
Conditions
  1. Each new interval is chosen from a bisection of the previous one.

  2. Each chosen interval still contains infinitely many terms of the sequence.

Prerequisites
  1. Naming the chosen infinite-content interval as I~1\widetilde{I}_1

Length formula for the kth nested interval

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    Green writing shows |I~k\widetilde{I}_k| = (d0−c0d_0-c_0)/2^k.

  2. Audio
    Observation

    He says the length is half the length of the overall thing, giving (d0−c0d_0-c_0)/2^k.

Formula
Explanation

Each bisection halves the interval length, so after k steps the chosen interval has length (d0−c0d_0-c_0)/2^k. This formula is central to the later convergence argument because the lengths tend to 0.

Formula
∣I~k∣=d0−c02k|\widetilde{I}_k|=\frac{d_0-c_0}{2^k}
Conditions
  1. Start from interval length d0−c0d_0-c_0.

  2. Each step bisects the current interval.

Prerequisites
  1. Inductive construction of a nested interval family

Bolzano-Weierstrass theorem statement on the board

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    Top of board: "Bolzano-Weierstrass: Any bounded sequence of real numbers contains a convergent subsequence."

Definition
Explanation

The theorem asserts that every bounded sequence of real numbers has at least one convergent subsequence. In this clip, the proof begins from a bounded sequence {ana_n}_{n=1n=1}^∞\infty with c0≤an≤d0c_0 \le a_n \le d_0 for all n.

Formula
Any bounded sequence of real numbers contains a convergent subsequence.\text{Any bounded sequence of real numbers contains a convergent subsequence.}
Conditions
  1. The sequence consists of real numbers.

  2. The sequence is bounded.

Inductive construction of nested intervals

Clear evidence
Shown in the video
Evidence
  1. Audio
    Observation

    The instructor says they will construct the next interval by splitting Ĩ_k in half so that infinitely many ana_n are in Ĩ_{k+1k+1}.

  2. Formula
    Observation

    Board text: "Split Ĩ_k in half s.t. infinitely many ana_n are in Ĩ_{k+1k+1}."

Method
Explanation

Given a nested interval Ĩ_k containing infinitely many terms of the sequence, split it into two halves. At least one half must contain infinitely many terms; choose that half as Ĩ_{k+1k+1}. This produces a nested sequence of closed intervals whose lengths shrink by a factor of 2 each step.

Formula
Split I~k in half s.t. infinitely many an are in I~k+1.\text{Split } \widetilde{I}_k \text{ in half s.t. infinitely many } a_n \text{ are in } \widetilde{I}_{k+1}.
Conditions
  1. Each Ĩ_k is a closed interval.

  2. Each Ĩ_k contains infinitely many terms of {ana_n}.

  3. The construction proceeds inductively over k.

Prerequisites
  1. Bolzano-Weierstrass theorem statement on the board

Length of the kth nested interval

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    Board writes |Ĩ_k| = (d0−c0d_0 - c_0)/2^k.

  2. Audio
    Observation

    The instructor says the measure result is exactly the same when splitting in half.

Formula
Explanation

The initial bounding interval has length d0−c0d_0 - c_0. Each bisection halves the previous interval length, so after k steps the selected interval has length (d0−c0d_0 - c_0)/2^k.

Formula
∣I~k∣=d0−c02k|\widetilde{I}_k| = \frac{d_0 - c_0}{2^k}
Conditions
  1. c0≤d0c_0 \le d_0.

  2. Each new interval is obtained by halving the previous interval.

Prerequisites
  1. Inductive construction of nested intervals
Claims and conditions · 5

Bolzano-Weierstrass Theorem

Clear evidence
Shown in the video
Evidence
  1. Audio
    Observation

    The speaker states the theorem verbally.

  2. Formula
    Observation

    The speaker writes the theorem statement on the board.

Theorem
Statement

Any bounded sequence of real numbers contains a convergent subsequence.

Hypotheses
  1. The sequence consists of real numbers.

  2. The sequence is bounded.

Quantifiers

For any bounded sequence of real numbers, there exists a convergent subsequence.

Bolzano-Weierstrass theorem

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    The theorem statement is written at the top of the board.

Theorem
Statement

Any bounded sequence of real numbers contains a convergent subsequence.

Hypotheses
  1. The sequence is a sequence of real numbers.

  2. The sequence is bounded.

Quantifiers

For every bounded real sequence, there exists a convergent subsequence.

Pigeonhole-style claim for the two half-intervals

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    Written statement: "One of these intervals contains infinitely many of the ana_n".

  2. Audio
    Observation

    He justifies it by saying that if both had finitely many terms, the sequence would have finitely many terms.

Proposition
Statement

If an interval containing all terms of an infinite sequence is split into two subintervals, then at least one of the two subintervals contains infinitely many terms of the sequence.

Hypotheses
  1. The original interval contains all terms of the sequence.

  2. The sequence has infinitely many terms.

  3. The interval is divided into two subintervals whose union is the original interval.

Quantifiers

There exists at least one of the two subintervals containing infinitely many sequence terms.

Nested interval property gives a common point

Clear evidence
Shown in the video
Evidence
  1. Audio
    Observation

    The instructor says, "by the nested interval property, there is a point a which is in the intersection n goes from 1 to infinity of InI_n tilde."

  2. Formula
    Observation

    Board writes: "By the nested interval property there is a point a ∈ ⋂_{n=1n=1}^∞\infty Ĩ_n."

Uncertainties
  1. The video names the nested interval property but does not separately state its full hypotheses on screen in this clip.

Theorem
Statement

For the constructed nested sequence of closed intervals, there exists a point a belonging to every interval, i.e. a ∈ ⋂_{n=1n=1}^∞\infty Ĩ_n.

Hypotheses
  1. The intervals form a nested sequence.

  2. The intervals are closed.

  3. The construction has been carried out inductively for all positive integer indices.

Quantifiers

There exists a real number a such that for every n≥1n \ge 1, a ∈ Ĩ_n.

Bolzano-Weierstrass Theorem

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    Written explicitly on the top left of the blackboard.

Theorem
Statement

Any bounded sequence of real numbers contains a convergent subsequence.

Hypotheses
  1. Let \{ana_n\}_{n=1n=1}^{∞\infty} be a bounded sequence of real numbers.

Quantifiers

Universal quantification over all bounded sequences of real numbers; existential quantification over convergent subsequences.

Derivations and proofs · 5

Initial Setup for the Proof of Bolzano-Weierstrass Theorem

Clear evidence
Shown in the video
Evidence
  1. Audio
    Observation

    The speaker outlines the initial steps of the proof, including defining the sequence, establishing its bounds, and proposing the method of nested intervals.

  2. Formula
    Observation

    The speaker writes the sequence definition, the bounding inequality, and the split intervals on the board.

  3. Diagram
    Observation

    The speaker draws the real line and the initial bounding interval.

Proof
Steps
  1. Expression
    {an}n=1∞\{a_n\}_{n=1}^{\infty}
    Explanation

    Let the sequence be denoted as {ana_n} from n=1n=1 to infinity.

    Justification

    Definition of the object being analyzed in the theorem.

    Shown in the video
  2. Expression
    c0≤an≤d0 for all nc_0 \le a_n \le d_0 \text{ for all } n
    Explanation

    Since the sequence is bounded, there exist real numbers c0c_0 and d0d_0 such that all terms lie in the closed interval [c0c_0, d0d_0].

    Justification

    Definition of a bounded sequence.

    Shown in the video
  3. Expression
    [c0,c0+d02]∪[c0+d02,d0]\left[c_0, \frac{c_0+d_0}{2}\right] \cup \left[\frac{c_0+d_0}{2}, d_0\right]
    Explanation

    The initial interval [c0c_0, d0d_0] is split into two closed sub-intervals at its midpoint.

    Justification

    Strategy to build a nested collection of closed intervals to extract a convergent subsequence.

    Shown in the video
Conclusion

The proof begins by establishing a bounded interval containing the sequence and splitting it into two halves to initiate the construction of nested intervals.

First bisection and selection of an infinite-content subinterval

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    The board shows the split [c0c_0,(c0+d0c_0+d_0)/2] ∪ [(c0+d0c_0+d_0)/2,d0d_0], then [c0c_0,c1c_1] ∪ [c1c_1,d0d_0], then I1,1I_{1,1} ∪ I1,2I_{1,2}.

  2. Audio
    Observation

    He narrates naming the midpoint c1c_1 and the two subintervals.

Proof
Steps
  1. Expression
    c0≤an≤d0for all nc_0 \le a_n \le d_0 \quad \text{for all } n
    Explanation

    Start from the boundedness assumption, so all sequence terms lie in [c0c_0,d0d_0].

    Justification

    Given directly on the board as the setup for the proof.

    Shown in the video
  2. Expression
    c1=c0+d02c_1=\frac{c_0+d_0}{2}
    Explanation

    Introduce the midpoint of the initial interval.

    Justification

    Written on the number line and then named c1c_1 in the algebraic decomposition.

    Shown in the video
  3. Expression
    [c0,d0]=[c0,c1]∪[c1,d0][c_0,d_0]=[c_0,c_1]\cup[c_1,d_0]
    Explanation

    Split the original interval into two closed halves meeting at c1c_1.

    Justification

    Direct rewriting shown on the board.

    Shown in the video
  4. Expression
    [c0,d0]=I1,1∪I1,2[c_0,d_0]=I_{1,1}\cup I_{1,2}
    Explanation

    Rename the two halves as I1,1I_{1,1} and I1,2I_{1,2}.

    Justification

    Explicit notation added on the board.

    Shown in the video
  5. Expression
    One of I1,1,I1,2 contains infinitely many an\text{One of } I_{1,1},I_{1,2} \text{ contains infinitely many } a_n
    Explanation

    At least one half must contain infinitely many terms of the sequence.

    Justification

    Stated on the board and justified verbally by contradiction: if both were finite, the whole sequence would be finite.

    Shown in the video
  6. Expression
    I~1∈{I1,1,I1,2}\widetilde{I}_1 \in \{I_{1,1},I_{1,2}\}
    Explanation

    Choose one such half and call it I~1\widetilde{I}_1.

    Justification

    Explicitly written as "call this I~1\widetilde{I}_1".

    Shown in the video
Conclusion

The first step of the nested-interval construction produces a closed subinterval I~1\widetilde{I}_1 that still contains infinitely many terms of the sequence.

Inductive nesting and length estimate

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    Green writing shows I~1\widetilde{I}_1 ⊇ I~2\widetilde{I}_2 ⊇ I~3\widetilde{I}_3 ⊇ ... ⊇ I~k\widetilde{I}_k.

  2. Audio
    Observation

    He says to assume we have constructed this nested collection and that each interval has length (d0−c0d_0-c_0)/2^k.

Uncertainties
  1. The clip states the inductive hypothesis and displays the pattern, but the full induction proof for all k is not completed within this excerpt.

Proof
Steps
  1. Expression
    I~1⊇I~2⊇I~3⊇⋯⊇I~k\widetilde{I}_1 \supseteq \widetilde{I}_2 \supseteq \widetilde{I}_3 \supseteq \cdots \supseteq \widetilde{I}_k
    Explanation

    Assume a finite stage of the construction has produced a nested chain of chosen intervals.

    Justification

    Written explicitly in green on the board as the inductive setup.

    Shown in the video
  2. Expression
    ∣I~k∣=d0−c02k|\widetilde{I}_k|=\frac{d_0-c_0}{2^k}
    Explanation

    Record the length of the kth chosen interval.

    Justification

    Written explicitly on the board and explained verbally as halving at each step.

    Shown in the video
Conclusion

By the end of the clip, the proof has established the nested structure and the shrinking-length formula needed for the later convergence argument.

Proof of Bolzano-Weierstrass via nested intervals

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    The board lays out the proof from the bounded sequence assumption through nested intervals, intersection point, subsequence selection, and convergence.

  2. Audio
    Observation

    The instructor narrates the inductive split, invokes the nested interval property, picks anka_{n_k} ∈ Ĩ_k, bounds |ank−aa_{n_k}-a|, and concludes ank→aa_{n_k} \to a.

Uncertainties
  1. The clip does not show the initial proof of why one half must contain infinitely many terms; it is assumed from earlier context on the board.

Proof
Steps
  1. Expression
    Let {an}n=1∞ be a bounded sequence with c0≤an≤d0 for all n.\text{Let } \{a_n\}_{n=1}^{\infty} \text{ be a bounded sequence with } c_0 \leq a_n \leq d_0 \text{ for all } n.
    Explanation

    Start with a bounded real sequence and enclose all its terms in the initial closed interval [c0c_0,d0d_0].

    Justification

    Stated directly on the board as the setup for the theorem.

    Shown in the video
  2. Expression
    I~1⊇I~2⊇I~3⊇⋯⊇I~k,∣I~k∣=d0−c02k\widetilde{I}_1 \supseteq \widetilde{I}_2 \supseteq \widetilde{I}_3 \supseteq \cdots \supseteq \widetilde{I}_k, \quad |\widetilde{I}_k| = \frac{d_0-c_0}{2^k}
    Explanation

    Assume nested intervals have been constructed up to stage k, each containing infinitely many sequence terms and having length reduced by repeated halving.

    Justification

    Written on the board as the induction hypothesis for the construction.

    Shown in the video
  3. Expression
    Split I~k in half s.t. infinitely many an are in I~k+1.\text{Split } \widetilde{I}_k \text{ in half s.t. infinitely many } a_n \text{ are in } \widetilde{I}_{k+1}.
    Explanation

    To continue the construction, divide Ĩ_k into two halves and select a half that still contains infinitely many terms of the sequence.

    Justification

    Audio explanation plus board text; the underlying pigeonhole idea is that finitely many terms in both halves would imply only finitely many in their union.

    Shown in the video
  4. Expression
    ∃a∈⋂n=1∞I~n\exists a \in \bigcap_{n=1}^{\infty} \widetilde{I}_n
    Explanation

    The nested closed intervals have a common point a.

    Justification

    Explicit invocation of the nested interval property.

    Shown in the video
  5. Expression
    Pick ank∈I~k\text{Pick } a_{n_k} \in \widetilde{I}_k
    Explanation

    For each k, choose a sequence term lying in the kth interval; these chosen terms form the candidate subsequence.

    Justification

    Possible because each Ĩ_k was constructed to contain infinitely many ana_n.

    Shown in the video
  6. Expression
    ∣ank−a∣≤d0−c02k|a_{n_k} - a| \leq \frac{d_0-c_0}{2^k}
    Explanation

    Since both anka_{n_k} and a lie in Ĩ_k, their distance cannot exceed the length of Ĩ_k.

    Justification

    Interval containment plus the formula for |Ĩ_k|.

    Shown in the video
  7. Expression
    d0−c02k→0as k→∞\frac{d_0-c_0}{2^k} \to 0 \quad \text{as } k \to \infty
    Explanation

    The upper bound on |ank−aa_{n_k}-a| tends to zero because repeated division by 2 makes the interval lengths arbitrarily small.

    Justification

    Standard limit of a constant divided by 2k2^k.

    Derived from the video
  8. Expression
    ank→aa_{n_k} \to a
    Explanation

    Therefore the selected subsequence converges to a.

    Justification

    Comparison/squeeze argument using the bound |ank−aa_{n_k}-a| ≤ (d0−c0d_0-c_0)/2^k and the fact that the right-hand side tends to 0.

    Shown in the video
Conclusion

A convergent subsequence {anka_{n_k}} of the original bounded sequence has been constructed, proving the Bolzano-Weierstrass theorem for this case.

Proof of the Bolzano-Weierstrass Theorem

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    The entire right side and bottom left of the board detail the step-by-step construction of the proof.

  2. Audio
    Observation

    Speaker concludes: 'And that's the proof of Bolzano-Weierstrass.'

Proof
Steps
  1. Expression
    c0≤an≤d0 for all nc_0 \le a_n \le d_0 \text{ for all } n
    Explanation

    Establish the initial bounds for the bounded sequence \{ana_n\}.

    Justification

    Definition of a bounded sequence.

    Shown in the video
  2. Expression
    [c0,c0+d02]∪[c0+d02,d0][c_0, \frac{c_0+d_0}{2}] \cup [\frac{c_0+d_0}{2}, d_0]
    Explanation

    Split the initial interval [c0c_0, d0d_0] into two halves.

    Justification

    Bisection method.

    Shown in the video
  3. Expression
    One of these intervals contains infinitely many of the an\text{One of these intervals contains infinitely many of the } a_n
    Explanation

    Identify which half-interval contains infinitely many terms of the sequence and label it I~1\widetilde{I}_1.

    Justification

    Pigeonhole principle applied to infinite sets.

    Shown in the video
  4. Expression
    I~1⊇I~2⊇I~3⊇⋯⊇I~k\widetilde{I}_1 \supseteq \widetilde{I}_2 \supseteq \widetilde{I}_3 \supseteq \dots \supseteq \widetilde{I}_k
    Explanation

    Iteratively construct a nested sequence of closed intervals, where each I~k\widetilde{I}_k contains infinitely many terms of \{ana_n\}.

    Justification

    Recursive application of the bisection and infinite subset selection.

    Shown in the video
  5. Expression
    ∣I~k∣=d0−c02k|\widetilde{I}_k| = \frac{d_0 - c_0}{2^k}
    Explanation

    Calculate the length of the k-th interval.

    Justification

    Each bisection halves the length of the previous interval.

    Shown in the video
  6. Expression
    a∈⋂n=1∞I~na \in \bigcap_{n=1}^{\infty} \widetilde{I}_n
    Explanation

    Assert the existence of a limit point 'a' common to all nested intervals.

    Justification

    Nested interval property of real numbers.

    Shown in the video
  7. Expression
    Pick aqk∈I~k\text{Pick } a_{q_k} \in \widetilde{I}_k
    Explanation

    Construct a subsequence by selecting one term from each interval I~k\widetilde{I}_k.

    Justification

    Axiom of choice / constructive selection from infinite subsets.

    Shown in the video
  8. Expression
    ∣aqk−a∣≤d0−c02k|a_{q_k} - a| \le \frac{d_0 - c_0}{2^k}
    Explanation

    Bound the distance between the subsequence term and the limit point 'a'.

    Justification

    Both points lie within the same interval I~k\widetilde{I}_k of length d0−c02k\frac{d_0 - c_0}{2^k}.

    Shown in the video
  9. Expression
    aqk→aa_{q_k} \to a
    Explanation

    Conclude that the subsequence converges to 'a'.

    Justification

    Comparison test, since d0−c02k→0\frac{d_0 - c_0}{2^k} \to 0 as k→∞k \to \infty.

    Shown in the video
Conclusion

The constructed subsequence \{aqka_{q_k}\} converges to the real number a, proving the Bolzano-Weierstrass theorem.

Visual events · 6

Visualization of the Real Line and Bounding Interval

Clear evidence
Shown in the video
Evidence
  1. Diagram
    Observation

    The speaker draws a horizontal line with an arrow on the right, labeling it 'R' for the real line. He then marks two points on the line, labeling them 'c0c_0' and 'd0d_0', and draws a bracketed interval between them.

Objects
  1. Horizontal line representing the real number line (R\mathbb{R})

  2. Point labeled c0c_0

  3. Point labeled d0d_0

  4. Bracketed interval between c0c_0 and d0d_0

Changes
  1. Drawing of the real line

  2. Marking of points c0c_0 and d0d_0

  3. Drawing of the interval [c0c_0, d0d_0]

Invariants
  1. The line represents the set of all real numbers.

Interpretation

This visual aid demonstrates the concept of a bounded sequence residing within a specific closed interval on the real line.

Number-line picture of the initial bounded interval

Clear evidence
Shown in the video
Evidence
  1. Diagram
    Observation

    A horizontal number line is drawn with labels c0c_0, (c0+d0c_0+d_0)/2, and d0d_0, plus arrows indicating the interval direction.

Objects
  1. Number line

  2. Labels c0c_0 and d0d_0

  3. Midpoint label (c0+d0c_0+d_0)/2

  4. Bracketed interval over the line

Changes
  1. The midpoint is marked between c0c_0 and d0d_0.

  2. The interval [c0c_0,d0d_0] is visually emphasized as the region containing the sequence.

Invariants
  1. All sequence terms remain inside [c0c_0,d0d_0] during this setup.

  2. The midpoint stays fixed as (c0+d0c_0+d_0)/2 once introduced.

Interpretation

The diagram encodes the boundedness hypothesis and prepares the first bisection step of the proof.

Color-coded progression from setup to induction

Clear evidence
Shown in the video
Evidence
  1. Diagram
    Observation

    Blue writing adds the algebraic decomposition and selection statements; green writing later adds the nested chain and length formula.

Objects
  1. Blue interval decompositions

  2. Blue sentence about infinitely many terms

  3. Green nested-chain notation

  4. Green length formula

Changes
  1. The board moves from the initial interval split to naming I1,1I_{1,1}, I1,2I_{1,2}, and I~1\widetilde{I}_1.

  2. It then advances to the inductive nested family and the formula for |I~k\widetilde{I}_k|.

Invariants
  1. The theorem statement at the top remains visible throughout.

  2. The original bounds c0c_0 and d0d_0 continue to anchor the construction.

Interpretation

The visual layering mirrors the logical structure: first define the geometric split, then select an infinite-content piece, then generalize by induction.

Blackboard organization of the proof

Clear evidence
Shown in the video
Evidence
  1. Diagram
    Observation

    The left side shows a number-line sketch with c0c_0, d0d_0, and interval bisections; the right side develops the proof text and formulas.

Objects
  1. Title statement of Bolzano-Weierstrass

  2. Number line with c0c_0 and d0d_0

  3. Interval bisection expressions

  4. Nested interval sequence Ĩ_1 ⊇ Ĩ_2 ⊇ ...

  5. Length formula |Ĩ_k|

  6. Intersection point a

  7. Subsequence selection anka_{n_k}

  8. Convergence inequality and conclusion

Changes
  1. The instructor adds "with infinitely many of the ana_n in Ĩ_k" near the beginning.

  2. He writes the inductive split rule for Ĩ_{k+1k+1}.

  3. He writes the nested interval property conclusion with a ∈ ⋂ _n.

  4. He writes the choice anka_{n_k} ∈ Ĩ_k.

  5. He writes the distance bound and final convergence statement.

Invariants
  1. The theorem statement remains visible at the top throughout.

  2. The initial boundedness condition c0≤an≤d0c_0 \le a_n \le d_0 remains visible.

  3. The interval length formula remains visible once written.

Interpretation

The visual layout separates the geometric intuition of repeated bisection from the formal proof steps, making the nested-interval method the central mechanism of the argument.

Number Line Diagram

Clear evidence
Shown in the video
Evidence
  1. Diagram
    Observation

    Left side of the board shows a number line with an arrow pointing left labeled 'finite number' and an arrow pointing right labeled '∞\infty'.

Objects
  1. Number line

  2. Arrows indicating direction

  3. Labels for finite and infinity

Invariants
  1. Static diagram illustrating the concept of boundedness and infinite sequences.

Interpretation

Visually represents the domain of the sequence and the concept of bounds extending towards infinity.

Interval Bisection Visualization

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    Bottom left shows the splitting of [c0c_0, d0d_0] into [c0c_0, c0+d02\frac{c_0+d_0}{2}] and [c0+d02\frac{c_0+d_0}{2}, d0d_0], then further into I1,1I_{1,1} and I1,2I_{1,2}.

Objects
  1. Initial interval [c0c_0, d0d_0]

  2. Midpoint c0+d02\frac{c_0+d_0}{2}

  3. Sub-intervals I1,1I_{1,1} and I1,2I_{1,2}

Changes
  1. The interval is conceptually divided in half repeatedly.

Invariants
  1. At least one sub-interval always contains infinitely many terms of the sequence.

Interpretation

Illustrates the core mechanism of the proof: repeatedly halving the interval to isolate a nested sequence of intervals that trap the limit point.

Misconceptions · 3

Misconception about Boundedness implying Convergence

Clear evidence
Shown in the video
Evidence
  1. Audio
    Observation

    The speaker says, "Now of course it might oscillate, right? It might oscillate between the left and the right, so we don't necessarily know it's going to converge because it might just hop back and forth between c zero and d zero... and that wouldn't violate that condition."

Misconception

Assuming that because a sequence is bounded within an interval, the sequence itself must converge.

Clarification

A bounded sequence can oscillate back and forth within its bounding interval without converging. The theorem guarantees the existence of a convergent *subsequence*, not that the original sequence converges.

Mistaking a union of two finite sets for an infinite set

Clear evidence
Shown in the video
Evidence
  1. Audio
    Observation

    He explicitly warns that if both intervals contained only finitely many terms, then the sequence would have only finitely many terms.

Misconception

One might think both half-intervals could contain only finitely many sequence terms while the whole sequence is still infinite.

Clarification

If both pieces contained only finitely many terms, their union would also contain only finitely many terms, contradicting that the sequence has infinitely many terms.

Confusing the subsequence index k with the original sequence index n

Approximate timing
Derived from the video
Evidence
  1. Formula
    Observation

    The board writes Pick anka_{n_k} ∈ Ĩ_k and later uses k in the convergence estimate.

  2. Audio
    Observation

    The instructor says "as n goes to infinity" while discussing the bound for the subsequence indexed by k.

Uncertainties
  1. This is an indexing wording issue rather than a mathematical error in the displayed proof.

Misconception

One might think the convergence statement concerns the original sequence index n rather than the subsequence index k.

Clarification

The displayed mathematics uses anka_{n_k} and bounds |ank−aa_{n_k}-a| by (d0−c0d_0-c_0)/2^k, so the limiting process is over k, the subsequence parameter.

Concept relations · 13

Bolzano-Weierstrass Theorem → Definition of a Bounded Sequence

Clear evidence
Shown in the video
Evidence
  1. Audio
    Observation

    The speaker states the theorem and then defines what it means for the sequence in the theorem to be bounded.

Prerequisite
Explanation

The definition of a bounded sequence is a necessary prerequisite to understand the hypothesis of the Bolzano-Weierstrass theorem.

Bolzano-Weierstrass Theorem → Method of Nested Intervals for Subsequence Extraction

Clear evidence
Shown in the video
Evidence
  1. Audio
    Observation

    The speaker introduces the method of nested intervals as the core idea for proving the theorem.

Proof dependency
Explanation

The method of nested intervals is the primary technique used in the proof of the Bolzano-Weierstrass theorem demonstrated in the video.

Bolzano-Weierstrass theorem statement shown on board → Initial enclosing interval for the bounded sequence

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    The theorem statement is followed immediately by the bounded-sequence setup c0≤an≤d0c_0 \le a_n \le d_0.

Application
Explanation

The initial enclosing interval is the direct application of the boundedness hypothesis in the Bolzano-Weierstrass theorem.

Initial enclosing interval for the bounded sequence → Splitting [c0c_0,d0d_0] into two half-intervals

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    The board rewrites [c0c_0,d0d_0] as [c0c_0,c1c_1] ∪ [c1c_1,d0d_0].

Application
Explanation

Once the sequence is known to lie in [c0c_0,d0d_0], the proof applies midpoint bisection to that interval.

Splitting [c0c_0,d0d_0] into two half-intervals → At least one half-interval contains infinitely many sequence terms

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    After writing I1,1I_{1,1} ∪ I1,2I_{1,2}, the next blue statement says one of these intervals contains infinitely many ana_n.

Proof dependency
Explanation

The claim about infinitely many terms depends on having split the original interval into two covering subintervals.

At least one half-interval contains infinitely many sequence terms → Naming the chosen infinite-content interval as I~1\widetilde{I}_1

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    The board adds "call this I~1\widetilde{I}_1" right after the sentence about infinitely many terms.

Contains
Explanation

The notation I~1\widetilde{I}_1 packages the result of selecting one of the two half-intervals with infinitely many sequence terms.

Naming the chosen infinite-content interval as I~1\widetilde{I}_1 → Inductive construction of a nested interval family

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    The green chain starts with I~1\widetilde{I}_1 and continues to I~k\widetilde{I}_k.

Generalizes
Explanation

The single chosen interval I~1\widetilde{I}_1 is generalized into an inductively built nested family of chosen intervals.

Inductive construction of a nested interval family → Length formula for the kth nested interval

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    Immediately after the nested chain, the board writes |I~k\widetilde{I}_k|=(d0−c0d_0-c_0)/2^k.

Proof dependency
Explanation

The length formula is derived from the repeated bisection inherent in the nested construction.

Bolzano-Weierstrass theorem statement on the board → Nested interval property gives a common point

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    The proof moves from the Bolzano-Weierstrass statement to constructing nested intervals and invoking the nested interval property.

Proof dependency
Explanation

The clip proves the Bolzano-Weierstrass theorem by relying on the existence of a common point in a nested sequence of closed intervals.

Length of the kth nested interval → Using the shrinking interval length to prove convergence

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    The bound |ank−aa_{n_k}-a| ≤ (d0−c0d_0-c_0)/2^k directly uses the interval length formula to conclude convergence.

Application
Explanation

The explicit formula for the interval length supplies the shrinking upper bound needed in the comparison argument.

Inductive construction of nested intervals → Nested interval property gives a common point

Clear evidence
Shown in the video
Evidence
  1. Audio
    Observation

    After describing the inductive split, the instructor says this shows we can do it inductively and then invokes the nested interval property.

Prerequisite
Explanation

The nested interval property is applied only after the construction has produced a nested sequence of closed intervals.

Nested Interval Property → Bolzano-Weierstrass Theorem Statement

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    The proof explicitly relies on the 'nested interval property' to find the limit point 'a'.

Proof dependency
Explanation

The Nested Interval Property is a foundational axiom/theorem of real analysis used directly in the proof of the Bolzano-Weierstrass theorem to guarantee the existence of the limit point.

Find an answer · 15

What is the exact statement of the Bolzano-Weierstrass theorem?

Clear evidence
Shown in the video
Evidence
  1. Audio
    Observation

    The speaker explicitly states the theorem.

  2. Formula
    Observation

    The theorem is written on the board.

Knowledge points
  1. Bolzano-Weierstrass Theorem

How is a bounded sequence of real numbers mathematically defined?

Clear evidence
Shown in the video
Evidence
  1. Audio
    Observation

    The speaker defines a bounded sequence using an inequality.

  2. Formula
    Observation

    The inequality is written on the board.

Knowledge points
  1. Definition of a Bounded Sequence

What is the first step in using the method of nested intervals to prove the Bolzano-Weierstrass theorem?

Clear evidence
Shown in the video
Evidence
  1. Audio
    Observation

    The speaker explains the first step of the nested intervals method.

  2. Formula
    Observation

    The split intervals are written on the board.

Knowledge points
  1. Method of Nested Intervals for Subsequence Extraction

What does the Bolzano-Weierstrass theorem state in this clip?

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    The theorem title and statement are visible at the top of the board.

Knowledge points
  1. Bolzano-Weierstrass theorem statement shown on board

Why do we start with an interval [c0c_0,d0d_0] containing all the sequence terms?

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    The board writes c0≤an≤d0c_0 \le a_n \le d_0 for all n.

Knowledge points
  1. Initial enclosing interval for the bounded sequence

How is the first interval split into two subintervals?

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    The board shows [c0c_0,c1c_1] ∪ [c1c_1,d0d_0] and I1,1I_{1,1} ∪ I1,2I_{1,2}.

Knowledge points
  1. Splitting [c0c_0,d0d_0] into two half-intervals

Why must at least one of the two half-intervals contain infinitely many terms?

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    The written claim says one of these intervals contains infinitely many of the ana_n.

  2. Audio
    Observation

    He justifies it by contradiction using finiteness of both pieces.

Knowledge points
  1. At least one half-interval contains infinitely many sequence terms
  2. Mistaking a union of two finite sets for an infinite set

What does the notation I~1\widetilde{I}_1 mean here?

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    The board says call this I~1\widetilde{I}_1.

Knowledge points
  1. Naming the chosen infinite-content interval as I~1\widetilde{I}_1

What nested structure is being constructed in the proof?

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    Green writing shows I~1\widetilde{I}_1 ⊇ I~2\widetilde{I}_2 ⊇ I~3\widetilde{I}_3 ⊇ ... ⊇ I~k\widetilde{I}_k.

Knowledge points
  1. Inductive construction of a nested interval family

What is the formula for the length of the kth chosen interval?

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    Green writing shows |I~k\widetilde{I}_k|=(d0−c0d_0-c_0)/2^k.

Knowledge points
  1. Length formula for the kth nested interval

Why does the proof split the current interval in half when constructing the next nested interval?

Clear evidence
Shown in the video
Evidence
  1. Audio
    Observation

    The instructor explains splitting Ĩ_k in half so that infinitely many ana_n are in Ĩ_{k+1k+1}.

Knowledge points
  1. Inductive construction of nested intervals

Where is the nested interval property used in the Bolzano-Weierstrass proof?

Clear evidence
Shown in the video
Evidence
  1. Formula
    Observation

    Board text explicitly says "By the nested interval property there is a point a ∈ ⋂_{n=1n=1}^∞\infty Ĩ_n."

Knowledge points
  1. Nested interval property gives a common point
Coverage and review notes

Covered · Title card and introduction.

Covered · Statement of the Bolzano-Weierstrass theorem.

Covered · Setting up the proof by defining the sequence and explaining the concept of boundedness and potential oscillation.

Covered · Writing the formal definition of boundedness and introducing the method of nested intervals by splitting the initial interval.

Covered · The theorem statement and the initial bounded-interval setup are already on the board.

Covered · The midpoint is named c1c_1, the interval is rewritten as a union of two halves, and the halves are labeled I1,1I_{1,1} and I1,2I_{1,2}.

Covered · The instructor states and justifies that one half contains infinitely many sequence terms, then names that chosen half I~1\widetilde{I}_1.

Covered · The inductive nested chain I~1\widetilde{I}_1 ⊇ ... ⊇ I~k\widetilde{I}_k and the length formula |I~k\widetilde{I}_k|=(d0−c0d_0-c_0)/2^k are written and explained.

Covered · The board setup and the completion of the sentence about infinitely many ana_n lying in Ĩ_k are visible and audible.

Covered · The instructor writes and explains the inductive halving step producing Ĩ_{k+1k+1}.

Covered · The nested interval property is invoked and the common point a in the infinite intersection is written.

Covered · The subsequence terms anka_{n_k} are chosen, bounded by interval length, and shown to converge to a.

Covered · The entire 12-second clip consists of a static shot of a completed blackboard proof accompanied by a brief concluding audio statement. All mathematical content on the board has been extracted.

Covered · Silence and static image; no new mathematical content introduced.

Explore the knowledge in this video

Reviewed subject paths