Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 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.

Refinement choices induce the same Čech map

Statement

Let X be a topological space, let F be a sheaf of abelian groups on X, and let U=(Ui)i∈I and V=(Vj)j∈J be open covers of X indexed by linearly ordered sets, with fixed-cover Čech cohomology Hˇ∙ (Fixed-cover Čech cohomology). Let c,c′:J→I be two refinement functions from V to U (Refinement map of ordered open covers) and let c♯,c′♯:C∙(U,F)→C∙(V,F) be the induced cochain maps. Then c♯ and c′♯ are chain-homotopic (A chain homotopy), and consequently they induce the same homomorphism Hˇp(U,F)⟶Hˇp(V,F) for every p.

Explicitly, the homotopy is the family of degree (−1) maps (hps)j0⋯jp−1:=∑a=0p−1(−1)a sc(j0)⋯c(ja) c′(ja)⋯c′(jp−1)∣Vj0∩⋯∩Vjp−1 for p≥1, and h0:=0, where s is evaluated at the displayed tuple of p+1 U-indices in the alternating model (Ordered and alternating Čech complexes agree); it satisfies δV∘hp+hp+1∘δU=c′♯−c♯ as maps Cp(U,F)→Cp(V,F), for every p≥0. In particular the refinement maps on cohomology do not depend on the choice of the refinement function.

Facts & Assumptions

[F1]

(c♯s)j0⋯jp=sc(j0)⋯c(jp)∣Vj0∩⋯∩Vjp, evaluated in the alternating model of U, and c♯ commutes with the differentials (Refinement map of ordered open covers).

[F2]

A refinement function from V to U satisfies Vj⊆Uc(j) for every j∈J (Refinement map of ordered open covers).

[F3]

An ordered cochain t∈Cp(U,F) extends to the alternating family with (ept)K=sgn⁡(τK) tiτK(0)⋯iτK(p) on tuples K=(i0,…,ip) of pairwise distinct indices, so t may be evaluated at an arbitrary tuple of U-indices (Ordered and alternating Čech complexes agree).

[F4]

A chain homotopy s:f≃g between chain maps consists of degree 1 morphisms sn with fn−gn=dn+1Dsn+sn−1dnC for every n (A chain homotopy).

[F5]

A cochain complex is read as a chain complex by the reindexing convention (C♯)n:=C−n, dn♯:=d−n (Cochain complex in an abelian category).

[F6]

Chain-homotopic chain maps f,g induce the same map on homology: Hn(f)=Hn(g) for every n (Chain-homotopic maps induce the same map on homology).

[F7]

Hˇp(U,F)=ker⁡(δp)/im⁡(δp−1) is the cohomology of the ordered Čech complex (Fixed-cover Čech cohomology).

[F8]

Restrictions are compatible and are group homomorphisms: (s∣V)∣W=s∣W for W⊆V⊆U (Sections, restrictions, and global sections of a presheaf).

[F9]

The n-th cohomology object of a cochain complex is Hn(C)=coker⁡(Bn(C)→Zn(C)) (Cohomology object of a cochain complex).

Proof

Given: A topological space X, a sheaf of abelian groups F on it, open covers U=(Ui)i∈I, V=(Vj)j∈J indexed by linearly ordered sets and two refinement functions c,c′:J→I from V to U.

1.1

Let c♯,c′♯ be the cochain maps of the two refinement functions, so that Vj⊆Uc(j) and Vj⊆Uc′(j) for every j∈J [F2] and the displayed formula of [F1] applies to both. For p≥1 define hp:Cp(U,F)→Cp−1(V,F) on increasing tuples by the formula of the statement, and set h0:=0. This is well defined: for a tuple J=(j0,…,jp−1) the tuple Ma:=(c(j0),…,c(ja),c′(ja),…,c′(jp−1)) has p+1 entries, so s may be evaluated there in the alternating model [F3], and Vj0∩⋯∩Vjp−1⊆Uc(jb) and ⊆Uc′(jb) for every b by [F2], so the restriction lands in F(Vj0∩⋯∩Vjp−1); the map is additive in s because evaluation and restriction are homomorphisms [F8].

