Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedjudge 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.

Wang sequence of a mapping torus

Statement

Let f:FF be a homeomorphism and form its mapping-torus bundle Tf=(F×[0,1])/(x,1)(f(x),0)S1. For every q0, with H1(F;Z)=0, its Wang sequence has map 1f and yields a natural short exact sequence 0coker(1f:Hq(F)Hq(F))Hq(Tf)ker(1f:Hq1(F)Hq1(F))0. No splitting, natural or otherwise, is asserted.

Facts & Assumptions

Given: a homeomorphism f:FF, its displayed mapping-torus bundle, the positive orientation of S1=[0,1]/01, and integral coefficients.

[F1]

Fiber transport and monodromy action defines transport and its induced homology monodromy.

[F2]

Wang sequence for a fibration over the circle gives the natural long exact sequence with map 1Tq for positive-loop transport Tq and specifies the simultaneous sign change under orientation reversal.

Verification

technique · identify the gluing map as monodromy, then isolate the kernel and cokernel in one exact five-term segment
1.1

Away from the identified endpoint, the quotient projection has product charts. Across the endpoint, use one interval on the t=1 side and one on the t=0 side, changing the fiber coordinate by f in one direction and by f1 in the other. Thus the displayed map is the standard mapping-torus fiber bundle. Lifting the positive base loop from t=0 to t=1 starts at x and ends at the class of (x,1), which equals the class of (f(x),0). Hence [F1] gives Tq=f:Hq(F)Hq(F).

F1
2.1

Substitute Tq=f into the five-term part of [F2]: Hq(F)1fHq(F)iqHq(Tf)qHq1(F)1fHq1(F). Exactness gives keriq=im(1f), so iq descends to an injection from the displayed cokernel, whose image is kerq. It also gives imq=ker(1fHq1(F)), so q corestricts to a surjection onto the displayed kernel. These two conclusions are exactly the claimed short exact sequence.

F2step 1.1
3.1

For q=0, the right group is zero by the stated H1=0 convention, so the conclusion is the literal isomorphism H0(Tf)coker(1fH0F). If F is empty, all three nonzero-index groups are zero and the same sequence is exact. If f=id, both Wang maps vanish and the sequence becomes 0Hq(F)Hq(F×S1)Hq1(F)0, still without selecting a splitting. Orientation reversal replaces 1f by f1; multiplication by 1 leaves its kernel, image, and cokernel canonically isomorphic. Thus zero maps, identity monodromy, both exactness endpoints, and both orientation signs are covered. The argument uses no choice principle and proves no converse.

F2step 1.1step 2.1

Source notes

Hatcher's proof of the Serre sequence, printed pp. 526–532, specializes over the one-cell circle to the two-column exact couple underlying Wang. The local Wang theorem [F2] supplies that derived sequence; steps 1.1–2.1 provide the mapping-torus monodromy and the complete kernel-cokernel extraction.

Depends on

Used by

Dependency tree · two levels

11 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