Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-27
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

The Khovanov–Seidel bimodule maps β_i and γ_i

Definition

Fix m≥1, let Am be the Khovanov–Seidel type A algebra with its internal grading and its left-to-right path multiplication of Khovanov–Seidel type A algebra and Integral path ring of a finite quiver, and for 1≤i≤m let Pi=Amei(paths ending at i),iP=eiAm(paths beginning at i),Ui=Pi⊗ZiP be the graded (Am,Am)-bimodule of The two-sided projective bimodules U_i and their tensor functors, with left action a⋅(x⊗y)=(ax)⊗y and right action (x⊗y)⋅a=x⊗(ya).

The multiplication map. Let βi:Ui⟶Am,βi(x⊗y):=xy, be the Z-bilinear extension of the product in Am. It is the degree-zero (Am,Am)-bimodule map Ui→Am with βi(ei⊗ei)=ei, and it is uniquely determined by that value, as proved below. This is equation (2.6) of the source.

The map γi. Let wi:=(i−1∣i)⊗(i∣i−1)+(i+1∣i)⊗(i∣i+1)+(i)⊗(i∣i−1∣i)+(i∣i−1∣i)⊗(i) ∈ Ui be the sum of the four displayed elementary tensors of Ui, with the second summand (i+1∣i)⊗(i∣i+1) omitted when i=m, so that wm=(m−1∣m)⊗(m∣m−1)+(m)⊗(m∣m−1∣m)+(m∣m−1∣m)⊗(m); the omission is forced, because the arrow (i+1∣i) exists only for i≤m−1. Let γi:Am⟶Ui{−1},γi(a):=a⋅wi, the left action of Am on Ui followed by the identification with the internal shift Ui{−1} of Finite graded A_m-modules, internal shifts and the vertex projectives; this is equation (2.7) of the source.

Claims proved below. The element wi lies in Ui and is homogeneous of internal degree 1, so that γi takes values in Ui{−1} and γi(1)=wi has degree 0 there; wi is central, a⋅wi=wi⋅a for every a∈Am, so γi is a map of (Am,Am)-bimodules and not only left Am-linear; βi is a well-defined degree-zero (Am,Am)-bimodule map; and consequently βi and γi induce natural transformations Ui(−)→Id and Id→Ui{−1}(−) on the category Am-mod.

Convention. The shift is the internal one, (Ui{−1})d=(Ui)d+1, and never the homological shift [1]; both βi and γi are degree-zero maps of graded bimodules, the shift in the target of γi absorbing the degree one of wi. Indices run over 1≤i≤m as in the source, and the term omitted at i=m is the only one that involves a non-existent arrow.

Facts & Assumptions

Given: An integer m≥1, the algebra Am with vertex idempotents ej, arrows (j∣j±1), returns (j∣j−1∣j), its internal grading, and the bimodules Pi=Amei, iP=eiAm, Ui=Pi⊗ZiP for an index 1≤i≤m.

[F1]

The product of two paths in ZΓm is their left-to-right concatenation when they compose and 0 otherwise; the unit is ∑j=0m(j); (j)p=p exactly for paths p beginning at j and p(j)=p exactly for paths p ending at j; consequently Pj=Amej is the subgroup spanned by the paths ending at j and jP=ejAm the subgroup spanned by the paths beginning at j (Integral path ring of a finite quiver, Finite graded A_m-modules, internal shifts and the vertex projectives).

[L2]

Am has the Z-basis of 4m+1 classes given by the vertices, the 2m arrows and the returns (1∣0∣1),…,(m∣m−1∣m); every path of length at least three has class 0; the monotone length-two paths (j∣j+1∣j+2) and (j+2∣j+1∣j) have class 0 for 0≤j≤m−2; the return (0∣1∣0) has class 0; and at an interior vertex 0<j<m the two returns agree, (j∣j+1∣j)=(j∣j−1∣j) (The 4m+1 path basis).

[F3]

The internal degree is additive over concatenation, with deg⁡(j)=deg⁡(j∣j+1)=0 and deg⁡(j+1∣j)=1 for all 0≤j≤m−1; in particular deg⁡(i∣i−1∣i)=1 for 1≤i≤m (Khovanov–Seidel type A algebra).

