Alphabeta Math
DefinitionDefinition: 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 triangulated K_0 of the Khovanov–Seidel projective category

Definition

Fix m≥1, let Cm=Kb(proj⁡grAm) be the bounded homotopy category of finite graded projective left Am-modules of The bounded projective homotopy category C_m and the two shifts, with its homological shift [1] and its distinguished triangles. To provide a literal set of indices, form the presentation-code category Mmcode: its objects are pairs (r,N) where r=(r1,…,rs) is a finite list of integers, Fr:=⨁j=1sAm{rj}, and N is a graded submodule of Fr; the pair represents Fr/N. Its morphisms are all degree-zero Am-module maps between the represented quotients. The proof shows that this is a small category and every object of Am-mod is isomorphic to a represented quotient. Let Cmcode be the small homotopy category of bounded complexes of these codes whose represented terms are finite graded projective, with finite direct sums encoded by concatenating presentations, and with distinguished triangles given by cone triangles and their isomorphic images. Every object of Cm and every distinguished triangle in Cm is represented up to isomorphism in Cmcode. Write Iso⁡code(Cm) for the set of isomorphism types in this coded category, and for X∈Cm let τ(X) be its unique represented type.

The group. Let F:=Z(Iso⁡code(Cm)) be the free abelian group on the set Iso⁡code(Cm) of The free module on a set and its standard basis, with standard basis element eτ(X) attached to the represented type of X, and let R≤F be the subgroup generated by all elements eτ(Y)−eτ(X)−eτ(Z) attached to the distinguished triangles X→Y→Z→X[1] in Cmcode. The zeroth K-group of Cm is K0(Cm):=F/R, and the class of an object X∈Cm is written [X]:=eτ(X)+R. This is the usual isomorphism-type presentation of the zeroth K-group defined in Stacks Project, Definition 13.28.1: its triangle relations identify isomorphic objects, as verified for Cm in step 4.1.

Why the notation denotes. Every claim needed to make the display meaningful is proved below: the coded category is small and represents all objects and triangle types of Cm, so the free abelian group on its isomorphism types exists and R is generated by a set; moreover Cm is triangulated, so that "distinguished triangle" refers to an actual triangulated structure. No skeleton or global choice of representatives is needed: the generators are isomorphism types in the explicit set of finite presentation codes, and any two codes for the same object determine the same type.

Elementary consequences. For isomorphic objects X≅Y one has [X]=[Y] in K0(Cm), and for the zero object [0]=0; moreover [X⊕Y]=[X]+[Y], so the group operation is compatible with finite direct sums in the expected way.

Scope. This is the K0 used on this page for the shift comparison: it is formed from the distinguished triangles of Cm only, and it imports no graded Cartan pairing, no generic perfect-complex machinery and no ungraded K0-of-an-abelian-category theorem beyond the definition.

Facts & Assumptions

Given: An integer m≥1, the algebra Am, the category Am-mod of finitely generated graded left Am-modules, and the category Cm=Kb(proj⁡grAm) with its homological shift and its distinguished triangles.

[L1]

Cm is the full subcategory of the homotopy category K(Am-mod) on the bounded complexes whose terms are finite graded projective left Am-modules; cones and homological shifts of such complexes again have finite graded projective terms and are objects of Cm; and K(Am-mod) with its shift and distinguished cone triangles is a triangulated category, so Cm inherits a triangulated structure whose distinguished triangles are the cone triangles and their isomorphic images (The bounded projective homotopy category C_m and the two shifts, The homotopy category of an abelian category is triangulated).

[L2]

Every object of Am-mod is generated by finitely many homogeneous elements, so it is a quotient of a finite direct sum Am{r1}⊕⋯⊕Am{rn} of internal shifts of the regular module; an object of Cm is a bounded complex of such modules; and the internal shift is a degree-zero automorphism of Am-mod (Finite graded A_m-modules, internal shifts and the vertex projectives, Associative graded algebras, bimodules, and internal shifts).

[L3]

For a set X the free abelian group Z(X) on X has the standard basis {ex}x∈X, every element being a unique finite Z-linear combination of basis elements; a subgroup generated by a set is well defined, and the quotient of an abelian group by a subgroup is an abelian group (The free module on a set and its standard basis, The quotient ring R/I with (r+I)(s+I)=rs+I).

[L4]

A category is small when its object and morphism collections are sets (Small, locally small, and large categories).

[L5]

In a triangulated category the triangles X→0→X[1]→1X[1] and X→(10)X⊕Y→(0  1)Y→X[1] are distinguished, and a triangle isomorphic to a distinguished triangle is itself distinguished (Zero and split triangles are distinguished, Triangulated-category axiom TR1).

