Bourbaki

Proposition 8

Tag 022O, permanent. Cite it as [Bourbaki, Tag 022O].

Topologie algébrique, chapter IV, § 4. Théorie de la descente

Let X and Y be non-empty topological spaces and let ff be a continuous mapping of X into Y. Assume that the space X is locally arcwise connected, that the space Y is connected, and that the mapping ff is strict and surjective. Then the groupoid Coeg(ff) is transitive.

Let Γ be the quiver whose set of vertices is X and whose set of arrows is the sum set of Fl(ϖ(X)\varpi (X)) and X×YXX\times_YX, the origin and target mappings being those of ϖ(X)\varpi (X) on Fl(ϖ(X)\varpi (X)) and the mappings p1p_1 and p2p_2 on X×YXX\times_YX. By the definition of the framework of the pair (ϖ(\varpi(pr1_1),ϖ, \varpi(pr2_2)) (II, p. 185, Def. 3) and Remark 2 of II, p. 200, the set of orbits of Coeg(ff) is identified with the set of connected components of the quiver Γ. Since the space X is non-empty, it is enough to prove that the graph Γ is connected.

The connected components of Γ are saturated with respect to the equivalence relation “there exists a path joining xx to x′x'”, and therefore are open in X, since X is locally arcwise connected. They are then also closed. They are also saturated with respect to the equivalence relation R defined by ff. By hypothesis, the mapping ff induces a homeomorphism of X/RX/R onto Y, so that the image under ff of every connected component of Γ is an open and closed subset of Y, and therefore is equal to Y since the space Y is assumed connected.

Let C be a connected component of Γ, and let xx be a point of X. From the preceding, there exists a point x′∈Cx'\in C such that f(x′)=f(x)f(x') =f(x). By definition of the quiver Γ, we have x′∈Cx'\in C. Thus C = X and the quiver Γ is therefore connected.

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.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.