Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 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 naturality and projection formula

Statement

For continuous f:X→Y, α∈Hp(Y;R) and x∈Hn(X;R), f∗(f∗α∩x)=α∩f∗x. For α∈Hp(X;R), β∈Hq(X;R) and x∈Hn(X;R), (α⌣β)∩x=β∩(α∩x). Here R is commutative unital and cap evaluates the front face, retaining the back face. Both identities hold already on cochains and chains. No AC is needed.

Facts & Assumptions

[F1]

Cap product boundary identity proves that the front-evaluation/back-retention cap descends to cohomology and homology, including zero output degrees.

[F2]

Singular cup product on cochains supplies the front/back evaluation formula. Cup product is natural, unital and associative supplies its descent to cohomology together with naturality, the unit, and associativity.

Proof

Given: Cochain representatives a,b of degrees p,q and a singular n-simplex σ. For the first identity a is on Y; for the second both are on X.

1.1F1given

If n≥p, the left side of the first chain identity is f#(a(fσ[0,…,p])σ[p,…,n]), equal to a(fσ[0,…,p])(fσ)[p,…,n]. This is exactly a∩f#σ, since postcomposition commutes with face restriction. If n<p, both sides are zero. Linearity gives the chain identity for every chain.

1.2F1F2given

If n≥p+q, evaluating the left side of the second identity yields a(σ[0,…,p])b(σ[p,…,p+q])σ[p+q,…,n]. Capping first by a leaves the chain a(σ[0,…,p])σ[p,…,n]; capping by b gives the same scalar and back face by R-linearity. If n<p, the inner cap on the right is zero; if p≤n<p+q, its remaining degree n−p is less than q, so the outer cap is zero. In both cases the left side also vanishes. Thus the equality holds on every simplex and extends bilinearly.

2.1F1F2step 1.1step 1.2∎

For cocycles and cycles, [F1] and [F2] make every operation in steps 1.1–1.2 well-defined on the corresponding quotient classes. Passing the chain identities to classes proves the formulas. The case p=0 is initial-vertex multiplication; the case p+q=n retains the last vertex with no sign, and zero degrees in either factor need no alteration. Empty spaces, zero inputs/ring, point spaces and degenerate simplices use the same formulas. All maps and products are explicit, without AC.

Depends on

Dependency tree · 2 levels

Sources