Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 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.

Gysin sequence from a sphere-fiber Serre spectral sequence

Statement

Assume the Axiom of Choice. Let p:EB be a Serre fibration over a path-connected CW complex, let R be a commutative unital ring, and let n1. Suppose every fiber is an R-cohomology n-sphere and a compatible R-orientation has been supplied: the top-cohomology local system is identified with the constant system R, with distinguished generator uE20,n.

The class e(p):=dn+1(u)En+1n+1,0=Hn+1(B;R) is the spherical Euler, or transgression, class. There is a natural Gysin long exact sequence

Hkn1(B;R)e(p)Hk(B;R)pHk(E;R)p!Hkn(B;R)e(p)Hk+1(B;R).(1)

Here p! is the canonical quotient from the two-row abutment filtration to Ekn,n, followed by the supplied orientation; it is integration along the fiber in this spectral-sequence sense. With the product and differential conventions of the multiplicative Serre theorem,

dn+1(au)=(1)aae(p).(2)

The signs in (1) are normalized by multiplying alternate connecting arrows by 1; this does not change their kernels or images. The construction is natural for pullback squares preserving the supplied orientation. No vector-bundle Euler class is used.

Facts & Assumptions

Given: AC, the oriented sphere-cohomology fibration, and the integer n1 in the statement.

[A1]

The Axiom of Choice is assumed exactly to invoke the cohomological Serre construction and its multiplicative refinement.

[F1]

Cohomological Serre spectral sequence gives the two-row sequence, its natural finite abutment filtration, and its cohomological edge maps.

[F2]

Multiplicative cohomological Serre spectral sequence gives the total-degree Leibniz rule, the base/fiber product, and naturality as a multiplicative sequence.

[F3]

Serre edge homomorphisms and transgression identifies dn+1 from (0,n) to (n+1,0) as the cohomological transgression after all earlier outgoing differentials.

[F4]

Edge homomorphisms of a first quadrant spectral sequence identifies the bottom cohomological edge. The stable-term filtration in [F1] supplies the canonical quotient onto the other nonzero, top-row subquotient.

[F5]

Degree and parity criteria for Serre collapse permits collapse once the only possible two-row differential has been taken.

Proof

technique · calculate the sole possible differential and splice its kernels and cokernels through the two-piece filtration
1.1

The orientation identifies the only nonzero fiber-cohomology local systems as the constant copies of R in rows 0 and n. Hence [F1] gives E2a,0=Ha(B;R) and E2a,n=Ha(B;R)u, with all other rows zero. For 2sn, a differential from the top row has target in a row strictly between 0 and n, while a differential from the bottom row has negative second coordinate. Thus these differentials vanish. On page n+1 the only possible nonzero differential is dn+1:En+1a,nEn+1a+n+1,0. All later differentials have a zero endpoint, so [F5] gives collapse at En+2.

F1F3F5
2.1

Put e=dn+1(u). Since no earlier differential reaches (n+1,0), [F3] identifies its target with Hn+1(B;R), so e is an actual base class. A bottom-row class a has zero differential. The Leibniz rule in [F2], applied to the product au, gives dn+1(au)=(1)aae, proving (2). Thus the only page differential is, up to the displayed unit sign, cup multiplication by e.

F2F3step 1.1
3.1

In total degree k, the two stable terms are therefore Ek,0=coker(Hkn1(B;R)eHk(B;R)) and Ekn,n=ker(Hkn(B;R)eHk+1(B;R)). The decreasing abutment filtration has no other nonzero quotient, so [F1] and [F4] give a natural short exact sequence 0Ek,0Hk(E;R)Ekn,n0.(3) The left arrow is the bottom edge. Naturality of [F1] applied to the map of fibrations from p to the identity fibration of B identifies its composite from Hk(B;R) with p. The right arrow followed by the orientation is, by definition, p!.

F1F4step 2.1
4.1

Exactness of (3) says successively that the kernel of p is the image of cup multiplication by e, the image of p is the kernel of p!, and the image of p! is the kernel of the next cup multiplication. Placing these short exact sequences for consecutive total degrees next to one another gives (1), with no appeal to a homological exact-couple connector. Formula (2) contributes (1)a to every other displayed cup map; multiplying that arrow by the unit 1 produces the stated cup-e convention without changing kernels or images.

F2step 2.1step 3.1
5.1

For an orientation-preserving pullback, the coefficient generators correspond. Naturality of [F2] commutes with dn+1, so the Euler class pulls back; naturality of the filtration, the bottom edge, and the top-row quotient in [F1] and [F4] commutes with p and p!. Hence the whole sequence is natural.

F1F2F4step 2.1step 3.1step 4.1
6.1

If B is empty the path-connected hypothesis excludes the case; if the zero ring is allowed, every displayed group and map is zero and the unique element is the orientation generator. For n=1 the first possible differential is d2, exactly as above. Negative cohomological degrees are zero, so (1) has valid endpoints for every integer k. The cases e=0, a=0, a=1, a zero or one-term kernel, and a one-cell base are included. Degenerate cochain representatives disappear on passage to cohomology. Both rows, both ends of (3), all three adjacent exactness assertions, and both orientations of every pullback square have been checked. AC is used only through [F1]–[F2]. There is no iff assertion and no splitting of (3) is claimed.

A1F1F2F3F4F5step 1.1step 2.1step 3.1step 4.1step 5.1

Source notes

Miller, Lecture 29, printed pp. 101–103, gives the two-row Gysin sequence, defines the Euler class as the top generator's transgression, and derives multiplication by it from Leibniz. The map called integration along the fiber here is the canonical quotient onto the stable top row, not the cohomological axis edge defined in [F4]. Miller writes an (n1)-sphere fiber; replacing his n by n+1 gives the indexing used here.

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