Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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 m≥1 and let Am be the Khovanov–Seidel type A algebra of Khovanov–Seidel type A algebra, with its internal grading deg⁡ei=0,deg⁡(i∣i+1)=0,deg⁡(i+1∣i)=1 on vertices and arrows, extended to paths additively, and with vertex idempotents e0,…,em and unit 1=e0+⋯+em. Let J⊆Am be the two-sided ideal generated by the classes of all arrows (i∣i±1) (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. J is homogeneous for the internal degree; J is spanned as a Z-module by the classes of all paths of length at least one, and J2 is spanned by the returns (i∣i−1∣i), so that J3=0; and the quotient ring of The quotient ring R/I with (r+I)(s+I)=rs+I satisfies Am/J≅Zm+1 through the vertex idempotents, the isomorphism sending the class of ei to the i-th standard basis vector. In particular the quotient module Am/J≅Zm+1 is concentrated on the vertex idempotents.

Facts & Assumptions

Given: An integer m≥1, the graded algebra Am with vertex idempotents e0,…,em, arrows (i∣i±1) and returns (i∣i−1∣i), and the two-sided ideal J generated by the arrows.

[L1]

The algebra Am has the Z-basis of 4m+1 classes e0,…,em, (0∣1),…,(m−1∣m), (1∣0),…,(m∣m−1), (1∣0∣1),…,(m∣m−1∣m); 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 (i∣i−1∣i)=(i∣i+1∣i) for 0<i<m and make every path of length at least three vanish in Am; the vertices are mutually orthogonal idempotents with sum 1 (The 4m+1 path basis, Khovanov–Seidel type A algebra).

[L2]

An element of Am is homogeneous when it is a Z-linear combination of basis paths of one degree; each vertex and each up-arrow has degree 0, each down-arrow and each return has degree 1, and the product of homogeneous elements is homogeneous of the sum of the degrees (Khovanov–Seidel type A algebra).

[L3]

J is the intersection of all two-sided ideals of Am containing all arrows; it contains every arrow, is closed under addition and under left and right multiplication by elements of Am, and is generated by homogeneous elements (The ideal generated by a subset and principal ideals).

[L4]

The elements of Am/J are additive cosets, with [x]+[y]=[x+y] and [x][y]=[xy] (The quotient ring R/I with (r+I)(s+I)=rs+I); hence its projection π(x)=[x] preserves addition and multiplication, and [1] is its unit.

Proof

technique · direct
1.1L1L2L3

J is spanned by the paths of length at least one, and is homogeneous. Write B≥1 for the set of basis elements of [L1] that are arrows or returns, and P≥1 for the Z-span of all paths of length at least one. Every generator of J lies in P≥1, and P≥1 is closed under left and right multiplication by Am: the product of a path of length at least one with any path is either 0 or a concatenation of length at least one, and multiplication is bilinear; hence J⊆P≥1 by minimality of the generated ideal. Conversely every path of length at least one is a product of arrows, hence lies in J because a product of arrows belongs to J and J is closed under multiplication; so P≥1⊆J, and P≥1=J. Every basis element of B≥1 is homogeneous by [L2], so J, the span of the basis elements of B≥1, is homogeneous: it is the direct sum of its intersections with the homogeneous components of Am.

2.1step 1.1L1

J2 is spanned by the returns, and J3=0. By step 1.1 it suffices to compute products of two basis elements of B≥1 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 Am are the returns (i∣i−1∣i) for 1≤i≤m (equal to (i∣i+1∣i) only for i<m), each of which is a product (i∣i−1)(i−1∣i) of two arrows; hence J2 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 Am by [L1], so J3=0.

3.1step 2.1L1L4

The quotient is Zm+1. The assignment ψ0(ei):=ui for the standard basis vectors u0,…,um of Zm+1 and ψ0(b):=0 for every non-vertex basis element b 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 δijei, matching uiuj=δijui) or a non-vertex basis path (whose image and whose factors' product of images are both 0 unless both factors are vertices), and paths of length at least three vanish on both sides; bilinearity extends the check to Am. Since ψ0 kills every arrow, it kills J, define ψ([x]):=ψ0(x). This is well defined: if [x]=[y], then x−y∈J and ψ0(x)−ψ0(y)=ψ0(x−y)=0. The coset formulas [L4] show that ψ preserves addition and multiplication and sends [1] to 1, so it is a unital ring homomorphism with ψπ=ψ0. Let φ:Zm+1→Am/J, φ(a0,…,am):=∑iai[ei], where [ei]=π(ei); the classes [ei] are orthogonal idempotents with ∑i[ei]=1 because π is a unital ring homomorphism, so φ is a unital ring homomorphism, and ψφ=id since ψ([ei])=ui. Conversely φψ([b])=[b] for every basis element b of [L1]: for a vertex this is immediate, and for a non-vertex element both sides are 0 because b∈J by step 1.1; hence φψ=idAm/J and Am/J≅Zm+1.

4.1step 1.1step 2.1step 3.1∎

Conclusion. The ideal J 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 Zm+1 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