Alphabeta Math
Pipeline-generated
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.

✓ 5 results · all verified · 5 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 5 also cleared it.

Lefschetz Splitting In Bounded Triangulated Categories

1 · Prerequisites

2 · Summary

Objective. This page isolates the abstract Hard Lefschetz splitting mechanism of a bounded t-structure, the form in which the Lefschetz theorems of Hodge theory are consumed by perverse-sheaf arguments. The first three items are local prerequisites: truncation functors, t-cohomology and bounded t-structures are fixed by convention; truncation triangles are shown to be essentially unique, to define adjoint truncation functors, and to satisfy the orthogonality, aisle, extension and direct-sum criteria; and t-cohomology is shown to be functorial, shift-compatible, additive over finite biproducts, to detect amplitude, and to be detected on single-degree objects. Everything is proved from the t-structure axioms and the standard triangulated-category formalism of the source family (Beilinson–Bernstein–Deligne, Astérisque 100, §1.3), with no choice principle used.

Claims. On that basis the page proves the abstract splitting criterion of Deligne: if a degree-two endomorphism L of a bounded-amplitude object K induces isomorphisms Ht−j(Lj):Ht−j(K)→Htj(K) for every j≥0, then K is isomorphic to the finite direct sum of its shifted t-cohomology objects. The isomorphism is deliberately not asserted to be canonical and carries no compatibility with primitive lifts, so the lemma serves as the abstract non-canonical splitting input rather than the stronger primitive-compatible decomposition of the Hodge theory of projective maps. The page then records the graded primitive decomposition attached to such a Lefschetz operator and the canonical, self-dual nilpotent Lefschetz filtration, together with the descended nondegenerate forms on its graded pieces. The companion page computes the splitting in the smallest case with two Lefschetz steps.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

Truncation functors, t-cohomology, amplitude and bounded t-structures

Definition

Let (T≤0,T≥0) be a t-structure on a triangulated category T with translation [1] (Canonical t structure on a derived category, Triangulated category), and set T≤n:=T≤0[−n] and T≥n:=T≥0[−n] for n∈Z; thus X∈T≤n exactly when X[n]∈T≤0, and X∈T≥n exactly when X[n]∈T≥0.

For X∈T and n∈Z, the t-structure axiom applied to the translate X[n] and then shifted by [−n] produces a distinguished triangle τ≤nX⟶X⟶τ≥n+1X⟶τ≤nX[1] with τ≤nX∈T≤n and τ≥n+1X∈T≥n+1; such a triangle is a truncation triangle of X at n. Truncation triangles of the same X at the same n are canonically isomorphic over X, so the objects and maps occurring in them are determined up to a unique compatible isomorphism (Truncation triangles are essentially unique and give adjoint truncation functors ↗); one writes τ≤n and τ≥n for the resulting truncation functors.

The t-cohomology of X is Htn(X):=(τ≤nτ≥nX)[n], an object of the heart C=T≤0∩T≥0 (t-cohomology is functorial, additive, shift-compatible and detects amplitude ↗). The amplitude of X is the set of n with Htn(X)≇0; it is contained in an interval [a,b] when Htn(X)=0 for every n∉[a,b]. The t-structure is bounded when every object of T lies in T≤n∩T≥−n for some integer n depending on the object.

This item fixes notation and conventions only. Existence of the truncation triangle is the t-structure axiom itself, applied to X[n] and shifted; the essential uniqueness of that triangle, the functoriality of the truncations and all algebraic properties of τ≤n, τ≥n and Htn are proved in the two immediately following lemmas.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Truncation triangles are essentially unique and give adjoint truncation functors

Statement

Let (T≤0,T≥0) be a t-structure on a triangulated category T, with truncations as in Truncation functors, t-cohomology, amplitude and bounded t-structures.

(i) Essential uniqueness. For every X and n, every distinguished triangle A→X→B→A[1] with A∈T≤n and B∈T≥n+1 is isomorphic to the truncation triangle τ≤nX→X→τ≥n+1X→τ≤nX[1] by an isomorphism of triangles whose middle component is the identity of X; this isomorphism is unique.

(ii) Adjunction and orthogonality. The assignment X↦τ≤nX is a functor and for T∈T≤n the map Hom⁡(T,τ≤nX)→Hom⁡(T,X), f↦(τ≤nX→X)∘f, is a bijection natural in X; dually Hom⁡(τ≥nX,T)→Hom⁡(X,T) is a bijection for T∈T≥n. Moreover Hom⁡(T≤n,T≥n+1)=0 for every n.

(iii) Aisle criteria. X∈T≤n if and only if τ≤nX→X is an isomorphism, if and only if τ≥n+1X=0, if and only if Hom⁡(X,T≥n+1)=0; dually X∈T≥n if and only if X→τ≥nX is an isomorphism, if and only if τ≤n−1X=0, if and only if Hom⁡(T≤n−1,X)=0.

(iv) Extensions, direct sums and iteration. In a distinguished triangle X→Y→Z→X[1], if X,Z∈T≤n (respectively T≥n), then Y lies in the same aisle. If X,Y∈T≤n then Z∈T≤n, while if Y,Z∈T≤n then X∈T≤n+1; dually, if Y,Z∈T≥n then X∈T≥n, while if X,Y∈T≥n then Z∈T≥n−1. Also, a finite direct sum lies in T≤n (respectively T≥n) if and only if each summand does. For m≤n there are canonical isomorphisms τ≤mτ≤n≅τ≤m, τ≤nτ≤m≅τ≤m, τ≥nτ≥m≅τ≥n and τ≥mτ≥n≅τ≥n compatible with the truncation maps, and τ≤mτ≥n=0 when m<n.

Facts & Assumptions

Given: A t-structure (T≤0,T≥0) on a triangulated category T, with T≤n=T≤0[−n], T≥n=T≥0[−n] and Hom⁡(T≤0,T≥1)=0 (Canonical t structure on a derived category, Truncation functors, t-cohomology, amplitude and bounded t-structures).

[F1]

For every object W and distinguished triangle X→Y→Z→X[1], the sequences T(W,X)→T(W,Y)→T(W,Z)→T(W,X[1]) and, dually, T(Z,W)→T(Y,W)→T(X,W)→T(Z[−1],W) are exact (Long exact Hom sequences of a distinguished triangle).

[F2]

