Bourbaki

Proposition 11

Tag 01XD, permanent. Cite it as [Bourbaki, Tag 01XD].

Topologie algébrique, chapter III, § 2. Homotopie et chemins

A connected and locally connected topological space, whose topology can be defined by a distance for which it is complete, is connected by arcs.

Let X be a topological space. Call a train in X any nonempty finite sequence T=(Wi)1⩽i⩽nT = (W_i)_{1\leqslant i\leqslant n} of connected open subsets of X such that Wi∩Wi+1=∅̸W_i\cap W_{i+1}=\not\emptyset for 1⩽i⩽n−11\leqslant i\leqslant n-1. We say that nn is the length of the train T and that the WiW_i are its wagons. If X is endowed with a distance compatible with its topology, we call the width of the train T the maximum of the diameters of its wagons. We say that the train joins a point aa to a point bb if aa belongs to the first and bb to the last wagon. We call a refinement of T any pair (T′,f)(T', f) formed by a train T′=(Wj′)1⩽j⩽mT'= (W'_j)_{1\leqslant j\leqslant m} and a strictly increasing mapping f:{0,1,...,n}→{0,1,...,m}f:\{0,1, . . . , n\} \rightarrow \{0,1, . . . , m\} such that f(0)=0,f(n)=mf(0) = 0,f(n) =m and Wj′⊂WiW'_j\subset W_i for 1⩽i⩽n1\leqslant i\leqslant n and f(i−1)<j⩽f(i)f(i-1)< j\leqslant f(i).

Bourbaki sets the proof directly after the statement, and the corpus does not separate them, so what is above is the statement and its proof together.

Cited by

Nothing.

Cites

Nothing.

Machine translation of the English, by gpt-5-6-mini, gpt-5-mini, gpt-5-6, gpt-5.4, against glossary version 34. Not checked by a person. That model is a cut down version of the one the rest of this language was written by.