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.

Products of complex projective spaces are linearly independent in rational oriented bordism

Statement

Assume AC (The Axiom of Choice), inherited from the characteristic-number and projective-space suppliers. Let k≥1 and let PJ=CP2j1×⋯×CP2jr range over the products of complex projective spaces indexed by the partitions J of k. Then the classes [PJ] are linearly independent in the rational oriented bordism group Ω4kSO⊗Q; equivalently, if ∑JcJ[PJ]=0 with cJ∈Q then all cJ=0. Consequently dim⁡Q(Ω4kSO⊗Q) ≥ p(k), the number of partitions of k.

Facts & Assumptions

Given: An integer k≥1, the partitions J of k, the classes [PJ]∈Ω4kSO of the projective-space products with their product complex orientations, and rational coefficients cJ.

[F1]

Characteristic numbers are cobordism invariants: oriented-cobordant closed oriented 4k-manifolds have equal Pontryagin numbers, so for each partition I of k the Pontryagin number is a well-defined function on the oriented bordism classes of Unoriented and oriented bordism groups.

[F2]

Pontryagin numbers of a closed oriented manifold defines the number componentwise over the connected components, so pI[M⊔N]=pI[M]+pI[N]; the group operation on Ω4kSO is [M]+[N]=[M⊔N] and the classes of products are the well-defined products in Cartesian product makes bordism a graded ring (Unoriented and oriented bordism groups). Hence pI is additive for the group operation, pI([M]+[N])=pI[M]+pI[N].

[F3]

Products of complex projective spaces have an invertible Pontryagin-number matrix: the ordinary Pontryagin-number matrix AI,J=⟨pI(TPJ),[PJ]⟩, with rows and columns indexed by the partitions of k, is invertible over Q; Characteristic numbers of products satisfy the Whitney-sum and Kunneth product formulas identifies the numbers of the products with the evaluations used in that matrix.

Proof

1.1F1F2

Each Pontryagin number is additive. By [F1], pI is constant on oriented cobordism classes, hence well defined on Ω4kSO; by the componentwise definition and the disjoint-union group law [F2], pI[M⊔N]=pI[M]+pI[N] for closed oriented 4k-manifolds, so pI:Ω4kSO→Z is a group homomorphism. Extending scalars, (z⊗q)↦q pI[z] is Z-balanced and Q-bilinear, hence induces a linear functional pI⊗Q:Ω4kSO⊗Q→Q; the balancing relation pI[nz⊗q]=nq pI[z]=pI[z⊗nq] holds by the definition of the tensor product.

2.1F2F3step 1.1

Suppose ∑JcJ[PJ]=0 in Ω4kSO⊗Q. Applying the functional pI⊗Q for every partition I of k and using additivity [F2] gives ∑JAI,JcJ=0 for every I, that is, the matrix equation A c=0 with AI,J=⟨pI(TPJ),[PJ]⟩ as in [F3].

3.1F3step 2.1

By [F3] the matrix A is invertible over Q, so Ac=0 forces c=0: all coefficients vanish and the classes [PJ] are linearly independent in Ω4kSO⊗Q. A linearly independent family of p(k) vectors in a vector space gives the lower bound dim⁡Q(Ω4kSO⊗Q)≥p(k).

4.1F3step 3.1∎

Boundary and convention remarks. For k=0, Zero-dimensional bordism groups gives the positive point generator; there is one partition, the empty one, with P∅ a point, Ω0SO⊗Q≅Q on the positive point class, and p(k)=1; the lower bound is still correct and no independence beyond a nonzero class is claimed, but the statement is formulated for k≥1 where the products have positive dimension. The argument gives only a lower bound: it neither produces a rational Hurewicz theorem nor any spanning family, and no upper bound on Ω4kSO⊗Q is asserted. The number p(k) counts the partitions of k, and the index set of [F3] is exactly that finite set. No choice beyond the cited suppliers is used.

Depends on

Used by

Dependency tree · two levels

74 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