Orthogonality and monotonicity: Hom⁡(T≤n,T≥n+1)=0 for every n by the t-structure axiom Hom⁡(T≤0,T≥1)=0 and the shift conventions, since a map X→Y with X∈T≤n and Y∈T≥n+1 is a map X[n]∈T≤0→Y[n]∈T≥1; moreover T≤m⊆T≤n and T≥n⊆T≥m whenever m≤n, because T≤0[1]⊆T≤0 and T≥0[−1]⊆T≥0 (Canonical t structure on a derived category).

[F3]

TR3: every commutative square on the first maps of two distinguished triangles extends to a morphism of triangles (Triangulated-category axiom TR3, Morphism and isomorphism of triangles); and a morphism of triangles with two adjacent isomorphism components has its third component an isomorphism (The triangulated five lemma).

[F4]

The triangles X→1X→0→X[1] and X→0→X[1]→1X[1] are distinguished, and distinguished triangles are closed under translations and rotations (Zero and split triangles are distinguished, Distinguished triangles are closed under shifts and both rotations).

[F5]

The triangulated category is additive, so finite biproducts exist, and T(X⊕Y,W)≅T(X,W)⊕T(Y,W) and T(W,X⊕Y)≅T(W,X)⊕T(W,Y) (Additive category, Biproduct).

Proof

technique · direct
1.1F1F2algebra

Let A→aX→bB→A[1] be distinguished with A∈T≤n and B∈T≥n+1. For T∈T≤n, the exact segment Hom⁡(T,B[−1])→Hom⁡(T,A)→a∗Hom⁡(T,X)→Hom⁡(T,B) has zero outer terms by [F2], since B[−1]∈T≥n+2. Thus a∗ is bijective. Dually, for T∈T≥n+1 the segment Hom⁡(A[1],T)→Hom⁡(B,T)→b∗Hom⁡(X,T)→Hom⁡(A,T) has zero outer terms, since A[1]∈T≤n−1, so b∗ is bijective.

1.2F3F4algebra

If A→fB→0→A[1] is a distinguished triangle, then f is an isomorphism. Indeed, the triangle B→1B→0→B[1] is distinguished by [F4], and (f,1B,0) is a morphism of triangles from the first to the second, commuting with all three arrows; the components 1B and 0→0 are adjacent isomorphisms, so f is an isomorphism by [F3].

2.1step 1.1F3algebra

Claim (i). Let A→aX→bB→A[1] be distinguished with A∈T≤n, B∈T≥n+1, and let P→pX→qQ→P[1] be the truncation triangle. By step 1.1 applied to the truncation triangle with T=A there is a unique f:A→P with pf=a, and applied to the given triangle with T=P there is a unique f′:P→A with af′=p. Then p(ff′)=af′=p=p 1P, and ff′=1P because Hom⁡(P,P)→Hom⁡(P,X) is injective by step 1.1 applied to the truncation triangle with T=P; symmetrically f′f=1A using the given triangle with T=A. So f is an isomorphism. By TR3 [F3] the commutative square (f,1X) extends to a morphism of triangles (f,1X,g), which is an isomorphism of triangles because f and 1X are adjacent isomorphism components, and its middle component is the identity of X. For uniqueness, let (f′′,1X,g′′) be another such isomorphism; then pf′′=a, so f′′=f by the uniqueness in step 1.1 applied to the truncation triangle with T=A. Hence the composite of (f′′,1X,g′′) with the inverse of (f,1X,g) is an automorphism (1A,1X,d) of the given triangle; it satisfies db=b, and Hom⁡(B,B)→Hom⁡(X,B), v↦vb, is injective by step 1.1 applied to the given triangle with T=B∈T≥n+1, so d=1B and the isomorphism over X is unique.

2.2step 1.1F2algebra

Claim (ii), the ≤ side. Fix the truncation triangle PX→pXX→qXQX→PX[1] for every X. For f:X→Y, the composite fpX lies in Hom⁡(PX,Y), and step 1.1 applied to the truncation triangle of Y with T=PX∈T≤n gives a unique map τ≤nf:PX→PY with pY(τ≤nf)=fpX. This makes τ≤n a functor: τ≤n(1X)=1PX by uniqueness, and for X→fY→hZ both τ≤n(hf) and τ≤nh∘τ≤nf have the same composite with pZ, so they are equal by the uniqueness. The map Hom⁡(T,PX)→Hom⁡(T,X), u↦pXu, is a bijection for T∈T≤n by step 1.1 applied to the truncation triangle of X, and it is natural in X because both pY(τ≤nf u) and f(pXu) equal (fpX)u. Applying the same argument with arrows reversed to the truncation triangle at n−1, whose third vertex is τ≥nX, makes X↦τ≥nX a functor and gives a bijection Hom⁡(τ≥nX,T)→Hom⁡(X,T) for T∈T≥n. The final vanishing Hom⁡(T≤n,T≥n+1)=0 is [F2].

2.3step 1.1step 1.2F1F2

Claim (iii), the ≤ side. Let P→pX→qQ→P[1] be the truncation triangle. The following are equivalent: (a) X∈T≤n; (b) p is an isomorphism; (c) Q=0; (d) Hom⁡(X,T≥n+1)=0. (a)⇒(d) is [F2]. (a)⇒(c): if X∈T≤n then q∈Hom⁡(X,Q)=0 by [F2], so q∗(1Q)=q=0=q∗(0), and q∗:Hom⁡(Q,Q)→Hom⁡(X,Q) is injective by step 1.1 applied to the truncation triangle with T=Q∈T≥n+1, hence 1Q=0 and Q is a zero object. (c)⇒(b): if Q=0, step 1.2 applied to the triangle P→X→0→P[1] makes p an isomorphism. (b)⇒(c): if p is an isomorphism, then in the exact sequence Hom⁡(Q,Q)→q∗Hom⁡(X,Q)→p∗Hom⁡(P,Q) of [F1] the map p∗ is injective (a map φ with φp=0 vanishes because p is an isomorphism), so im⁡(q∗)=0; since q∗ is a bijection by step 1.1, 1Q=0 and Q=0. (d)⇒(c): if Hom⁡(X,T≥n+1)=0 then q=0, so q∗(1Q)=0=q∗(0) and injectivity of q∗ gives 1Q=0, i.e. Q=0. Finally (b)⇒(a): if p is an isomorphism then X≅P and P∈T≤n, so X∈T≤n.

2.4step 1.1step 1.2F2F4

