Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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.

Fiber and limit isomorphisms force a base-axis isomorphism

Statement

Let Φ:Eˉ→E be a morphism of first-quadrant cohomological spectral sequences of vector spaces, with dr of bidegree (r,1−r) and

Eˉ2p,q=Eˉ2p,0⊗Eˉ20,q,E2p,q=E2p,0⊗E20,q.

Assume Φ2 factors as the tensor product of its axis maps, the fiber-axis map is an isomorphism, and Φ∞ is an isomorphism in every position. Then the base-axis map Φ2p,0 is an isomorphism in every degree.

Facts & Assumptions

Given: A morphism Φ:Eˉ→E of first-quadrant cohomological spectral sequences of vector spaces over a field, with dr of bidegree (r,1−r); tensor-factorized second pages Eˉ2p,q=Eˉ2p,0⊗Eˉ20,q and E2p,q=E2p,0⊗E20,q; Φ2 factoring as the tensor product of its axis maps; the fiber-axis map Φ20,q an isomorphism; and Φ∞ an isomorphism in every position.

[F1]

A morphism of spectral sequences commutes with the differentials and their induced homology maps. Successive cohomological pages satisfy Er+1=H(Er,dr), where dr has bidegree (r,1−r) (Morphism of spectral sequences, Cohomological spectral sequence). Writing Zrp,q=ker⁡dr and Brp,q=im⁡dr, the valid short exact sequences are 0→Brp,q→Zrp,q→Er+1p,q→0 and 0→Zrp,q→Erp,q→Brp+r,q−r+1→0.

[F2]

In a strongly convergent first-quadrant spectral sequence the stationary page identifies with the associated graded of the abutment (Strong convergence of a spectral sequence). First-quadrant bidegrees alone give stationarity; the assumed Φ∞ isomorphism identifies these stationary pages positionwise, without additional abutment data.

Proof

technique · direct
1.1givenF1

Induct on k, assuming the base-axis maps are isomorphisms through column k. Column zero starts this induction. The tensor condition implies isomorphism on all E2p,q with p≤k.

2.1step 1.1F1algebra

Induction on r≥2 gives simultaneously: (Ar)Φrp,q is an isomorphism if p≤k−r+1,(Br)Φrp,q is injective if p≤k. For r=2 these follow from the preceding E2 isomorphisms. Write Zr=ker⁡dr and Br=im⁡dr, distinguishing the boundary group Br from the assertion (Br) by context. If p≤k−r, the domain map is an isomorphism and the outgoing-target map in column p+r≤k is injective, so the map on cycles Zrp,q is an isomorphism. If p≤k−r+1, both the domain and incoming-source maps are isomorphisms by (Ar), so the maps on boundary groups and on the quotients by those boundaries are isomorphisms. Quotienting cycles by boundaries gives (Ar+1). For p≤k, the cycle map is injective by (Br), and the incoming-source map is surjective since p−r≤k−r+1. Thus every target boundary in the image of a source cycle lifts to a source boundary; the map on cycle/boundary quotients is injective. This gives (Br+1).

3.1step 2.1F2algebra

Now consider the unknown bottom position (k+1,0). It has no outgoing differential, and for each r there is an exact sequence Zrk−r+1,r−1⟶Erk−r+1,r−1→drErk+1,0⟶Er+1k+1,0⟶0. The second term is mapped isomorphically by (Ar). We claim the cycle term is mapped surjectively. Put (u,v)=(k−r+1,r−1). For s≥r, use Esu−s,v+s−1⟶Zsu,v⟶Es+1u,v⟶0. Here the first map is the incoming differential restricted to cycles; this is exact because ds2=0. The map on the first term is an isomorphism by (As), since u−s=k−r−s+1≤k−s+1. At all pages later than s, outgoing differentials from (u,v) have negative fiber target, so Es+1u,v=Zs+1u,v. Start from stationarity, where its map is an isomorphism by the assumed limiting isomorphism, and descend on s; lifting an element of the third term and correcting by an element of the first proves surjectivity on Zsu,v, including s=r. The first quadrant gives a finite stationarity bound at every position, so this is finite downward induction.

4.1step 3.1step 1.1F2∎

Finally the bottom position itself is stationary for r>k+1. Starting from its limiting isomorphism, descend on r in the displayed five-term exact sequence. Surjectivity on the first term and isomorphisms on the second and fourth show the third map is an isomorphism: for surjectivity lift its quotient in the fourth term and correct the difference by the second; for injectivity first lift a kernel element to the second, then lift its image in the first and subtract, using injectivity of the second. Thus Φ2k+1,0 is an isomorphism. Induction on k proves the claim.

Depends on

Used by

Dependency tree · two levels

13 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