I was reading Munkres' proof that topologist's sine curve is not path connected. What confused me was why he bothered to reduce the path $f:[a,c]\to\bar{S}$ to $f:[b,c] \to \bar{S}$. As is understood by me, it is to assure that $x(t)\gt0$ for $t>b$, so that one can always choose $u$ with $0 < u < x(1/n)$ for arbitrary large $n$. To put it in another way, the crucial point is to use the right discontinuity of the point $b$. Is that so? What if one proceed with the entire path instead? Thanks in advance!
2026-03-27 16:55:30.1774630530
Munkres' proof that topologist's sine curve is not path connected
202 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in GENERAL-TOPOLOGY
- Is every non-locally compact metric space totally disconnected?
- Let X be a topological space and let A be a subset of X
- Continuity, preimage of an open set of $\mathbb R^2$
- Question on minimizing the infimum distance of a point from a non compact set
- Is hedgehog of countable spininess separable space?
- Nonclosed set in $ \mathbb{R}^2 $
- I cannot understand that $\mathfrak{O} := \{\{\}, \{1\}, \{1, 2\}, \{3\}, \{1, 3\}, \{1, 2, 3\}\}$ is a topology on the set $\{1, 2, 3\}$.
- If for every continuous function $\phi$, the function $\phi \circ f$ is continuous, then $f$ is continuous.
- Defining a homotopy on an annulus
- Triangle inequality for metric space where the metric is angles between vectors
Related Questions in PROOF-EXPLANATION
- (From Awodey)$\sf C \cong D$ be equivalent categories then $\sf C$ has binary products if and only if $\sf D$ does.
- Help with Propositional Logic Proof
- Lemma 1.8.2 - Convex Bodies: The Brunn-Minkowski Theory
- Proof of Fourier transform of cos$2\pi ft$
- Total number of nodes in a full k-ary tree. Explanation
- Finding height of a $k$-ary tree
- How to get the missing brick of the proof $A \circ P_\sigma = P_\sigma \circ A$ using permutations?
- Inner Product Same for all Inputs
- Complex Derivatives in Polar Form
- Confused about how to prove a function is surjective/injective?
Related Questions in CONNECTEDNESS
- Estimation of connected components
- decomposing a graph in connected components
- Proving that we can divide a graph to two graphs which induced subgraph is connected on vertices of each one
- Does every connected topological space have the property that you can walk around a finite open cover to get from any point to any other?
- A set with more than $n$ components has $n+1$ pairwise separated subsets.
- Can connectedness preservation be used to define continuity of a function?
- Prove the set is not connected
- Related the property of two points contained in the same component
- Is a connected component a group?
- f is a continuous function from (X,$\tau$) to {0,1} with discrete topology, if f non constant then (X,$\tau$) disconnected
Related Questions in PATH-CONNECTED
- Why the order square is not path-connected
- Prove that $\overline S$ is not path connected, where $S=\{x\times \sin(\frac1x):x\in(0,1]\}$
- Is the Mandelbrot set path-connected?
- Example of a topological space that is connected, not locally connected and not path connected
- Example of path connected metric space whose hyperspace with Vietoris topology is not path connected?
- Proof explanation to see that subset of $\mathbb{R}^2$ is not path connected.
- Connectedness and path connectedness of a finer topology
- Show that for an abelian countable group $G$ there exists a compact path connected subspace $K ⊆ \Bbb R^4$ such that $H_1(K)$ isomorphic to $G$
- Is there a better way - space is not path connected
- How to construct a path between two points in a general $n-surface$?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?

From a purely logical standpoint, Munkres' reduction is not needed.
Let $g(x)=\sin(1/x)$, $0<x\leq 1$. Let $S(x)=(x,g(x))$, the graph of $g$. The key fact is that for any $x_0>0$, there are infinitely many values of $x$ between $0$ and $x_0$ with $g(x)=1$, and with $g(x)=-1$.
Say $f:[a,c]\to\overline{S}$ is a path connecting $(0,0)$ to some point in $S$. Let $f(t)=(x(t),y(t))$ with $x(a)=0$ and $x(c)=x_0>0$. Set $t_0=c$, and inductively define a sequence $t_0>t_1>\ldots >a$ with $x(t_n)=x_n$ and $g(x_n)=(-1)^n$ for all $n\geq 1$. The mere existence of such a sequence shows that $t\mapsto g(x(t))$ cannot be a continuous function, since $t_n$ must have a limit greater than or equal to $a$, but $g(x(t_n))$ cannot have a limit. If $t\mapsto g(x(t))$ is not continuous, then $t\mapsto (x(t),g(x(t))=f(t)$ isn't either.
The sequence $\{t_n\}$ can be defined inductively. Suppose $t_{n-1}$ has been defined. We know that there is an $x$-coordinate, say $u$, such that $g(u)=(-1)^n$ and $0<u<x_{n-1}$. Now we just need a time-coordinate to go with it: a $t_n$ such that $a<t_n<t_{n-1}$ and $x(t_n)=u$. But $u$ is between $0=x(a)$ and $x_{n-1}=x(t_{n-1})$, so by the intermediate value theorem, $x(t_n)=u$ for some $t_n$ inbetween $a$ and $t_{n-1}$.
This is basically Munkres' argument. The fact that $f$ might not move for awhile--that $f(t)$ might be stationary between $a$ and some $b>a$--turns out to be irrelevant to the logic. However, I do think that Munkres' argument is more appealing from a visual standpoint.