Claim (iii), the ≥ side, by the same arguments with the roles of the two maps interchanged. Let P→pX→qQ→P[1] be the truncation triangle at n−1, so that P=τ≤n−1X and Q=τ≥nX. Then: (a′) X∈T≥n implies Hom⁡(T≤n−1,X)=0 by [F2], hence p=0 and p∗(1P)=p=0=p∗(0) with p∗ injective by step 1.1, so P=0; (b′) P=0 makes the triangle X→Q→0→X[1] distinguished by [F4], so X→Q is an isomorphism by step 1.2 and X≅Q∈T≥n; (c′) if X→Q is an isomorphism then qp=0 forces p=0 and hence 1P=0 as above, so P=0; (d′) if Hom⁡(T≤n−1,X)=0 then p=0 and 1P=0 as in (a′), so P=0 and X∈T≥n by (b′); and X∈T≥n implies Hom⁡(T≤n−1,X)=0 by [F2]. This proves X∈T≥n if and only if X→τ≥nX is an isomorphism, if and only if τ≤n−1X=0, if and only if Hom⁡(T≤n−1,X)=0.

3.1step 2.3step 2.4F1F2F4

Claim (iv), extensions: let X→Y→Z→X[1] be distinguished. If X,Z∈T≥n, then for W∈T≤n−1 exactness of Hom⁡(W,X)→Hom⁡(W,Y)→Hom⁡(W,Z) and orthogonality force Hom⁡(W,Y)=0, hence Y∈T≥n by step 2.4. Dually, X,Z∈T≤n force Y∈T≤n using Hom⁡(Z,W)→Hom⁡(Y,W)→Hom⁡(X,W) and step 2.3. Applying these extension statements to the rotations Y→Z→X[1]→ and Z[−1]→X→Y→, and using X[1]∈T≤n−1 when X∈T≤n and Z[−1]∈T≥n+1 when Z∈T≥n, gives the four other bounds in (iv).

3.2step 2.3step 2.4F5

Claim (iv), direct sums: for objects X,Y one has Hom⁡(X⊕Y,W)≅Hom⁡(X,W)⊕Hom⁡(Y,W) and Hom⁡(W,X⊕Y)≅Hom⁡(W,X)⊕Hom⁡(W,Y) by [F5]. Hence X⊕Y∈T≤n implies Hom⁡(X,W)=0 for every W∈T≥n+1, as a direct summand of the vanishing group Hom⁡(X⊕Y,W), so X∈T≤n and likewise Y∈T≤n by step 2.3; conversely if X,Y∈T≤n then every such Hom⁡(X⊕Y,W) vanishes and X⊕Y∈T≤n by step 2.3. The same argument with the second displayed bijection and step 2.4 gives the statement for T≥n; the empty direct sum is the zero object and the claims are vacuous for it.

3.3step 2.2step 2.3step 2.4F2

Claim (iv), iteration: let m≤n. Since τ≤mX∈T≤n, its truncation map τ≤nτ≤mX→τ≤mX is an isomorphism by step 2.3. Put P=τ≤mτ≤nX and Q=τ≤mX, and let α:P→X and β:Q→X be the composites of their truncation maps. For every T∈T≤m, composition with either α or β is a bijection onto Hom⁡(T,X) by step 2.2 and T≤m⊆T≤n. Thus there are unique d:P→Q and v:Q→P with βd=α and αv=β, and injectivity gives dv=1Q and vd=1P. These isomorphisms commute with the maps to X and are natural by uniqueness. Dually, since τ≥nX∈T≥m, the map τ≥nX→τ≥mτ≥nX is an isomorphism by step 2.4; the dual factorization argument identifies τ≥nτ≥mX with τ≥nX, compatibly with the maps from X. Finally, if m<n, then τ≥nX∈T≥m+1, so τ≤mτ≥nX=0 by step 2.4.

4.1step 2.1step 2.2step 2.3step 2.4step 3.1step 3.2step 3.3∎

Steps 2.1, 2.2, 2.3, 2.4, 3.1, 3.2 and 3.3 prove claims (i), (ii), (iii) and (iv) respectively, including the uniqueness of the isomorphism in (i), the naturality and the dual statements in (ii), all four equivalent formulations in (iii), and the closure, direct-sum and iteration statements in (iv).

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

t-cohomology is functorial, additive, shift-compatible and detects amplitude

Statement

Let (T≤0,T≥0) be a t-structure on a triangulated category T, with truncations and t-cohomology as in Truncation functors, t-cohomology, amplitude and bounded t-structures and Truncation triangles are essentially unique and give adjoint truncation functors, and let C=T≤0∩T≥0 be the heart.

(i) Each Htn is a functor from T to C: for every morphism f:X→Y the induced map Htn(f) is the unique map compatible with f under the truncations, and values lie in the heart.

(ii) Shifts. Htn(X[m])≅Htn+m(X) for all m,n∈Z, naturally in X.

(iii) Additivity. For a finite biproduct X⊕Y with injections iX,iY and projections pX,pY, the maps (Htn(iX),Htn(iY)):Htn(X)⊕Htn(Y)→Htn(X⊕Y) and (Htn(pX),Htn(pY)):Htn(X⊕Y)→Htn(X)⊕Htn(Y) are mutually inverse isomorphisms; in particular Htn(X⊕Y)≅Htn(X)⊕Htn(Y) naturally.

(iv) Amplitude detection. If X∈T≤m then Htn(X)=0 for every n>m, and if X∈T≥m then Htn(X)=0 for every n<m. If the t-structure is bounded (Truncation functors, t-cohomology, amplitude and bounded t-structures), the converses hold: Htn(X)=0 for all n>m implies X∈T≤m, and Htn(X)=0 for all n<m implies X∈T≥m.

(v) Concentration and its consequences. If X∈T≤m then τ≥mX≅Htm(X)[−m], and if X∈T≥m then τ≤mX≅Htm(X)[−m]; if X lies in both aisles then the canonical map gives X≅Htm(X)[−m]. If X and Y both lie in T≤m∩T≥m, then the canonical identifications X≅Htm(X)[−m] and Y≅Htm(Y)[−m] identify Hom⁡(X,Y) with Hom⁡(Htm(X),Htm(Y)) via f↦Htm(f); in particular this applies when the t-structure is bounded and X,Y have Htn=0 for every n≠m.

Facts & Assumptions

Given: A t-structure (T≤0,T≥0) on a triangulated category T, with truncation triangles τ≤nX→X→τ≥n+1X→τ≤nX[1], heart C=T≤0∩T≥0 and Htn(X)=(τ≤nτ≥nX)[n].

[F1]

