Papers
Topics
Authors
Recent
2000 character limit reached

Chouhy–Solotar Reduction System

Updated 20 November 2025
  • Chouhy–Solotar reduction system is a combinatorial method for constructing minimal and functorial projective bimodule resolutions of associative algebras defined by quivers with relations.
  • It employs a structured reduction system and ambiguity analysis to derive explicit differentials that facilitate efficient Hochschild cohomology computations.
  • The framework supports diagrammatic representations in Fukaya categories and braiding functor formulations, offering a streamlined alternative to the traditional bar resolution.

The Chouhy–Solotar reduction system is an explicit and combinatorial method for constructing projective bimodule resolutions of associative algebras defined by quivers with relations, particularly where the relations are not necessarily monomial. It yields minimal and functorial resolutions of the diagonal bimodule, enabling rigorous computations in Hochschild cohomology and the categorical paper of natural transformations, as applied to the Fukaya category associated to Coulomb branches of quiver gauge theories and the diagrammatic structure of KLRW categories (Tong, 13 Nov 2025).

1. Quiver, Path Algebra, and Reduction System

Let QQ be a quiver with vertices Q0Q_0 corresponding to idempotents eie_i (i=0,,Ni=0,\dots,N) and arrows Q1Q_1:

  • pi+1p_{i+1}: eiei+1e_i \to e_{i+1},
  • qiq_i: ei+1eie_{i+1} \to e_i,
  • sis_i: eieie_i \to e_i, for i=0,,N1i=0,\dots,N-1. The path algebra is A=kQ/IA=\mathbb{k}Q/I, where II encodes the KLRW relations.

A reduction system RR is a set of generators of II of the form

R={(s,φs)sSQ2, φskQ, φs is irreducible},R = \{ (s, \varphi_s) \mid s\in S\subset Q_2,\ \varphi_s\in\mathbb{k}Q,\ \varphi_s\text{ is irreducible} \},

where “irreducible” means no subpath is in SS. For the KLRW category,

S={qipi+1, piqi1, sipi, siqi},S = \{ q_i p_{i+1},\ p_i q_{i-1},\ s_i p_i,\ s_i q_i \},

with

φqipi+1=si,φpiqi1=si,φsipi=pisi1,φsiqi=qisi+1.\varphi_{q_ip_{i+1}} = s_i,\quad \varphi_{p_iq_{i-1}} = s_i,\quad \varphi_{s_ip_i} = p_i s_{i-1},\quad \varphi_{s_iq_i} = q_i s_{i+1}.

A preorder "\preceq" on monomials is defined by replacing any subpath sSs\in S by φs\varphi_s. A path is irreducible iff it contains no sSs\in S.

2. Ambiguities and Construction of Projective Bimodules

An nn-ambiguity is a path u=un+1u0u=u_{n+1}\cdots u_0 such that each length-2 subpath ui+1uiSu_{i+1}u_i\in S and no smaller subpath lies in SS. Let SnS_n denote the set of nn-ambiguities (S2=SS_2=S).

The sizes are: S0=N+1,S1=3N+1,Sn=4N for n2.|S_0| = N+1,\quad |S_1| = 3N+1,\quad |S_n| = 4N\text{ for } n\geq 2.

Define projective (A(AA)A)-bimodules by

Pn=AkQ0k[Sn]kQ0A.P_n = A \otimes_{\mathbb{k}Q_0} \mathbb{k}[S_n] \otimes_{\mathbb{k}Q_0} A.

Thus, P0=AAP_0=A\otimes A, P1=AQ1AP_1=A\otimes Q_1\otimes A, etc. The combinatorial structure of ambiguities forms the backbone of the resolution.

3. Differentials and Exactness

Auxiliary “split” maps on paths wQw\in Q are defined as

splitn(w)=w=urv, rSnπ(u)rπ(v),\text{split}_n(w) = \sum_{w=u\cdot r\cdot v,\ r\in S_n} \pi(u)\otimes r\otimes\pi(v),

with splitnR\text{split}_n^R, splitnL\text{split}_n^L denoting rightmost/leftmost decompositions.

Base cases:

  • δ0(xy)=π(xy)\delta_0(x\otimes y)=\pi(xy),
  • δ1(1w1)=1ww1\delta_1(1\otimes w\otimes 1)=1\otimes w - w\otimes 1.

For n2n\geq 2:

  • nn even: δn(1w1)=splitn1L(w)splitn1R(w)\delta_n(1\otimes w\otimes 1)=\text{split}_{n-1}^L(w) - \text{split}_{n-1}^R(w),
  • nn odd: δn(1w1)=splitn1(w)\delta_n(1\otimes w\otimes 1)=\text{split}_{n-1}(w).

The differential n\partial_n is recursively corrected for exactness: n(1w1)=(idρn2n1)δn(1w1),\partial_n(1\otimes w \otimes 1) = ( \mathrm{id} - \rho_{n-2} \partial_{n-1} ) \circ \delta_n(1\otimes w\otimes 1), with

