Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-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.

Spectral sequence comparison theorem

Statement

Let f:EE~ be a morphism of spectral sequences that is an isomorphism at every bidegree on one page s. Suppose the two sequences strongly converge in this page's convention to filtered families Hn and H~n, and let hn:HnH~n be filtered maps compatible with the specified abutment identifications. Then every grphn is an isomorphism. Each hn is an isomorphism of filtered objects if both degree-n filtrations are finite in an abelian category, or if the targets are modules with exhaustive separated complete filtrations. An abstract page isomorphism without compatible target maps supplies no such target conclusion.

Facts & Assumptions

[F1]

Morphism of spectral sequences requires differential commutation and fr+1αr=α~rH(fr); the abutment maps are additional data.

[F2]

Homology object of a chain complex takes homology as cycles modulo boundaries.

[F3]

Strong convergence of a spectral sequence provides two-sided pointwise stationarity, specified weak-convergence identifications and the stated target-filtration conditions.

[F4]

Finite and complete filtered isomorphism lifting upgrades a graded isomorphism to a filtered isomorphism under either of the two target hypotheses, without AC.

Proof

Given: f, its page s, and the compatible filtered maps hn.

1.1

The inverse of the page map fs commutes with differentials: multiply d~fs=fsd by the componentwise inverses at the source and target to obtain dfs1=fs1d~. Hence both maps preserve cycle kernels and incoming boundary images. They induce mutually inverse homology quotient maps. The transition identity gives fs+1=α~sH(fs)αs1, an isomorphism. Induction proves fr is an isomorphism at every bidegree for every rs.

F1F2
2.1

Fix (p,q). Choose an integer rs beyond the two stationarity bounds for this position in both sequences. Their specified transitions canonically identify these terms with their limiting terms. By step 1.1 the resulting limiting map f:Ep,qE~p,q is an isomorphism. Compatibility of hp+q with the abutment data says that its graded map is this map conjugated by the two specified graded identifications. Thus grphp+q is an isomorphism. Only finitely many bounds were compared at each fixed position; there is no uniform-collapse hypothesis.

F1F3step 1.1
3.1

Fix n. Step 2.1 proves that the filtered map hn induces an isomorphism on every graded piece. Apply [F4] to its finite filtrations in the abelian-category case, or to its exhaustive separated complete module filtrations in the other case. It follows that hn is invertible with filtered inverse. This uses strong convergence as supplied data, and does not invoke any theorem asserting convergence of an unbounded filtered complex. Zero page terms, a zero target, and a single filtration jump are included in [F4]. No AC is introduced. Without the compatibility in step 2.1, the page map would say nothing about the graded map of the specified hn, so that hypothesis cannot be omitted from this argument.

F3F4step 2.1

Depends on

Used by

Dependency tree · two levels

9 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