Codex @codex  0

A topological space $X$ is connected when it has no separation of a topological space: no partition of a set into two nonempty open subsets $U,V$ satisfyingHere the union covers all of $X$, and the intersection is the empty set, so no point belongs to both pieces. For a subset $X$ of a larger topological space, "open" means open in the subspace topology: each piece is the intersection of $X$ with an ambient open set. Both pieces must be open; merely dividing a drawing into two colours does not establish a separation of a topological space. ^[ref]

For example, the closed interval $I=[0,1]$ with its usual subspace topology from the real line is connected. The proposed split $[0,1/2)\cup [1/2,1]$ fails: the second subset is not open in $I$, since every neighbourhood of $1/2$ in $I$ contains points less than $1/2$. More generally, a connected subset of the real line is precisely a real interval. In contrast, for the unionthe open intervals $(-3,0)$ and $(0,3)$ exhibit $U,V$ as nonempty open subsets in the subspace topology of $D$. Their intersection is empty and their union is $D$, so $D$ is not connected. Although $U,V$ are closed intervals in the real line, they are also open within $D$.

Why is connectedness useful? A continuous image of a connected space is connected: a proposed separation of a topological space in the image would pull back through the continuous map to a forbidden separation of a topological space in its source. Thus a continuous map from a real interval to the real line cannot skip values between two attained values. This is the intermediate value theorem. For a computed example, the continuous function $f(x)=x^2$ on $[0,1]$ has image $[0,1]$; the value $1/2$ occurs at $x=1/\sqrt{2}\approx 0.707107$. Connectedness guarantees an input attaining that value even when we have no formula for it.

Path connectedness is a stronger condition: it supplies a continuous path between every pair of points. The topologist's sine curve below shows that a connected space need not be a path-connected space.

In the usual subspace topology from the real line, a subset $A\subseteq \mathbb{R}$ is connected exactly when it has the defining property of a real interval:Every real number between two members must be present. Thus open intervals, closed intervals, intervals with only one endpoint included, and unbounded real intervals are connected. Singleton sets are connected too. With the no-separation of a topological space convention used here, the empty set satisfies the same property; some texts reserve the word connected for nonempty topological spaces.^[ref]

Removing an interior point changes the answer:These two real intervals are exactly its connected components and its path components. Removing an endpoint instead leaves a real interval, for example $[-2,2]\setminus \{2\}=[-2,2)$, which stays connected. This is why an interior point of a closed interval is a cut point, whereas an endpoint is not. A nonempty finite set of points in the real line is connected exactly when it is a singleton set.

Proof outline: if $a,b\in A$ but $c\in (a,b)$ is missing, the subsetsgive a separation of a topological space, since the two open intervals make both pieces open in $A$. Conversely, a nonempty real interval contains the continuous path $t\mapsto (1-t)a+tb$ between any two of its points, so it is path-connected and hence connected. Together with continuous image of a connected space, this characterization gives the intermediate value theorem: a continuous function on a real interval cannot jump over a value lying between two attained values.

If $f:X\to Y$ is continuous and $X$ is path-connected, then $f(X)$ is path-connected. Choose preimages of any two image points and a continuous path between them in $X$. Its composition with $f$ supplies the required path inside $f(X)$. The conclusion uses the subspace topology on the image, not an assumption that $f$ maps onto the whole codomain.

An edge path in a simplicial complex is a finite sequence of vertices of a simplicial complex such that $\{v_i,v_{i+1}\}$ is a simplex for each consecutive pair. Repeated consecutive vertices are allowed. Its geometric realization is a continuous path formed by traversing the corresponding line segments, with constant pieces for repetitions.

A connected geometric realization has an edge path between any two vertices. For a fixed vertex, the reachable vertices form a union of whole simplexes: all vertices of a simplex are pairwise joined by edges. The reachable and unreachable geometric parts therefore intersect each simplex in either the whole simplex or the empty set. Both parts are closed in the realization topology and are complements, so both are open. Connectedness forces the unreachable part to be empty. Conversely, edge paths between vertices and straight segments inside simplexes join arbitrary points, so the realization is path-connected.

A metric space in which every two points are joined by a metric geodesic segment. Equivalently, they admit a continuous path whose metric path length equals their distance. In this general setting no Riemannian metric or covariant derivative is required.

A continuous path with finite arc length on every compact parameter interval. Families of such paths are used in the measurable-density definition of extremal length.

For a continuous path $\gamma :[a,b]\to X$ in a metric space, take the supremum over finite partitions $a=t_0<\cdots <t_n=b$ of ${\sum }_{i=1}^{n}d(\gamma (t_i),\gamma (t_{i-1}))$. This definition allows $+\infty$ and needs no derivative. A metric geodesic parametrized on $[a,b]$ has length $b-a$. In a Riemannian manifold, it agrees with the usual arc length integral for a smooth curve.

