Bourbaki

Proposition 4

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

Topologie algébrique, chapter II, § 3. Groupoïdes

Endowed with this law of composition, ϖG\varpi_G is a groupoid.

By construction, one has the relation φ(cc′)=φ(c)φ(c′)\varphi (cc') =\varphi (c)\varphi (c'), for every pair of juxtaposed paths (c,c′)(c, c') in G. Every arrow of ϖG\varpi_G is of the form φ(c)\varphi (c), where cc is a path in G. It follows that the law of composition of ϖG\varpi_G is associative and that φ(ea)\varphi (e_a) is an identity element at aa, for every vertex aa of ϖG\varpi_G. It remains to prove that every arrow of ϖG\varpi_G is invertible. Let cc be a path in G, and let us prove by induction on the length of cc that one has φ(c)φ(c‾)=φ(eo(c))\varphi (c)\varphi (\overline{c}) =\varphi (e_{o(c)}). This equality is true if cc is of length 0. If cc is of length n⩾1n\geqslant 1, we may write c=c1c2c=c_1c_2, with c1c_1 of length 1 and c2c_2 of length n−1n-1. Then, c‾=c2‾c1‾\overline{c}=\overline{c_2}\overline{c_1} and one has

φ(c)φ(c‾)=φ(c1)φ(c2)φ(c2‾)φ(c1‾)=φ(c1)φ(eo(c2))φ(c1‾)=φ(c1)φ(c1‾) \varphi (c)\varphi (\overline{c}) =\varphi (c_1)\varphi (c_2)\varphi (\overline{c_2})\varphi (\overline{c_1}) =\varphi (c_1)\varphi (e_{o(c_2)})\varphi (\overline{c_1}) =\varphi (c_1)\varphi (\overline{c_1})
=φ(c1c1‾)=φ(eo(c1)) =\varphi (c_1\overline{c_1}) =\varphi (e_{o(c_1)})

by definition of the relation R\mathscr{R}.

Applying this equality to the path c‾\overline{c}, we see that φ(c‾)φ(c)=\varphi (\overline{c})\varphi (c) = φ(et(c))\varphi (e_{t(c)}). Thus, φ(c)\varphi (c) is invertible, with inverse φ(c‾)\varphi (\overline{c}).

The equivalence classes of the relation R\mathscr{R} are called the path classes in the graph G; the groupoid ϖG\varpi_G is called the groupoid of path classes of the graph G. It has the same set of vertices as G, and its orbits are the connected components of the graph G.

Let us denote by vv the mapping which associates with an arrow ff of G the class of the path (o(f),f,t(f))(o(f), f, t(f)) of G. The pair jj = (IdSom(G),v_{Som(G)}, v) is a morphism, called canonical, of quivers from G into ϖG\varpi_G. Its image generates ϖG\varpi_G; for every arrow ff of G, one has j(f‾)=j(f)−1j(\overline{f}) =j(f)^{-1}.

Let G and G′G' be graphs, let φ:G→G′\varphi : G\rightarrow G' be a graph morphism. Let us denote by j:G→ϖGj: G\rightarrow \varpi_G and j′:G′→ϖG′j': G'\rightarrow \varpi_{G'} the canonical morphisms. If c=(a0,f1,a1,...,an)c= (a_0, f_1, a_1, . . . , a_n) is a path in G, the class of the path φ(c)=(φ(a0),φ(f1),φ(a1),...,φ(an))\varphi (c) = (\varphi (a_0), \varphi (f_1), \varphi (a_1), . . . , \varphi (a_n)) depends only on the class of cc. Thus, by passing to equivalence classes, one defines a quiver morphism ϖ(φ):ϖG→ϖG′\varpi (\varphi ):\varpi_G\rightarrow \varpi_{G'} such that ϖ(φ)∘j=j′∘φ\varpi (\varphi )\circ j=j'\circ \varphi. It is a groupoid morphism.

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.4, against glossary version 34. Not checked by a person.