Truncation-triangle package: for T∈T≤n the map Hom⁡(T,τ≤nX)→Hom⁡(T,X), u↦(τ≤nX→X)u, is a bijection natural in X, and dually Hom⁡(τ≥nX,T)→Hom⁡(X,T) is a bijection for T∈T≥n; Hom⁡(T≤n,T≥n+1)=0; T≤m⊆T≤n and T≥n⊆T≥m for m≤n; X∈T≤n if and only if τ≤nX→X is an isomorphism, if and only if τ≥n+1X=0, if and only if Hom⁡(X,T≥n+1)=0, and dually for T≥n; the aisles are closed under extensions and finite direct sums; every decomposition triangle with outer terms in T≤n,T≥n+1 is canonically the truncation triangle (Truncation triangles are essentially unique and give adjoint truncation functors).

[F2]

The translation [1] is an additive autoequivalence with chosen coherence isomorphisms [m][n]≅[m+n] (Triangulated category, Category with translation via Truncation functors, t-cohomology, amplitude and bounded t-structures).

[F3]

The category T is additive, and T≤n and T≥n are additive subcategories: they contain the zero object and are closed under finite direct sums by [F1]. A right or left adjoint between additive categories is additive (Any adjoint between additive categories is additive, Additive functor), and an additive functor preserves split biproduct diagrams, carrying the structure maps of a biproduct to mutually inverse structure maps of the image (An additive functor preserves split biproduct diagrams, Biproduct, Additive category).

Proof

technique · direct
1.1F1F2algebra

Claim (i). The formula Htn(X)=(τ≤nτ≥nX)[n] is a composite of functors by [F1] and [F2], and the induced maps are uniquely compatible with the truncation maps by [F1]. Put Y=τ≥nX and Z=τ≤nY. For T∈T≤n−1, adjunction gives Hom⁡(T,Z)≅Hom⁡(T,Y)=0, since Y∈T≥n. The aisle criterion therefore puts Z in T≥n; it is in T≤n by construction. Consequently Z[n]=Htn(X) lies in the heart by the shift conventions.

1.2F1F2algebra

Claim (ii). For all a,b there is a canonical isomorphism τ≤a(X[b])≅(τ≤a+bX)[b] over X[b], and dually for τ≥a: for T∈T≤a both objects represent the same functor, Hom⁡(T,τ≤a(X[b]))≅Hom⁡(T,X[b]) by the adjunction [F1], and Hom⁡(T,(τ≤a+bX)[b])≅Hom⁡(T[−b],τ≤a+bX)≅Hom⁡(T[−b],X)≅Hom⁡(T,X[b]) because T[−b]∈T≤a+b, so the essential uniqueness in [F1] identifies them. Hence Htn(X[m])=(τ≤nτ≥n(X[m]))[n]≅(τ≤n((τ≥n+mX)[m]))[n]≅((τ≤n+mτ≥n+mX)[m])[n]≅Htn+m(X), using the coherence isomorphisms of [F2], and the isomorphisms are natural in X by functoriality of the truncations.

1.3F1algebra

Claim (iv), the forward implications. If X∈T≤m and n>m, then X∈T≤n−1 by [F1], so τ≥nX=0 by the aisle criterion [F1] and Htn(X)=0. If X∈T≥m and n<m, then X∈T≥n+1 by [F1], so τ≥nX≅X and τ≤nτ≥nX=τ≤nX=0 by the dual aisle criterion, whence Htn(X)=0.

1.4F1algebra

Claim (v), concentration. The identity Htm(X)[−m]=τ≤mτ≥mX is the definition. If X∈T≥m then τ≥mX≅X by [F1], giving the second identity. If X∈T≤m, then τ≥mX∈T≤m: for W∈T≥m+1 one has Hom⁡(τ≥mX,W)≅Hom⁡(X,W)=0 by the adjunction and orthogonality of [F1], so the aisle criterion gives τ≥mX∈T≤m; hence τ≤mτ≥mX≅τ≥mX, giving the first identity. If X lies in both aisles, then τ≤mX≅X and τ≥mX≅X, and the composite canonical map X≅Htm(X)[−m] is the truncation map.

2.1step 1.1F1F2F3

Claim (iii). The inclusion T≤n↪T has the right adjoint τ≤n by [F1], and the inclusion T≥n↪T has the left adjoint τ≥n; these inclusions and T are additive by [F3], so τ≤n and τ≥n are additive functors by [F3], and so is the autoequivalence [n] by [F2]. Hence Htn is additive, and by [F3] it preserves the split biproduct diagram of X⊕Y: the images of the injections and projections under Htn are the two mutually inverse structure maps of a biproduct diagram of Htn(X) and Htn(Y), which is precisely the assertion, and the resulting isomorphism Htn(X⊕Y)≅Htn(X)⊕Htn(Y) is natural by functoriality.

2.2step 1.3step 1.4F1algebra

Claim (iv), the converses for a bounded t-structure. Suppose Htn(X)=0 for all n>m. By boundedness choose N≥m with X∈T≤N∩T≥−N; then X∈T≤N, and if X∈T≤k for some k≥m+1, the concentration identity of step 1.4 gives τ≥kX≅Htk(X)[−k]=0, so X≅τ≤k−1X∈T≤k−1 by the aisle criterion. Descending finitely from N to m+1 gives X∈T≤m. The lower bound is dual: if Htn(X)=0 for all n<m, choose N≥−m with X∈T≤N∩T≥−N and ascend from −N to m−1, using τ≤kX≅Htk(X)[−k]=0 to conclude X→τ≥k+1X is an isomorphism and X∈T≥k+1; the two arguments are independent.

2.3step 1.1step 1.4

Claim (v), map detection. Let X,Y∈T≤m∩T≥m. By step 1.4 the canonical maps give isomorphisms X≅Htm(X)[−m] and Y≅Htm(Y)[−m]; under these, a morphism f:X→Y corresponds to Htm(f): both the source and target identifications are the truncation maps, and Htm is a functor commuting with the truncations by step 1.1, so the induced bijection is f↦Htm(f), and it is a bijection because the identifications are isomorphisms.

3.1step 2.2step 2.3

Claim (v), the bounded single-degree case: if the t-structure is bounded and X,Y have Htn=0 for every n≠m, then step 2.2 (applied to the positive and negative ranges) gives X,Y∈T≤m∩T≥m, so step 2.3 applies and Hom⁡(X,Y)→Hom⁡(Htm(X),Htm(Y)), f↦Htm(f), is a bijection under the canonical identifications.

