Definition of a Path
In a metric space , a path is defined as a continuous function that maps a closed interval into . This generalizes the concept of parametric curves to arbitrary metric spaces.
Real Analysis Summer 2020 - Max Wimberley · YouTube · 10:10
This lecture segment introduces the topological concept of path-connectedness in metric spaces. It begins by formally defining a path as a continuous function from a closed interval into a metric space. Building on this, it defines a subset as path-connected if any two points within it can be joined by a path that remains entirely within that subset. The instructor visually emphasizes the importance of the path's target space being the subset itself, rather than the ambient metric space. This lecture segment defines paths and path-connectedness in metric spaces. It establishes that path-connectedness implies connectedness, noting the converse is false, and begins a proof by contradiction for the theorem. This video segment presents a whiteboard lecture on topology, focusing on the relationship between path-connectedness and connectedness. It begins with the formal proof of Theorem 22.5, which states that every path-connected set is connected, using a proof by contradiction that relies on a previous theorem about continuous images. Following the proof, the lecturer introduces the closed topologist's sine curve in as a classic example of a set that is connected but not path-connected, providing a hand-drawn sketch to illustrate its structure. This lecture segment presents the closed topologist's sine curve as a classic counterexample in topology. The instructor defines the set as the union of the graph of for and the vertical interval on the y-axis. He emphasizes that the object of study is the graph in , not just the function. The core mathematical claim is that this set is connected but not path-connected. The lack of path-connectedness is intuitively explained by the impossibility of drawing a continuous path from the oscillating curve to the y-axis segment due to the infinite number of oscillations near .
Use the learning inspector for key ideas and moments, or open the reading tabs for the complete notes.
Generated from the video's visuals and explanation; not verbatim speech.
The lecture begins by introducing the topic of path-connectedness, framing it as a formal mathematical version of the intuitive idea that a space is connected if any two points can be joined by a continuous path staying entirely within the space. The instructor references previous discussions on connectedness, using the example of a disconnected interval with a deleted point to illustrate why a path cannot cross between the two pieces without leaving the set.
The formal definition of a path is written on the board: Given a metric space , a path in is a continuous function . The instructor clarifies that this means any continuous function mapping a closed interval into the space . Parametric curves in higher-dimensional spaces like are given as familiar examples of such paths.
Next, the definition of path-connectedness is introduced: A subset is path-connected if for all pairs of points , there exists a path . The instructor deliberately circles the at the end of the formula, emphasizing a crucial detail: the path must map entirely into the subset itself, not just the larger ambient metric space . This ensures the connection between the points does not leave the set.
We begin by defining a path in a metric space . A path is a continuous function that maps a closed interval into . This means the function has no breaks or jumps as it traverses the space.
Next, we define what it means for a subset of to be path-connected. is path-connected if for any two points and in , there exists a path that stays entirely within , starting at (where ) and ending at (where ).
The lecturer then states a key theorem: If a set is path-connected, then it is connected. He initially writes the converse by mistake but quickly corrects it, emphasizing the direction of the implication.
He notes that the converse is not true; there are connected sets that are not path-connected. He mentions he will provide an example later but won't prove it in detail now.
To prove the theorem, he sets up a proof by contradiction. He assumes is disconnected, meaning it can be separated into two non-empty, disjoint open sets and . He then picks a point in and a point in to show that a path between them would lead to a contradiction.
The lecturer continues a proof by contradiction for Theorem 22.5, which states that if a subset of a topological space is path-connected, then is connected.
Assuming is disconnected by open sets and , there exist points and within .
Because is path-connected, there must be a continuous path connecting and , meaning .
The lecturer invokes a previous theorem: the image of a connected set (like the interval ) under a continuous function is connected. Thus, must be connected.
However, since contains points in both and , and disconnect , they also disconnect the subset .
This creates a contradiction: is both connected and disconnected. Therefore, the initial assumption that is disconnected must be false, proving is connected.
The lecturer then transitions to an example demonstrating that the converse is false: a set can be connected without being path-connected.
The example given is the closed topologist's sine curve in .
A hand-drawn sketch illustrates the curve for , which oscillates infinitely as it approaches the y-axis, along with the vertical segment on the y-axis from to .
This visual representation helps explain why no continuous path can connect a point on the oscillating curve to a point on the y-axis segment, despite the entire set being connected.
The instructor begins by sketching the graph of the function for . He notes that as approaches 0 from the right, the oscillations become infinitely frequent, though the amplitude remains bounded between -1 and 1.
He formally identifies the drawn curve as the graph of defined for . He clarifies a crucial distinction: in topology, when discussing subsets of , we refer to the *graph* (the set of points ), not merely the algebraic function mapping inputs to outputs.
To construct the 'closed' topologist's sine curve, he adds a specific component: the vertical line segment on the y-axis corresponding to the interval . This represents the limit points of the oscillating curve as . He states that adding this interval results in a closed set.
The instructor presents the main property of this set: it is connected but not path-connected. He provides an intuitive explanation for the failure of path-connectedness. Attempting to draw a continuous path from a point on the oscillating curve to a point on the added y-axis segment is impossible because the path would have to traverse an infinite number of oscillations in a finite domain, violating the continuity condition for functions on closed intervals.
Concluding the example, he reiterates that the closed topologist's sine curve serves as a counterexample showing that connectedness does not imply path-connectedness. He then wraps up the lecture, mentioning the next session will be lighter.
In a metric space , a path is defined as a continuous function that maps a closed interval into . This generalizes the concept of parametric curves to arbitrary metric spaces.
A subset of a metric space is path-connected if every pair of points in can be connected by a path that lies entirely within . The instructor emphasizes circling the target space to highlight that the path cannot leave the subset.
A path in a metric space is a continuous function .
A subset is path-connected if for all , there exists a path such that and .
If a subset of a metric space is path-connected, then it is connected. The converse is false.
This theorem establishes a fundamental relationship in topology: path-connectedness is a stronger condition than connectedness. If you can draw a continuous path between any two points in a set, the set cannot be split into two separate, non-intersecting open pieces.
The proof assumes the set is disconnected by open sets and . It finds points and in different sets, uses path-connectedness to create a path between them, and then shows this path's image must be both connected (by a previous theorem) and disconnected (by and ), yielding a contradiction.
A key step in the proof relies on a previously established theorem: if you take a connected set (like a closed interval) and apply a continuous function to it (like a path), the resulting image set is guaranteed to be connected.
To show the converse of Theorem 22.5 is false, the lecturer introduces the closed topologist's sine curve. This set in consists of the graph of for plus the vertical segment on the y-axis from -1 to 1. It is connected but not path-connected.
A subset of formed by the union of the graph of for and the vertical segment on the y-axis.
When analyzing topological properties like connectedness for equations, the object of interest is the graph (a set of points in the plane), distinct from the function (a mapping).
The closed topologist's sine curve is connected (cannot be split into two disjoint non-empty open sets) but not path-connected (no continuous path exists between certain pairs of points, specifically between the curve and the y-axis segment).
A continuous path from the oscillating part to the y-axis would need to cross infinitely many oscillations near , which is impossible for a continuous function defined on a compact (closed and bounded) interval.
Explore conditions, steps and evidence. Supplementary explanations are labeled separately from content shown in the video.
The handwritten text defines a metric space as S.
The speaker says, 'given a metric space S'.
S
An arbitrary metric space.
Metric space
The handwritten text uses the Greek letter gamma to denote a path function.
The speaker says, 'a continuous function gamma'.
A continuous function representing a path.
Function from [a,b] to S or E
The handwritten text shows the domain of the path function as [a,b].
The speaker says, 'from a closed interval into the space S'.
[a,b]
A closed interval serving as the domain for a path function.
Subset of real numbers
The handwritten text introduces a subset E of S.
The speaker says, 'we say E subset S is path connected'.
E
A subset of the metric space S.
Subset of S
The handwritten text uses s and t as points in E.
The speaker says, 'for all pairs of points in E'.
s, t
Arbitrary points within the subset E.
Elements of E
The symbol S is written on the whiteboard as part of the phrase 'Given a metric space S' and in the function definition gamma: [a,b] -> S.
S
A metric space
Set of points with a defined distance function
The symbol gamma is written on the whiteboard as part of the function definition gamma: [a,b] -> S and in the conditions gamma(a) = s, gamma(b) = t.
A continuous function representing a path
[a, b]
The symbols a and b are written on the whiteboard as the domain of the function gamma: [a,b] -> S.
[a, b]
A closed interval of real numbers
The symbol E is written on the whiteboard as part of the phrase 'We say is path-connected' and in the theorem statement.
E
A subset of the metric space S
Subset of S
The symbols s and t are written on the whiteboard as elements of E and as the endpoints of the path gamma.
s, t
Points in the subset E
Elements of E
The symbols and are written on the whiteboard as part of the proof setup: 'Suppose E disconnected by , '.
,
Open sets that disconnect the set E
Subsets of the metric space
E is written in the theorem statement and proof.
E
A subset of a topological space S.
Subset of S
Given a metric space S, a path in S is a continuous function : [a,b] .
The speaker states the definition of a path in a metric space.
In a metric space S, a path is defined as any continuous function mapping a closed interval [a,b] into the space S.
S is a metric space
[a,b] is a closed interval
is a continuous function
We say is path-connected if , , : [a,b] .
The speaker states the definition of a path-connected set.
A subset E of a metric space S is path-connected if for every pair of points s and t in E, there exists a path entirely contained within E that connects them.
E is a subset of a metric space S
For all pairs of points s, t in E
There exists a continuous function mapping [a,b] to E
The whiteboard shows the definition: 'Given a metric space S, a path in S is a ct's function : [a,b] .'
The speaker says, 'Given a metric space S, a path in S is a continuous function gamma from a, b to S.'
In a metric space , a path is defined as a continuous function mapping a closed interval of real numbers into . The speaker emphasizes that the function must be continuous.
S is a metric space
is a continuous function
[a, b] is a closed interval in
The whiteboard shows: 'We say is path-connected if , : [a,b] .t. , .'
The speaker explains, 'We say E is a subset of S is path connected if for all s, t in E, there exists a gamma from a, b to E such that gamma of a equals s and gamma of b equals t.'
A subset of a metric space is path-connected if for any two points and in , there exists a path entirely within that starts at and ends at . Specifically, and .
For every pair of points s, t in E
The path gamma maps into E
The whiteboard shows: 'Thm If is path-connected, then E is connected.'
The speaker states, 'If E is path connected, then E is connected.'
The theorem states that if a subset of a metric space is path-connected, then it is necessarily connected. The speaker initially writes the converse but corrects himself.
E is path-connected
The theorem states 'If is path-connected'.
A set E is path-connected if for any two points in E, there exists a continuous path entirely within E connecting them.
E must be a subset of a topological space S.
The theorem concludes 'then E is connected'.
A set E is connected if it cannot be represented as the union of two disjoint, non-empty open subsets relative to E.
E must be a subset of a topological space S.
The proof starts with 'Suppose E disconnected by , '.
A set E is disconnected if there exist two open sets and such that E is contained in their union, E intersects both, and E does not intersect their intersection.
and are open sets in the ambient space S.
The text 'the closed topologist's sine curve in ' is written.
A specific subset of the two-dimensional Euclidean space used as an example of a connected but not path-connected set.
Defined in .
The title on the whiteboard reads 'Example of a connected but not path-connected set: the closed topologist's sine curve in '.
The instructor explains that the set consists of the graph of for plus the interval on the y-axis.
The closed topologist's sine curve is a specific subset of constructed by taking the graph of the function for positive , and adding the vertical line segment from to on the y-axis (where ).
Considered as a subset of with the standard topology.
The instructor states, 'as a subset of , we're using the graph... It's not just the function... The actual set we're talking about is the graph of the function in .'
In the context of topological properties like connectedness, the object of study is the graph of the function (a set of points in ), not the function itself (a mapping from a domain to a codomain).
Applies when discussing subsets of defined by functions.
The speaker says, 'And perhaps surprisingly, it doesn't go the other way. So there are actually connected spaces which are not path connected.'
The converse of the theorem is false; there exist connected sets that are not path-connected.
E is connected
Existential (there are)
Theorem 22.5 is written on the board: 'If is path-connected, then E is connected.'
If a subset E of a topological space S is path-connected, then E is connected.
E is path-connected
For all subsets E of a topological space S.
The speaker mentions 'our theorem about images of connected sets under continuous functions'.
The exact statement of this previous theorem is not written on the board in this clip.
The image of a connected set under a continuous function is connected.
The domain set is connected.
The function is continuous.
For all connected sets and continuous functions.
The title explicitly states 'Example of a connected but not path-connected set'.
The instructor concludes, 'it turns out that it's connected, but it's not path-connected'.
The closed topologist's sine curve is a connected set, but it is not a path-connected set.
The set is defined as the union of the graph of for and the interval on the y-axis.
Universal for the defined set.
The whiteboard shows the start of a proof by contradiction: 'PF Suppose E disconnected by , . Then , '.
The speaker outlines the proof strategy: 'Suppose E is disconnected by U1 and U2... we'll just show that that's impossible because if you do that... you can take a point in one piece...'
The proof is cut off before completion.
Assume for the sake of contradiction that is disconnected.
Proof by contradiction setup.
By definition of disconnectedness, there exist non-empty, disjoint open sets and (relative to ) such that and , .
Definition of a disconnected set.
Choose a point in and a point in .
Existence of points in the non-empty intersections.
The proof is incomplete in the video, but the setup aims to show that a path between and would have to cross the gap between and , contradicting continuity or the definition of the separation.
The proof steps are written sequentially on the whiteboard.
Assume for contradiction that E is not connected.
Start of proof by contradiction.
By definition of disconnection, there must be points of E in both and .
Definition of disconnected set.
Since E is path-connected, there is a path between any two points in E.
Definition of path-connected set.
The image of the interval [a,b] under the continuous path is a subset of E and is connected.
Theorem on images of connected sets under continuous functions.
The sets and also disconnect the path because it contains points in both.
Properties of disconnection and subset relations.
We have a set that is both connected and disconnected.
Logical contradiction.
Therefore, the initial assumption that E is disconnected must be false.
Conclusion of proof by contradiction.
If E is path-connected, then E is connected.
The instructor explains that a path from a point on the oscillating curve to a point on the y-axis interval would require passing through an infinite number of oscillations, which is impossible for a continuous function on a closed interval.
Consider a point on the oscillating part of the curve (where ) and a point on the vertical segment on the y-axis (where ).
Setup for attempting to construct a path.
Any continuous path connecting these two points must traverse the region where the function oscillates infinitely often as approaches 0.
Visual observation of the graph's behavior near the y-axis.
Passing through an infinite number of oscillations in finite time (or over a closed interval domain for the path parameter) violates the continuity requirement for paths.
Standard topological argument regarding uniform continuity or bounded variation on compact intervals (implied by the instructor's 'not possible if it's a continuous function on a closed interval').
Therefore, no such continuous path exists, meaning the set is not path-connected.
The speaker mentions parametric curves in higher dimensional spaces as examples of paths.
Identify an example of a path in a specific metric space.
The metric space is .
Provide an example of a path in .
Consider parametric curves in higher-dimensional spaces.
These curves are continuous functions from a closed interval into .
Parametric curves in are examples of paths.
They fit the definition of a continuous function from [a,b] to S where .
Text: 'Example of a connected but not path-connected set: the closed topologist's sine curve in '.
A sketch of the topologist's sine curve is drawn.
Provide an example of a set that is connected but not path-connected.
The set is the closed topologist's sine curve in .
Illustrate the distinction between connectedness and path-connectedness.
Draw the oscillating curve approaching the y-axis and include the y-axis segment to make it closed.
Definition of the closed topologist's sine curve.
The closed topologist's sine curve is connected but not path-connected.
The visual sketch shows the set's structure, which intuitively prevents a continuous path from the origin to the oscillating part while maintaining overall connectedness.
The speaker draws a circle around the letter E in the formula : [a,b] .
The speaker says, 'So I'm going to circle that because that's important.'
The letter E in the formula
A circle is drawn around the letter E.
The rest of the formula remains unchanged.
Emphasizes that the path must map into the subset E itself, not just the larger metric space S.
The speaker erases the words 'connected' and 'path-connected' in the theorem statement and rewrites them in the reverse order.
The speaker says, 'Or sorry, sorry. I got this flipped. Ay ay ay.'
Text on whiteboard
'connected' and 'path-connected' swap positions in the implication.
The structure 'If is ..., then E is ...' remains.
The speaker realized he wrote the converse of the intended theorem and corrected it.
Handwritten text appears sequentially on the whiteboard, forming the proof.
Whiteboard
Handwritten text
Text is added line by line to construct the proof.
The camera angle remains fixed on the whiteboard and the speaker.
The sequential writing guides the viewer through the logical steps of the proof by contradiction.
A hand draws a coordinate system and then sketches the topologist's sine curve.
Coordinate axes
Oscillating curve
Vertical line segment
Axes are drawn first, followed by the curve and the vertical segment.
The drawing is a freehand sketch without precise mathematical plotting.
The sketch visually represents the set described in the example, showing its oscillatory behavior near the y-axis.
The instructor draws the axes and then sketches the oscillating curve for , showing increasing frequency as approaches 0.
x-axis
y-axis
Oscillating curve
Curve is drawn from right to left, getting denser near the y-axis.
Amplitude remains bounded between -1 and 1.
Visual representation of the function for .
The instructor shades/draws a thick vertical line segment on the y-axis between -1 and 1 and labels it 'add interval [-1, 1] on y-axis'.
y-axis segment from -1 to 1
Vertical segment is emphasized/added to the drawing.
Position on the y-axis ().
Completing the definition of the closed topologist's sine curve by including the limit points on the y-axis.
The speaker emphasizes circling the E because it's important that the path is in E.
Believing that a path connecting two points in a subset E only needs to map into the larger metric space S.
For E to be path-connected, the path must map entirely into the subset E, not just the ambient space S.
The speaker initially writes 'If E is connected, then E is path-connected' before correcting it.
One might assume that connectedness implies path-connectedness.
The speaker corrects this, stating that path-connectedness implies connectedness, but not vice versa.
The speaker introduces an example of a connected but not path-connected set immediately after proving the forward implication.
Assuming that if a set is connected, it must also be path-connected.
The closed topologist's sine curve is a standard counterexample showing that connectedness does not imply path-connectedness.
The instructor explicitly warns, 'It's not just the function... The actual set we're talking about is the graph of the function in .'
Thinking that topological properties like connectedness apply directly to the algebraic expression of the function rather than the geometric set of points forming its graph in the plane.
In this context, the object is the subset of consisting of points satisfying the equation, not the mapping .
The definition of path-connectedness uses the previously defined concept of a path.
The definition of a path-connected set relies on the prior definition of a path.
The theorem statement 'If E is path-connected, then E is connected' establishes a logical implication.
The definition of path-connectedness is the hypothesis of the theorem.
The speaker explicitly contrasts the two concepts by stating the converse is false.
The theorem shows one direction of implication, while the claim notes the lack of equivalence.
The instructor uses this example to show a set that is connected but fails to be path-connected.
This example demonstrates that the converse of 'path-connected implies connected' is false; a set can be connected without being path-connected.
The definition of a path is written on the board.
The definition of path-connectedness is written on the board.
The speaker circles the E in the formula.
Definition of a path is written on the board.
Speaker discusses the theorem and its converse.
The entire proof is written on the board.
The example is written and sketched.
Title: 'Example of a connected but not path-connected set'.
Explanation involving infinite oscillations preventing a continuous path.
Covered · Introduction to the lecture topic of path-connectedness and its intuitive connection to previous discussions on connectedness.
Covered · Formal definition of a path in a metric space and examples.
Covered · Formal definition of path-connectedness, emphasizing the target space of the path.
Covered · Definition of a path.
Covered · Definition of path-connectedness.
Covered · Statement of the theorem (including correction).
Covered · Discussion of the converse.
Covered · Start of the proof by contradiction.
Covered · Proof of Theorem 22.5: path-connected implies connected.
Covered · Introduction and sketch of the closed topologist's sine curve as a counterexample for the converse.
Covered · Drawing the graph of .
Covered · Defining the set and distinguishing graph from function.
Covered · Adding the interval on the y-axis to close the set.
Covered · Explaining why it is connected but not path-connected.
Covered · Lecture wrap-up and announcement of next lecture.
Reviewed English material v1: card "Definition of Path-Connectedness" at 2:10 — A subset of a metric space is path-connected if every pair of points in can be connected by a path that lies entirely within . The instructor emphasizes circling the target space to highlight that the path cannot leave the subset.
Reviewed English material v1: card "Proof by Contradiction: Path-connected to Connected" at 5:25 — The proof assumes the set is disconnected by open sets and . It finds points and in different sets, uses path-connectedness to create a path between them, and then shows this path's image must be both connected (by a previous theorem) and disconnected (by and ), yielding a contradiction.