ρn1=γn1+i1γn1(δnγn1nγn1)i,\rho_{n-1} = \gamma_{n-1} + \sum_{i\geq 1} \gamma_{n-1}( \delta_n \gamma_{n-1} - \partial_n \gamma_{n-1})^i,

where γn1(xwy)=(1)nsplitn(xw)y\gamma_{n-1}(x\otimes w\otimes y)=(-1)^n \text{split}_n(x w) y. Theorem 4.1 in [CS] guarantees the resulting complex is exact.

4. Diagrammatics and KLRW Embedding

In the diagrammatic framework compatible with the Fukaya/KLRW embedding, arrows pip_i, qiq_i correspond to black strands crossing a fixed red line associated to a puncture. Dots sis_i are decorations on stationary strands at red ii.

The four relations in SS map directly to local moves among these strand-dot diagrams. Ambiguities are visualized as oscillations or zig-zag motions of strands around punctures, either as strand oscillations (type I) or those ending in a dot (type II).

5. Projective Resolution of the Diagonal Bimodule

The sequence

P22P11P00A0\cdots \to P_2 \xrightarrow{\partial_2} P_1 \xrightarrow{\partial_1} P_0 \xrightarrow{\partial_0} A \to 0

with the above differentials provides a projective resolution of the diagonal bimodule Δ(,)=Hom(,)\Delta(-,-)=\operatorname{Hom}(-,-). Each PnP_n is finitely generated (stabilizing for n2n\geq 2), in contrast to the bar resolution, whose modules grow exponentially.

6. Hochschild Cohomology Computation

The cochain complex for Hochschild cohomology is

Cn=HomAA(Pn,Δ),dn(φ)=φn+1.C^n = \operatorname{Hom}_{A-A}(P_n,\Delta),\qquad d^n(\varphi) = \varphi \circ \partial_{n+1}.

Given the explicit structure Pn=AkQ0k[Sn]kQ0AP_n = A \otimes_{\mathbb{k}Q_0} \mathbb{k}[S_n] \otimes_{\mathbb{k}Q_0} A, homomorphisms φ\varphi are determined by their values φ(s)\varphi_\ell(s) on each nn-ambiguity sSns\in S_n and each dot-count 0\ell\geq 0.

Explicit combinatorial formulas for dnd^n on the coefficient-functions φ(s)\varphi_\ell(s) are given (see Theorem 7.9 in (Tong, 13 Nov 2025)). For n3n\geq 3, the resolution decomposes into 2-vertex blocks, yielding HHn=0HH^n=0. In low degrees: HH0(Δ)kN,HH1(Δ)kN,HH2(Δ)kN1.HH^0 (\Delta) \cong \mathbb{k}^{\mathbb{N}},\qquad HH^1 (\Delta) \cong \mathbb{k}^{\mathbb{N}},\qquad HH^2(\Delta) \cong \mathbb{k}^{N-1}. Cocycle representatives are labeled by sequences ϵ\epsilon_\ell, σ\sigma_\ell, and θi\theta_i.

7. Comparison with Alternative Resolutions and Minimality

The bar resolution Barn=A(A/J)nA\operatorname{Bar}_n = A \otimes (A/J)^{\otimes n} \otimes A is universally applicable but large and highly redundant. Monomial-algebra resolutions (Bardzell) are limited to monomial generators.

The Chouhy–Solotar system generalizes Bardzell’s approach to arbitrary quivers with relations, yielding minimal, functorial, and combinatorially efficient resolutions, as PnP_n stabilizes for n2n\geq 2 and contains no contractible summands.

One can construct a homotopy deformation retract from Bar\operatorname{Bar}_\bullet onto PP_\bullet, with explicit chain-maps FF, GG, hh, reducing calculations in the bar complex to computations in the smaller Chouhy–Solotar complex.

8. Applications in Fukaya Categories and Braiding Functors

Morita invariance yields HH(Δ)HH(id)HH^\ast(\Delta) \cong HH^\ast(\mathrm{id}), HH(Bi)HH(βi)HH^\ast(B_{i^{-}}) \cong HH^\ast(\beta_{i^{-}}). Low-degree cohomology classes produce explicit AA_\infty-natural transformations idid\mathrm{id}\Rightarrow\mathrm{id} and idβi\mathrm{id}\Rightarrow\beta_{i^{-}}, whose components ηd\eta^d are given by summations over dot-counts and strand-pictures with coefficients derived from the Hochschild cocycles.

This framework determines the higher AA_\infty-data encoded in braiding functors and their natural transformations, enabling the categorical formulation of braid cobordism actions within the Fukaya category context, specifically for the Coulomb branch M(,1)\mathcal{M}(\bullet,1) of the sl2\mathfrak{sl}_2 quiver gauge theory (Tong, 13 Nov 2025).

Definition Search Book Streamline Icon: https://streamlinehq.com
References (1)
Slide Deck Streamline Icon: https://streamlinehq.com

Whiteboard

Forward Email Streamline Icon: https://streamlinehq.com

Follow Topic

Get notified by email when new papers are published related to Chouhy-Solotar Reduction System.