4.1step 1.1step 1.2step 2.1step 1.3step 1.4step 2.2step 2.3step 3.1∎

Steps 1.1 to 1.4 and 2.2 to 3.1 prove all the clauses: (i) in step 1.1, (ii) in step 1.2, (iii) in step 2.1, both directions of (iv) in steps 1.3 and 2.2, and the concentration identities and map detection of (v) in steps 1.4, 2.3 and 3.1.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

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.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Graded hard Lefschetz has a canonical primitive decomposition

Statement

Let Hj, j∈Z, be objects of an abelian category, zero for all but finitely many j, and let Lj:Hj→Hj+2 be morphisms whose iterates give isomorphisms Lr:H−r→Hr for every r≥0, with L0=1H0. Put P−r:=ker⁡(Lr+1:H−r→Hr+2) for r≥0, and P−r=0 for r<0. Then for every r≥0 the powers of L induce finite direct sum decompositions H−r=⨁j≥0LjP−r−2j,Hr=⨁j≥0Lr+jP−r−2j, where LjP−r−2j denotes the image of the restriction of Lj to the subobject P−r−2j⊆H−r−2j, and likewise for Lr+jP−r−2j. Each displayed power Lj or Lr+j restricts to a monomorphism on its primitive source, and both decompositions are natural for morphisms commuting with L. This is a decomposition statement for graded objects in an abelian category; it does not identify primitive objects with classes annihilated by an untruncated map on a derived splitting of a complex.

Facts & Assumptions

Given: Objects Hj of an abelian category, zero for all but finitely many j, morphisms Lj:Hj→Hj+2, and the hypothesis that each iterate Lr:H−r→Hr, r≥0, is an isomorphism, with L0=1H0; the objects P−r=ker⁡(Lr+1:H−r→Hr+2) for r≥0 and P−r=0 for r<0.

[F1]

Kernels and cokernels are the equalizers and coequalizers of a morphism with the zero morphism: the kernel inclusion k of f satisfies fk=0 and every h with fh=0 factors uniquely as h=kh′, and any two kernels of the same morphism are canonically isomorphic over it (Kernels and cokernels in a category with zero morphisms as equalizers and coequalizers, Image and coimage in a category with kernels and cokernels).

[F2]

A composable triple 0→A→iB→pC→0 is a short exact sequence if and only if i is a kernel of p and p is a cokernel of i, and every epimorphism is the cokernel of its kernel (A short exact sequence is a kernel-cokernel pair, Exact sequence and short exact sequence in an abelian category, Every monomorphism is the kernel of its cokernel, and dually every epimorphism is the cokernel of its kernel).

[F3]

Splitting lemma: if 0→A→iB→pC→0 is a short exact sequence admitting s:C→B with ps=1C, then there is a unique π:B→A with πi=1A and iπ+sp=1B, so that (B,i,s,π,p) is the biproduct diagram of A and C (Splitting lemma in an abelian category, Split short exact sequence in an abelian category, Biproduct).

[F4]

A monomorphism f:X→Y induces an isomorphism X→im⁡(f) over Y: by Every monomorphism is the kernel of its cokernel, and dually every epimorphism is the cokernel of its kernel the map f itself is a kernel of its cokernel coker⁡(f), while the image inclusion im⁡(f)→Y is a kernel of coker⁡(f) by definition, and kernels of one morphism are unique up to a unique compatible isomorphism by [F1]. Consequently, if X is the biproduct of A and B with injections iA,iB, then applying this isomorphism to the biproduct identities exhibits im⁡(f) as the biproduct of im⁡(fiA) and im⁡(fiB).

Proof

technique · induction on the number $j$ of peeled degree-two steps
1.1givenalgebra

For every m≥2 the map L:H−m→H−m+2 is a monomorphism, because Lm=Lm−1L is an isomorphism: if Lu=0 then Lmu=Lm−1Lu=0, hence u=0.

1.2givenalgebra

For every r≥0 the map p:=Lr+1:H−r→Hr+2 is an epimorphism and s:=L(Lr+2)−1:Hr+2→H−r satisfies ps=1Hr+2, because pL=Lr+2 is an isomorphism: if vp=0 then vLr+2=vpL=0, hence v=0, and ps=Lr+1L(Lr+2)−1=Lr+2(Lr+2)−1=1.

2.1F1F2F3F4step 1.1step 1.2construct

Fix r≥0 and let i:P−r→H−r be the kernel of p=Lr+1. Since p is epic by step 1.2, [F2] makes 0→P−r→iH−r→pHr+2→0 short exact. Its section s=L(Lr+2)−1 gives, by [F3], a projection π:H−r→P−r with πi=1, iπ+sp=1 and πs=0. Put t=L:H−r−2→H−r and g=Lr+2:H−r−2→Hr+2. Then g is an isomorphism, s=tg−1, pt=g and πt=πsg=0. Consequently (i,t):P−r⊕H−r−2→H−r has inverse (π,g−1p): the diagonal composites are identities, the off-diagonal composites vanish, and iπ+tg−1p=iπ+sp=1. Since t is monic by step 1.1, [F4] identifies its source with its image. Hence this is the canonical decomposition H−r=P−r⊕LH−r−2. The endomorphism sp projects onto the second summand, whereas its projection to the source H−r−2 is g−1p.

3.1basestep 2.1

Base of the induction: for j=0 the object H−r is the biproduct of P−r=L0P−r and L1H−r−2=LH−r−2. This is exactly the decomposition of step 2.1, so the assertion holds for j=0.

3.2ihstep 2.1

Induction hypothesis: fix j≥0 and assume the assertion for this j, that is, H−r is the biproduct of P−r,LP−r−2,…,LjP−r−2j and Lj+1H−r−2j−2; we must derive it for j+1.

4.1F4step 1.1step 2.1step 3.2algebra

Applying step 2.1 with r replaced by r+2j+2 gives the biproduct decomposition H−r−2j−2=P−r−2j−2⊕LH−r−2j−4. The map Lj+1:H−r−2j−2→H−r is a monomorphism, being a composite of the monomorphisms of step 1.1; by [F4] it carries this biproduct diagram to the biproduct diagram of its image, im⁡(Lj+1)=Lj+1P−r−2j−2⊕Lj+1(LH−r−2j−4)=Lj+1P−r−2j−2⊕Lj+2H−r−2j−4. Substituting this into the biproduct of the induction hypothesis (step 3.2) gives that H−r is the biproduct of P−r,LP−r−2,…,Lj+1P−r−2j−2 and Lj+2H−r−2j−4, which is the assertion for j+1.

