Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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 splits a bounded t-structure complex

Statement

Let T be a triangulated category with a bounded t-structure, with truncation functors and t-cohomology as in Truncation functors, t-cohomology, amplitude and bounded t-structures and t-cohomology is functorial, additive, shift-compatible and detects amplitude. Let K∈T and let L:K→K[2] be a morphism such that for every integer j≥0 the map Ht−j(Lj):Ht−j(K)⟶Ht−j(K[2j])≅Htj(K) is an isomorphism, where Lj:=L[2j−2]∘⋯∘L[2]∘L is the j-fold iterate (so L0=1K) and the identification is the shift isomorphism Htj(K)≅Ht−j(K[2j]) of that lemma. Then there is an isomorphism K≅⨁jHtj(K)[−j] in T; the sum is finite because the t-structure is bounded. The isomorphism is not asserted to be canonical, and no compatibility with primitive lifts is claimed: this is the abstract splitting criterion, not the stronger primitive-compatible decomposition used in the Hodge theory of projective maps. The degenerate case in which Ht−n(K) and Htn(K) are both zero (they vanish together because Ht−n(Ln) is an isomorphism) is covered by the same formulas, all of which are then the zero maps between zero objects.

Facts & Assumptions

Given: A t-structure (T≤0,T≥0) on a triangulated category T, bounded in the sense of Truncation functors, t-cohomology, amplitude and bounded t-structures, with truncation functors τ≤n,τ≥n and t-cohomology Htn; an object K∈T and a morphism L:K→K[2] whose iterates Lj:K→K[2j] satisfy the hard Lefschetz hypothesis of the Statement.

[F1]

Boundedness and amplitude detection: there is n≥0 with K∈T≤n∩T≥−n, and then Htj(K)=0 for every ∣j∣>n; conversely, if Htj(K)=0 for every ∣j∣>n then K∈T≤n∩T≥−n (Truncation functors, t-cohomology, amplitude and bounded t-structures, (iv) of t-cohomology is functorial, additive, shift-compatible and detects amplitude).

[F2]

Truncation package (Truncation triangles are essentially unique and give adjoint truncation functors, t-cohomology is functorial, additive, shift-compatible and detects amplitude): Hom⁡(T≤m,T≥m+1)=0 for every m, and T≤m⊆T≤m′, T≥m′⊆T≥m whenever m≤m′; X∈T≤m if and only if τ≥m+1X=0, and X∈T≥m if and only if τ≤m−1X=0; the aisles are closed under extensions and finite direct sums, and a finite direct sum lies in an aisle exactly when each summand does. If X∈T≥m then τ≤mX≅Htm(X)[−m], and if X∈T≤m then τ≥mX≅Htm(X)[−m], the identification using the truncation maps of X; in particular an object lying in T≤m∩T≥m is canonically isomorphic to Htm(X)[−m]. The assignments Htm are functors, Htm(X[r])≅Htm+r(X) naturally, and for a finite biproduct X⊕Y the structure maps give mutually inverse isomorphisms (Htm(iX),Htm(iY)):Htm(X)⊕Htm(Y)→Htm(X⊕Y) and (Htm(pX),Htm(pY)). If X,Y lie in T≤m∩T≥m, then under the canonical identifications X≅Htm(X)[−m], Y≅Htm(Y)[−m] the map Hom⁡(X,Y)→Hom⁡(Htm(X),Htm(Y)), f↦Htm(f), is a bijection; in particular a morphism X→Y is an isomorphism exactly when Htm(f) is.

[F3]

TR1 and TR3: every morphism extends to a distinguished triangle, and a commutative square formed by the first maps of two distinguished triangles extends to a morphism of triangles (Triangulated-category axiom TR1, Triangulated-category axiom TR3, Morphism and isomorphism of triangles).

[F4]

Rotations and split triangles: with the signs of Rotation of a triangle, the inverse rotation Z[−1]→−h[−1]X→fY→gZ of a distinguished triangle X→fY→gZ→hX[1] is distinguished (Distinguished triangles are closed under shifts and both rotations); the triangle X→1XX→0→X[1] is distinguished, and a distinguished triangle X→0Y→gZ→hX[1] is isomorphic to X→0Y→(10)Y⊕X[1]→(0  1)X[1] (Zero and split triangles are distinguished, A distinguished triangle with zero first map is split).

[F5]

The triangulated category is additive and has finite biproducts (Triangulated category, Additive category, Biproduct): for a biproduct diagram (X⊕Y,iX,iY,pX,pY) one has pXiX=1X, pYiY=1Y, pXiY=0, pYiX=0 and iXpX+iYpY=1X⊕Y, and a pair of morphisms into or out of a biproduct is determined by its components, composition being matrix multiplication.

Proof

technique · induction on an amplitude bound
1.1basegivenF1F2