[L4]

For graded modules the balanced tensor carries the total grading in which a homogeneous elementary tensor has degree the sum of the degrees of its factors; Ui=Pi⊗ZiP is a graded (Am,Am)-bimodule with the actions displayed in the definition, and every elementary tensor is a finite sum of such homogeneous terms (Graded balanced tensor product and homogeneous Hom, The two-sided projective bimodules U_i and their tensor functors).

[L5]

For a graded ring R and a graded left R-module N the unit map R⊗RN→N, r⊗n↦rn, is a natural degree-zero isomorphism of graded left R-modules, and the balanced tensor is functorial in each variable (Graded associativity, units, and internal-shift tensor isomorphisms).

Proof

technique · direct
1.1

The displayed tensors lie in Ui. By [F1] the module Pi is spanned by the paths ending at i and iP by the paths beginning at i; each first factor occurring in wi, namely (i−1∣i), (i+1∣i), (i) and (i∣i−1∣i), ends at i and so lies in Pi, and each second factor, namely (i∣i−1), (i∣i+1), (i∣i−1∣i) and (i), begins at i and so lies in iP; hence every displayed elementary tensor is an element of Ui=Pi⊗ZiP and wi is a well-defined element of Ui. The summand (i+1∣i)⊗(i∣i+1) involves the arrow (i+1∣i), which for i=m is not an arrow of the quiver, so the omission at i=m is forced and not a convention.

F1L4
1.2

Degree of wi. By [F3] the degrees of the four first factors are 0,1,0,1 and those of the four second factors are 1,0,1,0, so by the additivity of the degree over concatenation and the total grading of [L4] the four summands of wi have degrees 0+1, 1+0, 0+1 and 1+0, all equal to 1; hence wi is homogeneous of degree 1 in Ui, and in the shifted module Ui{−1}, where degrees are lowered by one, the element wi=γi(1) has degree 0, matching the degree 0 of 1∈Am.

F3L4
1.3

βi is a degree-zero bimodule map. Multiplication Am×Am→Am is Z-bilinear and hence induces a well-defined Z-linear map on the tensor product, and it is degree zero because deg⁡(xy)=deg⁡(x)+deg⁡(y) by [F3] is exactly the degree of the elementary tensor x⊗y in the total grading of [L4]; moreover for a,b∈Am and an elementary tensor x⊗y∈Ui one has βi(a⋅(x⊗y)⋅b)=βi((ax)⊗(yb))=(ax)(yb)=a (xy) b=a βi(x⊗y) b by associativity of Am, so βi is left and right Am-linear.

F1F3L4
2.1

βi is the unique bimodule map with βi(ei⊗ei)=ei. By [F1] every x∈Pi satisfies xei=x and every y∈iP satisfies eiy=y, so x⊗y=x⋅(ei⊗ei)⋅y for each elementary tensor; a bimodule map β:Ui→Am with β(ei⊗ei)=ei therefore satisfies β(x⊗y)=x ei y=xy=βi(x⊗y) on elementary tensors, hence on all of Ui by additivity, so β=βi and in particular βi(ei⊗ei)=ei≠0.

step 1.3F1
2.2

Weight form of the centrality identity. Write wi=∑kxk⊗yk for the at most four displayed elementary tensors, so each xk∈Pi begins at a vertex sk∈{i−1,i,i+1} and each yk∈iP ends at that same vertex sk, the value i+1 not occurring when i=m; for a path p∈Am the left action gives p⋅(xk⊗yk)=(pxk)⊗yk, which is 0 unless t(p)=sk, and the right action gives (xk⊗yk)⋅p=xk⊗(ykp), which is 0 unless s(p)=sk. Since s(p)≠t(p) for an arrow, the index k contributes to p⋅wi or to wi⋅p but never to both, so p⋅wi=∑k: t(p)=sk(pxk)⊗yk and wi⋅p=∑k: s(p)=skxk⊗(ykp); centrality is therefore the finite list of checks on vertex idempotents and arrows carried out in steps 3.1, 3.2, 3.3, 3.4, 3.5, 3.6 and 3.7 below, and by Z-linearity in p it suffices to run them on the path generators of Am.

