Bourbaki

Definition 2

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

Topologie algébrique, chapter II, § 1. Carquois

Let C be a quiver. A path in C is a sequence c=(a0,f1,a1,...,an−1,fn,an)c= (a_0, f_1, a_1, . . . , a_{n-1}, f_n, a_n), where nn is an integer ⩾0,a0,...,an\geqslant 0,a_0, . . . , a_n are vertices of C, and where, for 1⩽i⩽n,fi1\leqslant i\leqslant n,f_i is an arrow of C joining ai−1a_{i-1} to aia_i. One says that the path cc is of length nn.

Let c=(a0,f1,a1,...,an−1,fn,an)c= (a_0, f_1, a_1, . . . , a_{n-1}, f_n, a_n) be a path of length nn in C. The vertex a0a_0 is called the origin, or the source, of cc; the vertex ana_n is called the term, or the end, of cc; one also says that cc joins the vertex a0a_0 to the vertex ana_n. The vertex aia_i, for 0⩽i⩽n0\leqslant i\leqslant n, is called the vertex of index ii; the arrow fif_i, for 1⩽i⩽n1\leqslant i\leqslant n, is called the ii-th arrow, or the arrow of index ii. A path of length ⩾1\geqslant 1 is determined by the sequence of its arrows.

A path whose origin is equal to the term is called a loop. A path of length 0 is a loop, called constant.

One says that paths

c=(a0,f1,a1,...,an−1,fn,an)c= (a_0, f_1, a_1, . . . , a_{n-1}, f_n, a_n) and c′=(a0′,f1′,a1′,...,am−1′,fm′,am′)c'= (a'_0, f'_1, a'_1, . . . , a'_{m-1}, f'_m, a'_m)

in C are juxtaposed if the term ana_n of cc is the origin a0′a'_0 of c′c'. In this case, the sequence (a0,f1,a1,...,an−1,fn,an,f1′,a1′,...,fm′,am′)(a_0, f_1, a_1, . . . , a_{n-1}, f_n, a_n, f'_1, a'_1, . . . , f'_m, a'_m) is a path in C which is denoted by c∗c′c*c' and is called the juxtaposed path of cc and c′c'. It joins the origin of cc to the term of c′c'; its length is the sum of the lengths of the paths cc and c′c'.

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.