Alphabeta Math
DefinitionDefinition: 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 Hirzebruch L-polynomials and the total L-class of a real vector bundle

Definition

Work over Q with the series Q(x)=x/tanh⁡x=∑j≥0q2jx2j of The formal hyperbolic tangent series and the even series x/tanh⁡x, so that q0=1 and, as recorded and justified in that definition, q2=1/3 and q4=−1/45. Give the i-th polynomial variable weight 4i.

The L-polynomials. For each k≥0 let Lk∈Q[p1,p2,p3,… ] denote the polynomial, homogeneous of weight 4k, characterized by the following condition: for every N≥1 and all indeterminates x1,…,xN, with ej the elementary symmetric polynomials (The elementary symmetric polynomials e0,e1,…,en, Symmetric polynomials as the invariants of variable permutations), Lk(e1(x12,…,xN2),…,ek(x12,…,xN2))=[weight 4k]∏i=1NQ(xi). Here [weight 4k] selects the homogeneous component of weight 4k.

Existence and uniqueness. Give each xi weight 2 and put ui=xi2, of weight 4. For N≥max⁡(1,k), the weight-4k component of ∏iQ(xi) is a symmetric polynomial of ordinary degree k in the ui. The fundamental theorem of symmetric polynomials (Fundamental theorem of symmetric polynomials: unique expression as a polynomial in e1,…,en) expresses it uniquely in e1(u),…,eN(u). Since ej has ordinary degree j, uniqueness of homogeneous components makes this expression homogeneous of weighted degree k and excludes every ej with j>k. Define Lk using N=max⁡(1,k). Setting additional roots to zero leaves the product unchanged because Q(0)=1; injectivity of substitution in at least k variables shows that the same polynomial works for every larger N. Setting roots to zero then gives the identity for N<k too, where ej=0 for j>N; injectivity is asserted only when N≥k. In particular L0=1. For two variables the weight-4 part of Q(x1)Q(x2) is q2(x12+x22)=q2e1, and its weight-8 part is q4(x14+x24)+q22x12x22, which the identities x14+x24=e12−2e2 and x12x22=e2 rewrite as q4(e12−2e2)+q22e2; substituting q2=1/3, q4=−1/45 and the corresponding powers of p1,p2 gives L1=p13,L2=7p2−p1245.

The total L-class. Assume AC (The Axiom of Choice), inherited from the Pontryagin and Chern constructions, including their bundle and Thom suppliers; no claim is made that DC alone supplies those constructions. For a real vector bundle E→B of finite rank over a CW-type base with Pontryagin classes pi(E)∈H4i(B;Z) of Pontryagin classes by complexification, regarded in rational cohomology, the total L-class is the element L(E):=(Lk(p1(E),…,pk(E)))k≥0∈H^4∗(B;Q) of the completed ring of The completed cohomology ring in degrees divisible by four; its degree-4k component is written Lk(E):=Lk(p1(E),…,pk(E)). The sequence is well defined because each Lk(p1(E),…,pk(E)) is a class in H4k(B;Q) computed from the given Pontryagin classes, and pi(E)=0 whenever 2i>rank⁡E (Naturality, stability, and mod-two reduction of Pontryagin classes), and if B has a finite-dimensional CW model, its cohomology vanishes above that dimension, so only finitely many components are nonzero. The coefficients q2j belong to Q, so no integrality of L(E) is asserted; see Formal power series over a commutative ring and the coefficient-extraction functional [xn] for the coefficient notation. Naturality, stability and multiplicativity of L are not part of this definition; they are proved in the lemma named in justified_by.

Depends on

Used by

Dependency tree · two levels

40 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