Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

The total L-class of complex projective space is a power of x/tanh⁡x

Statement

Assume AC. Let γ→CPn be the tautological complex line and y=c1(γ∗)∈H2(CPn;Z) the standard generator with H∗(CPn;Z)=Z[y]/(yn+1) and ⟨yn,[CPn]⟩=1 (The tangent bundle of complex projective space and its Pontryagin classes), and give CPn its complex orientation. Then in H4∗(CPn;Q), L(TCPn)=Q(y)n+1=(ytanh⁡y)n+1. Its degree-4j component is cjy2j with cj=∑i1+⋯+in+1=jq2i1⋯q2in+1=[y2j](y/tanh⁡y)n+1, the multinomial coefficient sum; for j=1 this is (n+1)q2.

Facts & Assumptions

Given: AC, the tautological line γ→CPn, the generator y=c1(γ∗), and the complex orientation.

[F1]

The total L-class of a smooth manifold is L(M)=L(TM)∈H^4∗(M;Q), with degree-4j component Lj(TM), and L of a bundle is a polynomial in its Pontryagin classes (The total L-class and the L-genus of a smooth manifold, The Hirzebruch L-polynomials and the total L-class of a real vector bundle).

[F2]

L is stable, multiplicative and natural, and for a complex line bundle ℓ with c1(ℓ)=t the underlying real L-class is L(ℓR)=Q(t)=t/tanh⁡t (The L-polynomials are well defined and form a multiplicative, natural and stable sequence).

[F3]

The in-run supplier establishes the complex bundle isomorphism C‾⊕TCPn≅(γ∗)⊕(n+1) and p(TCPn)=(1+y2)n+1 (The tangent bundle of complex projective space and its Pontryagin classes).

[F4]

The projective tangent-bundle supplier gives H∗(CPn;Z)=Z[y]/(yn+1) for y=c1(γ∗) and ⟨yn,[CPn]⟩=1 (The tangent bundle of complex projective space and its Pontryagin classes). Rational coefficient change gives the same truncated ring over Q: the integral groups are finite free, and the universal coefficient sequence identifies both coefficient groups with duals of the integral homology free quotients. Thus H4j(CPn;Q)=Qy2j for 2j≤n and is zero otherwise (Topological universal coefficient short exact sequence for cohomology).

[F6]

Q(u)=∑j≥0q2ju2j with q0=1 (The Hirzebruch L-polynomials and the total L-class of a real vector bundle).

Proof

technique · direct; split the stable tangent bundle and apply the rank-two evaluation
1.1givenF1F2F3

Step [F3] gives a complex bundle isomorphism C‾⊕TCPn≅(γ∗)⊕(n+1). Since L is computed from Pontryagin classes and is therefore unchanged under bundle isomorphism, and since L is stable, L(TCPn)=L(TCPn⊕C‾)=L((γ∗)⊕(n+1)) in the completed ring of CPn.

1.2givenF2F4F5

The dual tautological bundle γ∗ is a complex line bundle with c1(γ∗)=y by [F4], so by [F5] its underlying oriented real bundle has Euler class y and the complex-line clause of [F2] gives L(γR∗)=Q(y)=y/tanh⁡y.

2.1step 1.1step 1.2F2

By multiplicativity in [F2], applied (n+1) times to the Whitney sum of copies of γR∗, L((γ∗)⊕(n+1))=L(γ∗) n+1=Q(y)n+1=(y/tanh⁡y)n+1.

3.1step 2.1F4F6algebra∎

Degree components: writing Q(y)n+1=(∑i≥0q2iy2i)n+1 and extracting coefficients first in the formal indeterminate y and then reducing modulo yn+1 by [F4], the degree-4j component is the multinomial sum cjy2j with cj=∑i1+⋯+in+1=jq2i1⋯q2in+1=[y2j]Q(y)n+1, because a product of n+1 factors of weights 4ia has weight 4j exactly when i1+⋯+in+1=j; the case j=1 gives c1=(n+1)q2, and components with 2j>n vanish by [F4] and the convention on Pontryagin classes. Hence L(TCPn)=Q(y)n+1 with the displayed components.

Depends on

Used by

Dependency tree · two levels

71 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