The monodromy theorem says that, when analytic continuation exists throughout a domain, its ambiguity depends on homotopy. Let $D\subset \mathbb{C}$ be a domain, $a\in D$, and $g_a$ a germ of a holomorphic function at $a$. Assume $g_a$ admits analytic continuation along every continuous path in $D$ starting at $a$. Two such paths ending at $b$ give the same terminal germ of a holomorphic function if they are homotopic with endpoints fixed in $D$. ^[ref]

Here a homotopy with endpoints fixed is a continuous map $H:[0,1{]}^2\to D$ satisfyingEvery intermediate path must stay in $D$. Equality means agreement on a neighbourhood of $b$, rather than merely equal values at $b$. ^[ref]

The identity theorem provides local rigidity; the monodromy theorem shows precisely how topology controls the remaining global freedom. Deforming a route without crossing a forbidden point cannot change the resulting germ of a holomorphic function. Thus a complicated analytic continuation calculation can be replaced by one on a simpler homotopic route. Distinct homotopy classes can still give the same continuation: a rational function on its domain already gives a single-valued answer along every route, even around a pole.

Let $\mathcal{A}$ be the closure of the polynomials in $C(K)$ for the uniform norm. It is a closed algebra, since products of uniformly convergent sequences converge uniformly on the compact set $K$.

Choose a point $W$ with $|W|>{\sup }_{z\in K}|z|$. The uniformly convergent geometric seriesshows that this reciprocal belongs to $\mathcal{A}$. Join $w$ to $W$ by a continuous path in $\mathbb{C}\setminus K$. Its image is compact and disjoint from $K$, so their distance $d$ is positive. Partition the path into finitely many steps shorter than $d/2$.

Suppose $1/(b-z)\in \mathcal{A}$ and $|a-b|<d/2$, with $b$ on the path. Thenconverges uniformly on $K$, since $|b-z|\ge d$. Every partial sum belongs to $\mathcal{A}$, by its algebra property, and so does the limit. Working backwards along the partition transfers the pole from $W$ to $w$. Thus $1/(w-z)\in \mathcal{A}$: a polynomial $P$ exists withThis pole-moving polynomial approximation is the elementary mechanism behind the polynomial Runge theorem.

A standard one-dimensional Brownian motion is a real-valued stochastic process $(B_t{)}_{t\ge 0}$ satisfying $B_0=0$ almost surely, having continuous paths almost surely, and having independent increments withHere $N(0,t-s)$ is the normal distribution with zero expected value and variance $t-s$. Thus the increments are also stationary increments.

If Brownian motion is defined relative to a specified filtration $({\mathcal{F}}_t)$, additionally require that it is an adapted process and that $B_t-B_s$ is independent of ${\mathcal{F}}_s$. For its natural filtration, this follows from independent increments. These are the defining properties of standard Brownian motion.

Fix an integer $k\ge 1$ and consider the independent incrementsFor fixed $k$ these are independent and identically distributed random variables with the normal distribution $N(0,1/k)$, so $p_k=\mathbb{P}(|{\Delta }_{j,k}|>1)>0$. The second Borel-Cantelli lemma gives $|{\Delta }_{j,k}|>1$ for infinitely many $j$, almost surely. Intersecting these probability-one events over the countably many $k$ preserves probability one.

On any path in this intersection, uniform continuity on $[0,\infty )$ would give some $\delta >0$ such that $|B_t-B_s|<1$ whenever $|t-s|<\delta$. Choosing $k$ with $1/k<\delta$ contradicts the existence of an increment $|{\Delta }_{j,k}|>1$. Therefore Brownian paths are not uniformly continuous on the half-line:The event is measurable: for continuous paths, uniform continuity can be tested by countably many pairs of nonnegative rational numbers and tolerances $1/m$. Brownian motion has uniform continuity on every compact time interval, but almost surely fails it on the whole half-line.

For each $k$, the coordinate projectionis continuous when $\mathbb{Z}$ has the discrete topology: if $d(x,y)<2^{-k}$, then $x_k=y_k$.

If $\gamma :[0,1]\to X$ were a continuous path, then ${\pi }_k\circ \gamma$ would be a continuous map from the connected interval $[0,1]$ to a discrete space, so it would be constant. This holds for every $k$, and therefore $\gamma$ itself must be constant. Since $X$ contains distinct points, no path joins every pair. Henceindeed, every path component is a singleton.

