Documentation

TauCeti.RepresentationTheory.Quiver.Zigzag.Skew.Grading

The path-length grading of a skew-zigzag relation quotient #

Every skew-zigzag relator of a simple graph is homogeneous for the path-length grading of the path algebra of the doubled quiver: a non-returning length-two path and the scalar relation backtrack(h) - ratio(h, h') • backtrack(h') between two backtracks at one vertex sit in degree two, and each long generator is a single path. So the skew relation ideal is homogeneous, and the skew-zigzag relation quotient Z_k(G, c) carries the induced grading, in which the vertex idempotents have degree 0, the arrows degree 1, and the backtracks degree 2.

The comparison isomorphisms between skew-zigzag quotients are graded: the gauge isomorphism rescales arrows, the relabelling along a graph isomorphism preserves path length, and the comparison of the constant parameter with the ordinary zigzag relation quotient is the identity on representatives. Consequently the vertex-fixing classification from Couture's setting extends here to finite graphs over commutative rings, with vertex-fixing graded isomorphisms: two parameters are gauge equivalent, equivalently have the same class in H¹(G, kˣ), exactly when their relation quotients are isomorphic by a graded isomorphism fixing every vertex idempotent. A graded isomorphism φ : Z_k(G, c) ≃ₐ[k] Z_k(G, c') is spelled out as an algebra isomorphism such that φ x lies in the degree-n piece of Z_k(G, c') exactly when x lies in the degree-n piece of Z_k(G, c), for every n.

Main definitions #

Main results #

References #

C. Couture, Skew-Zigzag Algebras, Section 3 for the grading and Section 4, Theorem 4.8, for the vertex-fixing classification of connected graphs over fields containing square roots, https://arxiv.org/abs/1509.08405. The graded classification here extends that result to finite graphs over commutative rings.

Homogeneity of the skew relators #

The skew-zigzag relators are homogeneous: the non-returning quadratic paths and the scalar backtrack relators in degree two, and each long generator in the degree its own length names.

The skew relation ideal is homogeneous for the path-length grading. This is the condition needed to descend the grading to the skew-zigzag quotient.

The induced grading on the skew relation quotient #

noncomputable def TauCeti.skewZigzagGrade (k : Type w) [CommRing k] {V : Type u} (G : SimpleGraph V) [Finite V] (c : SkewZigzagParameter k G) (n : ℕ) :

The induced grading on the skew-zigzag relation quotient: the degree-n piece is the image of the degree-n piece of the path-length grading of the doubled path algebra under the quotient map. By TauCeti.isInternal_skewZigzagGrade these pieces form an internal direct sum decomposition of the quotient itself.

Instances For
    theorem TauCeti.mem_skewZigzagGrade_iff (k : Type w) [CommRing k] {V : Type u} (G : SimpleGraph V) [Finite V] (c : SkewZigzagParameter k G) {n : ℕ} {x : skewZigzagQuotient k G c} :
    x ∈ skewZigzagGrade k G c n ↔ ∃ y ∈ PathAlgebra.grade k (DoubledQuiver G) n, (skewZigzagMk k G c) y = x

    Membership in a graded piece is being the class of a homogeneous element of that degree.

    @[simp]

    A homogeneous element lands in the piece its degree names.

    The skew-zigzag quotient is the internal direct sum of its graded pieces.

    theorem TauCeti.mul_mem_skewZigzagGrade (k : Type w) [CommRing k] {V : Type u} (G : SimpleGraph V) [Finite V] (c : SkewZigzagParameter k G) {m n : ℕ} {x y : skewZigzagQuotient k G c} (hx : x ∈ skewZigzagGrade k G c m) (hy : y ∈ skewZigzagGrade k G c n) :
    x * y ∈ skewZigzagGrade k G c (m + n)

    Multiplication adds degrees in the induced grading.

    @[instance_reducible]
    noncomputable def TauCeti.skewZigzagGradedAlgebra (k : Type w) [CommRing k] {V : Type u} (G : SimpleGraph V) [Finite V] (c : SkewZigzagParameter k G) :

    The skew-zigzag relation quotient is a graded algebra for the induced path-length grading. This is kept as a definition rather than an instance so that callers choose when to introduce it locally; see TauCeti.GradedAlgebra.gradedAlgebraQuotientPiece.

    Instances For

      The graded pieces #

      The degree-n piece is spanned by the classes of paths of length n.

      Degree zero is spanned by the vertex idempotent classes.

      Degree one is spanned by the arrow classes, one for each dart of the graph.

      Degree two is spanned by the backtrack classes, one for each dart of the graph: every length-two path either does not return, and dies, or returns to its source and is a backtrack. The backtracks at one vertex agree only up to the unit ratios of the parameter, so the family is indexed by darts rather than by one volume class per vertex.

      theorem TauCeti.skewZigzagGrade_eq_bot_of_three_le (k : Type w) [CommRing k] {V : Type u} (G : SimpleGraph V) [Finite V] (c : SkewZigzagParameter k G) {n : ℕ} (hn : 3 ≤ n) :

      Every piece of degree at least three vanishes: all long paths are relations.

      The comparison isomorphisms are graded #

      @[simp]
      theorem TauCeti.skewZigzagQuotientGaugeEquiv_mem_skewZigzagGrade_iff (k : Type w) [CommRing k] {V : Type u} (G : SimpleGraph V) [Finite V] (c c' : SkewZigzagParameter k G) (u : ⦃x y : DoubledQuiver G⦄ → (x ⟶ y) → kˣ) (hc : c' = c.gauge u) {n : ℕ} {x : skewZigzagQuotient k G c} :

      The gauge isomorphism is graded: it and its inverse are arrow rescalings, which preserve path length.

      @[simp]

      The comparison of the constant parameter with the ordinary zigzag relation quotient is graded: it matches the skew-zigzag grading at the constant parameter with the ordinary zigzag grading.

      @[simp]

      The relabelling isomorphism along a graph isomorphism is graded: it and its inverse are induced by relabellings of the doubled path algebras, which preserve path length.

      Vertex-fixing graded classification extending Couture's result #

      Gauge classes are vertex-fixing graded isomorphism classes. Two skew-zigzag parameters over a commutative ring are gauge equivalent exactly when their relation quotients are isomorphic by a graded algebra isomorphism fixing every vertex idempotent. The gauge isomorphism is graded, and conversely every vertex-fixing isomorphism, graded or not, forces gauge equivalence (AlgEquiv.isGaugeEquivalent_of_vertexFixing).

      Vertex-fixing graded classification extending Couture's result: over a commutative ring, two skew-zigzag parameters of a finite graph have the same cohomology class in H¹(G, kˣ) exactly when their relation quotients are isomorphic by a graded algebra isomorphism fixing every vertex idempotent. Couture's Theorem 4.8 treats connected graphs over fields containing square roots.