The deck group and the walk-class grading #
Subsection 4.2 (subsec:universal-cover, scalar-normalization.tex):
"Let K̃ be the universal cover of K, constructed from walks starting at a
basepoint, modulo edge cancellation and the triangle relations. The fundamental
group G acts on this cover by deck transformations." A lifted vertex is a
vertex X with the class of a walk from the basepoint; a path of Γ lifts
uniquely from a chosen lift of its source.
Formally we fix a basepoint v₀ and adjoin to K a cone of edges
s_X : v₀ → X without triangles. This makes the complex connected without
changing the argument (the source assumes A connected; with the cone, the
cover is a disjoint union of universal covers of the components of K, and
G is still free by the collapse of Lemma 4.2). The lift (X, h) of X in
sheet h ∈ G is the walk class h · s_X; a path p : X → Y lifts from sheet
h to sheet h · deg p, where deg p = s_X p s_Y⁻¹ (degW). Mesh relations
are homogeneous for deg (their terms are homotopic to t_X), so deg
grades C(Q, c) (WeightGrading.lean): this is the covering formula
eq:walk-hom-sum. Edges have length one, translation edges length two and
cone edges length zero; triangles preserve length, so length is a
homomorphism ℓ : G → ℤ with ℓ (deg p) = |p| (len_degW); this is the
height of the source.
The complex with additional edges and the same triangles.
Instances For
The prefunctor on edges given by values in a groupoid.
Instances For
A functor out of the fundamental groupoid, from values on edges that respect the triangles.
Instances For
The source of an edge of the coned complex.
Instances For
The target of an edge of the coned complex.
Instances For
The complex K with a cone of edges s_X : v₀ → X.
Instances For
Its fundamental groupoid.
Instances For
A vertex as an object of PiC.
Instances For
The class of an edge.
Instances For
The class of an arrow.
Instances For
The class of a translation edge t_x : τ x → x.
Instances For
The class of a cone edge s_X : v₀ → X.
Instances For
The class of a path.
Instances For
The mesh triangles: (σ a) a = t_x in the fundamental groupoid.
The deck group: loops at the basepoint, multiplied in walk order.
Instances For
The walk-class weight deg p = s_X p s_Y⁻¹.
Instances For
The mesh relations are homogeneous for the walk-class weight.
Freeness of the deck group #
The deck group is free (Lemma 4.2, for the coned complex).
Length #
Lengths of edges: one for arrows, two for translation edges, zero for cone edges.
Instances For
The length functor on the fundamental groupoid.
Instances For
The length homomorphism ℓ : G → ℤ.
Instances For
Height: the length of a path is the length of its walk class.