Base case. Let n=0 and let K∈T≤0∩T≥0 admit such an L. Then K lies in both aisles, so the concentration identity of (F2) applied with m=0 gives a canonical isomorphism K≅Ht0(K)[0]=Ht0(K), while amplitude detection gives Htj(K)=0 for every j≠0; hence the asserted direct sum is the single term Ht0(K) and the conclusion holds.

1.2ihgivenF1F2

Induction step. Fix n≥1 and assume as induction hypothesis that the assertion holds for every object of T≤n−1∩T≥−(n−1) admitting a morphism L′ with Ht−j(L′ j) an isomorphism for every j≥0. Let K∈T≤n∩T≥−n and let L:K→K[2] satisfy the hard Lefschetz hypothesis, and put A:=Ht−n(K), B:=Htn(K) and h:=Ht−n(Ln):A→B; the map h is an isomorphism by hypothesis and A,B lie in the heart. Since K∈T≥−n and K∈T≤n, concentration (F2) identifies the truncation maps of K at −n and n with morphisms a:A[n]→K and b:K→B[−n] for which Ht−n(a):A→Ht−n(K)=A and Htn(b):B→Htn(B[−n])=B are the canonical identifications. Since A[n]∈T≤−n, B[−n]∈T≥n and T≥n⊆T≥−n+1 as n≥1, the orthogonality in (F2) gives ba=0.

2.1step 1.2F2

Define c:=Ln[−2n]∘a[−2n]∘h−1[−n]:B[−n]→K and r:=h−1[n]∘b[2n]∘Ln:K→A[n], so that bc=1B[−n] and ra=1A[n]. Indeed, on Htn the composite bc induces h∘1A∘h−1=1B: the shift isomorphisms of (F2) convert the induced maps of h−1[−n], a[−2n] and Ln[−2n] into h−1, the canonical identification of A≅Ht−n(K) and h respectively, and b induces the canonical identification of B; since B[−n] lies in T≤n∩T≥n and therefore has Htm=0 for m≠n, map detection (F2) upgrades the identity on Htn to the identity of morphisms bc=1B[−n]. Symmetrically ra=1A[n]: the shift isomorphisms convert the induced maps of Ln, b[2n] and h−1[n] into h, the canonical identification of B and h−1, so ra induces h−1∘1B∘h=1A on Ht−n, and A[n] lies in T≤−n∩T≥−n with t-cohomology concentrated in degree −n.

3.1step 1.2step 2.1F5

Put r′:=r−(rc)b, where rc:=r∘c:B[−n]→A[n] and (rc)b:=(rc)∘b:K→A[n]. Then r′a=ra−(rc)(ba)=1−0=1 and r′c=rc−(rc)(bc)=rc−rc=0, while ba=0 and bc=1 by steps 1.2 and 2.1; hence with respect to the biproduct structure of A[n]⊕B[−n] the composite (r′,b)∘(a,c) has matrix (r′ar′cbabc)=(1001) and equals the identity, so (a,c) has the left inverse (r′,b).

4.1step 3.1F3F4

By TR1 complete the map u:=(a,c):A[n]⊕B[−n]→K to a distinguished triangle A[n]⊕B[−n]→uK→vK0→w(A[n]⊕B[−n])[1]. The square formed by u and by (r′,b):K→A[n]⊕B[−n] commutes, since (r′,b)u=1 by step 3.1; TR3 applied to this square and to the distinguished triangle A[n]⊕B[−n]→1A[n]⊕B[−n]→0→⋯ of (F4) yields a morphism of triangles whose first two components are the identity and (r′,b) and whose third component h′ satisfies w=δh′, where δ:0→(A[n]⊕B[−n])[1] is the zero morphism; hence w=0.

5.1step 4.1F4F5

The inverse rotation is K0[−1]→0X→uK→vK0, where X=A[n]⊕B[−n], by step 4.1 and (F4). Applying the zero-first-map split criterion (F4) supplies an isomorphism g:K→X⊕K0 with gu=(10) and (0  1)g=v. Here the criterion can be taken to fix its first two vertices: its proof constructs the third-vertex isomorphism from a section of the final map. Put R:=(1  0)g, i:=g−1(01) and p:=(0  1)g=v. Then pi=1K0, Ru=1X, pu=0, Ri=0 and uR+ip=1K. Thus (u,i,R,p) is a biproduct diagram and K≅A[n]⊕K0⊕B[−n].

6.1step 1.2step 5.1F2F5

