Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

Serre filtration over the base skeleta

Definition

Let p:E→B be a continuous map to a CW complex with skeleta Ba. Put Ba=∅ for a<0 and Ea=p−1(Ba). For a commutative ring R, the homological Serre filtration on singular chains is the increasing filtration FaCn(E;R)=im⁡(Cn(Ea;R)→Cn(E;R))=Cn(Ea;R),F−1Cn=0. The last equality identifies a singular simplex in the subspace with the same simplex in E. Since faces remain in the same preimage, ∂FaCn⊆FaCn−1.

This filtration is exhaustive one chain at a time. Indeed, the projection to B of each singular simplex has compact domain, so Compact CW images have finite cell support without choice places its image in a finite subcomplex and hence in some skeleton. A finite chain has one maximum of its finitely many resulting dimensions. There is generally no uniform bound depending only on n: an n-simplex can map into cells of arbitrarily high dimension. Thus this definition does not assert that FnCn=Cn or that the chain filtration is degreewise finite.

The induced increasing filtration on homology is FaHn(E;R)=im⁡(Hn(Ea;R)→Hn(E;R)). If E~a,nr denotes the singly graded filtered-complex indexing, write Ea,br=E~a,a+br,dr:Ea,br→Ea−r,b+r−1r.

The cohomological Serre filtration is the decreasing annihilator filtration FaCn(E;R)=ker⁡(Cn(E;R)→Cn(Ea−1;R)). Thus F0Cn=Cn, and δFaCn⊆FaCn+1. Its reindexed differential convention is dr:Era,b→Era+r,b−r+1. These conventions include E=∅, the zero ring, a=0, and zero chains/cochains. The compact-support statement is applied separately to each specified simplex, so no choice principle is used.

Depends on

Dependency tree · 2 levels

Sources