Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-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.

Chern classes of a sum of universal complex lines

Example

Assume AC and let n0 be an integer. On (CP)n let Li be the pullback of the universal complex line along the i-th projection, let xi=c1(Li)H2((CP)n;Z), and let E=L1Ln. Then c(E)=i=1n(1+xi),ck(E)=ek(x1,,xn), the k-th elementary symmetric polynomial for k0, with e0=1, in H((CP)n;Z)=Z[x1,,xn].

Facts & Assumptions

Given: AC, the projections pi:(CP)nCP and the pulled-back universal lines Li=piγ.

[A1]

The Axiom of Choice is assumed, exactly as inherited from the Chern-class and Kunneth suppliers (The Axiom of Choice).

[F1]

Chern classes are natural and multiplicative over Whitney sums, and on a line c(L)=1+c1(L) (Naturality, normalization, and Whitney sum for Chern classes).

[F2]

H(CP;Z)=Z[u] where u=e(γR), with free finitely generated homology in each degree, and the Kunneth cross product is a ring isomorphism for products of such spaces over a PID (Cohomology ring of infinite complex projective space, Cohomological Kunneth cross product is a ring isomorphism).

[F3]

Direct sums of complex line bundles are formed fiberwise and are compatible with pullback (Whitney sum, tensor, dual, Hom, and exterior-power bundles).

[F4]

The product of the standard circle classifying bundles models BTn=(CP)n, with the coordinate universal lines (The universal complex flag bundle is BT-n).

[F5]

The Schubert structures make CP a countable CW complex, with one cell in each even dimension: for rank one the symbols are the integers a11 with cell dimension 2(a11) (Schubert cells give the stable Grassmannian CW structure, Schubert cells in real and complex Grassmannians).

Verification

technique · direct
1.1

The ordinary finite product base is a path-connected CW complex. To verify the topology qualification, exhaust two countable CW factors by increasing finite subcomplexes Xj,Yj. Their product cells have finite closures. If W is open in the product cell topology and (a,b)W, choose compact product neighborhoods K1×M1W in the first finite stages containing the point. Given Kj×MjW, compactness of Mj gives for each xKj compact neighborhoods Kx of x and Mx of Mj in the next finite stages with Kx×MxW. A finite collection of the interiors of Kx covers Kj; take their union for Kj+1 and the intersection of the corresponding Mx for Mj+1. The unions of the relative interiors of Kj and Mj are open in the weak CW topologies: on each finite stage their tails are an increasing union of open sets. Their product lies in W. Thus the ordinary product and cell topologies agree. Product characteristic maps give the CW structure (a product of two disks is a disk with its product boundary), and the resulting product still has countably many cells. Induction proves the assertion using [F5]. Path connectivity follows coordinatewise.

F5
2.1

For n1, step 1.1 supplies the CW base. The coordinate universal circle bundles of [F4] are numerable; their associated complex lines and their pullbacks are numerable by pulling back the same local partitions. Thus the hypotheses of [F1] hold; a finite sum remains numerable by multiplying the finitely many local partition functions. Each Li is a complex line bundle and E=iLi by [F3]; by multiplicativity and line normalization [F1], c(E)=ic(Li)=i(1+xi).

F1F3F4step 1.1given
3.1

Each xi has cohomological degree two, so the degree-2k component of the product is ck(E)=1i1<<iknxi1xik=ek(x1,,xn). The empty product for k=0 is 1 and the empty sum for k>n is 0. Equivalently these are the coefficients of zk in the formal polynomial i(1+xiz); polynomial degree in z is distinct from cohomological degree.

step 2.1algebra
4.1

By naturality and line normalization in [F1], xi=piu, for the specific generator u=e(γR) of [F2]. Apply the Kunneth ring isomorphism repeatedly, taking one new CP factor each time: that factor has finite free integral homology in every degree, which suffices for the supplier even though the full cohomology is not finitely generated. The cross product sends its coordinate generators to the piu=xi. Every generator has even degree, so all graded tensor signs are +1. This identifies the ring with Z[x1,,xn], with no relations among the xi.

F1F2step 3.1
5.1

Boundary cases. For n=0 the base is a point, E is the rank-zero bundle, the empty product is 1, and the ring is Z with no variables; [F1] gives exactly these Chern conventions. For n=1 the product is 1+x1 and E=L1; for k>n the elementary symmetric polynomial ek vanishes, matching the rank cutoff. If a line is replaced by a trivial summand, its first class is zero and its factor is 1 by [F1]; this is a specialization, not a claim that one of the given universal coordinate lines is trivial. The coefficient ring Z is nonzero and the product is finite, so no convergence question arises. AC is used only through [A1].

A1F1step 3.1

Source notes

This is the elementary-symmetric computation of Miller's Lecture 35: the Chern classes of a sum of lines are the elementary symmetric functions of the line classes, which is also the mechanism behind H(BU(n);Z)=Z[c1,,cn].

The ordinary product topology in step 1.1 agrees with the product CW topology because each factor has countably many cells; see Hatcher, Algebraic Topology, Appendix Theorem A.6, printed p.524: https://pi.math.cornell.edu/~hatcher/AT/AT.pdf .

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

48 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