Alphabeta Math
CounterexampleConstruction: 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.

Ignoring monodromy gives the wrong Serre E2 page

Statement

Let r:S1S1 be the reflection r([t])=[t], and let K=Tr be its mapping torus, the Klein bottle. Its monodromy acts by 1 on H1(S1;Z). Consequently the correct fiber-degree-one row has H0(S1;H1)=Z/2,H1(S1;H1)=0, whereas replacing H1 by the constant system gives Z in both degrees. The correct Wang sequence gives H1(K;Z)=ZZ/2; the untwisted table misses its torsion summand. No choice principle is used.

Facts & Assumptions

Given: the quotient circle S1=R/Z, its positive one-cell orientation, the reflection r([t])=[t], and integral coefficients.

[F1]

Deg:π1(R/Z,[0])(Z,+) is an isomorphism identifies the positive loop with 1Z. The first Hurewicz map is abelianization identifies this with the oriented generator of H1(S1;Z) and is natural in r.

[F2]

Wang sequence of a mapping torus identifies mapping-torus monodromy with the gluing homeomorphism and supplies the unsplit kernel-cokernel short exact sequence.

[F3]

The first Serre differential is the cellular boundary with local coefficients identifies the Serre E2 row with cellular homology of the base circle using the actual fiber-homology monodromy.

Verification

technique · calculate the one-cell boundary with and without the reflection action, then compare the Wang abutment
1.1

Reflection sends the positive loop t[t] to the negative loop t[t]. Hence [F1] gives r=1:H1(S1;Z)H1(S1;Z). By [F2], this is exactly the degree-one monodromy of the mapping-torus fibration. On H0(S1;Z)=Z the monodromy is the identity, because the fiber is connected.

F1F2
2.1

In fiber degree one, the cellular local chain complex of the one-vertex, one-edge base circle is 0Z1(1)=2Z0. Changing the edge convention multiplies this boundary by 1 and changes neither group. Thus [F3] gives E0,12=coker(2)=Z/2,E1,12=ker(2)=0. If one falsely makes the coefficient system constant, the boundary becomes 11=0, so the same two entries become Z and Z.

F3step 1.1
2.2

Apply [F2] in degree one. On fiber H1, 1r=2; on fiber H0, 1r=0. Hence 0Z/2H1(K;Z)Z0. This sequence splits explicitly: the point [0]S1 is fixed by r, so [t][([0],t)] is a section of KS1 and its first-homology map splits the displayed projection. Therefore H1(K;Z)ZZ/2.

F1F2step 1.1
3.1

The base has cellular dimension one, so no Serre differential ds with s2 can leave or enter its columns. The correct E2 table therefore already displays the torsion piece in total degree one. The false constant table has Z instead at (0,1) and would have two infinite cyclic total-degree-one pieces, so it cannot yield the actual H1(K). Degree zero, the zero kernel of multiplication by two, identity action on H0, both base cells, both orientations, both row degrees, and the fixed-point section are all explicit above. No AC is used, and there is no converse assertion.

F1F2F3step 1.1step 2.1step 2.2

Source notes

Miller's Lectures 24–25, printed pp. 80–87, construct the Serre sequence with the fiber-homology local system and identify its second page by cellular local chains. Steps 1.1–3.1 supply the specific reflection action, its boundary 2, and the Klein-bottle first-homology calculation.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

28 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