Documentation

TauCeti.RepresentationTheory.Quiver.Zigzag.AInfinity.Backtrack

Gauge-trivial quartic loop deformations of a zigzag algebra #

Let Z be the zigzag algebra of a finite simple graph G with no isolated vertex, graded by path length and regarded as an A∞ algebra whose only operation is the product (TauCeti.zigzagStrictAInfinityAlgebra). For two darts d and e with d.fst = e.snd, the backtrack operation

ψ_{d,e}(x₀, x₁, x₂) = a_d(x₀) a_e(x₁) a_{e.symm}(x₂) · d,

with a_d the coordinate of the arrow of d in the vertex-arrow-volume basis, is a ternary operation of degree -2. On arrows it is nonzero only on the word d, e, e.symm, which it sends to d: the backtrack along e is removed. Its Hochschild coboundary

x₀ ψ(x₁, x₂, x₃) - ψ(x₀ x₁, x₂, x₃) + ψ(x₀, x₁ x₂, x₃) - ψ(x₀, x₁, x₂ x₃) + ψ(x₀, x₁, x₂) x₃

is the sum of the loop operations TauCeti.zigzagLoopOperation of the closed walk d.symm, d, e, e.symm and of its rotation d, e, e.symm, d.symm (TauCeti.zigzagBacktrackOperation_coboundary). The proof is the telescoping of arrow coordinates used for the cocycle property of loop operations.

Let P be a finite set of such pairs, with weights a, and suppose that no first dart of a pair is reverse to the first dart of another, so that the products of two values of the weighted backtrack cochain ψ = ∑ a_p ψ_p vanish. Then the loop deformation TauCeti.zigzagLoopAInfinityAlgebra whose coefficients are the weighted backtrack walks and their rotations is gauge trivial. The maps f₁ = id, f₃ = ψ and fₙ = 0 otherwise are the components of an A∞ morphism to the strict zigzag algebra (TauCeti.zigzagBacktrackAInfinityHom). Its morphism equations are f₁ m₄ = δψ in arity four, m₂(f₃, f₃) = 0 in arity six, and trivial otherwise, since ψ vanishes on the volume classes in which m₄ takes its values. The linear part is the identity, so the morphism is an A∞ isomorphism and the deformation is formal.

The signs are those of Tau Ceti's Keller/Getzler--Jones conventions, in which the arity-four morphism equation carries no relative sign between the two outer terms of δψ. Liu--Wang's quartic operation for affine D₄, with equal values on the four rotations of its walk, is an instance; see TauCeti.RepresentationTheory.Quiver.Zigzag.AInfinity.Affine.D.Four.

Main definitions #

Main results #

References #

Backtrack operations #

noncomputable def TauCeti.zigzagBacktrackOperation (k : Type w) [CommRing k] {V : Type u} (G : SimpleGraph V) [Finite V] (hns : ∀ (i : V), ∃ (j : V), G.Adj i j) (d e : G.Dart) :

The backtrack operation of two darts d and e: the product of the d-, e- and e.symm-arrow coordinates of its three inputs, times the arrow of d.

