Alphabeta Math
DefinitionDefinition: AI-adaptedProof: 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 completed cohomology ring in degrees divisible by four

Definition

Let B be a space (a topological space; no finite-dimensionality or CW assumption is made). The completed fourfold-graded cohomology group of B with rational coefficients is the product H^4∗(B;Q):=∏j≥0H4j(B;Q), the set of all sequences a=(a0,a1,a2,… ) with aj∈H4j(B;Q) (Singular cohomology ring). Addition is componentwise, (a+b)j:=aj+bj, and multiplication is the convolution of the graded cup product, (a⋅b)n:=∑i+j=nai⌣bj.

The product is well defined: for fixed n the sum has exactly n+1 terms, so no infinite sum occurs in any component, and each ai⌣bj lies in H4n(B;Q) because cup product adds degrees. The unit is 1:=(1,0,0,… ), with 1∈H0(B;Q) the unit of Singular cohomology ring. For a continuous map f:B→C the pullback is f∗:H^4∗(C;Q)→H^4∗(B;Q),f∗(a)j:=f∗(aj), the componentwise pullback of the ordinary cohomology rings.

The ring laws and the naturality assertions are not part of this definition: they are proved in The completed fourfold-graded cohomology ring is natural and satisfies the ring laws ↗, the lemma named in justified_by. The construction is a product of abelian groups and a prescribed formula; nothing is selected, so no choice principle is used.

Depends on

Used by

Dependency tree · two levels

3 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