Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

Cohomological Kunneth isomorphism under finite free hypotheses

Statement

Assume AC. Let R be a commutative PID and X,Y spaces such that every Hq(Y;R) is a finite free R-module. For every n≥0 the additive singular cohomology cross product gives an isomorphism ⨁p+q=nHp(X;R)⊗RHq(Y;R)→ ∼ Hn(X×Y;R). All indices are nonnegative. The symmetric assertion holds when every Hp(X;R) is finite free instead. No bound on the number of nonzero homology degrees and no finite-rank hypothesis on the singular chain groups is required.

Facts & Assumptions

[F1]

A free PID complex decomposes into two-term cycle-boundary pieces supplies free cycles/boundaries and sections sj:Bj−1→Cj under The Axiom of Choice. Free modules are projective, with the exact choice boundary supplies sections of surjections onto free homology modules.

[F2]

Additive singular cohomology cross product and The additive singular cohomology cross product is well-defined specify the natural product by tensor evaluation J followed by a shuffle inverse, with positive coboundary.

[F3]

Singular product chain equivalence by simplex models gives that shuffle equivalence and its homotopies over R.

[F4]

Singular cochain complex with coefficients identifies singular cochains with R-linear Hom on free coefficient chains and gives the positive differential.

Proof

Given: Write C=C(X;R), D=C(Y;R) and Vj=Hj(D). For the first assertion all Vj are finite free. Let V denote this graded module with zero differential. Assume AC.

1.1F1F4given

Choose the sections sj:Bj−1D→Dj from [F1] and put πj=1−sjdj:Dj→ZjD. Since Vj is free, choose a section ℓj:Vj→ZjD of the homology quotient qj:ZjD→Vj, using [F1]. AC permits these choices in every degree. Set ηj=qjπj and bj=πj−ℓjηj:Dj→BjD, where the last corestriction is valid because qjbj=0. We have ηℓ=1, dℓ=0 and ηd=0: a boundary is fixed by π and killed by q. Thus ℓ:V→D and η:D→V are chain maps.

1.2F4given

Fix q and choose a finite basis e1,…,em of Vq with coordinate duals ei∗. For every R-module U, the map Hom⁡(U,R)⊗Vq∗→Hom⁡(U⊗Vq,R) sends φ⊗λ to (u⊗v↦φ(u)λ(v)). An explicit inverse sends w to ∑i=1mφi⊗ei∗, where φi(u)=w(u⊗ei). Substitution using v=∑iei∗(v)ei proves one composite is identity. For the other, write λ=∑iλ(ei)ei∗ and use tensor bilinearity. Thus this is an isomorphism for arbitrary U, including infinitely generated U. It is its formula, not the chosen basis, that specifies the map. Finite rank is used in this finite inverse sum.

2.1F1step 1.1

Define hj=sj+1bj:Dj→Dj+1. Then dhj=bj, while bj−1dj=dj because dj lands in boundaries. Hence hj−1dj=sjdj and dh+hd=b+sd=1−ℓη. Also ηℓ=1 by step 1.1. This is an explicit chain deformation retraction of D onto V, not merely an isomorphism of its homology groups. The same calculation works at j=0 with negative terms zero.

2.2F4step 1.2

In degree n, Hom⁡((C⊗V)n,R) is the finite direct sum of Hom⁡(Cn−q⊗Vq,R) for 0≤q≤n. Since dV=0, the differential preserves q and is the positive C coboundary. Step 1.2 identifies each fixed-q complex with m copies of the C cochain complex shifted in degree by q. Kernels and images of maps on finitely many coordinates are taken coordinatewise, so its cohomology is Hn−q(X;R)⊗Vq∗. Taking the finite degree diagonal gives an isomorphism from ⨁p+q=nHp(X;R)⊗Vq∗ to Hn(Hom⁡(C⊗V,R)), represented by the evaluation functionals. The absence of a degree-(−1) coordinate at q=n agrees with the zero incoming coboundaries in C0.

3.1F3F4step 1.1step 2.1

Tensor with C: on a homogeneous tensor define H(c⊗y)=(−1)∣c∣c⊗hy. In dH+Hd, the two terms involving dc cancel, while the other two give c⊗(dh+hd)y. Thus 1⊗η and 1⊗ℓ are chain homotopy inverses between C⊗D and C⊗V. Precomposition with these maps gives cochain homotopy inverses on Hom into R: if u−v=dH+Hd, the operator K(ϕ)=ϕH in degree minus one obeys δK+Kδ=(u−v)∗. In particular no tensor exactness or Hom exactness is needed to preserve this specified homotopy equivalence. Combining with [F3], A=(1⊗η)T:D(X×Y)→C⊗V is a chain homotopy equivalence, so A∗ is a cohomology isomorphism.

3.2F4step 1.1step 2.1

On Hom⁡(D,R), Kϕ=ϕh gives δK+Kδ=1−(ℓη)∗ by step 2.1, while (ηℓ)∗=1. These identities identify Hq(Y;R) with Vq∗=Hom⁡R(Vq,R): a functional λ corresponds to the cohomology class [ληq], with inverse induced by ℓ. Since V has zero differential, its Hom cohomology is exactly its Hom graded module.

4.1F2step 3.1step 3.2step 2.2

Combine step 2.2 with A∗ of step 3.1 and replace Vq∗ by Hq(Y;R) using step 3.2. A representative φ⊗λ is carried to the class of the functional J(φ,λ)(1⊗η)T=J(φ,λη)T. By [F2] this is precisely [φ]×[λη]. Consequently the resulting isomorphism is the cross product in the statement, independent of every auxiliary basis and section used to prove it is bijective.

5.1F1F2F3F4step 1.1step 2.1step 3.1step 1.2step 2.2step 4.1

For the symmetric case, carry out steps 1.1 and 2.1 on C instead, obtaining a deformation retraction onto Up=Hp(C). Tensoring its homotopy with 1D has d(h⊗1)+(h⊗1)d=(1−ℓη)⊗1, with mixed terms cancelling. Thus reduce to Hom⁡(U⊗D,R). On the fixed-p summand its differential is (−1)p times the D coboundary. Multiplication by this unit changes neither kernels nor images. A finite basis of Up gives the analogue of step 1.2 with the finite free factor first, hence cohomology Up∗⊗Hq(Y;R). Its evaluation functional is J(λη,ψ)T, exactly the same ordered cross product by [F2]. This proves the symmetric assertion without assuming a symmetry theorem for that product.

6.1F1F2F3F4step 1.1step 2.1step 3.1step 3.2step 1.2step 2.2step 4.1step 5.1∎

Empty X or Y gives zero complexes. A zero-rank Vq contributes an empty basis and a zero summand in steps 1.2 and 2.2; rank one gives the evident identification with a single copy of C∗. At n=0, the only diagonal is (0,0) and all constructions retain the usual product of values at vertices. Although there may be infinitely many nonzero Vq, each total degree uses only finitely many, so no exchange of an infinite product with tensor is asserted. AC is used for the arbitrary-rank PID cycle/boundary sections and for simultaneous homology sections and finite bases across degrees; all dual and tensor calculations are explicit after those choices.

Depends on

Dependency tree · 2 levels

Sources