Instances For
    @[simp]
    theorem TauCeti.zigzagBacktrackOperation_apply (k : Type w) [CommRing k] {V : Type u} (G : SimpleGraph V) [Finite V] (hns : ∀ (i : V), ∃ (j : V), G.Adj i j) (d e : G.Dart) (x : Fin 3 → nonisolatedZigzagQuotient k G) :
    (zigzagBacktrackOperation k G hns d e) x = (((zigzagBasis k G hns).coord (Sum.inr (Sum.inl d))) (x 0) * ((zigzagBasis k G hns).coord (Sum.inr (Sum.inl e))) (x 1) * ((zigzagBasis k G hns).coord (Sum.inr (Sum.inl e.symm))) (x 2)) • (zigzagMk k G) (PathAlgebra.ofArrow (DoubledQuiver.arrow G ⋯))

    A backtrack operation is the product of three arrow coordinates times an arrow.

    def TauCeti.zigzagBacktrackWalk {V : Type u} (G : SimpleGraph V) (d e : G.Dart) :
    Fin 4 → G.Dart

    The closed walk d.symm, d, e, e.symm in product order: read from the last entry it goes back and forth along e and then along d, so it is closed when d.fst = e.snd.

    Instances For
      theorem TauCeti.zigzagBacktrackWalk_def {V : Type u} (G : SimpleGraph V) (d e : G.Dart) :

      The backtrack walk lists d.symm, d, e and e.symm.

      theorem TauCeti.zigzagBacktrackWalk_fst_eq_snd {V : Type u} {G : SimpleGraph V} {d e : G.Dart} (h : d.toProd.1 = e.toProd.2) (j i : Fin 4) :
      (zigzagBacktrackWalk G d e (i + j)).toProd.1 = (zigzagBacktrackWalk G d e (i + 1 + j)).toProd.2

      Every rotation of the backtrack walk of d and e is closed, read in product order, when d starts where e ends.

      theorem TauCeti.zigzagBacktrackOperation_coboundary (k : Type w) [CommRing k] {V : Type u} {G : SimpleGraph V} [Finite V] (hns : ∀ (i : V), ∃ (j : V), G.Adj i j) {d e : G.Dart} (h : d.toProd.1 = e.toProd.2) (x₀ x₁ x₂ x₃ : nonisolatedZigzagQuotient k G) :
      x₀ * (zigzagBacktrackOperation k G hns d e) ![x₁, x₂, x₃] - (zigzagBacktrackOperation k G hns d e) ![x₀ * x₁, x₂, x₃] + (zigzagBacktrackOperation k G hns d e) ![x₀, x₁ * x₂, x₃] - (zigzagBacktrackOperation k G hns d e) ![x₀, x₁, x₂ * x₃] + (zigzagBacktrackOperation k G hns d e) ![x₀, x₁, x₂] * x₃ = (zigzagLoopOperation k G hns (zigzagBacktrackWalk G d e)) ![x₀, x₁, x₂, x₃] + (zigzagLoopOperation k G hns fun (i : Fin (Nat.succ 0).succ.succ.succ) => zigzagBacktrackWalk G d e (i + 1)) ![x₀, x₁, x₂, x₃]

      The core coboundary identity. When d.fst = e.snd, the Hochschild coboundary of the backtrack operation of d and e is the sum of the loop operations of the backtrack walk and of its rotation by one step.

      Weighted families of backtrack operations #

      noncomputable def TauCeti.zigzagBacktrackCochain {k : Type w} [CommRing k] {V : Type u} {G : SimpleGraph V} [Finite V] (hns : ∀ (i : V), ∃ (j : V), G.Adj i j) (P : Finset (G.Dart × G.Dart)) (a : G.Dart × G.Dart → k) :

      The backtrack cochain of a finite set P of pairs of darts with weights a: the sum of the backtrack operations of the pairs in P, weighted by a.

      Instances For
        @[simp]
        theorem TauCeti.zigzagBacktrackCochain_apply {k : Type w} [CommRing k] {V : Type u} {G : SimpleGraph V} [Finite V] (hns : ∀ (i : V), ∃ (j : V), G.Adj i j) (P : Finset (G.Dart × G.Dart)) (a : G.Dart × G.Dart → k) (x : Fin 3 → nonisolatedZigzagQuotient k G) :
        (zigzagBacktrackCochain hns P a) x = ∑ p ∈ P, (a p * (((zigzagBasis k G hns).coord (Sum.inr (Sum.inl p.1))) (x 0) * ((zigzagBasis k G hns).coord (Sum.inr (Sum.inl p.2))) (x 1) * ((zigzagBasis k G hns).coord (Sum.inr (Sum.inl p.2.symm))) (x 2))) • (zigzagMk k G) (PathAlgebra.ofArrow (DoubledQuiver.arrow G ⋯))

        The backtrack cochain is a weighted sum of products of three arrow coordinates times arrows.

        noncomputable def TauCeti.zigzagBacktrackCoefficients {k : Type w} [CommRing k] {V : Type u} {G : SimpleGraph V} (P : Finset (G.Dart × G.Dart)) (a : G.Dart × G.Dart → k) :
        (Fin 4 → G.Dart) →₀ k

        The coefficients of the loop operations of the backtrack walks of the pairs in P and of their rotations by one step, weighted by a.

        Instances For
          theorem TauCeti.zigzagBacktrackCoefficients_def {k : Type w} [CommRing k] {V : Type u} {G : SimpleGraph V} (P : Finset (G.Dart × G.Dart)) (a : G.Dart × G.Dart → k) :
          zigzagBacktrackCoefficients P a = ∑ p ∈ P, (Finsupp.single (zigzagBacktrackWalk G p.1 p.2) (a p) + Finsupp.single (fun (i : Fin 4) => zigzagBacktrackWalk G p.1 p.2 (i + 1)) (a p))

          The backtrack coefficients are the sum, over the pairs in P, of the single coefficients of the backtrack walk and of its rotation by one step.

          theorem TauCeti.fst_eq_snd_of_mem_support_zigzagBacktrackCoefficients {k : Type w} [CommRing k] {V : Type u} {G : SimpleGraph V} {P : Finset (G.Dart × G.Dart)} (a : G.Dart × G.Dart → k) (hP : ∀ p ∈ P, p.1.toProd.1 = p.2.toProd.2) (w : Fin 4 → G.Dart) :
          w ∈ (zigzagBacktrackCoefficients P a).support → ∀ (i : Fin 4), (w i).toProd.1 = (w (i + 1)).toProd.2

          The backtrack coefficients are supported on closed walks, read in product order.

          theorem TauCeti.zigzagLoopAInfinityAlgebra_zigzagBacktrackCoefficients_m_four {k : Type w} [CommRing k] {V : Type u} {G : SimpleGraph V} [Finite V] (hns : ∀ (i : V), ∃ (j : V), G.Adj i j) {P : Finset (G.Dart × G.Dart)} (a : G.Dart × G.Dart → k) (hc : ∀ w ∈ (zigzagBacktrackCoefficients P a).support, ∀ (i : Fin 4), (w i).toProd.1 = (w (i + 1)).toProd.2) :
          (zigzagLoopAInfinityAlgebra hns (zigzagBacktrackCoefficients P a) hc).m 4 = ∑ p ∈ P, a p • (zigzagLoopOperation k G hns (zigzagBacktrackWalk G p.1 p.2) + zigzagLoopOperation k G hns fun (i : Fin 4) => zigzagBacktrackWalk G p.1 p.2 (i + 1))

          The quartic operation of the loop deformation with backtrack coefficients is the weighted sum of the loop operations of the backtrack walks and of their rotations.

          theorem TauCeti.zigzagBacktrackCochain_coboundary {k : Type w} [CommRing k] {V : Type u} {G : SimpleGraph V} [Finite V] (hns : ∀ (i : V), ∃ (j : V), G.Adj i j) {P : Finset (G.Dart × G.Dart)} (a : G.Dart × G.Dart → k) (hP : ∀ p ∈ P, p.1.toProd.1 = p.2.toProd.2) (x₀ x₁ x₂ x₃ : nonisolatedZigzagQuotient k G) :
          x₀ * (zigzagBacktrackCochain hns P a) ![x₁, x₂, x₃] - (zigzagBacktrackCochain hns P a) ![x₀ * x₁, x₂, x₃] + (zigzagBacktrackCochain hns P a) ![x₀, x₁ * x₂, x₃] - (zigzagBacktrackCochain hns P a) ![x₀, x₁, x₂ * x₃] + (zigzagBacktrackCochain hns P a) ![x₀, x₁, x₂] * x₃ = ((zigzagLoopAInfinityAlgebra hns (zigzagBacktrackCoefficients P a) ⋯).m 4) ![x₀, x₁, x₂, x₃]

          The coboundary of the backtrack cochain is the quartic operation of the loop deformation with backtrack coefficients.

          theorem TauCeti.zigzagBacktrackCochain_eq_zero_of_mem {k : Type w} [CommRing k] {V : Type u} {G : SimpleGraph V} [Finite V] (hns : ∀ (i : V), ∃ (j : V), G.Adj i j) {P : Finset (G.Dart × G.Dart)} (a : G.Dart × G.Dart → k) (x : Fin 3 → nonisolatedZigzagQuotient k G) (j : Fin 3) {m : ℤ} (hm : m ≠ 1) (hx : x j ∈ zigzagIntegerGrade k G m) :

          The backtrack cochain vanishes as soon as one input is homogeneous of degree other than one: it only reads arrow coordinates.

          theorem TauCeti.isHomogeneous_zigzagBacktrackCochain {k : Type w} [CommRing k] {V : Type u} {G : SimpleGraph V} [Finite V] (hns : ∀ (i : V), ∃ (j : V), G.Adj i j) {P : Finset (G.Dart × G.Dart)} (a : G.Dart × G.Dart → k) :

          The backtrack cochain has degree -2 for the path-length grading.

          theorem TauCeti.zigzagBacktrackCochain_mul_zigzagBacktrackCochain_eq_zero {k : Type w} [CommRing k] {V : Type u} {G : SimpleGraph V} [Finite V] (hns : ∀ (i : V), ∃ (j : V), G.Adj i j) {P : Finset (G.Dart × G.Dart)} (a : G.Dart × G.Dart → k) (hP' : ∀ p ∈ P, ∀ q ∈ P, q.1 ≠ p.1.symm) (x y : Fin 3 → nonisolatedZigzagQuotient k G) :

          Products of values of the backtrack cochain vanish when no pair in P has a first dart reverse to the first dart of another.

          The A∞ isomorphism #

          noncomputable def TauCeti.zigzagBacktrackTaylor {k : Type w} [CommRing k] {V : Type u} {G : SimpleGraph V} [Finite V] (hns : ∀ (i : V), ∃ (j : V), G.Adj i j) (P : Finset (G.Dart × G.Dart)) (a : G.Dart × G.Dart → k) :

          The backtrack Taylor map: the suspension of the backtrack cochain, concentrated on words of length three. Together with the projection onto single letters it is the Taylor map of the backtrack isomorphism.

          Instances For
            @[simp]
            theorem TauCeti.zigzagBacktrackTaylor_of_tprod_of_ne {k : Type w} [CommRing k] {V : Type u} {G : SimpleGraph V} [Finite V] (hns : ∀ (i : V), ∃ (j : V), G.Adj i j) {P : Finset (G.Dart × G.Dart)} (a : G.Dart × G.Dart → k) {m : ℕ} (hm : 0 < m) (hm3 : m ≠ 3) (w : Fin m → nonisolatedZigzagQuotient k G) :

            The backtrack Taylor map vanishes on words whose length is not three.

            @[simp]
            theorem TauCeti.zigzagBacktrackTaylor_of_tprod_three {k : Type w} [CommRing k] {V : Type u} {G : SimpleGraph V} [Finite V] (hns : ∀ (i : V), ∃ (j : V), G.Adj i j) {P : Finset (G.Dart × G.Dart)} (a : G.Dart × G.Dart → k) (w : Fin 3 → nonisolatedZigzagQuotient k G) :

            On a word of length three the backtrack Taylor map is the negative of the backtrack cochain: the suspension sign of an arity-three operation of even degree is that of its middle letter, which the backtrack cochain only reads through an arrow coordinate.

            The backtrack Taylor map has degree zero for the suspended path-length grading.

            noncomputable def TauCeti.zigzagBacktrackAInfinityHom {k : Type w} [CommRing k] {V : Type u} {G : SimpleGraph V} [Finite V] (hns : ∀ (i : V), ∃ (j : V), G.Adj i j) {P : Finset (G.Dart × G.Dart)} (a : G.Dart × G.Dart → k) (hP : ∀ p ∈ P, p.1.toProd.1 = p.2.toProd.2) (hP' : ∀ p ∈ P, ∀ q ∈ P, q.1 ≠ p.1.symm) :

            The backtrack isomorphism: the A∞ morphism from the loop deformation with backtrack coefficients to the strict zigzag algebra whose Taylor map is the projection onto single letters plus the backtrack Taylor map. In unsuspended terms its components are f₁ = id, f₃ the backtrack cochain, and fₙ = 0 otherwise.

            Instances For
              @[simp]
              theorem TauCeti.taylor_zigzagBacktrackAInfinityHom {k : Type w} [CommRing k] {V : Type u} {G : SimpleGraph V} [Finite V] (hns : ∀ (i : V), ∃ (j : V), G.Adj i j) {P : Finset (G.Dart × G.Dart)} (a : G.Dart × G.Dart → k) (hP : ∀ p ∈ P, p.1.toProd.1 = p.2.toProd.2) (hP' : ∀ p ∈ P, ∀ q ∈ P, q.1 ≠ p.1.symm) :

              The Taylor map of the backtrack isomorphism.

              @[simp]
              theorem TauCeti.linearPart_zigzagBacktrackAInfinityHom {k : Type w} [CommRing k] {V : Type u} {G : SimpleGraph V} [Finite V] (hns : ∀ (i : V), ∃ (j : V), G.Adj i j) {P : Finset (G.Dart × G.Dart)} (a : G.Dart × G.Dart → k) (hP : ∀ p ∈ P, p.1.toProd.1 = p.2.toProd.2) (hP' : ∀ p ∈ P, ∀ q ∈ P, q.1 ≠ p.1.symm) :

              The linear part of the backtrack isomorphism is the identity.

              @[simp]
              theorem TauCeti.component_three_zigzagBacktrackAInfinityHom {k : Type w} [CommRing k] {V : Type u} {G : SimpleGraph V} [Finite V] (hns : ∀ (i : V), ∃ (j : V), G.Adj i j) {P : Finset (G.Dart × G.Dart)} (a : G.Dart × G.Dart → k) (hP : ∀ p ∈ P, p.1.toProd.1 = p.2.toProd.2) (hP' : ∀ p ∈ P, ∀ q ∈ P, q.1 ≠ p.1.symm) :

              The arity-three component of the backtrack isomorphism is the backtrack cochain.

              @[simp]
              theorem TauCeti.component_zigzagBacktrackAInfinityHom_of_ne {k : Type w} [CommRing k] {V : Type u} {G : SimpleGraph V} [Finite V] (hns : ∀ (i : V), ∃ (j : V), G.Adj i j) {P : Finset (G.Dart × G.Dart)} (a : G.Dart × G.Dart → k) (hP : ∀ p ∈ P, p.1.toProd.1 = p.2.toProd.2) (hP' : ∀ p ∈ P, ∀ q ∈ P, q.1 ≠ p.1.symm) {n : ℕ} (h₁ : n ≠ 1) (h₃ : n ≠ 3) :

              The components of the backtrack isomorphism vanish outside arities one and three.

              theorem TauCeti.isIso_zigzagBacktrackAInfinityHom {k : Type w} [CommRing k] {V : Type u} {G : SimpleGraph V} [Finite V] (hns : ∀ (i : V), ∃ (j : V), G.Adj i j) {P : Finset (G.Dart × G.Dart)} (a : G.Dart × G.Dart → k) (hP : ∀ p ∈ P, p.1.toProd.1 = p.2.toProd.2) (hP' : ∀ p ∈ P, ∀ q ∈ P, q.1 ≠ p.1.symm) :

              The backtrack isomorphism is an A∞ isomorphism.

              theorem TauCeti.isFormal_zigzagLoopAInfinityAlgebra_zigzagBacktrackCoefficients {k : Type w} [CommRing k] {V : Type u} {G : SimpleGraph V} [Finite V] (hns : ∀ (i : V), ∃ (j : V), G.Adj i j) {P : Finset (G.Dart × G.Dart)} (a : G.Dart × G.Dart → k) (hP : ∀ p ∈ P, p.1.toProd.1 = p.2.toProd.2) (hP' : ∀ p ∈ P, ∀ q ∈ P, q.1 ≠ p.1.symm) :

              The loop deformation with backtrack coefficients is formal: it is A∞ isomorphic to the strict zigzag algebra, which has no operation besides the product.