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.

The Deligne splitting of a mixed Hodge structure

Statement

Let (H,W,F) be a rational mixed Hodge structure (Rational mixed Hodge structures) with complex conjugation σ on HC=H⊗QC, and write Fˉa=σ(Fa) for the conjugate Hodge filtration; all weight spaces below are the complexifications WaHC. For integers p,q put m=p+q and Ip,q=(Fp∩Wm)∩((Fˉq∩Wm)+∑j≥1(Fˉq−j∩Wm−j−1)), the intersections and the sum taken in HC. Then:

(a) Ip,q⊆Wm∩Fp, the intersection Ip,q∩Wm−1 is zero, and the projection Wm→Gr⁡mWHC maps Ip,q isomorphically onto the summand Hmp,q of the mixed Hodge definition;

(b) WmHC=⨁p+q≤mIp,q, FaHC=⨁p≥aIp,q for all integers a,m; in particular HC=⨁p,qIp,q;

(c) every morphism f ⁣:H→K of rational mixed Hodge structures satisfies fC(Ip,q(H))⊆Ip,q(K).

The construction satisfies Ip,q+Wm−2=σ(Iq,p)+Wm−2 inside Wm. It need not satisfy σ(Ip,q)=Iq,p, and the same splitting need not split Fˉ: its conjugate gives FˉbHC=⨁q≥bσ(Iq,p). The splitting is the one pinned down in the sources by the displayed formula, not an arbitrary direct-sum decomposition.

Facts & Assumptions

Given: A rational mixed Hodge structure (H,W,F) with conjugation σ(h⊗z)=h⊗zˉ and conjugate filtration Fˉ=σ(F), as in Rational mixed Hodge structures; the complexified weight filtration WaHC=(WaH)⊗QC is again written Wa.

[F1]

On each Gr⁡nWHC the induced filtrations F and Fˉ are n-opposed, Gr⁡nWHC=⨁p+q=nHnp,q with Hnp,q=FpGr⁡nW∩FˉqGr⁡nW, where FpGr⁡nW is the image of Fp∩Wn and FˉqGr⁡nW the image of Fˉq∩Wn (Rational mixed Hodge structures, Associated graded object of a filtered object).

[F2]

W is finite: Wa=0 for all sufficiently negative a and Wa=HC for all sufficiently positive a; F and Fˉ are finite decreasing filtrations, so also the induced filtrations on each Gr⁡nW are finite (Rational mixed Hodge structures).

[F3]

A sum of vectors from the summands of a finite internal direct sum vanishes only if every summand vanishes; indeed, each summand then lies in its intersection with the sum of the others, which is zero (Internal direct sum V=⨁i<nUi: the sum is everything and each summand meets the sum of the others only in 0V).

Proof

technique · direct
1.1givenalgebra

(Two-filtration lemma, spanning and partial sums.) Let V be a finite-dimensional C-vector space with finite decreasing filtrations F and Fˉ such that V=⨁p+q=n(FpV∩FˉqV) for an integer n. Then (i) FaV+Fˉn+1−aV=V for every a, and (ii) FaV=⨁p≥a(FpV∩Fˉn−pV), with the conjugate formula FˉbV=⨁q≥b(Fn−qV∩FˉqV). For (i), write v=∑p+q=nvp,q; the terms with p≥a sum into FaV, and each remaining term has p<a, hence q=n−p>n−a, that is q≥n+1−a, so their sum lies in Fˉn+1−aV. For (ii), prove FaV⊆∑p≥a(FpV∩Fˉn−pV) by descending induction on a: the claim is trivial when FaV=0, and otherwise (i) with a+1 gives V=Fa+1V+Fˉn−aV, so the modular law applied to Fa+1V⊆FaV⊆V yields FaV=Fa+1V+(FaV∩Fˉn−aV), in which the induction hypothesis places Fa+1V inside ∑p≥a+1(FpV∩Fˉn−pV) while FaV∩Fˉn−aV is the term with p=a; the reverse inclusion is clear, and the sum is direct because the pieces FpV∩Fˉn−pV are independent by the decomposition hypothesis, which is symmetric in the two filtrations, so the same argument with F and Fˉ interchanged gives the formula for FˉbV.

2.1step 1.1algebra

