Alphabeta Math
LemmaStatement: 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.

The additive singular cohomology cross product is well-defined

Statement

Over a commutative unital ring R, the additive singular cohomology cross product is well-defined on both cocycle classes, independent of the chain homotopy inverse to shuffle, R-bilinear and natural in both spaces. With positive coboundary, its tensor functional satisfies δJ(φ,ψ)=J(δφ,ψ)+(−1)pJ(φ,δψ)(∣φ∣=p). No AC is required.

Facts & Assumptions

[F1]

Additive singular cohomology cross product specifies J and the quotient product via a shuffle inverse T.

[F2]

Singular product chain equivalence by simplex models gives natural maps S,T and homotopies ST≃1, TS≃1, with tensor differential d(x⊗y)=dx⊗y+(−1)∣x∣x⊗dy.

[F3]

Singular cochain complex with coefficients uses δφ=φd; Singular cohomology with coefficients identifies representatives modulo coboundaries.

Proof

Given: R,X,Y, homogeneous cochains φ,ψ of degrees p,q≥0, and the maps in [F1]–[F3]. Put F=C(X;R)⊗RC(Y;R) and D=C(X×Y;R).

1.1F1F2F3given

On a tensor of bidegree (p+1,q), J(φ,ψ)d has only the term φ(dx)ψ(y)=J(δφ,ψ)(x⊗y). On bidegree (p,q+1), only (−1)pφ(x)ψ(dy) remains, equal to (−1)pJ(φ,δψ)(x⊗y). On every other bidegree of total degree p+q+1, all terms vanish by the support definition of J. Homogeneous tensors generate the total complex, proving the asserted identity. In particular J(φ,ψ) is closed when both inputs are closed; its composite with T is closed because T is a chain map.

2.1F1F2F3step 1.1

If φ changes to φ+δu with ∣u∣=p−1 while ψ is closed, step 1.1 gives J(δu,ψ)=δJ(u,ψ). After composing with T the change is δ(J(u,ψ)T). If ψ changes by δv while φ is closed, step 1.1 gives J(φ,δv)=(−1)pδJ(φ,v), yielding the coboundary δ((−1)pJ(φ,v)T). A changed cocycle is still closed because δ2=0, so applying the two calculations successively handles simultaneous changes. When an input degree is zero, its negative-degree cochain is zero and the corresponding change is absent. This proves descent through both cohomology quotients.

2.2F1F2F3step 1.1

Let T′:D→F be another chain homotopy inverse of S. Choose the supplied homotopies dL+Ld=1D−ST and dP+Pd=T′S−1F (negating a homotopy if needed). Then K=T′L+PT has dK+Kd=T′(1−ST)+(T′S−1)T=T′−T, using the chain-map identities. For a closed functional χ=J(φ,ψ), χ(T′−T)=χdK+χKd=δ(χK) since χd=0. Thus both inverse choices give the same class. In total degree zero, the potential primitive has negative degree and is zero; the same identity gives equality directly.

3.1F1F2F3step 2.1step 2.2

On cochains, J is additive and R-linear in each variable by its evaluation formula and commutativity of R. Precomposition with T is linear, so step 2.1 descends this bilinearity to cohomology and hence to the tensor product of cohomology modules. For maps f:X′→X and g:Y′→Y, naturality of the specified T gives TX,Y(f×g)#=(f#⊗g#)TX′,Y′. Evaluation on homogeneous tensors gives J(φ,ψ)(f#⊗g#)=J(φf#,ψg#). Combining these equalities and passing to classes proves (f×g)∗(α×β)=f∗α×g∗β. Independence in step 2.2 makes this naturality independent of the particular inverse used to express the classes.

4.1F1F2F3step 1.1step 2.1step 2.2step 3.1∎

If either factor space is empty or either cochain class is zero, the product is zero by step 2.1 and bilinearity; the zero ring likewise gives zero modules. At p=q=0, T is the inverse vertex-pair identification, so the product value is φ(x)ψ(y) and the two unit values on points multiply to 1. Steps 1.1 and 2.1 separately cover p=0 or q=0, with no missing negative cochains. All chosen homotopies in step 2.2 are supplied as part of the inverse data, and the canonical inverse in [F2] is explicit, so no family of arbitrary choices or AC is used.

Depends on

Dependency tree · 2 levels

Sources