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.

Relative lifts produce cohomological transgressions

Statement

Assume AC. Let p:E→B be a Serre fibration over a simply connected CW base with basepoint vertex and fiber F. If x∈Hm(F;F2), m>0, and y∈Hm+1(B,∗;F2) satisfy

δx=p∗yin Hm+1(E,F;F2),

then x survives to Em+10,m and its differential dm+1 is the bottom-axis coset represented by y. Moreover Sqax has the same property with representative Sqay at page m+a+1, whenever its degree is positive.

Facts & Assumptions

Given: AC; a Serre fibration p:E→B over a simply connected CW base with basepoint a vertex, fiber F; classes x∈Hm(F;F2), m>0, and y∈Hm+1(B,∗;F2) with δx=p∗y in Hm+1(E,F;F2); and a nonnegative integer a with m+a>0.

[F1]

The cohomological Serre spectral sequence is constructed from the filtered singular cochain complex with the stated filtration and page formula, and converges to the abutment (Cohomological Serre spectral sequence, R page of the spectral sequence of a filtered complex, The cohomological filtered complex construction).

[F2]

Cellular cochains compute cohomology with local coefficients, so cohomology in degree m+1 of an m-dimensional CW complex vanishes (Cellular cochains compute cohomology with local coefficients); the cohomology pair sequence is exact and its connector is represented by the coboundary of an extension (Long exact sequence of a pair in singular cohomology).

[F3]

Steenrod squares are natural additive operations on relative cohomology and commute with the pair connector (Steenrod squares are well-defined and natural, Steenrod squares commute with relative cohomology connectors).

[F4]

AC is used to choose the relative cocycle representative v and the extension u (The Axiom of Choice).

Proof

technique · direct
1.1givenF1F2F4

A degree-m+1 class of B lifts to Hm+1(B,Bm): the restriction to Bm is zero because cellular cochains on an m-dimensional CW complex vanish in degree m+1, and the pair sequence gives the lift. Choose a relative cocycle v for that lift, hence vanishing on Bm. Extend a cocycle representing x from F to an absolute cochain u of E. The asserted relative-class equality means du−p∗v=dt for a cochain t vanishing on F. Replace u by u−t. It still restricts to the same fiber cocycle and now satisfies du=p∗v exactly.

2.1step 1.1F1

In the decreasing skeletal filtration, p∗v lies in filtration m+1, since it vanishes over Bm. Thus u is an (m+1)-cycle representative in column zero. The filtered-complex page formula shows it survives every earlier page, and the page-m+1 differential is represented by its coboundary p∗v. On the row of fiber degree zero the projection edge identifies this class with y, modulo precisely the earlier incoming boundaries. This identification is the base-edge identification in the published cohomological Serre construction, not an assumption of a new operation on a page. The column-zero identification sends the restriction of u to the original fiber class; simple connectivity makes its transport constant. The finite-quotient filtration comparison in the published Serre theorem identifies these representative computations with the actual Serre pages, despite the raw singular filtration being unbounded.

3.1step 2.1F3∎

Finally the connector-compatibility lemma and naturality of relative squares give δSqax=Sqaδx=Sqap∗y=p∗Sqay. Apply the same representative argument in total degree m+a+1. This proves both the survival and the precise differential page; no rule about squares of an arbitrary spectral-sequence cycle has been assumed. Zero operations simply give zero representatives.

Depends on

Used by

Dependency tree · two levels

45 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