(Two-filtration lemma, vanishing.) Under the hypothesis of step 1.1, FaV∩FˉbV=0 whenever a+b>n. Indeed, let x∈FaV∩FˉbV and let x=∑p+q=nxp,q be its unique decomposition with xp,q∈FpV∩FˉqV. Since x∈FaV, its decomposition lies in ⨁p≥a(FpV∩Fˉn−pV) by step 1.1 (ii), so xp,n−p=0 for every p<a; since x∈FˉbV, the conjugate half of step 1.1 (ii) gives xn−q,q=0 for every q<b. If x≠0, some xp,n−p is nonzero, and it satisfies p≥a and n−p≥b, whence n=p+(n−p)≥a+b>n, a contradiction; so x=0.

2.2F1F2step 1.1construct

(Lifting.) Let m=p+q. Every d∈Wm−1 can be written as d=z+g with z∈Fp∩Wm−1 and g∈(Fˉq∩Wm−1)+∑j≥1(Fˉq−j∩Wm−j−1). To see this, construct elements d1,d2,… and vectors fj,gj as follows. Put d1=d, and suppose dj∈Wm−j has been constructed for some j≥1. By [F1] the induced filtrations on Gr⁡m−jW are (m−j)-opposed, and step 1.1 (i) applied there with the pair (p,q−j+1), whose indices sum to m−j+1, shows that the images of Fp∩Wm−j and Fˉq−j+1∩Wm−j generate Gr⁡m−jW; choose fj∈Fp∩Wm−j and gj∈Fˉq−j+1∩Wm−j whose classes sum to the class of dj, and put dj+1:=dj−fj−gj∈Wm−j−1. By [F2] there is J with Wm−J=0; the recursion stops there, and summing the identities dj+1=dj−fj−gj gives d=∑j=1J−1(fj+gj). Each fj lies in Fp∩Wm−j⊆Fp∩Wm−1; g1 lies in Fˉq∩Wm−1 and, for j≥2, gj lies in Fˉq−(j−1)∩Wm−(j−1)−1. Hence z:=∑jfj and g:=∑jgj have the required properties.

3.1F1step 2.2algebra

(Surjectivity onto the graded summand.) Let ξ∈Hmp,q. Since Hmp,q⊆FpGr⁡mW is the image of Fp∩Wm, choose x0∈Fp∩Wm representing ξ; since Hmp,q⊆FˉqGr⁡mW is the image of Fˉq∩Wm, choose y0∈Fˉq∩Wm also representing ξ. Then d:=x0−y0 lies in Wm−1, so step 2.2 gives d=z+g with z∈Fp∩Wm−1 and g in the displayed sum. Put x:=x0−z=y0+g. Then x∈Fp∩Wm, and x∈(Fˉq∩Wm)+∑j≥1(Fˉq−j∩Wm−j−1) because y0 lies in the first summand and g in the sum; so x∈Ip,q. Finally x−x0=−z∈Wm−1, so x and x0 have the same class ξ in Gr⁡mW. Hence the projection maps Ip,q onto Hmp,q, and Ip,q⊆Wm∩Fp holds by definition.

4.1F1F2step 2.1step 3.1algebra

(Injectivity modulo the lower weight.) Suppose 0≠x∈Ip,q∩Wm−1, and choose its least weight index r, so x∈Wr∖Wr−1 and r<m. Write x=y+∑j≥1gj as in the defining formula, with y∈Fˉq∩Wm and gj∈Fˉq−j∩Wm−j−1; only finitely many terms are needed because W is finite. Put J=m−r−1≥0. The sum ∑j>Jgj lies in Wr−1, while h:=y+∑1≤j≤Jgj lies in Fˉq−J and also in Wr, because h=x−∑j>Jgj. Thus the nonzero class of x in Gr⁡rW belongs to FpGr⁡rW∩Fˉq−JGr⁡rW. But p+q−J=r+1>r, so step 2.1 makes that intersection zero, a contradiction. Together with step 3.1 this proves the projection isomorphism in (a).

5.1F1F2step 3.1step 4.1F3algebra

