Alphabeta Math
PropositionStatement: AI-generatedProof: AI-generated
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 E be a spectrum equipped with spectra FjE and compatible maps Fj+1E→FjE→E, for all integers j. Put gr⁡jE=cofib⁡(Fj+1E→FjE) and FjπnE=im⁡(πnFjE→πnE). The stage sequences form an exact couple and yield a cohomological spectral sequence, indexed from page 2, with

E2a,b=π−a−bgr⁡−bE,ds:Esa,b⟶Esa+s,b−s+1(s≥2).

If specified equivalences gr⁡jE≃(HCj)[2j] are given for cochain complexes Cj, then naturally

E2a,b≅Ha−b(C−b).

Suppose additionally that, for each integer n, there are integers Ln≤Un such that πnFjE→πnE is an isomorphism for j≤Ln and πnFjE=0 for j≥Un. Then every bidegree stabilizes after finitely many pages and there are natural isomorphisms

E∞a,b≅F−bπ−a−bE/F−b+1π−a−bE.

Thus the spectral sequence converges to π−a−bE with its finite image filtration. Here E∞ 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.

[F1]

For every j,n, Stage projections, kernels and image groups gives the natural long exact sequence containing πnFj+1E→πnFjE→πngr⁡jE→πn−1Fj+1E.

[F2]

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.

[F3]

Under a specified equivalence gr⁡jE≃(HCj)[2j], Complex shifts and spectral homotopy indices gives πngr⁡jE≅H2j−n(Cj).

Proof

1.1F1F2construct

Set Dp,q1=πp+qF−pE and Ep,q1=πp+qgr⁡−pE. Let i be induced by F−pE→F−p−1E, let j be the stage projection, and let k be the connecting homomorphism. Their respective degrees are (1,−1), (0,0) and (−1,0). Exactness at all three vertices follows from the long exact sequences in [F1], so these maps form an initial exact couple.

2.1F2step 1.1algebra

Derive the couple repeatedly. At homological page r≥1, its differential dr=jk has degree (−r,r−1), squares to zero, and its homology is the next page. Define Esa,b=Eb,−a−2bs−1 for s≥2. A homological differential with r=s−1 changes (b,−a−2b) to (b−r,−a−2b+r−1), corresponding to (a+s,b−s+1). Hence these reindexed pages satisfy the cohomological spectral-sequence convention. At s=2, their total homotopy degree is b+(−a−2b)=−a−b and their filtration index is −b, proving the first displayed formula.

3.1F3step 2.1algebra

With j=−b and n=−a−b, [F3] gives πngr⁡jE≅H2j−n(Cj)=Ha−b(C−b). This proves the second displayed formula and its naturality for maps preserving the given graded equivalences.

4.1F1F2step 1.1step 3.1

Fix j,n. 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 πn−1Fj+1E 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 πnFjE, and that projected class survives every page. The first assertion follows inductively because passing to the next derived couple replaces the D-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.

5.1F1F2step 4.1

The high-stage bound in degree n−1 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 x∈πnFjE. The derived-couple formulas also give the boundary test: such a projection is eventually zero exactly when the image of x in a sufficiently low stage lies in the image there of πnFj+1E. Indeed, a boundary coming from a lower graded stage has connecting image in πnFjE whose image in that lower stage vanishes; conversely, if x differs by an element from Fj+1 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.

6.1givenstep 2.1step 5.1∎

Choose the low stage at or below Ln. Its map to πnE is an isomorphism, so the boundary test says precisely that the image of x in πnE belongs to Fj+1πnE. Consequently the projection induces an isomorphism from FjπnE/Fj+1πnE 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 FjπnE=πnE for j≤Ln and FjπnE=0 for j≥Un; hence the image filtration is finite and the stated convergence follows. Substitution of j=−b and n=−a−b gives the displayed indexing.

Depends on

Used by · 6

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.