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

Relative cohomological Kunneth under finite free homology hypotheses

Statement

Assume AC. Let R be a commutative PID and (X,A),(Y,B) CW pairs with supplied characteristic maps. Suppose Hq(Y,B;R) is finite free over R for every q0. For every n0, relative external product gives an isomorphism p+q=nHp(X,A;R)RHq(Y,B;R)  Hn(X×Y,(A×Y)(X×B);R). The same conclusion holds instead when every Hp(X,A;R) is finite free. This is a hypothesis on relative homology, with no bound on the nonzero degrees and no finite-rank hypothesis on singular chain groups. Products use the ordinary topology. AC is used only for the algebraic sections and bases in the proof; the external product and its chain comparison require no choice.

Facts & Assumptions

[F1]

Relative singular product comparison for CW pairs gives a chain homotopy equivalence L:C(X×Y,(A×Y)(X×B);R)C(X,A;R)C(Y,B;R) through the AW quotient comparison. The relative external product is represented by J(φ,ψ)L, where J is tensor evaluation with no extra sign.

[F2]

A free PID complex decomposes into two-term cycle-boundary pieces supplies, under AC, free cycles and boundaries of an arbitrary-rank nonnegative free PID complex and sections of its boundary maps onto their images.

[F3]

Free modules are projective, with the exact choice boundary supplies a section of a surjection onto a free module by lifting its basis; a specified finite basis requires only finite choice.

[F4]

Relative singular cochain complex defines positive coboundaries and the relative singular-simplex basis. For coefficient ring R, extending an integer functional by R-linearity identifies these cochains with HomR(C(,;R),R): both are exactly arbitrary R-valued functions on the complementary simplex basis.

[F5]

The Axiom of Choice permits the arbitrary-rank PID choices and simultaneous sections and finite bases across all degrees.

Proof

Given: Put C=C(X,A;R), D=C(Y,B;R), Vj=Hj(D) and let V have zero differential. Both C and D are free in each nonnegative degree on the simplices not wholly in the subspace. Work first under the finite-free hypothesis on V.

1.1

For every j, choose sj:Bj1DDj with djsj=1 using [F2]. Set s0=0 and πj=1sjdj, which takes values in ZjD since djsjdj=dj. Let qj:ZjDVj be the homology quotient. By [F3], choose a section j:VjZjD of qj. Use [F5] for the simultaneous sections and for finite bases of all Vj. Define ηj=qjπj and bj=πjjηj. The image of bj lies in BjD because applying qj gives zero. Also η=1, d=0, and ηd=0: boundaries are fixed by π and killed by q. Thus :VD and η:DV are chain maps.

F2F3F5given
1.2

If Vq has finite basis e1,,em and dual coordinates ei, the evaluation map HomR(T,R)VqHomR(TVq,R) is an isomorphism for every R-module T. Its inverse takes w to i=1mw(ei)ei. For one composite, substitute v=iei(v)ei into w(tv); for the other substitute λ=iλ(ei)ei and use tensor bilinearity. Both substitutions give the identity. The finite sum is the exact use of finite rank, and T may have arbitrary rank or fail to be free.

given
2.1

Put hj=sj+1bj. Then dj+1hj=bj. Since dj lands in boundaries, πj1dj=dj and ηj1dj=0, so bj1dj=dj and hj1dj=sjdj. Therefore dh+hd=b+sd=1η,η=1. These are chain homotopy inverse identities, not only assertions about induced homology. They hold at degree zero with negative groups and maps set to zero.

step 1.1
2.2

In total degree n, HomR((CV)n,R) is the finite direct sum of HomR(CnqVq,R), 0qn. The differential preserves q because dV=0, and on each such complex it is the positive C coboundary. Apply step 1.2 to identify the fixed-q complex with m copies of HomR(C,R) shifted up by q. Its cycles and boundaries are determined coordinatewise, so its degree-n cohomology is Hnq(X,A;R)Vq. This also describes the image of each pure tensor: it is the class of its evaluation functional. For q=n the incoming degree-minus-one coordinate is zero, exactly as in relative H0. Summing along the finite diagonal proves p+q=nHp(X,A;R)VqHnHomR(CV,R).

F4step 1.2
3.1

On CD set H(cy)=(1)cch(y) for homogeneous c. Expanding its tensor differential, the dchy terms in dH+Hd have signs (1)c and (1)c1 and cancel. The remaining terms give c(dh+hd)y. Hence 1η and 1 are homotopy inverses between CD and CV. For any chain homotopy uv=dH+Hd, the cochain operator K(ϕ)=ϕH has degree minus one and satisfies δK+Kδ=(uv). This follows by evaluating on a chain: the two terms are ϕHd and ϕdH. Consequently these tensor homotopies and their duals need no exactness theorem for tensor or Hom.

F4step 1.1step 2.1
3.2

Applying the same dual computation to step 2.1 gives Hq(Y,B;R)Vq: λ represents [ληq], and the inverse is restriction along q. Indeed η=1 gives one inverse identity, and precomposition by h gives the other up to cochain homotopy. Since V has zero differential, its cohomology after Hom is exactly V.

F4step 1.1step 2.1
4.1

Compose L of [F1] with 1η. By step 3.1 this gives a chain homotopy equivalence from the product-pair chains to CV, and hence an isomorphism on dual cohomology. Combine it with step 2.2 and the identification in step 3.2. On representatives, φλ maps to [J(φ,λ)(1η)L]=[J(φ,λη)L]=[φ]×[λη], the actual relative external product by [F1]. Thus the isomorphism is the canonical product, independent of the bases and sections which proved its bijectivity. This identifies the map itself, rather than merely comparing abstract source and target modules.

F1step 2.2step 3.1step 3.2
5.1

Suppose instead Up=Hp(C) is finite free for every p. Apply the construction in steps 1.1 and 2.1 to C, obtaining ,η,h there. On CD use h1. The mixed terms in its homotopy identity have signs (1)c+1 and (1)c and cancel, yielding (1η)1. Reduce the dual complex to HomR(UD,R). For fixed p its differential is (1)p times the D coboundary, which has the same kernel and image because this sign is a unit. A finite basis ui of Up gives the inverse to evaluation by wiuiw(ui). The two substitutions in step 1.2 now give its inverse identities with the factors in this order. Taking finite degree diagonals and dualizing the deformation identifies its cohomology with p+q=nUpHq(Y,B;R). A representative maps through L to J(λη,ψ)L, the same ordered external product by [F1]. This proves the symmetric assertion with no appeal to commutativity of external product.

F1F4step 1.1step 1.2step 2.1step 2.2step 3.1step 4.1
6.1

Empty spaces or full subspaces make the corresponding relative complex zero and the displayed map the isomorphism between zero modules. Empty subspaces recover the absolute comparison for CW spaces. Rank zero in step 1.2 means the empty inverse sum; rank one gives one copy of the other complex. In degree zero the only summand is (p,q)=(0,0) and evaluation multiplies vertex values. Unnormalized degenerate simplices remain in the free chain bases; no finite-rank assertion about those bases occurs. Infinitely many nonzero Vq or Up cause no problem: every fixed total degree involves only finitely many, so no interchange of an infinite product with a tensor is used. A PID has 10; the zero-ring case is outside that hypothesis, though all the displayed groups would be zero. AC occurs in [F2]'s arbitrary-rank cycle/boundary freeness and sections and in step 1.1's simultaneous homology sections and finite bases; it is not invoked in [F1] or the product formula.

F1F2F5step 1.1step 1.2step 2.1step 2.2step 4.1step 5.1

Depends on

Used by

Dependency tree · two levels

21 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