Alphabeta Math
TheoremStatement: Literature-sourcedProof: Literature-sourcedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

Cup-i coboundary identity

Statement

For mod-two cochains a∈Cp(X) and b∈Cq(X) and every integer i,

δ(a⌣ib)=δa⌣ib+a⌣iδb+a⌣i−1b+b⌣i−1a,

where ⌣j=0 for j<0. The same identity holds in either relative variant of the cup-i product.

Facts & Assumptions

Given: A fixed natural higher-diagonal system and cochains a,b of the displayed degrees.

[F1]

Cup-i is evaluation of a⊗b on Di, and negative indices are zero (Higher cup-i products).

[F2]

The higher diagonals satisfy dDi+Did=(1+T)Di−1, with T interchanging the two tensor factors (Natural higher diagonal approximations).

Proof

technique · evaluate the chain identity
1.1givenF1

If i<0, every cup product in the asserted formula has negative index, so [F1] makes both sides zero. Hence assume i≥0 and evaluate the left side on a chain c of degree p+q−i+1. By the cochain-coboundary convention,

δ(a⌣ib)(c)=(a⊗b)Di(dc).

2.1F2step 1.1

Substitute the higher-diagonal recurrence. Over F2 it gives

(a⊗b)Di(dc)=(a⊗b)dDi(c)+(a⊗b)(1+T)Di−1(c).

3.1F1step 2.1∎

Expand the two terms. The tensor coboundary has no surviving signs over F2, so its first term is (δa⌣ib+a⌣iδb)(c). Since (a⊗b)T=b⊗a, the second is (a⌣i−1b+b⌣i−1a)(c). This proves the identity on every chain. The carrier property keeps every term relative when either input is relative. For i=0, both negative-index terms are zero and the formula reduces to the ordinary cup-product Leibniz identity.

Depends on

Dependency tree · 2 levels

Sources