Alphabeta Math
RemarkRemark: Literature-sourcedProof: Not applicablePipeline-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 class construction remains owned by algebraic topology

Remark

This page proves zero-set and self-intersection applications of characteristic classes. Algebraic topology owns the normalized Thom class Thom class by fiberwise normalization, its existence and Thom isomorphism Thom isomorphism for oriented vector bundles, and the Euler class e(E)=s0∗j∗uE Thom-defined Euler class of an oriented vector bundle, Euler class by zero-section pullback of the Thom class. Its naturality and ordered Whitney product are proved in Naturality, orientation sign, and Whitney product for Euler classes (with standard unit orientations on rank-zero inputs); the equality of the canonical mod 2 Euler class with the top Stiefel-Whitney class is proved in The mod-two Euler class is the top Stiefel–Whitney class. Each result retains its stated base, orientation and choice hypotheses. DT-12 cites these constructions and does not introduce competing ones. Conversely, zero-locus duality The zero locus of a transverse section represents the Euler dual and the normal-bundle self-intersection formula The self-intersection number is the Euler number of the normal bundle are DT-owned interfaces for the later Euler/index and immersion/embedding pairs.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

64 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