Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

The Euler number of the tangent bundle is the Euler characteristic

Statement

Assume the Axiom of Choice (The Axiom of Choice).

(i) Let M be a closed oriented smooth n-manifold, n≥1. Then the Euler number of the tangent bundle satisfies ⟨e(TM),[M]⟩=χ(M), where e(TM)∈Hn(M;Z) is the Euler class of Euler class by zero-section pullback of the Thom class and the bracket is the Kronecker evaluation; equivalently the diagonal satisfies ΔM⋅ΔM=χ(M) in the self-intersection number of The self-intersection number of a complementary-dimensional oriented submanifold.

(ii) For any closed smooth n-manifold with n≥1, ⟨wn(TM),[M]⟩2≡χ(M)(mod2), with wn the top Stiefel-Whitney class.

Facts & Assumptions

Given: A closed smooth n-manifold M, oriented in part (i).

[F1]

Choose an excellent Morse function f and a Riemannian metric g. The section s=grad⁡gf of TM vanishes exactly at Crit⁡(f) and is transverse to the zero section there (the linearization is the nondegenerate Hessian) (The Riemannian gradient is the metric dual of the differential, The Riemannian gradient vanishes exactly at the critical points, Every compact smooth manifold admits an excellent Morse function, Every smooth manifold admits a riemannian metric, Morse functions and excellent Morse functions).

[F2]

The signed zero count of a transverse section of a rank-n oriented bundle over a closed oriented n-manifold equals ⟨e(E),[M]⟩; the local sign of a zero of a vector field, read on the zero-section/graph intersection in TM with the horizontal-then-vertical orientation, is the index of the zero (The self-intersection number is the Euler number of the normal bundle, The index of a zero is its zero-section intersection number, Euler class by zero-section pullback of the Thom class).

[F3]

The signed zero count of grad⁡gf is ∑p(−1)ind⁡(p), and this equals χ(M); in particular the Euler number is χ(M). The diagonal form is the self-intersection statement for ΔM, and over F2 the unsigned zero count satisfies #Crit⁡(f)≡⟨wn(TM),[M]⟩2, since the canonical mod 2 Euler class is the top Stiefel-Whitney class (A Morse gradient zero contributes (−1)λ to the index, Morse Euler characteristic identity, The diagonal self-intersection is the Euler number of the tangent bundle, The mod two self-intersection is the top Stiefel-Whitney evaluation, The mod-two Euler class is the top Stiefel–Whitney class).

[F4]

Under the assumed AC, M is paracompact Hausdorff and CGWH with CW homotopy type, and the smooth tangent bundle is numerable (Smooth manifolds have CW homotopy type). These are the base and bundle hypotheses of the cited Thom and Stiefel-Whitney results.

Proof

1.1F1F2F3F4algebra

For (i): by [F1] the section s=grad⁡gf is transverse to the zero section with zero set Crit⁡(f), and by [F2] its signed zero count equals ⟨e(TM),[M]⟩; by [F3] that signed count is ∑p(−1)ind⁡(p)=χ(M), so ⟨e(TM),[M]⟩=χ(M).

2.1F3step 1.1algebra

The diagonal statement of [F3] identifies ΔM⋅ΔM with ⟨e(TM),[M]⟩, so it equals χ(M) as well.

3.1F3F4step 1.1algebra∎

For (ii): the unsigned count #Crit⁡(f) of the transverse section grad⁡gf satisfies #Crit⁡(f)≡⟨wn(TM),[M]⟩2 by [F3], while #Crit⁡(f)≡∑p(−1)ind⁡(p)=χ(M)(mod2) because (−1)λ≡1; hence ⟨wn(TM),[M]⟩2≡χ(M)(mod2).

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

133 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