Proof

technique · direct
1.1

The coded projective category is small and represents Cm. For each finite list r=(r1,…,rs) the graded submodules N⊆Fr=⨁jAm{rj} form a set, and the lists themselves form a set; hence the pairs (r,N) used in Mmcode form a set. For each pair of codes the degree-zero maps between the represented quotient modules form a set of functions, so [L4] makes Mmcode small. By finite generation in [L2], every module in Am-mod is isomorphic to a quotient represented by a code. A bounded complex has only finitely many nonzero terms, so choosing a code and an isomorphism for each such term and transporting its differentials gives an isomorphic code complex; these choices are finite for each complex, and no simultaneous choice over all complexes is made. If its terms are projective, the corresponding code terms are projective because they are isomorphic to them. The code complexes with projective terms and their chain-homotopy classes form a small category: there is a set of finite-support sequences of codes, a set of differentials between their represented modules, and a set of chain maps and homotopies. It is closed under shifts and cones, since finite direct sums are represented by concatenating presentations and a direct sum of finite projectives is projective. Thus it has a set of isomorphism types, and the realization functor is full and faithful and represents every object of Cm. Finally, each distinguished triangle of Cm is isomorphic to a cone triangle by [L1]; code its first two objects, transport the first map, and form its cone with the coded direct-sum terms. Therefore every triangle type is represented in the small coded category as well.

L1L2L4
2.1

K0(Cm) is a well-defined abelian group. By step 1.1 the index set Iso⁡code(Cm) is a set, so the free abelian group Z(Iso⁡code(Cm)) of [L3] is defined. Distinguished triangles in the small coded category form a set of diagrams, so their relation elements form a set; [L3] therefore gives the subgroup R and quotient group K0(Cm)=F/R. For any object X∈Cm, its represented type τ(X) is unique: if two coded complexes realize objects isomorphic to X, the composite of those isomorphisms is an isomorphism in the coded category because its realization is full and faithful. Thus [X]=eτ(X)+R is independent of the code used.

step 1.1L3
3.1

Code types and choice. The generators use the isomorphism types in the small coded category, not a skeleton of the large class of all complexes. For a fixed X, the existence of a code complex isomorphism is established by finitely many presentations, and uniqueness of its type follows from step 2.1; no choice function over all objects is needed. Hence the construction uses neither the Axiom of Choice nor dependent choice.

step 1.1step 2.1
3.2

The relations are genuine triangle relations. By [L1] the category Cm carries the triangulated structure inherited from K(Am-mod). Step 1.1 shows that every one of its distinguished triangles is isomorphic to a cone triangle in the coded category; the relations defining R therefore include exactly the usual relation [Y]−[X]−[Z] for every triangle type of Cm. The shift [1] in these triangles is the homological shift of Cm of [L1], never the internal shift.

step 1.1step 2.1L1
4.1

Isomorphic objects have equal classes, and [0]=0. Let f:X→Y be an isomorphism of Cm. The triangle X→fY→0→X[1] is isomorphic to the distinguished triangle X→1XX→0→X[1] of [L5] via the identity on the third and fourth vertices and f on the first two, so it is distinguished by the first axiom of [L5]; its relation reads [Y]=[X]+[0], while the triangle X→1XX→0→X[1] itself gives [X]=[X]+[0] and hence [0]=0 in K0(Cm). Therefore [X]=[Y] for isomorphic X and Y, as the notation [X] for an isomorphism class requires, and no relation depends on a choice of representative.

step 3.2L5
4.2

Direct sums add. By [L5] the canonical biproduct triangle X→X⊕Y→Y→X[1] is distinguished whenever X⊕Y exists in Cm, which it does since Cm is an additive full subcategory closed under finite direct sums of complexes of finite graded projective modules; its relation in F is [X⊕Y]=[X]+[Y] in K0(Cm), so the group operation of K0(Cm) is compatible with finite direct sums.

step 3.2L5
5.1

Conclusion. The set Iso⁡code(Cm) is supplied by step 1.1, so F=Z(Iso⁡code(Cm)) and the subgroup R generated by the distinguished-triangle relations are well defined and K0(Cm)=F/R is an abelian group by step 2.1; the relations represent every triangle type of Cm by step 3.2; isomorphic objects define the same class and [0]=0 by step 4.1 while [X⊕Y]=[X]+[Y] by step 4.2; and the construction needs neither a skeleton nor any choice principle by step 3.1. All sums in F are finite sums of basis elements, and the relations cover every distinguished triangle type of Cm.

step 1.1step 2.1step 3.1step 3.2step 4.1step 4.2∎

Depends on

Used by

Dependency tree · two levels

49 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