Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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 Kronecker pairing is multiplicative under cross products

Statement

Let X,Y be spaces, R a commutative unital ring, p,q≥0, α∈Hp(X;R), β∈Hq(Y;R), c∈Hp(X;R) and d∈Hq(Y;R). Then ⟨α×β,c×d⟩=⟨α,c⟩⟨β,d⟩∈R. The same identity holds for c∈Hp(X;Z) and d∈Hq(Y;Z), using coefficient extension for the homology inputs. If c and d instead have degrees m,n with m+n=p+q, the left side is zero unless (m,n)=(p,q). Pairings in unequal total degrees are not asserted. Both the additive shuffle convention and the external cup-product convention of the cohomology cross product give this identity. No AC is required.

Facts & Assumptions

Given: Spaces X,Y, a commutative unital ring R, cocycles φ,ψ of degrees p,q, and cycles z,w over R of degrees m,n with m+n=p+q. In the multiplicative identity take m=p,n=q. Integral input cycles are extended along Z→R.

[F1]

Kronecker evaluation pairing and The kronecker pairing is independent of cocycle and cycle representatives define ⟨[φ],[c]⟩=φ(c) by evaluation and prove it independent of both representatives and biadditive over R.

[F2]

Additive singular cohomology cross product represents α×β by the composite J(φ,ψ)T, where J(φ,ψ)(x⊗y)=φ(x)ψ(y) for ∣x∣=p,∣y∣=q and vanishes on the other bidegrees of total degree p+q, and T:C(X×Y;R)→C(X;R)⊗RC(Y;R) is a natural chain homotopy inverse of the shuffle S. By The additive singular cohomology cross product is well-defined the functional satisfies δJ(φ,ψ)=J(δφ,ψ)+(−1)pJ(φ,δψ), so it is a cocycle when φ,ψ are cocycles, the composite with the chain map T defines a class, and the product is R-bilinear and natural.

[F3]

The singular chain cross product on generators gives the shuffle expansion of the chain cross product S(c⊗d)=c×d, and The singular chain cross product satisfies the boundary formula gives ∂(a×b)=∂a×b+(−1)ia×∂b for a∈Ci, so a cross product of cycles is a cycle and S is a chain map. Singular chain cross products are natural makes it natural. These integral chain identities extend R-bilinearly by scalar extension.

[F4]

The homology cross product for tensor complexes and The Kunneth cross-product map is well defined and natural make [x]×[y]=[x⊗y] well defined and natural on homology. For cycles z∈Cm(X;R) and w∈Cn(Y;R), the singular class [z]×[w] is represented by S(z⊗w)∈Cm+n(X×Y;R).

[F5]

Singular product chain equivalence by simplex models supplies, for the shuffle S, its natural inverse T and natural homotopies ST≃1 and TS≃1; in particular there is a natural chain homotopy K with dK+Kd=TS−1 on C(X;R)⊗RC(Y;R).

[F6]

Cohomological Kunneth cross product is a ring isomorphism uses the external product a×b=pr⁡X∗a⌣pr⁡Y∗b. Singular cup product on cochains gives its front/back cochain formula, and Alexander--Whitney and shuffle are natural chain-homotopy inverses supplies the Alexander-Whitney map A and a natural homotopy A−T=dH+Hd with the shuffle inverse of [F2], without AC.

Proof

1.1givenF2F3F4F5

By [F2] the class α×β is represented by the cocycle J(φ,ψ)T, and by [F4] the class c×d is represented by the cycle S(z⊗w), which is a cycle because S(z⊗w) has boundary ∂z×w+(−1)mz×∂w=0 by [F3]. The shuffle equivalence [F5] supplies the inverse T and a homotopy K with dK+Kd=TS−1 on the tensor complex, so the pairing can be computed on these representatives.

2.1F2F5step 1.1

Evaluation gives (JT)(S(z⊗w))=J(TS(z⊗w)). Since z⊗w is a cycle, TS(z⊗w)−z⊗w=dK(z⊗w). The cocycle J=J(φ,ψ) annihilates this boundary by [F2], so the value is J(z⊗w). This equals φ(z)ψ(w) when (m,n)=(p,q), and is zero for every other bidegree with m+n=p+q, by the defining bidegree support of J.

3.1F1F2F6step 2.1∎

For (m,n)=(p,q), [F1] identifies these values with the two Kronecker pairings, proving the identity. Representative independence follows from [F1, F2]. The front/back formula in [F6] identifies JA with pr⁡X∗φ⌣pr⁡Y∗ψ: only the (p,q) cut survives. Since Jd=0, its difference from JT is J(A−T)=JHd=δ(JH), so these cochains represent the same class. This comparison uses no additive Kunneth bijectivity. Extension of integral cycles to R commutes with shuffle and evaluation, proving the integral-input version. This includes degree zero, empty spaces and the zero ring.

Depends on

Used by

Dependency tree · two levels

35 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