Vertex groups of free groupoids are free #
The last step of Lemma 4.2 (lem:mesh-walk-free, scalar-normalization.tex):
"Contracting spanning trees gives a graph. Its edges outside a spanning tree
freely generate the fundamental group." Mathlib proves this for a connected
free groupoid (IsFreeGroupoid.endIsFreeOfConnectedFree, by a spanning tree).
Here the free groupoid on any quiver is shown to be free in Mathlib's sense, and
the vertex group at X₀ is identified with the vertex group of the free
groupoid on the connected component of X₀.
The free groupoid on a quiver is a free groupoid.
Reachability by zigzags of arrows.
Instances For
The connected component of X₀, as a full subquiver.
Instances For
The base point of the component.
Instances For
The inclusion of the component.
Instances For
The induced functor of free groupoids.
Instances For
Instances For
Injectivity: conjugating back to the base point #
The vertex group at the base point.
Instances For
The underlying vertex of an object.
Instances For
Conjugation to the base point, as a functor to the vertex group.
Instances For
A vertex of the component.
Instances For
The labelling of the arrows of U by conjugated loops.
Instances For
The functor F of the labelling.
Instances For
Surjectivity: walks from the component stay in it #
The class of a walk in the free groupoid.
Instances For
Vertex groups of free groupoids are free (the spanning-tree step of Lemma 4.2).