Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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.

An explicit projective resolution of the vertex module S_2 for A_2

Example

Let A2 be the Khovanov–Seidel type A algebra with its vertex projectives P0,P1,P2=A2e0,A2e1,A2e2 of The algebra A_2 and its vertex projectives and let S2 be the vertex module of The vertex modules S_i and their prime quotients: the group Z placed in internal degree 0, with e2 acting as the identity and every other path of A2 acting as 0. Then S2 has the explicit graded projective resolution 0⟶P0→ ⋅(0∣1) P1→ ⋅(1∣2) P2→ ε S2⟶0, where the two inner maps are right multiplication by the degree-zero ascending arrows (0∣1) and (1∣2) and the last map is the A2-linear surjection with ε(e2)=1. Every map is a degree-zero A2-module map, and the sequence is exact at each of its three nonzero terms.

Facts & Assumptions

Given: The algebra A2 with its nine-element path basis, the vertex projectives P0,P1,P2 and their bases of paths ending at 0,1,2, the internal degree with deg⁡(0∣1)=deg⁡(1∣2)=0 and deg⁡(1∣0)=deg⁡(2∣1)=deg⁡(1∣0∣1)=deg⁡(2∣1∣2)=1, and the vertex module S2.

[L1]

P0=Z(0)⊕Z(1∣0), P1=Z(1)⊕Z(0∣1)⊕Z(2∣1)⊕Z(1∣0∣1) and P2=Z(2)⊕Z(1∣2)⊕Z(2∣1∣2), with the degrees displayed; products of composable paths are left-to-right concatenations, products of non-composable paths are 0, every path of length at least three vanishes in A2, (0∣1∣0)=0, (0∣1∣2)=0 and (1∣2∣1)=(1∣0∣1) (The algebra A_2 and its vertex projectives).

[F2]

S2 is Z in internal degree 0 with e2 acting as the identity and every other path of the quiver, in particular every arrow and every return, acting as 0; it is a finitely generated graded left A2-module, and a graded A2-linear map P2→S2 is determined by the image of e2 (The vertex modules S_i and their prime quotients).

[L3]

For a finitely generated graded left Am-module M, a finite graded projective resolution is an exact sequence 0→Pa→⋯→P0→M→0 with every Pk finite graded projective and every map degree zero; S2 is known to admit such a resolution with all terms of the form Pj, so a displayed sequence is compared with it term by term (Projective resolutions in an abelian category, The Khovanov-Seidel grid resolutions of the vertex modules).

[L4]

Right multiplication by a degree-zero path q from j to k is the degree-zero Am-linear map Pj→Pk given on a path p ending at j by p↦pq, which is 0 unless q begins at j and, when nonzero, is the concatenation of p and q (The algebra A_2 and its vertex projectives, Finite graded A_m-modules, internal shifts and the vertex projectives).

Verification

technique · direct
1.1

The map P0→P1. By [L4] right multiplication by (0∣1) is the degree-zero A2-linear map P0→P1 with (0)↦(0)(0∣1)=(0∣1) and (1∣0)↦(1∣0)(0∣1)=(1∣0∣1) by [L1]; both images are basis elements of P1 by [L1], the degrees are preserved because (0) and (0∣1) have degree 0 and (1∣0) and (1∣0∣1) have degree 1, and the map is injective because it carries a basis to a linearly independent set.

L1L4
1.2

The map P1→P2. Right multiplication by (1∣2) is the degree-zero A2-linear map P1→P2 with (1)↦(1∣2), (2∣1)↦(2∣1)(1∣2)=(2∣1∣2), (0∣1)↦(0∣1)(1∣2)=(0∣1∣2)=0 and (1∣0∣1)↦(1∣0∣1)(1∣2)=(1∣0∣1∣2)=0, the last two being respectively a monotone length-two path and a length-three path; again (1) and (1∣2) have degree 0 while (2∣1) and (2∣1∣2) have degree 1.

L1L4
1.3

The map P2→S2. Define ε to be the A2-linear map with ε(e2)=1 and ε((1∣2))=ε((2∣1∣2))=0, which is well defined by the formula ε(ae2)=a⋅1: if ae2=0, then a⋅1=(ae2)⋅1=0 since e2⋅1=1. This formula is A2-linear by the module action in [F2]; it is surjective because S2=Z⋅1 and it is degree zero because e2 has degree 0.

F2L1
2.1

Every composite in the sequence is zero. The composite P0→P1→P2 is right multiplication by (0∣1)(1∣2)=(0∣1∣2)=0 by step 1.1, step 1.2 and [L1]; the composite P1→P2→S2 kills the image of the second map, namely the basis elements (1∣2) and (2∣1∣2), which are sent to 0 by step 1.3.

step 1.1step 1.2step 1.3L1
2.2

Exactness at P1. By step 1.2 the kernel of right multiplication by (1∣2) is the span of the two basis elements that are killed, (0∣1) and (1∣0∣1), and by step 1.1 the image of right multiplication by (0∣1) is exactly the span of (0∣1) and (1∣0∣1); the two submodules of P1 are therefore equal, so ker⁡(P1→P2)=im(P0→P1).

step 1.1step 1.2
2.3

Exactness at P2. A basis element of P2 is in the kernel of ε exactly when it is not (2), since ε((2))=1, so ker⁡ε=Z(1∣2)⊕Z(2∣1∣2) by step 1.3; by step 1.2 that span is exactly the image of right multiplication by (1∣2), so ker⁡ε=im(P1→P2).

step 1.2step 1.3
3.1

Conclusion. The displayed sequence 0→P0→P1→P2→S2→0 has finitely generated graded projective resolution terms P0,P1,P2, all maps are degree-zero A2-linear maps by steps 1.1, 1.2 and 1.3, the first map is injective by step 1.1, the last is surjective by step 1.3, every composite is zero by step 2.1 and the sequence is exact at P1 and at P2 by steps 2.2 and 2.3; hence it is a finite graded projective resolution of the vertex module S2, of length 2, as in [L3]. The two inner differentials are right multiplications by the degree-zero arrows (0∣1) and (1∣2), exactly the arrows ascending toward the vertex 2; the module S2 is a rank-one Z-module and is therefore not a simple module over A2 in the ungraded sense, the word "simple" belonging to the inherited identifier only.

step 1.1step 1.3step 2.2step 2.3L3∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

30 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