Additivity (F2) applied to this biproduct gives, for every m, an isomorphism (Htm(u),Htm(i)):Htm(X)⊕Htm(K0)→Htm(K) with inverse (Htm(R),Htm(p)), where X:=A[n]⊕B[−n]. On the extreme degrees the first component is an isomorphism: with respect to the biproduct X=A[n]⊕B[−n] the map Ht−n(u) has components (Ht−n(a),Ht−n(c))=(1A,0), since Ht−n(a)=1A by step 1.2 and Ht−n(B[−n])=Ht−2n(B)=0; and Htn(u) has components (Htn(a),Htn(c))=(0,Htn(c)), since Htn(A[n])=Ht2n(A)=0 while Htn(c) is an isomorphism because Htn(b)Htn(c)=Htn(bc)=1B and Htn(b) is the canonical identification. An isomorphism (f,g):C⊕D→E with f an isomorphism has D=0: if (ψ1,ψ2) is its inverse, then ψ2f=0 forces ψ2=ψ2ff−1=0, and then 1D=ψ2g=0. Applying this to the isomorphisms (Ht−n(u),Ht−n(i)) and (Htn(u),Htn(i)), whose first components are isomorphisms, yields Ht−n(K0)=0 and Htn(K0)=0.

7.1step 6.1F2

Since K≅X⊕K0 and K∈T≤n∩T≥−n, the direct-sum clause of (F2) gives K0∈T≤n∩T≥−n. From K0∈T≥−n and Ht−n(K0)=0, concentration gives τ≤−nK0≅Ht−n(K0)[n]=0, so K0∈T≥−n+1 by the aisle criterion of (F2); dually K0∈T≤n and Htn(K0)=0 give τ≥nK0≅Htn(K0)[−n]=0, so K0∈T≤n−1. Moreover additivity gives morphisms (Htm(u),Htm(i)):Htm(X)⊕Htm(K0)→Htm(K) with inverse (Htm(R),Htm(p)); for −n<m<n both components Htm(a) and Htm(c) of Htm(u) vanish, because their sources Htm(A[n])=Htm+n(A) and Htm(B[−n])=Htm−n(B) are zero when m≠−n respectively m≠n, so Htm(u)=0 and Htm(i):Htm(K0)→Htm(K) is an isomorphism with inverse Htm(p), since Htm(p)Htm(i)=Htm(pi)=1. In particular Htm(K0)≅Htm(K) for every ∣m∣<n.

8.1step 7.1F1F2

Define L0:=p[2]∘L∘i:K0→K0[2], so that L00=1K0. For 1≤j<n the map Ht−j(L0j) is an isomorphism. Indeed, expanding the iterate L0j=L0[2j−2]∘⋯∘L0[2]∘L0 and applying Ht−j factor by factor, the factor Ht−j(L0[2k]) corresponds under the shift isomorphisms of (F2) to Htmk(p[2]∘L∘i)=Htmk+2(p)∘Htmk(L)∘Htmk(i), where mk:=−j+2k; for the intermediate degrees mk with 1≤k≤j−1 one has ∣mk∣<n, so by step 7.1 together with Htmk(p)Htmk(i)=Htmk(pi)=1 the maps Htmk(i) and Htmk(p) are mutually inverse isomorphisms and the inserted pair Htmk(i)∘Htmk(p)=Htmk(ip) is the identity. The composite therefore corresponds to Htj(p)∘Ht−j(Lj)∘Ht−j(i), in which Ht−j(Lj) is an isomorphism by hypothesis and the outer maps are isomorphisms because −j and j are interior degrees. For j≥n, both Ht−j(K0) and Htj(K0) vanish by step 7.1 and amplitude detection, so Ht−j(L0j) is a morphism between zero objects, hence an isomorphism. Thus L0 satisfies the hard Lefschetz hypothesis on the object K0∈T≤n−1∩T≥−(n−1).

9.1step 1.2step 8.1

By the induction hypothesis of step 1.2, applied to the object K0∈T≤n−1∩T≥−(n−1) and the morphism L0 of step 8.1, there is an isomorphism K0≅⨁jHtj(K0)[−j], a finite sum because Htj(K0)=0 for ∣j∣>n−1.

10.1step 1.1step 5.1step 7.1step 9.1discharge-induction∎

Combining the results: step 5.1 gives an isomorphism K≅A[n]⊕K0⊕B[−n]; step 7.1 identifies Htm(K0)≅Htm(K) for ∣m∣<n; step 9.1 decomposes K0. Substituting A=Ht−n(K), B=Htn(K) and inserting the vanishing extreme cohomology of K0 gives the asserted isomorphism K≅Ht−n(K)[n]⊕⨁∣j∣<nHtj(K)[−j]⊕Htn(K)[−n]=⨁jHtj(K)[−j], a finite sum because Htj(K)=0 for ∣j∣>n by amplitude detection. Boundedness supplies such an n for every object K, the base case of step 1.1 and the induction step of steps 1.2 to 9.1 cover every n≥0, and therefore the splitting holds for arbitrary K.

Depends on

Used by

Dependency tree · two levels

31 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