Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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 with cohomology written first

Definition

Let X be a space and R a commutative unital ring. For p,n0, φCp(X;R), and a singular n-simplex σ, define φσ={φ(σ[0,,p])σ[p,,n],np,0,n<p. Extend R-bilinearly in φ and the finite chains of Singular simplices and singular chain groups with coefficients. An R-linear cochain is a function on simplex generators; each value multiplies one specified back-face generator. Thus the formula is well-defined on finite formal chains and is R-balanced in its two inputs. It gives Cp(X;R)RCn(X;R)Cnp(X;R), with negative chain groups zero. This is the cap product with cohomology first: evaluate on the front face and retain the back face.

The face convention is the same as Singular cup product on cochains. In terms of its Alexander–Whitney diagonal DX, cap is the bidegree-(p,np) part of DX, followed by evaluation of the first factor by φ. There is no additional sign in this evaluation. Subsequent boundary and projection identities use this order.

For p=0, this multiplies a simplex by the value of φ at its first vertex; in particular the constant value-one cochain acts as the identity on chains. For p=n, it returns φ(σ) times the last vertex, a degree-zero chain, whose boundary is zero. For p>n it is zero by definition. On a degenerate simplex the same face formula applies; unnormalized chains retain these generators. Empty X, zero inputs and the zero ring give zero maps. The construction also applies to the higher singular simplices of a point and requires no AC.

Depends on

Used by

Dependency tree · two levels

10 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