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, is a groupoid.
By construction, one has the relation , for every pair of juxtaposed paths in G. Every arrow of is of the form , where is a path in G. It follows that the law of composition of is associative and that is an identity element at , for every vertex of . It remains to prove that every arrow of is invertible. Let be a path in G, and let us prove by induction on the length of that one has . This equality is true if is of length 0. If is of length , we may write , with of length 1 and of length . Then, and one has
by definition of the relation .
Applying this equality to the path , we see that . Thus, is invertible, with inverse .
The equivalence classes of the relation are called the path classes in the graph G; the groupoid 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 the mapping which associates with an arrow of G the class of the path of G. The pair = (Id) is a morphism, called canonical, of quivers from G into . Its image generates ; for every arrow of G, one has .
Let G and be graphs, let be a graph morphism. Let us denote by and the canonical morphisms. If is a path in G, the class of the path depends only on the class of . Thus, by passing to equivalence classes, one defines a quiver morphism such that . 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.