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.
Spectral sequence of a tower
PDF p. 4: Motivic spectral sequence
Statement
Let be a spectrum equipped with spectra and compatible maps , for all integers . Put and . The stage sequences form an exact couple and yield a cohomological spectral sequence, indexed from page 2, with
If specified equivalences are given for cochain complexes , then naturally
Suppose additionally that, for each integer , there are integers such that is an isomorphism for and for . Then every bidegree stabilizes after finitely many pages and there are natural isomorphisms
Thus the spectral sequence converges to with its finite image filtration. Here denotes the eventual stable page in each bidegree; convergence includes the displayed associated-graded identification, not a canonical splitting of the filtration. The stated boundedness is a sufficient hypothesis; no convergence is asserted from the graded identifications alone.
Facts & Assumptions
Given: The tower and compatible maps in the statement; for the indexed cohomology formula, the specified graded equivalences; for convergence, the stated degreewise bounds.
Goal: Construct the spectral sequence, calculate its indices, and prove its bounded convergence assertion.
For every , Stage projections, kernels and image groups gives the natural long exact sequence containing .
Exact couple specifies the initial homological exact-couple degrees. Derived exact couple supplies the derived couple, its exactness, and its differential and homology construction. Cohomological spectral sequence specifies the cohomological differential degrees and page-to-page homology requirement.
Under a specified equivalence , Complex shifts and spectral homotopy indices gives .
Proof
Set and . Let be induced by , let be the stage projection, and let be the connecting homomorphism. Their respective degrees are , and . Exactness at all three vertices follows from the long exact sequences in [F1], so these maps form an initial exact couple.
Derive the couple repeatedly. At homological page , its differential has degree , squares to zero, and its homology is the next page. Define for . A homological differential with changes to , corresponding to . Hence these reindexed pages satisfy the cohomological spectral-sequence convention. At , their total homotopy degree is and their filtration index is , proving the first displayed formula.
With and , [F3] gives . This proves the second displayed formula and its naturality for maps preserving the given graded equivalences.
Fix . Iterating the derived-couple formulas shows the following two elementary lifting facts. A class on the initial graded term that survives through arbitrarily many differentials has connecting image in admitting lifts from arbitrarily high stages; the indeterminacies in choosing lifts are precisely the boundaries already factored out. Conversely, if its connecting image is zero, exactness writes it as the stage projection of an element of , and that projected class survives every page. The first assertion follows inductively because passing to the next derived couple replaces the -term by the image of the next transition map; the converse follows because a stage projection has zero connecting image and the same is true after each derivation.
The high-stage bound in degree makes the liftable subgroup in step 4.1 zero after finitely many stages. Thus every eventual class is represented by the stage projection of some . The derived-couple formulas also give the boundary test: such a projection is eventually zero exactly when the image of in a sufficiently low stage lies in the image there of . Indeed, a boundary coming from a lower graded stage has connecting image in whose image in that lower stage vanishes; conversely, if differs by an element from by an element killed at a lower stage, repeated exactness lifts that difference through the intervening connecting maps and expresses its projection as an iterated boundary. These implications use only finitely many stages.
Choose the low stage at or below . Its map to is an isomorphism, so the boundary test says precisely that the image of in belongs to . Consequently the projection induces an isomorphism from to the eventual graded term. The high- and low-stage bounds also bound the possible sources and targets of differentials at the fixed bidegree, so this eventual term is reached after finitely many pages. Finally for and for ; hence the image filtration is finite and the stated convergence follows. Substitution of and gives the displayed indexing.
Depends on
Used by · 6
- Motivic graded pieces and spectral sequence
- Degeneration of the spectral sequence of a split tower
- Cohomological indexing of the actual graded groups
- Identifying all spectral-sequence pages with the source multiplicative pages
- Stage bounds imply completeness and finite multiplicative convergence
- External actual graded algebra and multiplicative tower spectral sequence
Dependency tree · 3 levels
Arrows run from prerequisites to the items that use them. External source nodes link directly to the cited text. The view shows up to three dependency steps; open a prerequisite to continue.