Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)
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.

Row and column filtrations of a first quadrant double complex

Definition

Let C be a first-quadrant homological double complex. Its totalisation T exists: each nonnegative diagonal has at most n+1 nonzero terms and negative diagonals are zero. The finite sum/product identification is provided by Sum and product totalisations agree on finite diagonal double complexes, and The total differential squares to zero gives the chain condition.

For integers s,n, its column filtration and row filtration are the partial biproducts FscolTn=p+q=n, psCp,q,FsrowTn=p+q=n, qsCp,q. Their injections into Tn are split monomorphisms: projecting onto the selected summands is a left inverse. Thus these are subobjects. The selected index sets increase with s, giving the filtration inclusions.

Both arrows preserve each cutoff: h lowers p and fixes q, while v fixes p and lowers q. Consequently h+v restricts to each partial sum, and the two families are filtered subcomplexes. They vanish for s<0 and equal Tn for sn when n0. For n<0 every piece and Tn are zero. In particular degree zero has just the single possible component C0,0; both filtrations jump there at s=0.

The quotient Fs/Fs1 selects column s with remaining differential v, or row s with remaining differential h, respectively. In spectral coordinates (s,t), total degree is s+t; hence these associated graded components are respectively Cs,t and Ct,s. No sign is inserted: the original double-complex arrows already anticommute. The construction uses only the specified finite biproduct maps and no choices.

Depends on

Used by

Dependency tree · two levels

8 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