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

Cap product boundary identity

Statement

For φCp(X;R), cCn(X;R), p,n0, over a commutative unital ring, (φc)=(1)p(φcδφc). Consequently cap induces an R-bilinear map Hp(X;R)RHn(X;R)Hnp(X;R). Negative chain groups are zero, and no AC is assumed.

Facts & Assumptions

[F1]

Cap product with cohomology written first evaluates on the front face, retains the back face, and is zero for p>n.

[F2]

Singular cochain complex with coefficients gives δφ=φ with positive sign.

[F3]

The singular boundary operator gives the alternating face boundary and zero degree-zero boundary.

Proof

Given: X,R,p,n,φ,c as stated. By bilinearity it suffices first to check the identity on a simplex σ.

1.1

Assume n>p. In φσ, deleting vertex ip yields (1)iφ(σ[0,,i^,,p+1])σ[p+1,,n]; deleting i>p yields (1)iφ(σ[0,,p])σ[p,,i^,,n]. In δφσ, all terms are of the first form, now indexed by 0ip+1. Subtracting cancels the terms with ip and leaves φ(σ[0,,p])((1)pσ[p+1,,n]+i=p+1n(1)iσ[p,,i^,,n]). Multiplying by (1)p gives the alternating boundary of the retained back face, with its first face having sign +1 and subsequent signs (1)ip. This is (φσ).

F1F2F3given
2.1

If n=p, cap is a zero-chain with zero boundary; both terms on the right are zero by the degree convention. If n<p, all terms are zero for the same reason. Step 1.1 also covers p=0<n: its deleted-initial-vertex term cancels against the first term of δφ, and the surviving term is the ordinary back-face boundary. The case p=n=0 was covered by n=p. Linearity extends these calculations to all chains.

F1F2F3given
3.1

For a cocycle φ and cycle c the boundary identity gives (φc)=0. If the cycle changes by b, then φb=(1)p(φb) is a boundary. If the cocycle changes by δu, u=p1, then applying the identity to u,c gives δuc=(1)p(uc), again a boundary. For p=0 there is no u, since negative cochains are zero. Applying these two calculations successively covers changes in both variables; cycles and cocycles stay closed under these changes. Bilinearity descends and then factors through the tensor product.

F1F2step 1.1step 2.1
4.1

Empty spaces, zero chains/cochains and the zero ring give zero maps. Degenerate simplex restrictions satisfy the same face identities and cancellations. Point spaces retain higher unnormalized chains, to which step 1.1 applies unchanged. The endpoint cases and zero output degrees were treated in step 2.1. Every primitive in step 3.1 is an explicit cap of the supplied u or b; no arbitrary selection or AC occurs.

F1step 1.1step 2.1step 3.1

Depends on

Used by

Dependency tree · two levels

6 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