Alphabeta Math
TheoremStatement: Literature-sourcedProof: Literature-sourcedPipeline-generatedprecheck pass
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.

Thom's theorem: Stiefel-Whitney numbers detect unoriented bordism

Statement

Assume AC. Let M and N be closed smooth n-manifolds. Then M and N are unoriented-cobordant if and only if all of their Stiefel-Whitney numbers agree; equivalently, M is null-cobordant if and only if every Stiefel-Whitney number of M vanishes. Consequently the map ΩnO→∏IF2, [M]↦(wI[M])I, is injective, and the unoriented bordism ring is detected by the Stiefel-Whitney numbers. (The 'only if' direction is the invariance theorem; the content is the converse, due to Thom.)

Facts & Assumptions

Given: Closed smooth n-manifolds M,N, the unoriented bordism classes of Unoriented and oriented bordism groups, the Stiefel-Whitney numbers of Stiefel-Whitney numbers of a closed manifold, and the stable Thom prespectrum data of The Thom prespectrum of the universal real and oriented bundles.

[F1]

Characteristic numbers are cobordism invariants and All characteristic numbers vanish on null-cobordant manifolds: unoriented-cobordant closed n-manifolds have equal Stiefel-Whitney numbers, and a null-cobordant closed manifold has all of them zero; Null-cobordant closed manifolds identifies null-cobordism with the zero class of ΩnO.

[F2]

Pontryagin-Thom converts bordism detection to a Thom-space homotopy problem assigns α(M)∈πn(MO) with M null-cobordant if and only if α(M)=0, expresses the Stiefel-Whitney numbers as the evaluations of the universal classes ur⌣wI‾(γr) on α(M), and records that the degreewise inverse substitution is involutive.

[F3]

Stable universal Thom cohomology is eventually constant in every degree identifies H^n(TO;F2) with the homogeneous degree-n polynomials in the universal normal Stiefel-Whitney classes times the Thom class, and Finite Thom classifying detector map chooses the finite detector coordinates Dr,n from this space, so each coordinate is a finite linear combination of normal-class monomials times ur.

[F4]

Stable unoriented Thom homotopy is injectively detected: for each n the detector map from πn(MO) to the finite product of coordinate groups is injective on the cofinal tail r≥n+2, with coordinates commuting with the fixed-coordinate structure maps. Disjoint union makes bordism classes abelian groups gives [N]=−[N] in ΩnO and the componentwise additivity of the numbers, and The Axiom of Choice is assumed exactly as declared by these suppliers.

Proof

1.1F1

The only-if direction. If M and N are unoriented-cobordant then all their Stiefel-Whitney numbers agree by [F1], and a null-cobordant manifold has all numbers zero by [F1]; this is the easy half of both formulations.

1.2F2F3

The converse: vanishing numbers force the Thom class to be zero. Suppose every Stiefel-Whitney number of M vanishes. By [F2] the Pontryagin-Thom class α(M)∈πn(MO) determines null-cobordism, and for a large representative rank r the numbers are the evaluations wI[M]=⟨ur⌣wI‾(γr),α(M)⟩. By [F3] every detector coordinate Dr,n in degree n is a finite linear combination of normal-class monomials ur⌣a(γr) of degree n, and each such normal monomial is, by the degreewise inverse substitution of [F2] (which is involutive), a finite linear combination of the tangent-number functionals ur⌣wI‾(γr). Hence every detector coordinate evaluates to zero on α(M), since each of those functionals evaluates to a Stiefel-Whitney number and all of them vanish by hypothesis.

2.1F2F3F4step 1.2

Zero detector implies null-cobordism. The detector coordinates are compatible with the fixed-coordinate structure maps and injective on the cofinal tail r≥n+2 by [F4]. Since step 1.2 shows that all coordinates of α(M) vanish at a representative rank in that tail, injectivity gives α(M)=0; by [F2] the manifold M is null-cobordant. The argument uses the batch-30 Steenrod/Thom module-coalgebra and free-generator construction, the strict mod-two comparison, the finite-generation comparison through the universal-coefficient cone, the relative Hurewicz range, and the proved suspension compatibility through their supplier chain; no unstable dimension count or integral/mod-two identification replaces those inputs.

3.1F1F2F4step 2.1

Equality of numbers and injectivity. For closed n-manifolds M,N, the numbers of the disjoint union satisfy wI[M⊔N]=wI[M]+wI[N] in F2 by the componentwise definition [F1], and [N]=−[N] in the unoriented bordism group [F4]. Hence all numbers of M and N agree if and only if all numbers of M⊔N vanish, if and only if M⊔N is null-cobordant by step 2.1, if and only if [M]+[N]=0, if and only if [M]=[N]. Therefore the coordinate map ΩnO→∏IF2 is well defined and injective in every degree, so the unoriented bordism ring is detected by the Stiefel-Whitney numbers; no polynomial presentation of that ring is asserted.

4.1F1F3F4step 3.1∎

Degree zero and empty case. For n=0 the sole monomial is the empty product, whose number is the parity of the cardinality by [F1], the stable group is detected in degree zero through H^0=F2U and ranks r≥2 by [F3] and [F4], and the same argument gives that a finite set is null-cobordant exactly when its cardinality is even. The empty manifold has the zero class in Ω0O and all numbers zero, consistent with the injectivity of step 3.1. All rank thresholds use the cofinal tail r≥n+2 of [F4] and the fixed-coordinate structure maps; no further choice is made.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

95 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