Bourbaki

Lemma 8

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

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

The set U\mathscr{U}, ordered by inclusion, is inductive.

Let V\mathscr{V} be a totally ordered subset of U\mathscr{U}. Let us prove that the union V of the sets belonging to V\mathscr{V} is an element of U\mathscr{U}, that is to say that, for every connected component ]u,v[]u, v[ of V, one has f(u)=f(v)f(u) =f(v).

Let xx be a point of ]u,v[]u, v[. Let Vx\mathscr{V}_x be the set of the U∈VU\in \mathscr{V} such that x∈Ux\in U; for such a U, denote by ]uU,vU[]u_U, v_U[ the connected component of xx in U. One has uU′⩽uU<vU⩽vU′u_{U'}\leqslant u_U< v_U\leqslant v_{U'} if U and U′U' are elements of Vx\mathscr{V}_x such that U⊂U′U\subset U'. Since the union for U∈UxU\in \mathscr{U}_x of the ]uU,vU[]u_U, v_U[ is equal to ]u,v[]u, v[ according to Lemma 7 of III, p. 280, one has u=u= lim uUu_U and v=v= lim vUv_U, where the limits are taken following the filtered set Vx\mathscr{V}_x. Since the mapping ff is continuous and the topological space X is separated, the equalities f(uU)=f(vU)f(u_U) =f(v_U) for every U∈VxU\in \mathscr{V}_x imply that f(u)=f(v)f(u) =f(v), which was to be proved.

By virtue of E, III, p. 20, Th. 2, there exists an open subset U belonging to U\mathscr{U} which is maximal for the relation of inclusion.

Let g:I→Xg:\mathbf{I}\rightarrow X be the mapping defined as follows. If t∉Ut\notin U, we put g(t)=f(t)g(t) =f(t); otherwise, denoting by ]u,v[]u, v[ the connected component of tt in U, we put g(t)=f(u)=f(v)g(t) =f(u) =f(v), so that the mapping g∣[u,v]g|[u, v] is constant with image f(u)f(u).

Prop. 18 follows from the following lemma.

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.