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 be a morphism of first-quadrant cohomological spectral sequences of vector spaces, with of bidegree and
Assume 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 is an isomorphism in every degree.
Facts & Assumptions
Given: A morphism of first-quadrant cohomological spectral sequences of vector spaces over a field, with of bidegree ; tensor-factorized second pages and ; factoring as the tensor product of its axis maps; the fiber-axis map an isomorphism; and an isomorphism in every position.
A morphism of spectral sequences commutes with the differentials and their induced homology maps. Successive cohomological pages satisfy , where has bidegree (Morphism of spectral sequences, Cohomological spectral sequence). Writing and , the valid short exact sequences are and .
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
Induct on , assuming the base-axis maps are isomorphisms through column . Column zero starts this induction. The tensor condition implies isomorphism on all with .
Induction on gives simultaneously: For these follow from the preceding isomorphisms. Write and , distinguishing the boundary group from the assertion by context. If , the domain map is an isomorphism and the outgoing-target map in column is injective, so the map on cycles is an isomorphism. If , both the domain and incoming-source maps are isomorphisms by , so the maps on boundary groups and on the quotients by those boundaries are isomorphisms. Quotienting cycles by boundaries gives . For , the cycle map is injective by , and the incoming-source map is surjective since . 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 .
Now consider the unknown bottom position . It has no outgoing differential, and for each there is an exact sequence The second term is mapped isomorphically by . We claim the cycle term is mapped surjectively. Put . For , use Here the first map is the incoming differential restricted to cycles; this is exact because . The map on the first term is an isomorphism by , since . At all pages later than , outgoing differentials from have negative fiber target, so . Start from stationarity, where its map is an isomorphism by the assumed limiting isomorphism, and descend on ; lifting an element of the third term and correcting by an element of the first proves surjectivity on , including . The first quadrant gives a finite stationarity bound at every position, so this is finite downward induction.
Finally the bottom position itself is stationary for . Starting from its limiting isomorphism, descend on 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 is an isomorphism. Induction on 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
- Allen Hatcher, Spectral Sequences in Algebraic Topology, Chapter 1 (standard reference, not scraped)