The mesh complex K and its collapse #
Subsection 4.1 (subsec:mesh-walk-cover, scalar-normalization.tex):
"For every nonprojective vertex X, adjoin an edge t_X : τX → X to the
underlying graph of Γ. For each arrow a : Y → X with X nonprojective,
attach a triangle with boundary (σa) a t_X⁻¹." Its fundamental groupoid is
Morse.Pi (meshTris Q).
The proof of Lemma 4.2 (lem:mesh-walk-free, lines 96–113) eliminates edges
and triangles. Here the eliminations are an acyclic matching (meshMatching):
- an arrow whose mate orbit is a finite chain is eliminated with its own
triangle, from the end of the chain ("Along a chain, the triangles
successively express all but one quiver edge in terms of that edge and the
edges
t_X. Eliminate these edges and triangles from one end of the chain"); the potential is the remaining length of the chain; - on the arrows with cyclic mate orbits (the periodic components) the matching
is read off from a depth function
eon vertices that is invariant underτand such that each vertex has at most one cyclic incoming arrow from a vertex of depth at most its own: the triangle of the arrow from the parent eliminatest_X, the other triangles eliminate their arrow. This is the combinatorial form of "a periodic component containing arrows gives a mapping torus, which retracts onto its core circle"; the depth function is constructed from the tree model inPeriodicDepth.lean.
Once every triangle is eliminated, the remaining complex is a graph and the
vertex groups are free (Morse.isFreeGroup_end).
Arrows of the quiver.
Instances For
σ^j a is defined for all j < n.
Instances For
An arrow whose mate orbit is a cycle: all powers of σ are defined.
Instances For
The edges of K: the arrows and the translation edges t_X.
Instances For
Source of an edge.
Instances For
Target of an edge.
Instances For
The triangles of K: one for each arrow a : y → x with x nonprojective.
Instances For
The arrow of a triangle.
Instances For
The mate arrow σ a : τ x → y of a triangle.
Instances For
The mesh complex: triangles (σa) a = t_X.
Instances For
The remaining length of a finite mate chain.
Instances For
A depth function on the vertices, adapted to the cyclic arrows.
- e : V → ℕ
the depth
invariance under
τalong cyclic arrows- uniq (t t' : Tri Q) : t.fst = t'.fst → Cyclic Q t.arr → Cyclic Q t'.arr → self.e t.snd.fst ≤ self.e ↑t.fst → self.e t'.snd.fst ≤ self.e ↑t'.fst → t = t'
at most one cyclic arrow into a vertex comes from depth at most its own
Instances For
The condition for a triangle to eliminate its translation edge.
Instances For
A bound above all the periodic potentials.
Instances For
The potential of a triangle.
Instances For
The matching of the mesh complex.
Instances For
The fundamental groupoid Π(K) of the mesh complex: walks modulo cancellation
and the triangle relations.
Instances For
A vertex of Γ as an object of Π(K).
Instances For
The vertex groups of K are free, given a depth function on the
periodic part.