Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

Naturality of the homological Serre spectral sequence

Statement

Consider a strictly commutative square of Serre fibrations

EuEppBfB

over path-connected CW complexes, where f is cellular, and fix a commutative unital ring R. The map u induces maps between the homological Serre spectral sequences which commute with every differential and every next-page identification. Under the canonical identifications of the preceding theorem, the map on the second page is f:Ha(B;Hb(p;R))Ha(B;Hb(p;R)), where the coefficient morphism is induced by the strict-fiber maps ux:p1(x)(p)1(f(x)).

The induced map u:Hn(E;R)Hn(E;R) preserves the image filtrations, and its associated-graded map agrees with the map on the stable pages. These assignments preserve identities and composition.

If u0,u1:EE lie over the same cellular map f and are joined by a homotopy over f, meaning a homotopy U:E×IE satisfying pU(e,t)=f(p(e)) for every (e,t), their maps agree on every page r1 (hence in particular from E2 onward) and induce the same filtered map on homology. All assertions are choice-free.

Facts & Assumptions

Given: The displayed square, its cellular base map, and the two Serre spectral sequences with the conventions of the preceding theorem.

[F1]

Homological Serre spectral sequence constructs the choice-free sequences, their local-coefficient second pages, their stable associated-graded identifications, and their naturality for cellular squares.

[F2]

Serre filtration over the base skeleta gives the chain and target image filtrations. A filtered chain map induces a morphism of spectral sequences gives functorial page maps from a filtered chain map.

[F3]

Functoriality with coefficient morphisms gives the homology map induced by a base map and a forward coefficient morphism.

[F4]

The singular chain homotopy formula gives the prism identity. R cycles and r boundaries of an increasingly filtered complex and R page of the spectral sequence of a filtered complex give the representative numerator, denominator, and quotient formulas on every page.

Proof

technique · filtered chain maps and a filtration-preserving prism
1.1

If eEa=p1(Ba), then pu(e)=fp(e)f(Ba)(B)a because f is cellular. Hence u(Ea)Ea, and the singular chain map u# preserves every filtration piece. It also induces u(FaHn(E;R))FaHn(E;R) by the commutative square formed by the two inclusions of Ea and Ea.

F2
2.1

Apply [F2] to the filtered chain map of Step 1.1. It gives compatible maps ur:Ea,br(p)Ea,br(p) commuting with dr and with the specified homology-to-next-page isomorphisms. Filtered identity maps and composites induce the identity and composite page maps, so this construction is functorial.

F2Step 1.1
2.2

Now let U be a homotopy over the fixed map f. If a singular simplex has image in Ea, every prism simplex occurring in PU has image in (p)1(f(Ba))Ea. Thus the prism operator P=PU preserves filtration and raises chain degree by one. By [F4], u1#u0#=P+P. It follows at once on cycles that u0=u1 on homology; since both maps preserve the filtration, their filtered homology maps agree.

F4Step 1.1
3.1

Restriction of the square to the strict fibers over x gives ux:p1(x)(p)1(f(x)). Naturality of fiber transport makes the induced homology maps a coefficient morphism Hb(p;R)fHb(p;R). The relative-pair, excision, and transport maps used in the cellwise E1 calculation commute with the maps induced by (u,f); this is the naturality clause in [F1]. Taking homology of d1 therefore gives precisely the local-coefficient map of [F3] on E2.

F1F3Step 2.1
3.2

Represent a stable class at (a,na) by an actual cycle zFaCn(E;R). Its page image is represented by u#z, while its associated-graded image is the class of u[z] modulo Fa1Hn(E;R). These are the same representative under the stable identifications in [F1]. Boundaries and lower-filtration cycles map to boundaries and lower-filtration cycles, so the comparison is well defined and proves that the stable map is the associated graded of the filtered homology map from Step 1.1.

F1Step 1.1Step 2.1
3.3

Fix r1 and a representative xZa,br, so xFaCn and xFarCn1. The term Px lies in FarCnFa1Cn, and (Px)=(u1#u0#)xFarCn1; hence PxAa1,nr1, the first boundary summand in [F4]. Also PxFaCn+1Fa+r1Cn+1 and Px=(u1#u0#)xPxFaCn, so PxAa+r1,n+1r1 and Px is in the second boundary summand. The prism identity therefore makes (u1#u0#)x zero in Ea,br. Thus the two page maps agree for every r1, which is stronger than the promised agreement from E2.

F4Step 2.2
4.1

If a base, total space, or strict fiber is empty, the corresponding chains and coefficient stalks are zero; path-connected nonempty bases supply all stated fibers. The zero ring, degree zero, filtration zero, axes, identity and constant maps, constant homotopies, and degenerate simplices obey the same formulas. Step 1.1 checks both filtration endpoints, Step 3.2 checks both stable/associated-graded directions, and Step 3.3 checks both summands in the r-boundary denominator, including r=1. Every construction is applied to supplied maps, chains, or one prism, so no AC is used. The theorem has no iff assertion.

F1F2F3F4Step 1.1Step 2.1Step 3.1Step 3.2Step 2.2Step 3.3

Depends on

Used by

Dependency tree · two levels

34 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