5.1step 1.1step 4.1givenalgebra

By induction (steps 3.1, 3.2 and 4.1) the biproduct decomposition of step 3.2 holds for every j≥0. Since Hn=0 for all sufficiently negative n, choose J with H−r−2J−2=0; then the tail LJ+1H−r−2J−2 vanishes, and H−r is the biproduct of P−r,LP−r−2,…,LJP−r−2J, i.e. the finite direct sum decomposition H−r=⨁j≥0LjP−r−2j of the Statement. Each restricted power Lj∣P−r−2j is a monomorphism, being for j≥1 a composite of the monomorphisms of step 1.1 and for j=0 the primitive kernel inclusion.

6.1givenstep 5.1algebra

Applying the isomorphism Lr:H−r→Hr to the decomposition of step 5.1 carries the biproduct decomposition of H−r to a biproduct decomposition of Hr with summands Lr(LjP−r−2j)=Lr+jP−r−2j, giving Hr=⨁j≥0Lr+jP−r−2j. Each restricted power Lr+j∣P−r−2j=Lr∘(Lj∣P−r−2j) is a monomorphism, being the composite of an isomorphism with the monomorphism of step 5.1.

7.1F1step 2.1step 5.1step 6.1algebra

Naturality. Let φj:Hj→H′ j be a morphism of graded objects into another such family (H′ j,L′ j) with L′φj=φj+2L for all j. Then φ commutes with every iterate: L′ rφ−r=φrLr, hence (L′ r+2)−1φr+2=φ−r−2(Lr+2)−1; consequently φ−r carries P−r=ker⁡Lr+1 into P′ −r=ker⁡L′ r+1, because L′ r+1φ−ri=φr+2Lr+1i=0 and the kernel inclusion of L′ r+1 has the universal property of [F1]. The comparison π′φ−r=φPπ of the projections holds because both sides become equal after composition with the monomorphism i′, where φP:P−r→P′ −r is the factorization of φ−ri through i′; and φ−rs=s′φr+2 holds by the displayed commutation with the inverses of Lr+2,L′ r+2. So φ preserves the decomposition of step 2.1, and by the same chain of identities at the parameter r+2j+2 it maps each summand LjP−r−2j into L′ jP′ −r−2j and intertwines the two finite decompositions of step 5.1; the second decompositions, obtained in step 6.1 from the first by the isomorphisms Lr,L′ r, are intertwined as well.

8.1step 3.1step 4.1step 5.1step 6.1step 7.1discharge-induction∎

The base case of step 3.1 and the induction step of step 4.1 establish the hypothesis of step 3.2 for every j≥0, so step 5.1 gives the first displayed decomposition for every r≥0, and steps 6.1 and 7.1 give the second decomposition, the monomorphism clause and naturality; the degenerate cases are included, since a zero object has all its summands zero and every argument above is an identity between finitely many morphisms.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

The nilpotent Lefschetz filtration is canonical and self-dual

Statement

Let N be a nilpotent endomorphism of a finite-dimensional vector space H over a field F (Nilpotent endomorphisms and their nilpotency index). An admissible filtration is an increasing finite filtration W of H by linear subspaces (Linear subspace of a vector space): Wi⊆Wi+1 for all i, Wi=0 for all sufficiently negative i, Wi=H for all sufficiently positive i, such that

N(Wi)⊆Wi−2for all i,Nr:Gr⁡rW⟶Gr⁡−rW is an isomorphism for every r≥0,

where Gr⁡iW:=Wi/Wi−1 and the second map is the one induced by Nr, which is well defined because Nr(Wr)⊆W−r and Nr(Wr−1)⊆W−r−1. There is a unique admissible filtration W, and it is given intrinsically by

Wi=∑a,b≥0, a−b=iker⁡Na+1∩im⁡Nb.

If in addition S is a nondegenerate bilinear form on H with S(Nv,w)+S(v,Nw)=0 for all v,w (Bilinear forms, and symmetric, skew-symmetric, and alternating bilinear forms, The matrix, left and right radicals, rank, and nondegeneracy of a bilinear form on a finite-dimensional space), and U⊥:={x∈H:S(u,x)=0 for every u∈U} for a subspace U, then (Wi)⊥=W−i−1 for every i, and consequently S induces a perfect pairing between Gr⁡iW and Gr⁡−iW; moreover for i≥0 the form Si([v],[w]):=S(v,Niw) on Gr⁡iW is well defined and nondegenerate.

Facts & Assumptions

Given: A field F, a finite-dimensional F-vector space H, a nilpotent endomorphism N of H, an admissible filtration W as in the Statement, and, where used, a nondegenerate bilinear form S with S(Nv,w)+S(v,Nw)=0; the right-orthogonal complement U⊥={x:S(u,x)=0 for all u∈U}.

[F1]

Jordan string basis: there is a basis of H that is the concatenation of strings v1,…,vl with Nv1=0 and Nvt=vt−1 for t≥2; for H=0 this is the empty family (Every finite-dimensional nilpotent endomorphism has a basis of Jordan strings).

[F2]

Graded hard Lefschetz: let Gj be objects of an abelian category, zero for all but finitely many j, and λj:Gj→Gj+2 morphisms with λr:G−r→Gr an isomorphism for every r≥0; with π−r:=ker⁡λr+1 one has G−r=⨁j≥0λjπ−r−2j and Gr=⨁j≥0λr+jπ−r−2j, each restricted power being a monomorphism on its primitive source (Graded hard Lefschetz has a canonical primitive decomposition). The ambient category here is the category of F-vector spaces, which is abelian (Modules over a ring form an abelian category).

[F3]

Annihilator dimension: for a subspace U of a finite-dimensional space V, the dual dimension is dim⁡V∗=dim⁡V (The dual family of a finite basis is a basis of the dual space, with the same dimension), the restriction V∗→U∗, f↦f∣U, is surjective because a basis of U extends to a basis of V (If dim⁡FV=n and U is a linear subspace of V, then U is finite-dimensional, dim⁡FU≤n, and dim⁡FU=n if and only if U=V), its kernel is the annihilator U∘={ f:f∣U=0 } (The annihilator U∘≤V∗ of U≤V and the preannihilator ∘S≤V of S≤V∗), and rank-nullity (Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T) therefore gives dim⁡U∘=dim⁡V−dim⁡U. If U⊆U′ are subspaces of equal finite dimension, then U=U′ (If dim⁡FV=n and U is a linear subspace of V, then U is finite-dimensional, dim⁡FU≤n, and dim⁡FU=n if and only if U=V).

[F4]

Bilinear correspondence: for any bilinear form B the map B♭:v↦B(v,−) is linear in v, and B↦B♭ is a linear bijection onto L(V,V∗) (Bilinear forms on V correspond linearly and bijectively to linear maps V→V∗); for a nondegenerate form on a finite-dimensional space, B♭ is an isomorphism (The matrix, left and right radicals, rank, and nondegeneracy of a bilinear form on a finite-dimensional space). Apply the same correspondence to the transpose form Sop(v,w):=S(w,v) to obtain S♯(x):=S(−,x); its kernel is the right radical, so it is an isomorphism by rank-nullity and equality of the finite dimensions of H and H∗. Thus the right-orthogonal complement is U⊥=(S♯)−1(U∘).

Proof

technique · direct, with finite ascending inductions on filtration indices
1.1givenF1construct

Fix a Jordan string basis of H as in [F1], with strings vc,1,…,vc,lc indexed by c. Give vc,t the weight 2t−lc−1, so that the weights on a string of length lc are −lc+1,−lc+3,…,lc−1, and let Wi be the span of all vc,t with weight at most i.

1.2givenalgebra

On a Jordan string v1,…,vl, one has ker⁡Na+1=⟨vt:1≤t≤min⁡(a+1,l)⟩ and im⁡Nb=⟨vt:1≤t≤l−b⟩, since Njvt=vt−j for t>j and is zero otherwise. For 1≤t≤l, the vector vt belongs to a summand ker⁡Na+1∩im⁡Nb with a−b=i exactly when some integer b satisfies max⁡(0,−i,t−i−1)≤b≤l−t. Such a b exists exactly when 2t−l−1≤i: necessity follows from t−i−1≤l−t, and sufficiency follows because l−t≥0 and 2t−l−1≤i also gives −i≤l−t. Thus the sum of these nested spans consists precisely of the string vectors of weight at most i, including the zero and whole-string cases.

1.3F2givenalgebra

Consequences of [F2] for an admissible filtration W. The graded pieces Gr⁡s=Ws/Ws−1 are F-vector spaces, zero for all but finitely many s, and N induces Nˉ:Gr⁡s→Gr⁡s−2. Putting Gj:=Gr⁡−j and λj:=Nˉ:Gj→Gj+2, the hypothesis says that λr:G−r→Gr, which is Nˉr:Gr⁡r→Gr⁡−r, is an isomorphism for every r≥0. [F2] therefore gives, with Pm:=ker⁡(Nˉm+1:Gr⁡m→Gr⁡−m−2) for m≥0, the decompositions Gr⁡s=⨁m≥∣s∣, m≡s (2)Nˉ(m−s)/2Pm for every s (the first display of [F2] for s≥0, the second for s<0), each restricted power being a monomorphism. Moreover for t≤−q the map Nˉq:Gr⁡t+2q→Gr⁡t is surjective: with m′:=−t≥q each summand Nˉm′+jPm′+2j of the displayed decomposition of Gr⁡t equals Nˉq(Nˉm′+j−qPm′+2j), and Nˉm′+j−qPm′+2j⊆Gr⁡m′+2j−2(m′+j−q)=Gr⁡t+2q.

1.4F3F4givenalgebra

For a subspace U⊆H, [F4] gives U⊥=(S♯)−1(U∘), hence dim⁡U⊥=dim⁡H−dim⁡U by [F3]. Define the left-orthogonal complement ⊥U:={v:S(v,u)=0 for all u∈U}. Using S♭ instead gives dim⁡⊥U=dim⁡H−dim⁡U. The inclusion U⊆⊥(U⊥) follows directly from S(U,U⊥)=0; both sides have the same dimension, so ⊥(U⊥)=U by [F3]. Also H⊥=0 by nondegeneracy and {0}⊥=H. No symmetry of S is used.

1.5givenalgebra

Skew-adjointness iterated: S(Nrv,w)=(−1)rS(v,Nrw) for all r≥0, by induction on r from S(Nv,w)=−S(v,Nw).

2.1step 1.1algebra

The filtration of step 1.1 is admissible: it is increasing and finite by construction, and N(Wi)⊆Wi−2 because Nvc,t=vc,t−1 has weight 2(t−1)−lc−1=(2t−lc−1)−2 while Nvc,1=0.

2.2step 1.1step 1.2algebra

The filtration of step 1.1 satisfies the intrinsic formula of the Statement: both Wi and the sum ∑a−b=iker⁡Na+1∩im⁡Nb are direct sums over the strings of their chainwise parts, because N preserves each string span and the spans of the strings form a direct sum decomposition of H; by the chainwise computation of step 1.2 these parts are the same span of weights at most i.

2.3step 1.1algebra

The filtration of step 1.1 has Nr:Gr⁡r→Gr⁡−r an isomorphism for every r≥0: chainwise, Gr⁡r is spanned by the classes of the vc,t of weight exactly r, and Nr sends such a class to the class of vc,t−r of weight −r, which is an isomorphism on each string and hence on the direct sum of the stringwise graded pieces.

2.4step 1.3algebra

For any admissible W the graded surjectivity of step 1.3 upgrades to Nm+1(Wm−1)=W−m−3 for every m≥0. Indeed Nm+1(Wm−1)⊆W−m−3, and for surjectivity one shows Ws⊆Nm+1(Wm−1) by ascending induction on s: for x∈Ws apply step 1.3 with q=m+1 and t=s≤−m−3 to get y∈Ws+2m+2 with [Nm+1y]=[x] in Gr⁡s; then Nm+1y−x∈Ws−1, which lies in the image by the induction hypothesis, so x does too; the induction starts with Ws=0 for s very negative and runs up to s=−m−3. Note s+2m+2≤m−1, so y may be taken in Wm−1.

2.5step 1.4step 1.5givenalgebra

Define Wi′:=(W−i−1)⊥ for every i. Then W′ is an increasing finite filtration: i≤j gives W−i−1⊇W−j−1 and hence Wi′⊆Wj′; for i very negative, W−i−1=H and Wi′=H⊥=0; for i very positive, W−i−1=0 and Wi′={0}⊥=H. Moreover N(Wi′)⊆Wi−2′: for x∈(W−i−1)⊥ and w∈W−i+1 one has S(w,Nx)=−S(Nw,x)=0 because Nw∈W−i−1, so Nx∈(W−i+1)⊥=Wi−2′.