The implicit function theorem states that if $F(x_0,y_0)=0$ and the partial derivative $D_{y}F(x_0,y_0)$ is an invertible linear map, then near $(x_0,y_0)$ the zero set of $F$ is uniquely the graph $y=g(x)$ of a continuously differentiable function.

If $f$ is a differentiable bijection with differentiable inverse $g$, the chain rule applied to $g\circ f$ and $f\circ g$ givesThus $D{f}_x$ is an isomorphism with inverse $D{g}_{f(x)}$.

If a continuously differentiable map $F:{\mathbb{R}}^n\to {\mathbb{R}}^n$ has invertible derivative everywhere, the inverse function theorem makes it a local diffeomorphism. In particular it is an open map, so its image is open. Its image need not be closed: $x\mapsto \arctan x$ has nonzero derivative everywhere and image $(-\pi /2,\pi /2)$.

For the given map of elementary symmetric polynomials,and direct evaluation of the determinant givesHence the critical set isIts complement is the Zariski-open set on which the three coordinates are pairwise distinct. Each point has one of the six possible strict coordinate orderings, and each ordering defines a nonempty convex open region. A continuous path cannot change an ordering without crossing $C$. Therefore ${\mathbb{R}}^3\setminus C$ has exactlyconnected components.

A space is path-connected if for every pair $x_0,x_1$ it contains a continuous path $\gamma :[0,1]\to X$ with $\gamma (0)=x_0$ and $\gamma (1)=x_1$. For any $y_0,y_1\in f(X)$ choose preimages $x_0,x_1$. A path between those preimages maps to $f\circ \gamma$, a continuous path from $y_0$ to $y_1$ staying in $f(X)$. Thus a continuous image of a path-connected space is path-connected. Surjectivity onto the ambient codomain $Y$ is not needed; the conclusion concerns $f(X)$.

The answers, in the order completeness, sequential compactness, connectedness, and path connectedness, areDefine $F(0)=0$ and $F(x)=\sqrt{x}\sin (1/x)$ for $x>0$. The estimate $|F(x)|\le \sqrt{x}$ proves continuity at zero by the squeeze theorem; elsewhere it follows from the usual continuous functions. Thus $X$ is the graph of a function $F$ on the closed set $[0,\infty )$.

To check closedness directly, if $(x_n,F(x_n))\to (x,y)$ in the Euclidean plane, then $x\ge 0$ and continuity gives $y=F(x)$. Therefore $X$ is a closed subset of the complete metric space ${\mathbb{R}}^2$, hence is a complete metric space. The sequence $(n,F(n))$ has no convergent subsequence, since its first Cartesian coordinates tends to infinity, so sequential compactness fails.

For any two points $(u,F(u)),(v,F(v))$, the mapis a continuous path in $X$ joining them. Thus $X$ is path-connected, and consequently connected. The factor $\sqrt{x}$ is crucial: the oscillations shrink to the single point $(0,0)$.

The answers areWrite $M_n(f,g)={\sup }_{0\le t\le n}|f(t)-g(t)|$. The given metric describes locally uniform convergence: $d(f_j,f)\to 0$ if and only if $M_n(f_j,f)\to 0$ for every fixed $n$. Indeed,so convergence in $d$ forces $M_n\to 0$. Conversely, split the defining series at $N$: its tail is at most ${\sum }_{n>N}{2}^{-n}=2^{-N}$, and its finitely many initial terms tend to zero.

If $(f_j)$ is a Cauchy sequence in $d$, the same single-term estimate makes it a Cauchy sequence in the supremum norm on every $[0,n]$. The completeness of the continuous-map space in the uniform metric gives a continuous function $F_n$ on $[0,n]$ with $f_j\to F_n$ uniformly there. Uniqueness of the limit of a sequence gives $F_{n+1}{|}_{[0,n]}=F_n$, so these functions define a single continuous function $f$ on $[0,\infty )$. The preceding finite-head and tail argument proves $d(f_j,f)\to 0$. Thus the space is complete.

The constant functions $f_j(t)=j$ have $d(f_j,f_k)=1$ whenever $j\ne k$. They have no convergent subsequence, so the space is not sequentially compact.

For fixed $f,g$, set $\gamma (s)=(1-s)f+sg$. On $[0,n]$,as $s^{\prime }\to s$. The equivalence with locally uniform convergence proves that $\gamma$ is a continuous path for $d$. Hence the space is path-connected and connected.

The product topology on $X\times Y$ has the open rectangles $U\times V$, with $U$ open in $X$ and $V$ open in $Y$, as a topological basis. The projection preimages are $p_X^{-1}(U)=U\times Y$ and $p_Y^{-1}(V)=X\times V$, so both projections are continuous.

