Alphabeta Math
LemmaStatement: 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 4m+1 path basis

Statement

Let m≥1 and let Am be the Khovanov–Seidel type A algebra of Khovanov–Seidel type A algebra. As a graded abelian group Am is free of rank 4m+1, with basis the images of the 4m+1 paths (0),…,(m);(0∣1),…,(m−1∣m);(1∣0),…,(m∣m−1);(1∣0∣1),…,(m∣m−1∣m), that is: the m+1 vertices, the 2m arrows, and one degree-one length-two return at each vertex i=1,…,m. Every path of length at least three has class 0 in Am, the monotone length-two path (i−1∣i∣i+1) and its reverse (i+1∣i∣i−1) have class 0 for 0<i<m, the return (0∣1∣0) has class 0, and at an interior vertex 0<i<m the two returns (i∣i+1∣i) and (i∣i−1∣i) have the same class. In particular Am is a finitely generated free abelian group, so its underlying Z-module is free of finite rank 4m+1.

Facts & Assumptions

Given: An integer m≥1, the doubled line quiver Γm, its path ring ZΓm, the ideal Im generated by the four families of relations, and the algebra Am=ZΓm/Im.

[F1]

ZΓm is the free abelian group on the directed paths of Γm; a product of composable paths is their left-to-right concatenation and a product of non-composable paths is 0; the unit is ∑i=0m(i), and (u)p=p for paths p with source u, respectively p(v)=p for paths with target v, these products being 0 otherwise (Integral path ring of a finite quiver).

[F2]

Am=ZΓm/Im, where Im is the two-sided ideal generated by (i−1∣i∣i+1) and (i+1∣i∣i−1) for 0<i<m, by the differences (i∣i+1∣i)−(i∣i−1∣i) for 0<i<m, and by (0∣1∣0); the internal degree is additive over concatenation, with deg⁡(i)=deg⁡(i∣i+1)=0 and deg⁡(i+1∣i)=1 (Khovanov–Seidel type A algebra).

[L3]

Every element of a free abelian group on a set X is a finite Z-linear combination of basis elements, and a Z-linear map out of it may be specified by arbitrary values on the basis (The free module on a set and its standard basis).

[L4]

In the quotient Am=ZΓm/Im two elements have equal classes exactly when their difference lies in Im; every generator of Im has class 0; and since Im is a two-sided ideal, multiplying any element of Im on either side by any element of ZΓm again gives an element of Im (The quotient ring R/I with (r+I)(s+I)=rs+I).

Proof

technique · direct
1.1

The relations in path notation. Write uj:=(j∣j+1) and dj:=(j+1∣j) for 0≤j≤m−1. The generators of Im read, in this notation, ujuj+1(0≤j≤m−2),dj+1dj(0≤j≤m−2),uidi−di−1ui−1(0<i<m),u0d0. Indeed (j∣j+1∣j+2)=ujuj+1, (j+2∣j+1∣j)=dj+1dj, (i∣i+1∣i)=uidi and (i∣i−1∣i)=di−1ui−1. Each of these elements has class 0 in Am by [L4]; in particular uidi and di−1ui−1 have the same class for 0<i<m, and u0d0 has class 0.

F1F2L4
1.2

A separating functional on the path ring. Let F be the free abelian group with basis e0,…,em,u0,…,um−1,d0,…,dm−1,r1,…,rm, a total of 4m+1 basis elements. By [L3] there is a unique Z-linear map ρ:ZΓm→F with ρ((i))=ei,ρ((i∣i+1))=ui,ρ((i+1∣i))=di, ρ((i∣i−1∣i))=ri(1≤i≤m),ρ((i∣i+1∣i))=ri(1≤i<m),ρ(p)=0 for every other path p. Here "other" covers (0∣1∣0), the monotone length-two paths not of return form, and all paths of length at least three; the two returns at an interior vertex are both sent to ri, and (m∣m−1∣m), the only return at m, is sent to rm.

F1L3
2.1

Length-two paths in Am. A length-two path (i1∣i2∣i3) has consecutive differences ±1 and is of one of four forms. If both steps go up it is (j∣j+1∣j+2)=ujuj+1 with 0≤j≤m−2, and if both go down it is (j+2∣j+1∣j)=dj+1dj with 0≤j≤m−2; both have class 0 in Am by step 1.1. If the steps are up-then-down it is the return (j∣j+1∣j)=ujdj at j, for 0≤j≤m−1: its class is 0 when j=0 by step 1.1 and otherwise equals the class of dj−1uj−1=(j∣j−1∣j). If the steps are down-then-up it is the return (j+1∣j∣j+1)=djuj at j+1, for 0≤j≤m−1, whose class equals that of uj+1dj+1 when j+1<m by step 1.1 and is the class of the unique return at m when j+1=m. Consequently the classes of length-two paths are 0 or one of r1,…,rm, and each of the two returns at an interior vertex represents the same class.

step 1.1F1
2.2

