Alphabeta Math
RemarkRemark: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)
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 characteristic-class construction is cited, not rebuilt

The interface used

Assume AC. Remark. This page computes with the characteristic classes but does not construct them. The exact interfaces are: the Stiefel-Whitney classes wi and the conventions w0=1, wi=0 for i>rank⁡ of Stiefel–Whitney classes from the projective-bundle relation together with the Whitney product and naturality of Whitney sum formula for Stiefel–Whitney classes and Naturality of Stiefel–Whitney classes; the Euler class as the zero-section pullback of the Thom class of Euler class by zero-section pullback of the Thom class; and the Pontryagin classes pi(E)=(−1)ic2i(EC) of Pontryagin classes by complexification with the Whitney product away from two of Pontryagin Whitney product away from two and the odd-Chern two-torsion fact of Odd Chern classes of a complexified real bundle are two-torsion. Authoring must substitute these exact item ids and the two-torsion qualification before performing the calculations of The normal Pontryagin class is the rational inverse of the tangent Pontryagin class and High normal Pontryagin classes obstruct low-codimension immersions; no construction, normalization or product formula is minted here.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

41 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