(The weight decomposition and the direct-sum identity.) For every m the projection restricts to an isomorphism ⨁p+q=mIp,q→Gr⁡mWHC: by steps 3.1 and 4.1 each Ip,q maps isomorphically onto Hmp,q, and by [F1] the summands Hmp,q are independent with sum Gr⁡mW. In particular dim⁡Ip,q=dim⁡Hmp,q, so ∑p+q=mdim⁡Ip,q=dim⁡Gr⁡mW for every m. The sum map ψm ⁣:⨁p+q≤mIp,q→Wm is injective: if a finite sum ∑m′≤m∑p+q=m′xp,q vanishes, its class in Gr⁡mW is the sum of the classes of the top pieces xp,m−p, which vanishes only if each of those pieces is zero because the restricted projection is an isomorphism; subtracting them leaves a vanishing sum over m′≤m−1, and induction on m (with Wm=0 for all sufficiently negative m) finishes the argument. Its image therefore has dimension ∑m′≤mdim⁡Gr⁡m′W=dim⁡Wm, the finite telescoping identity for the finite filtration W; an injective map between spaces of equal dimension is an isomorphism, so WmHC=⨁p+q≤mIp,q. Taking m large gives HC=⨁p,qIp,q.

5.2F1step 2.1step 3.1step 4.1algebra

(Conjugation modulo lower weights.) Work in U=Wm/Wm−2 with the images of Fp∩Wm and Fˉq∩Wm. Their intersection T maps injectively to Gr⁡mW: its intersection with Wm−1/Wm−2 is FpGr⁡m−1W∩FˉqGr⁡m−1W=0 by step 2.1, since p+q=m>m−1. The formula for Ip,q shows its image in U lies in T, since every tail term has weight at most m−2. Step 3.1 shows this image maps onto Hmp,q; the image of T also lies in Hmp,q, so injectivity makes the image of Ip,q exactly T. Conjugating the same argument for Iq,p shows that σ(Iq,p) has this same image T in U. Therefore Ip,q+Wm−2=σ(Iq,p)+Wm−2.

6.1F1F2step 1.1step 4.1step 5.1algebra

(The Hodge decomposition.) For all a,m one has Fa∩Wm=⨁p≥a, p+q≤mIp,q. Indeed, decompose x∈Fa∩Wm by step 5.1. Its class in Gr⁡mW lies in ⨁p≥aHmp,m−p by step 1.1, so its top components with p<a vanish by the projection isomorphism. Subtracting the remaining top components leaves an element of Fa∩Wm−1, and induction through the finite W proves the assertion. Taking m large proves Fa=⨁p≥aIp,q. Conjugating this identity gives Fˉb=⨁q≥bσ(Iq,p); it does not assert a decomposition of Fˉ by the original Ip,q.

7.1givenalgebra∎

(Functoriality.) Let f ⁣:H→K be a morphism of rational mixed Hodge structures. Since f is defined over Q, fC commutes with the conjugations, so fC(FˉqHC)=fC(FqHC)‾⊆FˉqKC; it also satisfies fC(FpHC)⊆FpKC and fC(WaHC)⊆WaKC by definition. Applying fC to the two intersections and the sum defining Ip,q(H) therefore produces an element of the corresponding intersection of FpKC with the sum of the Fˉ-terms for K, and W-membership is preserved term by term; hence fC(Ip,q(H))⊆Ip,q(K).

Source notes

The construction is Deligne's; the proof above is a complete reconstruction of Deligne II (1.2.5), (1.2.8)-(1.2.11) in the increasing-weight convention. Step 2.2 replaces Deligne's induction (1.2.8)/(1.2.9) by a direct descending correction through the finite weight filtration, and steps 1.1 and 2.1 supply the two-filtration lemma (1.2.5) in the forms used afterwards. Weber (2.2.4)-(2.2.5) and El Zein, Lemma 2.1 state the displayed formula and the partial-sum decompositions; Cirici-Horel, Lemma 3.3 was an independent cross-check of the formula. The formula is not conjugate-symmetric in general: step 5.2 proves the congruence Ip,q≡σ(Iq,p) mod Wm−2 (Weber (2.2.5)), and the note after Voisin's Theorem 2.8 records that the pieces cannot in general be chosen simultaneously conjugate-symmetric and compatible with the two filtrations. The proof uses the exact W,F decompositions and the proved congruence, without asserting exact conjugate symmetry or an exact Fˉ decomposition by the same Ip,q.

Depends on

Used by

Dependency tree · two levels

16 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