Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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.

Hard Lefschetz splitting for a three-degree complex

Example

Let k be a field and let T=Db(vectkfd) be the bounded derived category of finite-dimensional k-vector spaces with its canonical t-structure. Take K=k[2]⊕k⊕k[−2]∈T, and let L:K→K[2] identify the first summand k[2] with the shifted second summand k[2] of K[2], the second summand k with the shifted third summand k of K[2], and the third summand k[−2] with 0. Its nonzero t-cohomology objects are Ht−2(K)=k,Ht0(K)=k,Ht2(K)=k, and for every j≥0 the map Ht−j(Lj) is an isomorphism: j=0 and j=2 are the two Lefschetz steps, while for j=1 and for j≥3 both sides are zero. Consequently the splitting of Hard Lefschetz splits a bounded t-structure complex returns exactly K≅Ht−2(K)[2]⊕Ht0(K)⊕Ht2(K)[−2]=k[2]⊕k⊕k[−2]. This example tests the abstract splitting on the simplest complex with two hard Lefschetz steps; it does not test primitive-lift compatibility.

Facts & Assumptions

Given: A field k, the category vectkfd of finite-dimensional k-vector spaces and its bounded derived category T=Db(vectkfd) with the canonical t-structure, the object K=k[2]⊕k⊕k[−2] and the morphism L:K→K[2] described in the Example.

[F1]

Abelian and size structure of the coefficient category: finite-dimensional k-vector spaces form the full subcategory of the abelian category k-Mod (Modules over a ring form an abelian category) closed under kernels, cokernels and finite direct sums, as supplied by rank-nullity (Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T), the first isomorphism theorem (First isomorphism theorem in an abelian category) and the dimension of a direct sum (If V=⨁i<nUi with every Ui finite-dimensional, then V is finite-dimensional and dim⁡FV=∑i<ndim⁡FUi; in particular dim⁡F(U⊕W)=dim⁡FU+dim⁡FW); a finite-dimensional space is isomorphic to kn for n=dim⁡kV (Two finite-dimensional vector spaces over F are linearly isomorphic if and only if they have the same dimension), so the category is essentially small and the standing size hypothesis of Derived category of an abelian category holds. Hence T is triangulated (The derived category inherits a triangulated structure) and carries the canonical t-structure T≤0={X:Hi(X)=0 for i>0}, T≥0={X:Hi(X)=0 for i<0} on Db (Canonical t structure on a derived category, The canonical pair is a t structure), where Hi denotes the cohomology functor on the derived category (Cohomology factors through the derived category).

[F2]

Boundedness: a bounded complex has cohomology vanishing outside some finite interval of degrees, so it lies in T≤n∩T≥−n for n large; thus the canonical t-structure is bounded (Truncation functors, t-cohomology, amplitude and bounded t-structures).

[F3]

Heart and shift rules (t-cohomology is functorial, additive, shift-compatible and detects amplitude): an object of the heart satisfies X≅Ht0(X) and Htj(X)=0 for j≠0; more generally Htj(X[m])≅Htj+m(X) naturally, and for a finite biproduct the structure maps identify Htj of the sum with the direct sum of the Htj of the summands.

[F4]

The hard Lefschetz splitting lemma: for a triangulated category with a bounded t-structure and a morphism L:K→K[2] with every Ht−j(Lj), j≥0, an isomorphism, one has K≅⨁jHtj(K)[−j] (Hard Lefschetz splits a bounded t-structure complex).

Verification

technique · direct
1.1givenF1F2F3

By (F1) the category T=Db(vectkfd) is triangulated and carries the canonical t-structure, which is bounded by (F2). The complex k concentrated in degree zero lies in the heart, since Hi(k)=0 for i≠0; hence Ht0(k)≅k and Htj(k)=0 for j≠0 by (F3).

2.1step 1.1F3

Since k[m] satisfies Htj(k[m])≅Htj+m(k) by the shift rule (F3), it has Htj(k[m])≅k for j=−m and vanishing Htj otherwise. The object K=k[2]⊕k⊕k[−2] is a finite biproduct in the additive category T (Biproduct), so additivity of Htj gives Ht−2(K)≅k, Ht0(K)≅k, Ht2(K)≅k, and Htj(K)=0 for all other j; in particular Ht−1(K)=0 and Htj(K)=0 for j≥3.

3.1step 2.1given

The description of L is a well-defined morphism: K[2]=k[4]⊕k[2]⊕k, and L has the canonical isomorphisms k[2]→≅k[2] and k→≅k as its components onto the second and third summands of K[2], all other components being zero, so the third summand k[−2] is carried to 0. Its iterate L2=L[2]∘L maps K to K[4]=k[6]⊕k[4]⊕k[2], carrying the first summand k[2] isomorphically onto the third summand k[2] of K[4] (first through the second summand of K[2], then through the third summand of K[4]) and killing the other two summands; and L0=1K.

4.1step 2.1step 3.1F3

Hence Ht−j(Lj) is an isomorphism for every j≥0. For j=0 it is the identity of Ht0(K)=k; for j=1 its source Ht−1(K) is zero and its target Ht−1(K[2])≅Ht1(K) is zero; for j=2 it is the isomorphism induced on Ht−2 by the nonzero component k[2]→≅k[2] of L2, between Ht−2(K)≅k and Ht−2(K[4])≅Ht2(K)≅k; and for j≥3 the source Ht−j(K) and the target Ht−j(K[2j])≅Htj(K) both vanish. A map between zero objects is an isomorphism, so the hard Lefschetz hypothesis holds in every case.

5.1step 1.1step 4.1F4∎

The hypotheses of (F4) are therefore satisfied: T is triangulated with a bounded t-structure and L satisfies the hard Lefschetz condition. The lemma yields K≅⨁jHtj(K)[−j]=Ht−2(K)[2]⊕Ht0(K)⊕Ht2(K)[−2]=k[2]⊕k⊕k[−2], which is the displayed K, so the abstract splitting returns exactly the direct sum of the shifted t-cohomology objects and the example checks no more than that.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

77 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