Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generated
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.

Degreewise mod-two cohomology of the universal real Thom prespectrum

Definition

Assume AC, inherited from the shared bundle and Thom construction. Use the real levels Tr=Th⁡(γr) and first-coordinate structure maps αr:S1∧Tr→Tr+1 of the shared Thom prespectrum. For q∈Z put Ar(q)=H~r+q(Tr;F2) and define the backwards bonding map

ρr(q)=σ−1αr∗:Ar+1(q)⟶Ar(q),

where σ is reduced cohomology suspension with the sphere coordinate first. Define

H^q(TO;F2)={(xr)r≥0∈∏r≥0Ar(q):ρr(q)xr+1=xr for every r},H^∗(TO;F2)=⨁q∈ZH^q(TO;F2).

The conditions are linear, so this is a well-defined vector space with componentwise operations. It is an inverse-limit prespectrum invariant; identifying it with represented spectrum cohomology would require a separate comparison theorem.

The normalized Thom isomorphisms give Ar(q)≅Hq(BO(r);F2), with ur the normalized rank-r Thom class. The bonding-map computation and eventual constancy are proved in Stable universal Thom cohomology is eventually constant in every degree ↗: all terms vanish for q<0, and for q≥0 projection to any rank r≥q identifies the compatible tuples with the weight-q polynomial Thom module. In particular, writing U=(ur),

H^∗(TO;F2)≅F2[w1,w2,…]U,∣wi∣=i,∣U∣=0.

This is a graded vector-space and characteristic-polynomial-module identification, justified by that lemma. It gives no ring structure from reduced finite-level cup products. Each weight is finite-dimensional.

Depends on

Used by

Dependency tree · two levels

52 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