If $f:Z\to X\times Y$ is continuous, both coordinate compositions are continuous. Conversely, if both are continuous, thenis open for every basic rectangle, proving continuity of $f$. Given paths between two chosen endpoints in each factor, their coordinatewise pair is therefore a continuous path in the product, proving that a product of path-connected spaces is path-connected.

For the compact-neighborhood assertion, fix $x\in K$. For each $y\in L$, choose an open rectangle $U_y\times V_y$ containing $(x,y)$ inside $W$. Compactness of $L$ chooses finitely many $V_{y_j}$ covering $L$. PutThen $x\in U_x$, $L\subseteq V_x$, and $U_x\times V_x\subseteq W$: any point of $V_x$ belongs to one of those rectangles' second factors, while $U_x$ lies in every first factor.

Compactness of $K$ now selects finitely many $U_{x_i}$ covering $K$. SetThese are open, contain $K$ and $L$, and if $(u,v)\in U\times V$, choose an $i$ with $u\in U_{x_i}$ and use $v\in V_{x_i}$. HenceIf $K$ or $L$ is empty, take the corresponding open factor empty and the other factor the whole space; the assertions then hold directly. No Hausdorff assumption on the factors is needed.

The sphere $S^2$ is path-connected. For $u,v\in S^2$ which are not an antipodal pair, a continuous path isThe denominator never vanishes: a zero would make $u$ and $v$ antipodal. If $v=-u$, choose a unit vector $w$ perpendicular to $u$ and concatenate the paths from $u$ to $w$ and from $w$ to $v$ of the same form. Thus $S^2$ is connected. The quotient map $q_S$ is continuous and surjective, so the continuous image of a connected space theorem proves that ${\mathbb{RP}}^2$ is connected. In fact composing the paths above with $q_S$ also proves path connectedness.

Removing $1/2$ from the closed interval $I=[0,1]$ leaves the separation of a topological spaceThus $1/2$ is a cut point of $I$.

In contrast, removing any point $p$ from the square $Q=[0,1{]}^2$ leaves a path-connected space. To prove this, take distinct $u,v\in Q\setminus \{p\}$. Choose an interior point $w$ outside the two lines through $(u,p)$ and $(v,p)$. Such a choice exists: a small circle in the interior meets each of those lines in at most two points. Since $Q$ is a convex set, the line segments $[u,w]$ and $[w,v]$ stay in $Q$; our choice of $w$ ensures that both avoid $p$. Their concatenation is a continuous path from $u$ to $v$ in $Q\setminus \{p\}$.

The product topology on $I\times I$ agrees with its usual subspace topology in the Euclidean plane. If $h:Q\to I$ were a homeomorphism, its restriction would give a homeomorphismThe domain is connected, since path connectedness implies connectedness, while the target is not connected. This contradicts the preservation of connectedness by a homeomorphism.

A path component of a topological space $X$ is a nonempty subset maximal among its path-connected subsets. The path component through $x$ can be described asEvery point along such a continuous path also belongs to $P_x$: the initial part of the path reaches that point. Thus the paths witnessing membership stay inside $P_x$. This makes path components useful for deciding which allowed positions can be reached from one another by continuous motion.

Every path component lies inside one connected component, because every path-connected space is connected. Thus each connected component is a union of path components. In a locally path-connected space the two classifications agree, by connected locally path-connected spaces are path-connected. For a subset of the real line with its usual subspace topology, the classifications also agree: every connected component is a real interval, and interpolation supplies a continuous path within it.

The topologist's sine curve shows why the distinction matters in general. Use specifically the closed versionwith the subspace topology from the usual Euclidean plane. It has one connected component, $T$, but two path components, $G$ and $L$. The graph of a function $G$ is a continuous image of a connected space, and its closure is $T$, so closure of a connected set gives connectedness. Each of $G,L$ is path-connected, but a continuous path crossing from $L$ into $G$ would force its second coordinate to oscillate between $1$ and $-1$ arbitrarily near its departure time, contradicting continuity; the topologist's sine curve article gives the short argument. Also $G$ is not closed in $T$, so path components need not be closed, unlike connected components.^[ref]

Being joined by a continuous path is an equivalence relation. Proof outline: the constant path joins a point to itself; $t\mapsto \gamma (1-t)$ reverses a path; and a path from $x$ to $y$ followed by one from $y$ to $z$ gives a path from $x$ to $z$. For the last construction, run each path on half of $[0,1]$; their values agree at $1/2$, so the pasting lemma for closed subspaces gives continuity. The equivalence classes are path-connected, are maximal, and form a partition of a set of $X$ into path components.^[ref]