Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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.

Field cohomology of an infinite wedge of circles

Example

Assume AC. Let X=⋁j≥1Sj1 have the CW weak topology, with all circle vertices identified. For every field k, H0(X;k)=k,H1(X;k)≅∏j≥1k,Hn(X;k)=0(n>1), whereas H1(X;k)≅⨁j≥1k. The cohomology group is the full product, not a finite-support subgroup. For k=F2 the product and direct sum are not even isomorphic as sets.

Facts & Assumptions

[F1]

Cellular boundary is the incidence degree matrix gives endpoint differences for oriented edges. Cellular homology computes singular homology applies to arbitrary CW complexes and every coefficient group, using direct-sum cellular chain groups.

[F2]

Under The Axiom of Choice, Cohomology over a field is dual to homology over that field identifies cohomology with the unrestricted linear dual of homology.

Proof

Given: The indicated CW wedge X and a field k, assuming AC.

1.1F1given

This CW structure has one zero-cell v, one oriented one-cell ej for each j≥1, and no higher cells. Every edge has terminal and initial endpoint v, so its cellular boundary is v−v=0 by [F1]. With coefficients in k the same endpoint calculation gives C0cell=k, C1cell=⨁j≥1kej and zero differential. Thus its homology is k in degree zero, the displayed direct sum in degree one, and zero in higher degrees. The arbitrary-CW comparison of [F1] transfers these actual groups to singular homology. The prescribed weak topology is essential to that CW application.

2.1F2step 1.1

For each sequence a=(aj)∈∏j≥1k, define λa(∑jcjej)=∑jcjaj. Every input sum has finite support, so this is a well-defined linear functional with no restriction on the support of a. Conversely a linear functional λ is determined by the sequence aj=λ(ej); linearity gives λ=λa. These maps are inverse and linear. Applying [F2] and step 1.1 yields the claimed H1 product. The dual of k is k by evaluation at 1, and the dual of zero is zero, giving the degree-zero and higher-degree cohomology groups.

3.1step 2.1

For k=F2, a finite-support sequence c maps injectively to the nonnegative integer ∑j≥1cj2j−1 by uniqueness of binary expansion, and every such integer comes from its finite binary expansion. Thus the direct sum is countable. The full product cannot be enumerated as a(1),a(2),…: the sequence bj=1−aj(j) differs from the jth proposed sequence at coordinate j. It is therefore uncountable and cannot be isomorphic to the direct sum. The all-one sequence also explicitly represents a functional outside the canonical finite-support subgroup: it sends every ej to 1.

4.1F1F2step 1.1step 2.1step 3.1∎

The zero sequence corresponds to the zero functional; a sequence supported at one coordinate is evaluation of that coordinate. The single vertex gives H0=k even though there are infinitely many edges. There is no degree-two cell, so no unmentioned differential changes the degree-one direct sum. The diagonal argument in step 3.1 uses the explicitly given enumeration indices and requires no choices; AC is inherited from field duality in [F2] and is also available for the arbitrary-CW comparison's compactness argument. This is the CW wedge, whose topology is not being replaced by a shrinking-circle subspace topology.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

17 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