Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-sol)audited 2026-09-27
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 Čech differential squares to zero

Statement

Let X be a topological space, F a sheaf of abelian groups on X and U=(Ui)i∈I an open cover indexed by a linearly ordered set I, with ordered Čech cochains Cp(U,F) as in Ordered Čech cochain complex of a cover. Then for every p∈Z δp+1∘δp=0, so that (C∙(U,F),δ∙) is a cochain complex.

Facts & Assumptions

[F1]

For s∈Cp(U,F) and an increasing (p+2)-tuple the differential is (δps)i0⋯ip+1=∑j=0p+1(−1)jsi0⋯ij^⋯ip+1∣Ui0∩⋯∩Uip+1, a sum of restrictions inside the single group F(Ui0∩⋯∩Uip+1) (Ordered Čech cochain complex of a cover).

[F2]

Restrictions of a section are compatible: for open W⊆V⊆U and s∈F(U) one has (s∣V)∣W=s∣W (Sections, restrictions, and global sections of a presheaf).

[F3]

An intersection factor over an empty intersection is the zero group F(∅)=0 (A set-valued sheaf has a unique section over the empty open set), so every cochain component indexed by an empty intersection is zero.

Proof

Given: A topological space X, a sheaf of abelian groups F, a linearly ordered open cover U, a degree p∈Z and a p-cochain s∈Cp(U,F).

1.1

First take p≥0. Fix an increasing (p+3)-tuple i0<⋯<ip+2, which indexes a component of Cp+2, the target of δp+1δp. If no such tuple exists, then Cp+2=0 and the identity is vacuous. If the full intersection is empty, its section group is zero by [F3]. Otherwise the component (δp+1δps)i0⋯ip+2 is computed in the single abelian group F(Ui0∩⋯∩Uip+2).

F1F3
1.2

Applying [F1] twice gives (δp+1δps)i0⋯ip+2=∑j=0p+2(−1)j(δps)i0⋯ij^⋯ip+2∣Ui0∩⋯∩Uip+2. Expanding each inner differential produces terms indexed by ordered pairs of distinct positions j,k∈{0,…,p+2}; each is the restriction of the p-cochain component si0⋯ij^⋯ik^⋯ip+2, whose tuple has p+1 indices. The coefficient for omitting ij first and then ik is (−1)j+k−1 when j<k, and (−1)j+k when j>k. Compatibility of restrictions [F2] places all terms in the section group of the full intersection.

F1F2step 1.1
2.1

For j<k, pair the term omitting ij then ik with the term omitting ik then ij. By [F2] these are restrictions of the same p-cochain component to the full intersection, while their coefficients (−1)j+k−1 and (−1)j+k sum to zero. Every ordered pair occurs in exactly one such pair. Thus every component of δp+1δps vanishes.

F1F2F3step 1.2
3.1

The tuple was arbitrary, so step 2.1 proves the identity for p≥0. For p<0, the convention Cp=0 and δp=0 makes the composite zero. Hence δp+1∘δp=0 in every degree, and the Čech cochains form a cochain complex.

step 2.1given∎

Depends on

Used by

Dependency tree · two levels

5 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