Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: Literature-sourcedPipeline-generatedprecheck passjudge 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.

Pontryagin numbers of the complex projective plane

Example

Assume AC (The Axiom of Choice), inherited from the tangent-bundle and Pontryagin-number suppliers. For CP2 with its complex orientation, H∗(CP2;Z)=Z[x]/(x3) with x=c1(γ∗) and ⟨x2,[CP2]⟩=1. Its total Pontryagin class is (1+x2)3=1+3x2 in this truncated ring. Its unique degree-four Pontryagin number is therefore p1[CP2]=3. Consequently it is not an oriented boundary and represents a nonzero class of Ω4SO. This supplies the degree-four numerical normalization for later signature computations without assuming that the test manifold is already known to generate integral bordism.

Facts & Assumptions

Given: The complex projective plane CP2 with its complex orientation and the tautological complex line γ with dual γ∗, and x=c1(γ∗).

[F1]

The tangent bundle of complex projective space and its Pontryagin classes gives the Euler sequence, the splitting, and the computations H∗(CP2;Z)=Z[x]/(x3), ⟨x2,[CP2]⟩=1, c(TCP2)=(1+x)3 and p(TCP2)=(1+x2)3, hence p1(TCP2)=3x2 and pk(TCP2)=(3k)x2k.

[F2]

Pontryagin numbers of a closed oriented manifold defines pJ[CP2]=⟨pj1⋯pjr,[CP2]⟩ for a partition J of the dimension divided by four, here the single partition (1) of 1, with the Kronecker pairing of Kronecker evaluation pairing.

[F3]

Oriented boundaries have zero Pontryagin numbers: a closed oriented 4k-manifold with a nonzero Pontryagin number is not an oriented boundary, and Null-cobordant closed manifolds, Unoriented and oriented bordism groups identify the oriented boundary classes with the zero class of Ω4SO.

[F4]

Zero-dimensional bordism groups identifies Ω0SO≅Z through the signed count and its positive point generator; no assertion about Ω4SO is part of that result.

Verification

1.1F1

By [F1] the truncated ring is Z[x]/(x3), so x3=0 and x2≠0 with ⟨x2,[CP2]⟩=1. The total Pontryagin class is p(TCP2)=(1+x2)3=1+3x2+3x4+x6, and all powers of x with exponent at least three vanish in the truncated ring, so p(TCP2)=1+3x2. Thus p1=3x2 and p2=0, the latter by the cohomological dimension, not the rank cutoff: the real tangent rank is 4 and 2⋅2=4 does not exceed it.

1.2F2step 1.1

The only partition of 1 is (1), so by [F2] the unique degree-four Pontryagin number is p1[CP2]=⟨3x2,[CP2]⟩=3⟨x2,[CP2]⟩=3, where the evaluation uses the normalization of step 1.1 and the linearity of the Kronecker pairing on classes [F2]. No other partition contributes, and classes of the wrong degree evaluate to zero by the conventions of [F2].

2.1F3step 1.2

Since p1[CP2]=3≠0, the manifold is not an oriented boundary by [F3], so its class in Ω4SO is nonzero: a boundary class has all Pontryagin numbers zero, and here p1 does not vanish. The empty manifold and the zero class are excluded by [F3]; in particular [CP2]≠0 without any appeal to a classification of Ω4SO.

3.1F1F2F4step 1.1step 2.1∎

Normalization and boundary cases. The degree-zero oriented bordism group is Ω0SO≅Z generated by the positively oriented point [F4], whose only number is p∅=⟨1,[pt]⟩=1; this identifies the degree-zero normalization but makes no claim about Ω4SO, and in particular no generator or rank statement for degree four is asserted here. For dimension zero the example reduces to that point computation, and the empty manifold has value 0. The formulas of step 1.1 include the degenerate case x3=0 through the truncation, and the cited suppliers carry their own choice declarations, so the verification adds no choice.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

69 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