Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedaudited 2026-09-22
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 EB be a real vector bundle of rank n over a path-connected CW base (or a CW-type base), with complexification EC and Chern classes ci(EC)H2i(B;Z) in the sense of Chern classes from the projective-bundle relation. The Pontryagin classes of E are defined by pi(E):=(1)ic2i(EC)H4i(B;Z)(i0), completed by the conventions p0(E):=1 and pi(E):=0 whenever 2i>n=rankRE; the total Pontryagin class is the finite sum p(E):=i0pi(E).

The definition is well defined and requires no orientation of E: the complexification EC is determined by E up to canonical isomorphism, so its even Chern classes are determined, and the sign (1)i is a fixed normalization (it makes pi of a line vanish and makes the top class pn of an oriented rank-2n bundle equal to e(E)2 in the next items). When E is numerable and B is a path-connected paracompact Hausdorff CW complex, the odd Chern classes of EC 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, c2i(EC)=c2i(EC), is what makes the construction orientation-free.

Depends on

Used by

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