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.
Pontryagin classes by complexification
Definition
Assume AC. Let be a real vector bundle of rank over a path-connected CW base (or a CW-type base), with complexification and Chern classes in the sense of Chern classes from the projective-bundle relation. The Pontryagin classes of are defined by completed by the conventions and whenever ; the total Pontryagin class is the finite sum .
The definition is well defined and requires no orientation of : the complexification is determined by up to canonical isomorphism, so its even Chern classes are determined, and the sign is a fixed normalization (it makes of a line vanish and makes the top class of an oriented rank- bundle equal to in the next items). When is numerable and is a path-connected paracompact Hausdorff CW complex, the odd Chern classes of are two-torsion by Odd Chern classes of a complexified real bundle are two-torsion and enter no Pontryagin class; conjugation invariance of the even classes, , is what makes the construction orientation-free.
Depends on
Used by
- Integral total Pontryagin multiplicativity cannot ignore two-torsion Counterexample
- Stability and rank cutoff under adding a trivial summand Example
- Naturality, stability, and mod-two reduction of Pontryagin classes Theorem
- Pontryagin Whitney product away from two Theorem
- Top Pontryagin class is the square of the Euler class Theorem
Dependency tree · two levels
15 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
- Hatcher, Vector Bundles & K-Theory, section 3.2 (standard reference, not scraped)