F1step 1.1
3.1

Vertex idempotents. For every vertex idempotent ej and every k one has ejxk=xk and ykej=yk when sk=j, and ejxk=0=ykej otherwise, by [F1] and the description of sk in step 2.2; summing over k gives ej⋅wi=∑k: sk=jxk⊗yk=wi⋅ej, so wi centralizes every vertex idempotent and hence every Z-linear combination of them.

step 2.2F1
3.2

The arrow (i−1∣i). Here t(p)=i and s(p)=i−1, and the only terms with sk=i are (i)⊗(i∣i−1∣i) and (i∣i−1∣i)⊗(i), so p⋅wi=((i−1∣i)(i))⊗(i∣i−1∣i)+((i−1∣i)(i∣i−1∣i))⊗(i)=(i−1∣i)⊗(i∣i−1∣i), the second summand being 0 because (i−1∣i∣i−1∣i) is a path of length three; and wi⋅p=((i−1∣i)⊗(i∣i−1))⋅p=(i−1∣i)⊗((i∣i−1)(i−1∣i))=(i−1∣i)⊗(i∣i−1∣i). The two sides agree, and this arrow exists for every 1≤i≤m.

step 2.2L2
3.3

The arrow (i∣i−1). Here t(p)=i−1 and s(p)=i, so p⋅wi=((i∣i−1)(i−1∣i))⊗(i∣i−1)=(i∣i−1∣i)⊗(i∣i−1), while wi⋅p=((i)⊗((i∣i−1∣i)(i∣i−1)))+((i∣i−1∣i)⊗((i)(i∣i−1)))=(i∣i−1∣i)⊗(i∣i−1), the first summand being 0 because the path (i∣i−1∣i∣i−1) has length three and the second being the displayed term. The two sides agree, and this arrow exists for every 1≤i≤m.

step 2.2L2
3.4

The arrow (i∣i+1). Here t(p)=i+1 and s(p)=i, so p⋅wi=((i∣i+1)(i+1∣i))⊗(i∣i+1)=(i∣i+1∣i)⊗(i∣i+1)=(i∣i−1∣i)⊗(i∣i+1), using the equality of the two returns at i, legitimate because 0<i<m holds when 1≤i≤m−1, which is exactly the range in which this arrow exists; and wi⋅p=((i)⊗((i∣i−1∣i)(i∣i+1)))+((i∣i−1∣i)⊗((i)(i∣i+1)))=(i∣i−1∣i)⊗(i∣i+1), the first summand being 0 because (i∣i−1∣i∣i+1) has length three. The two sides agree.

step 2.2L2
3.5

The arrow (i+1∣i). Here t(p)=i and s(p)=i+1, so p⋅wi=((i+1∣i)(i))⊗(i∣i−1∣i)+((i+1∣i)(i∣i−1∣i))⊗(i)=(i+1∣i)⊗(i∣i−1∣i), the second summand vanishing because (i+1∣i∣i−1∣i) has length three; and wi⋅p=((i+1∣i)⊗(i∣i+1))⋅p=(i+1∣i)⊗((i∣i+1)(i+1∣i))=(i+1∣i)⊗(i∣i+1∣i)=(i+1∣i)⊗(i∣i−1∣i) by the equality of the two returns at i with 0<i<m, again exactly the range 1≤i≤m−1 in which this arrow exists. The two sides agree.

step 2.2L2
3.6

The two arrows joining i−1 and i−2. For p=(i−2∣i−1) one has t(p)=i−1 and s(p)=i−2, so wi⋅p=0 because no sk equals i−2, while p⋅wi=((i−2∣i−1)(i−1∣i))⊗(i∣i−1)=(i−2∣i−1∣i)⊗(i∣i−1)=0, the monotone path (i−2∣i−1∣i) having class 0 at its interior vertex i−1, which satisfies 0<i−1<m when i≥2; for p=(i−1∣i−2) one has t(p)=i−2 and s(p)=i−1, so p⋅wi=0 while wi⋅p=((i−1∣i)⊗(i∣i−1))⋅p=(i−1∣i)⊗((i∣i−1)(i−1∣i−2))=(i−1∣i)⊗(i∣i−1∣i−2)=0, the monotone path (i∣i−1∣i−2) having class 0 at its interior vertex i−1. Both sides agree; both arrows exist only for i≥2, and for i<2 this step covers nothing.