No path of length three survives. Let w=(v0∣v1∣v2∣v3) be a path of length three and put sj:=vj−vj−1∈{±1} for j=1,2,3, so that w is the product of its three arrows by [F1]. If s1=s2, then the subpath (v0∣v1∣v2) is monotone with interior vertex v1 satisfying 0<v1<m, hence is one of the generators of Im listed in step 1.1 and w=(v0∣v1∣v2) (v2∣v3)=0 in Am by [L4]. If s2=s3, the same argument applies to (v1∣v2∣v3) and w=(v0∣v1) (v1∣v2∣v3)=0. Otherwise s1≠s2 and s2≠s3, so v0=v2 and v1=v3: the path oscillates on the edge {j,j+1} with j=min⁡(v0,v1), and there are two cases. If v0=j, then w=ujdjuj=(ujdj)uj; for j=0 the factor u0d0 is the zero return at 0 by step 1.1, while for 1≤j≤m−1 the relation of step 1.1 rewrites ujdj as dj−1uj−1 and w=dj−1uj−1uj=dj−1(uj−1uj)=0, the inner product being the generator (j−1∣j∣j+1) of Im with 0<j<m. If v0=j+1, then w=djujdj and j+1≥1. If m=1 then j=0 and w=d0(u0d0)=0, the factor u0d0 being the zero return at 0 by step 1.1. If m≥2, the two possibilities are exhaustive: for j+1<m the relation at the interior vertex j+1 writes the middle return as djuj=uj+1dj+1, so w=uj+1(dj+1dj)=0, the inner product being the generator (j+2∣j+1∣j) with 0<j+1<m; and for j+1=m the relation at m−1, an interior vertex because m≥2, writes um−1dm−1=dm−2um−2, so w=dm−1(dm−2um−2)=(dm−1dm−2)um−2=0, the inner product now being the generator (m∣m−1∣m−2) with 0<m−1<m. All cases are exhausted, so w has class 0 in Am.

step 1.1F1L4
2.3

ρ vanishes on the relation ideal. The two-sided ideal Im consists of finite sums asb, where s is a relation generator from step 1.1 and a,b∈ZΓm: such sums form an ideal containing the generators and are contained in every such ideal. By bilinearity it suffices to consider basis paths a,b. Every path term in asb, if nonzero, has length ∣a∣+2+∣b∣. If this length is at least three, each term has ρ-image zero by step 1.2. Otherwise a,b are vertex paths. For a monotone generator, asb is either zero or the same monotone path, which ρ sends to zero. The same holds for s=u0d0. For s=uidi−di−1ui−1, both summands start and end at i: multiplication by vertex paths either kills both summands or retains both, and in the latter case their images are ri−ri=0. Thus ρ(asb)=0 for every relation generator, and linearity gives ρ(Im)=0.

step 1.1step 1.2F1F2
3.1

All paths of length at least three have class 0. We prove by induction on l≥3 that every path of length l has class 0 in Am. The case l=3 is step 2.2. For l≥4, write w=a w′ where a is the first arrow of w and w′ is the suffix of length l−1; by the induction hypothesis w′ has class 0, hence w=a w′ has class 0 by [L4], the product of the class of a with the class of w′ being the class of their concatenation by the ring structure of the quotient.

step 2.2F1L4
3.2

The functional descends. By step 2.3 the Z-linear map ρ vanishes on the additive subgroup Im⊆ZΓm. The quotient map ZΓm→Am=ZΓm/Im is a surjective homomorphism of abelian groups with kernel Im by [L4], so ρ factors through it: there is a Z-linear map ρˉ:Am→F with ρˉ(x+Im)=ρ(x) for every x∈ZΓm. It is surjective, because each basis element ei, ui, di, ri of F is the image of the class of the corresponding displayed path by step 1.2.

step 1.2step 2.3L3L4
4.1

The class map π is surjective. By step 3.1 and step 2.1, the images in Am of the 4m+1 displayed paths span Am as an abelian group: every path of length at least three is 0, every length-two path is 0 or one of the returns, and length-zero and length-one paths are the vertices and arrows. Let π:Z4m+1→Am be the Z-linear map sending the standard basis elements to these 4m+1 classes in the displayed order; it is surjective.

step 2.1step 3.1L3
5.1

The composite of π and ρˉ. Let F=Z4m+1 be identified with the free group of step 1.2 in the displayed basis. For each displayed path p one has ρ(p) equal to the corresponding basis element of F; hence, for the standard basis element ϵp attached to p, the composite ρˉ∘π satisfies ρˉπ(ϵp)=ρˉ(class of p)=ρ(p)=ϵp. Since both sides are Z-linear and agree on a basis, ρˉ∘π=idF by [L3].

step 1.2step 3.2step 4.1L3
6.1

Conclusion: a basis. From ρˉ∘π=idF of step 5.1, π is injective: if π(x)=0 then x=ρˉπ(x)=0. Since π is surjective by step 4.1 it is an isomorphism, so Am≅Z4m+1 and the images under π of the standard basis, namely the classes of the 4m+1 displayed paths, form a Z-basis of Am. In particular those classes are Z-linearly independent, the rank is 4m+1, and the vanishing and identification statements for paths of length at least two are exactly those of steps 2.1 and 3.1. The internal degrees of the basis elements are 0 for the vertices and ascending arrows and 1 for the descending arrows and the returns, by the degree convention of [F2], so the basis is graded as displayed.

step 2.1step 3.1step 4.1step 5.1F2∎

Depends on

Used by

Dependency tree · two levels

10 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