F1F2F3F8
1.2

Fix a tuple J=(j0,…,jp) of pairwise distinct indices and suppress the restrictions to Vj0∩⋯∩Vjp, which are compatible [F8]. Put Ma:=(c(j0),…,c(ja),c′(ja),…,c′(jp)) for 0≤a≤p, a tuple of p+2 U-indices, and for 0≤a≤p−1 and 0≤b≤p let Na,b:=Ma(J∖b) be the mixed tuple formed from the tuple J with the b-th entry deleted, so that Na,b has p+1 entries. Expanding the definitions, (hp+1δUs)J=∑a=0p∑i=0p+1(−1)a+isMa∖i and (δVhps)J=∑a=0p−1∑b=0p(−1)a+bsNa,b, where Ma∖i is Ma with the entry at position i removed. Comparing entries gives Na,b=Ma+1∖b when b≤a and Na,b=Ma∖(b+1) when b>a: deleting jb from J and then forming the mixed tuple of split a removes the entry c(jb), which occupies position b of Ma+1, in the first case, and removes the entry c′(jb), which occupies position b+1 of Ma, in the second.

F1F3
2.1

Match the terms of the two sums. If i<a then the pair (a−1,i) of the second sum is admissible and contributes Na−1,i=Ma∖i with coefficient (−1)a−1+i=−(−1)a+i, cancelling the term (−1)a+isMa∖i of the first sum; if i>a+1 then a≤p−1 and the pair (a,i−1) of the second sum is admissible with i−1>a, contributing Na,i−1=Ma∖i with coefficient (−1)a+i−1=−(−1)a+i and cancelling the same term. Conversely every term of the second sum is covered: a term Na,b with b≤a is the term Ma+1∖b of the first sum with b≤a<a+1, and a term with b>a is the term Ma∖(b+1) of the first sum with b+1>a+1. Hence in the sum (hp+1δUs)J+(δVhps)J all terms cancel in pairs except the terms of the first sum with i=a and i=a+1, that is sMa∖a and −sMa∖(a+1) for 0≤a≤p.

F1step 1.2
3.1

It remains to identify the surviving terms. For 0≤a≤p the tuple Ma∖a deletes the entry c(ja) at position a of Ma and hence equals Qa:=(c(j0),…,c(ja−1),c′(ja),…,c′(jp)), while Ma∖(a+1) deletes the entry c′(ja) at position a+1 of Ma and hence equals Qa+1=(c(j0),…,c(ja),c′(ja+1),…,c′(jp)); in particular Q0=(c′(j0),…,c′(jp)) and Qp+1=(c(j0),…,c(jp)). Therefore the surviving terms telescope: (hp+1δUs)J+(δVhps)J=∑a=0psQa−∑a=0psQa+1=sQ0−sQp+1=sc′(j0)⋯c′(jp)−sc(j0)⋯c(jp)=(c′♯s)J−(c♯s)J, the last equality by the formula of the cochain maps [F1] restricted to Vj0∩⋯∩Vjp [F8].

F1F8step 2.1
4.1

Since J was an arbitrary tuple of pairwise distinct indices, the identity δVhp+hp+1δU=c′♯−c♯ holds as maps Cp(U,F)→Cp(V,F) for every p≥0: for p=0 the first sum is empty because h0=0, and the second sum consists of the two surviving terms Q0,Q1 found in [step 2.1] and [step 3.1], which is the same computation. Reading the two cochain complexes as chain complexes by the reindexing convention [F5] and the family h as a degree +1 map, this identity is exactly the chain-homotopy relation fn−gn=dn+1Dsn+sn−1dnC of [F4] for f=c′♯, g=c♯ and s=h, so c♯ and c′♯ are chain-homotopic. By homotopy invariance [F6] they induce the same map on Hn for every n, that is the same map on Hˇp(U,F)→Hˇp(V,F) for every p, since Hˇp is the p-th cohomology object [F7] of the Čech complex, computed as a cokernel of cocycles by coboundaries [F9]. ∎

F4F5F6F7F9

Depends on

Used by

Dependency tree · two levels

26 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