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 and let be the Khovanov–Seidel type A algebra of Khovanov–Seidel type A algebra. As a graded abelian group is free of rank , with basis the images of the paths that is: the vertices, the arrows, and one degree-one length-two return at each vertex . Every path of length at least three has class in , the monotone length-two path and its reverse have class for , the return has class , and at an interior vertex the two returns and have the same class. In particular is a finitely generated free abelian group, so its underlying -module is free of finite rank .
Facts & Assumptions
Given: An integer , the doubled line quiver , its path ring , the ideal generated by the four families of relations, and the algebra .
is the free abelian group on the directed paths of ; a product of composable paths is their left-to-right concatenation and a product of non-composable paths is ; the unit is , and for paths with source , respectively for paths with target , these products being otherwise (Integral path ring of a finite quiver).
, where is the two-sided ideal generated by and for , by the differences for , and by ; the internal degree is additive over concatenation, with and (Khovanov–Seidel type A algebra).
Every element of a free abelian group on a set is a finite -linear combination of basis elements, and a -linear map out of it may be specified by arbitrary values on the basis (The free module on a set and its standard basis).
In the quotient two elements have equal classes exactly when their difference lies in ; every generator of has class ; and since is a two-sided ideal, multiplying any element of on either side by any element of again gives an element of (The quotient ring with ).
Proof
The relations in path notation. Write and for . The generators of read, in this notation, Indeed , , and . Each of these elements has class in by [L4]; in particular and have the same class for , and has class .
A separating functional on the path ring. Let be the free abelian group with basis a total of basis elements. By [L3] there is a unique -linear map with Here "other" covers , 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 , and , the only return at , is sent to .
Length-two paths in . A length-two path has consecutive differences and is of one of four forms. If both steps go up it is with , and if both go down it is with ; both have class in by step 1.1. If the steps are up-then-down it is the return at , for : its class is when by step 1.1 and otherwise equals the class of . If the steps are down-then-up it is the return at , for , whose class equals that of when by step 1.1 and is the class of the unique return at when . Consequently the classes of length-two paths are or one of , and each of the two returns at an interior vertex represents the same class.
No path of length three survives. Let be a path of length three and put for , so that is the product of its three arrows by [F1]. If , then the subpath is monotone with interior vertex satisfying , hence is one of the generators of listed in step 1.1 and in by [L4]. If , the same argument applies to and . Otherwise and , so and : the path oscillates on the edge with , and there are two cases. If , then ; for the factor is the zero return at by step 1.1, while for the relation of step 1.1 rewrites as and the inner product being the generator of with . If , then and . If then and , the factor being the zero return at by step 1.1. If , the two possibilities are exhaustive: for the relation at the interior vertex writes the middle return as , so , the inner product being the generator with ; and for the relation at , an interior vertex because , writes , so , the inner product now being the generator with . All cases are exhausted, so has class in .
vanishes on the relation ideal. The two-sided ideal consists of finite sums , where is a relation generator from step 1.1 and : such sums form an ideal containing the generators and are contained in every such ideal. By bilinearity it suffices to consider basis paths . Every path term in , if nonzero, has length . If this length is at least three, each term has -image zero by step 1.2. Otherwise are vertex paths. For a monotone generator, is either zero or the same monotone path, which sends to zero. The same holds for . For , both summands start and end at : multiplication by vertex paths either kills both summands or retains both, and in the latter case their images are . Thus for every relation generator, and linearity gives .
All paths of length at least three have class . We prove by induction on that every path of length has class in . The case is step 2.2. For , write where is the first arrow of and is the suffix of length ; by the induction hypothesis has class , hence has class by [L4], the product of the class of with the class of being the class of their concatenation by the ring structure of the quotient.
The functional descends. By step 2.3 the -linear map vanishes on the additive subgroup . The quotient map is a surjective homomorphism of abelian groups with kernel by [L4], so factors through it: there is a -linear map with for every . It is surjective, because each basis element , , , of is the image of the class of the corresponding displayed path by step 1.2.
The class map is surjective. By step 3.1 and step 2.1, the images in of the displayed paths span as an abelian group: every path of length at least three is , every length-two path is or one of the returns, and length-zero and length-one paths are the vertices and arrows. Let be the -linear map sending the standard basis elements to these classes in the displayed order; it is surjective.
The composite of and . Let be identified with the free group of step 1.2 in the displayed basis. For each displayed path one has equal to the corresponding basis element of ; hence, for the standard basis element attached to , the composite satisfies . Since both sides are -linear and agree on a basis, by [L3].
Conclusion: a basis. From of step 5.1, is injective: if then . Since is surjective by step 4.1 it is an isomorphism, so and the images under of the standard basis, namely the classes of the displayed paths, form a -basis of . In particular those classes are -linearly independent, the rank is , 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 for the vertices and ascending arrows and for the descending arrows and the returns, by the degree convention of [F2], so the basis is graded as displayed.
Depends on
Used by
- The internal and homological shifts are not interchangeable Counterexample
- Finite graded Aₘ-modules, internal shifts and the vertex projectives Definition
- The Khovanov–Seidel bimodule maps βᵢ and γᵢ Definition
- The two-sided projective bimodules Uᵢ and their tensor functors Definition
- The algebra A₂ and its vertex projectives Example
- The graded horseshoe lemma for finite graded projective resolutions Lemma
- The Khovanov-Seidel grid resolutions of the vertex modules Lemma
- Corner computations: the Uᵢ satisfy the Temperley-Lieb relations Theorem
- Finite homological dimension of the finite graded Khovanov-Seidel module category Theorem
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
- Mikhail Khovanov and Paul Seidel, Quivers, Floer Cohomology, and Braid Group Actions, §1b, printed pp. 3-4 (standard reference, not scraped)