Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge 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.

Cohomological mixed Hodge complexes

Definition

A rational cohomological mixed Hodge complex consists of

(a) a bounded-below cochain complex KQ of Q-vector spaces with an increasing filtration W by subcomplexes, finite on each cochain group;

(b) a cochain complex KC of C-vector spaces with an increasing filtration W by subcomplexes and a decreasing filtration F by subcomplexes, again finite on each cochain group;

(c) a morphism of complexes α ⁣:KQ⊗QC→KC compatible with the weight filtrations, such that for every w the induced map Gr⁡wWα is a quasi-isomorphism,

subject to the following axiom: for every integer w the weight-graded complex Gr⁡wWK has finite-dimensional cohomology, its differential (induced by dK) is strict for the induced filtration F, and for every r the induced filtration F on Hr(Gr⁡wWKC), together with the induced rational comparison Hr(Gr⁡wWKQ)⊗QC→Hr(Gr⁡wWKC), is a pure Hodge structure of weight r+w (Rational mixed Hodge structures).

Here a cochain complex is a complex in the sense of Cochain complex in an abelian category, a filtration by subcomplexes is a filtered complex in the sense of Filtered chain complex, a morphism compatible with the weight filtrations is a filtered chain map in the sense of Filtered chain map, quasi-isomorphism means Quasi-isomorphism, and finiteness on a cochain group Kn means WaKn=0 for all sufficiently negative a and WaKn=Kn for all sufficiently positive a, with bounds depending on n; dually FpKn=Kn for p≪0 and FpKn=0 for p≫0.

The weight filtration on cohomology is the shifted image filtration WmHn(K):=im⁡(Hn(Wm−nK)→Hn(K)). The shift is essential: it is what makes the axiom's weight r+w on the graded complexes compatible with the weight of Hn, and pole-count weight on a logarithmic complex is not the weight on its cohomology. The differential strictness in the axiom is Deligne's condition (GH1); the equivalent formulation that the F-spectral sequence of the graded complex degenerates at its first page is recorded in the sources but is neither asserted nor used here, so no degeneration theorem enters this definition.

Morphisms and the sheaf case. A morphism of cohomological mixed Hodge complexes is a pair of chain maps KQ→LQ and KC→LC compatible with both filtrations and with the comparisons; compatible filtered homotopies are permitted. The same definitions apply to bounded-below complexes of sheaves on a topological space when the complexes are replaced by their derived global sections and the resolutions used preserve the graded pieces; the existence of such resolutions for the concrete complexes used later is proved where those complexes are constructed, not here.

Source notes

Deligne III (8.1.1)-(8.1.6) is the primary source; the concrete formulation above uses a concrete comparison map in the displayed direction to represent the filtered comparison in Deligne's derived-category formulation. A comparison isomorphism in a derived category does not itself supply such a chain map: a suitable representative must be constructed when this definition is applied. Weber, (2.3.1) and (2.4.1) and Arapura, Section 4.5, state the same axioms (GH1)/(GHM) in the vector-space and sheaf settings. The shift in the displayed weight filtration is the convention (1.1.2) used throughout this page. The definition itself uses no choice principle.

Depends on

Used by

Dependency tree · two levels

21 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