Bourbaki

Theorem 3

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

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

Let X be a delaceable topological space and let G be a discrete group operating properly in X; let f:X→X/Gf: X\rightarrow X/G be the canonical surjection. The canonical morphism of groupoids ϖ′′(f):ϖ(X)/G→ϖ(X/G)\varpi ''(f):\varpi (X)/G\rightarrow \varpi (X/G) introduced above is an isomorphism.

Let Coeg(ff) denote the coequalizer of the two morphisms of groupoids from ϖ(X×YX)\varpi (X\times_YX) to ϖ(X)\varpi (X) induced by the projections pr1_1 and pr2_2; let γ:ϖ(X)→\gamma :\varpi (X)\rightarrow Coeg(ff) be the canonical morphism of groupoids. Since the image of the mapping (m(m, pr2):G×X→X×X_2): G\times X\rightarrow X\times X is the subspace X×YXX\times_YX of X×XX\times X, the two morphisms of groupoids γ∘ϖ(m)\gamma \circ \varpi (m) and γ∘ϖ\gamma \circ \varpi(pr2_2), from ∣G∣×ϖ(X)|G|\times \varpi (X) to Coeg(ff), are equal. By the universal property of ϖ(X)/G\varpi (X)/G, there exists a unique morphism of groupoids α:ϖ(X)/G→\alpha :\varpi (X)/G\rightarrow Coeg(ff) such that γ=α∘β\gamma =\alpha \circ \beta.

Let also ϖ′(f)\varpi '(f) denote the unique morphism of groupoids from Coeg(ff) to ϖ(Y)\varpi (Y) such that ϖ(f)=ϖ′(f)∘γ\varpi (f) =\varpi '(f)\circ \gamma. By IV, p. 399, Example 2, the hypotheses of Theorem 1 of IV, p. 398 are satisfied and the morphism ϖ′(f)\varpi '(f) is an isomorphism. Since

ϖ(f)=ϖ′(f)∘γ=ϖ′(f)∘α∘β=ϖ′′(f)∘β \varpi (f) =\varpi '(f)\circ \gamma =\varpi '(f)\circ \alpha \circ \beta =\varpi ''(f)\circ \beta

we have ϖ′′(f)=ϖ′(f)∘α\varpi ''(f) =\varpi '(f)\circ \alpha. Thus, to prove Theorem 3, it is enough to prove that the morphism α\alpha is an isomorphism.

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.