The depth function on periodic components #
For the proof of Lemma 4.2 (lem:mesh-walk-free, scalar-normalization.tex):
"A periodic component containing arrows gives a mapping torus, which retracts
onto its core circle." By Proposition 4.1 a periodic component is covered by
ℤΔ, and the deck transformations have the form (v, t) ↦ (ρ v, t + c₀) for a
tree automorphism ρ (StarDeck.deck_height_form). "The automorphism ρ
fixes a vertex or an edge midpoint of Δ" (lines 82–85): we use the centre of
the path for type A, and the trivalent vertex for types D and E. The
(doubled) distance to this centre is invariant under every deck
transformation, so it descends to the component; each vertex has at most one
neighbour at depth at most its own. This depth function drives the
contraction onto the core circle in MeshComplex.lean.
The doubled distance from the centre at "half-depth" n / 2.
Instances For
A depth function on a stable translation quiver: invariant under τ, and
each vertex has at most one in-neighbour of depth at most its own.
Instances For
The depth function descends from the tree model.
A connected periodic component has a depth function (Proposition 4.1 and
the choice of a centre of Δ).
"A mate cycle forces periodic endpoints because σ² = τ."
The depth on the vertices of a periodic component S, through the chosen
model of S.
Instances For
The glued depth function.
Instances For
The depth function of Γ, from the tree models of its periodic
components.
Instances For
Lemma 4.2 (lem:mesh-walk-free) for a finite translation quiver with at
most one arrow between two vertices and a finite-dimensional scalar mesh
category: every vertex group of the complex K is free.