step 2.2L2
3.7

The two arrows joining i+1 and i+2, and the remaining arrows. For p=(i+1∣i+2) one has t(p)=i+2 and s(p)=i+1, so p⋅wi=0 because no sk equals i+2, while wi⋅p=((i+1∣i)⊗(i∣i+1))⋅p=(i+1∣i)⊗((i∣i+1)(i+1∣i+2))=(i+1∣i)⊗(i∣i+1∣i+2)=0, the monotone path (i∣i+1∣i+2) having class 0 at its interior vertex i+1, which satisfies 0<i+1<m when i+2≤m; for p=(i+2∣i+1) one has t(p)=i+1 and s(p)=i+2, so wi⋅p=0 because no sk equals i+2, while p⋅wi=((i+2∣i+1)(i+1∣i))⊗(i∣i+1)=(i+2∣i+1∣i)⊗(i∣i+1)=0, the monotone path (i+2∣i+1∣i) having class 0 at its interior vertex i+1. Every remaining arrow p has both endpoints outside {i−1,i,i+1}, so neither t(p) nor s(p) equals any sk, and p⋅wi=0=wi⋅p. All arrows of the quiver are thereby covered.

step 2.2L2
4.1

γi is a map of (Am,Am)-bimodules. By steps 3.1, 3.2, 3.3, 3.4, 3.5, 3.6 and 3.7 the element wi satisfies a⋅wi=wi⋅a for every a∈Am, since every element of Am is a finite Z-linear combination of paths and both actions are Z-linear; consequently, for a,b∈Am one has γi(ba)=(ba)⋅wi=b⋅(a⋅wi)=b⋅γi(a) by associativity of the left action, and γi(ab)=(ab)⋅wi=(a⋅wi)⋅b=γi(a)⋅b, the middle equality being the centrality applied to a⋅wi⋅b=a⋅(wi⋅b)=a⋅(b⋅wi). Hence γi is left and right Am-linear, and by step 1.2 it is degree zero with γi(1)=1⋅wi=wi of degree 0 in Ui{−1}.

step 1.2step 3.1step 3.2step 3.3step 3.4step 3.5step 3.6step 3.7
5.1

Natural transformations. Composing βi⊗AmidM:Ui⊗AmM→Am⊗AmM with the unit isomorphism Am⊗AmM≅M of [L5] defines a morphism of Am-mod natural in M, because for a degree-zero map f:M→N one has βi(x⊗y)⋅f(m)=f(βi(x⊗y)⋅m) by Am-linearity of f and the unit isomorphisms for M and N are natural by [L5]; thus βi induces a natural transformation Ui(−)→Id, and the identical computation with wi in place of βi, using that γi is degree zero and left Am-linear by step 4.1, induces a natural transformation Id→Ui{−1}(−).

step 1.3step 4.1L5
6.1

Conclusion. The displayed element wi lies in Ui and has degree 1 by steps 1.1 and 1.2, so γi(a)=a⋅wi is a well-defined degree-zero map Am→Ui{−1} with γi(1)=wi; it is a map of (Am,Am)-bimodules by step 4.1, whose centrality input is the case check of steps 3.1, 3.2, 3.3, 3.4, 3.5, 3.6 and 3.7 over the finitely many arrows, each case using only the equality of the two returns at an interior vertex, the vanishing of monotone length-two paths and the vanishing of all paths of length three; and βi is the degree-zero bimodule map of step 1.3, uniquely determined by βi(ei⊗ei)=ei by step 2.1. Finally βi and γi induce the natural transformations of step 5.1, so the bimodule maps βi and γi of the source's Section 2d are defined, graded of degree zero and bimodule-linear, and the endpoints i=1 and i=m are covered by steps 3.2, 3.3 and 3.5 with the summand of step 1.1 omitted at i=m. All tensor products are over Z or over Am as indicated, the sums involved are finite, and no choice principle is used.

step 1.1step 1.2step 1.3step 2.1step 4.1step 5.1∎

Depends on

Used by

Dependency tree · two levels

26 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources