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.

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.

Depends on

Used by

Dependency tree · two levels

23 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