3.1givenF3step 1.3step 2.4chooseconstruct

Fix an admissible W. Only finitely many Pm in step 1.3 are nonzero, and each is finite-dimensional by [F3]; choose a finite basis of each using the extension theorem in [F3]. For each of these finitely many basis classes choose a representative v∈Wm. Primitivity gives Nm+1v∈W−m−3, since its class in Gr⁡−m−2 vanishes. By step 2.4 choose u∈Wm−1 with Nm+1u=Nm+1v and replace v by v−u. The representative now satisfies Nm+1v=0. Its string v,Nv,…,Nmv lies in Wm,Wm−2,…,W−m and has graded classes Nˉi[v] of weight m−2i. All selections are finite.

3.2step 1.4step 2.5F3algebra

The pairing Gr⁡−iW×Gr⁡iW′→F, ([v],[x])↦S(v,x), is well defined: x∈Wi′=(W−i−1)⊥ kills errors in W−i−1 in the first variable, and errors in Wi−1′=(W−i)⊥ kill v∈W−i in the second. If S(v,Wi′)=0, then v∈⊥((W−i−1)⊥)=W−i−1 by step 1.4, so the left kernel vanishes. If S(W−i,x)=0, then x∈Wi−1′, so the right kernel vanishes. The pairing induces injections from each graded space to the dual of the other; [F3] then forces their dimensions to agree, and rank-nullity makes both injections isomorphisms. Thus the pairing is perfect.

4.1step 1.3step 3.1algebra

The graded classes of the string vectors of step 3.1 are linearly independent and span every Gr⁡s: in the decomposition of step 1.3, Gr⁡s is the direct sum over m≥∣s∣, m≡s (2) of the images of the monomorphisms Nˉ(m−s)/2:Pm→Gr⁡s, so the images of the chosen bases form a basis of Gr⁡s. Hence the string vectors are linearly independent, since a nontrivial finite combination would have a nonzero class in the largest weight occurring. They span H by ascending induction on s: if every element of Ws−1 is a combination of string vectors of weight at most s−1 and x∈Ws, then either [x]=0 in Gr⁡s and x∈Ws−1, or [x] is a combination of string classes of weight exactly s, and subtracting the corresponding string vectors leaves an element of Ws−1; the induction starts where Ws=0. This proves Ws⊆⟨string vectors of weight≤s⟩ for every s, and the reverse inclusion is clear; consequently the string vectors form a basis of H and Wi is exactly the span of those of weight at most i.

4.2givenstep 1.5step 3.2F3algebra

For any admissible W the W′-graded maps Nˉr:Gr⁡rW′→Gr⁡−rW′ are isomorphisms. Let ψ:Gr⁡−rW→(Gr⁡rW′)∗ and ϕ:Gr⁡rW→(Gr⁡−rW′)∗ be the isomorphisms induced by the perfect pairings of step 3.2, and let T:=Nˉr:Gr⁡rW′→Gr⁡−rW′. For y∈Wr and x∈Wr′ steps 1.5 and the definitions give ψ(Nˉr[y])([x])=S(Nry,x)=(−1)rS(y,Nrx)=(−1)r(T∗ϕ[y])([x]), so T∗=(−1)rψNˉrϕ−1 is an isomorphism because Nˉr:Gr⁡rW→Gr⁡−rW is an isomorphism by the admissibility of W; a linear map between finite-dimensional spaces whose transpose is an isomorphism is itself an isomorphism: surjectivity of T∗ forces ker⁡T=0 because every functional on the source then factors through T, and bijectivity of T∗ and [F3] give equality of the source and target dimensions, so rank-nullity makes T surjective as well.

5.1F1step 1.2step 2.2step 4.1

Every admissible W equals the intrinsic formula and hence the filtration of step 1.1; in particular the admissible filtration is unique. The strings of step 3.1 form a basis of H and satisfy Nm+1v=0, so each is a Jordan string for N in the sense of [F1]; the chainwise computation of step 1.2 applied to this basis says that ∑a−b=iker⁡Na+1∩im⁡Nb is exactly the span of the string vectors of weight at most i, which is Wi by step 4.1. This formula depends only on N, and the filtration of step 1.1 satisfies it too by step 2.2; hence every admissible W equals it.

6.1step 2.5step 4.2step 5.1

The filtration W′ of step 2.5 is admissible: it is an increasing finite filtration with N(Wi′)⊆Wi−2′ by step 2.5, and its graded maps are isomorphisms by step 4.2. By the uniqueness of step 5.1, W′=W.

7.1step 3.2step 6.1

Consequently (Wi)⊥=W−i−1 for every i: W′=W reads (W−i−1)⊥=Wi, and reindexing j:=−i−1 gives the claim. Moreover the pairing Gr⁡iW×Gr⁡−iW→F, ([v],[w])↦S(v,w), is perfect: it is the pairing of step 3.2 read with W′=W.

8.1givenstep 7.1

The forms Si are well defined and nondegenerate. For the restriction of S to a pairing on Gr⁡iW: an error v′∈Wi−1 in the first argument contributes S(v′,Niw)=0 because Niw∈W−i and (Wi−1)⊥=W−i by step 7.1, and an error w′∈Wi−1 in the second contributes S(v,Niw′)=0 because Niw′∈W−i−1=(Wi)⊥ by admissibility and step 7.1. Thus Si is well defined on Gr⁡iW×Gr⁡iW, and it is the composite of the perfect pairing ⟨[v],[x]⟩:=S(v,x) of step 7.1 with the second variable [w]↦Ni[w], which is an isomorphism Gr⁡iW→Gr⁡−iW by the admissibility of W; hence the induced map Gr⁡iW→(Gr⁡iW)∗, [v]↦Si([v],−) is an isomorphism: Si is nondegenerate.

9.1step 2.1step 2.2step 2.3step 5.1step 6.1step 7.1step 8.1∎

Steps 2.1, 2.2 and 2.3 exhibit the admissible filtration and identify it with the intrinsic formula; step 5.1 proves that any admissible filtration equals that formula, which is uniqueness; steps 6.1, 7.1 and 8.1 prove the self-duality, the perfect pairing and the descended forms Si. The zero space is included: its empty string basis of [F1] gives the zero filtration Wi=0=H, which is admissible and agrees with the intrinsic formula, which is zero for every i.

5 · Examples, counterexamples and false statements

None yet.

Sources