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 path ideal
Definition
Fix and let be the Khovanov–Seidel type A algebra of Khovanov–Seidel type A algebra, with its internal grading on vertices and arrows, extended to paths additively, and with vertex idempotents and unit . Let be the two-sided ideal generated by the classes of all arrows (The ideal generated by a subset and principal ideals); it is the smallest two-sided ideal containing every arrow, and it is computed in the proof below.
Claims. is homogeneous for the internal degree; is spanned as a -module by the classes of all paths of length at least one, and is spanned by the returns , so that ; and the quotient ring of The quotient ring with satisfies through the vertex idempotents, the isomorphism sending the class of to the -th standard basis vector. In particular the quotient module is concentrated on the vertex idempotents.
Facts & Assumptions
Given: An integer , the graded algebra with vertex idempotents , arrows and returns , and the two-sided ideal generated by the arrows.
The algebra has the -basis of classes , , , ; multiplication is left-to-right concatenation of paths, defined when the endpoint of the first equals the start of the second and zero otherwise; the relations make for and make every path of length at least three vanish in ; the vertices are mutually orthogonal idempotents with sum (The 4m+1 path basis, Khovanov–Seidel type A algebra).
An element of is homogeneous when it is a -linear combination of basis paths of one degree; each vertex and each up-arrow has degree , each down-arrow and each return has degree , and the product of homogeneous elements is homogeneous of the sum of the degrees (Khovanov–Seidel type A algebra).
is the intersection of all two-sided ideals of containing all arrows; it contains every arrow, is closed under addition and under left and right multiplication by elements of , and is generated by homogeneous elements (The ideal generated by a subset and principal ideals).
The elements of are additive cosets, with and (The quotient ring with ); hence its projection preserves addition and multiplication, and is its unit.
Proof
is spanned by the paths of length at least one, and is homogeneous. Write for the set of basis elements of [L1] that are arrows or returns, and for the -span of all paths of length at least one. Every generator of lies in , and is closed under left and right multiplication by : the product of a path of length at least one with any path is either or a concatenation of length at least one, and multiplication is bilinear; hence by minimality of the generated ideal. Conversely every path of length at least one is a product of arrows, hence lies in because a product of arrows belongs to and is closed under multiplication; so , and . Every basis element of is homogeneous by [L2], so , the span of the basis elements of , is homogeneous: it is the direct sum of its intersections with the homogeneous components of .
is spanned by the returns, and . By step 1.1 it suffices to compute products of two basis elements of and of three such elements. A concatenation of two paths of length at least one has length at least two, and by [L1] the only nonzero classes of length at least two in are the returns for (equal to only for ), each of which is a product of two arrows; hence is spanned by the returns. A concatenation of three paths of length at least one is a path of length at least three, which vanishes in by [L1], so .
The quotient is . The assignment for the standard basis vectors of and for every non-vertex basis element of [L1] is a unital ring homomorphism: on the multiplication table of [L1] one checks that a product of two basis elements, when nonzero, is either a vertex (and the product of the corresponding idempotents is , matching ) or a non-vertex basis path (whose image and whose factors' product of images are both unless both factors are vertices), and paths of length at least three vanish on both sides; bilinearity extends the check to . Since kills every arrow, it kills , define . This is well defined: if , then and . The coset formulas [L4] show that preserves addition and multiplication and sends to , so it is a unital ring homomorphism with . Let , , where ; the classes are orthogonal idempotents with because is a unital ring homomorphism, so is a unital ring homomorphism, and since . Conversely for every basis element of [L1]: for a vertex this is immediate, and for a non-vertex element both sides are because by step 1.1; hence and .
Conclusion. The ideal generated by the arrows is homogeneous and consists of the paths of length at least one, its square is spanned by the returns and its cube vanishes, and the quotient is on the vertex idempotents, all by steps 1.1–3.1. No choice principle is used.
Depends on
Used by
Dependency tree · two levels
11 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, J. Amer. Math. Soc. 15 (2002) 203-271, Section 1b (standard reference, not scraped)