Alphabeta Math
LemmaStatement: 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.

Ordered and alternating Čech complexes agree

Statement

Let X be a topological space, let F be a sheaf of abelian groups on X and let U=(Ui)i∈I be an open cover of X indexed by a linearly ordered set I, with ordered Čech cochains and differential (C∙(U,F),δ∙) (Ordered Čech cochain complex of a cover, The Čech differential squares to zero).

Let Ip+1 be the set of all (p+1)-tuples (i0,…,ip) of elements of I, let Sp+1 be the permutation group of the position set {0,…,p} with sign sgn⁡:Sp+1→{+1,−1} (Inversions, inversion number, the sign sgn⁡(σ)=(−1)inv⁡(σ), and even and odd permutations), and let a permutation act on tuples by σ⋅(i0,…,ip):=(iσ(0),…,iσ(p)). An alternating Čech p-cochain of U with values in F is a family s=(si0⋯ip)(i0,…,ip)∈Ip+1 with si0⋯ip∈F(Ui0∩⋯∩Uip) for every tuple, such that si0⋯ip=0whenever ia=ib for some a≠b, and sσ⋅(i0,…,ip)=sgn⁡(σ) si0⋯ipfor every σ∈Sp+1. The second condition compares elements of one and the same group, because the intersection Ui0∩⋯∩Uip depends only on the set {i0,…,ip} of indices. These families form a subgroup C~p(U,F) of ∏(i0,…,ip)∈Ip+1F(Ui0∩⋯∩Uip), and we set C~p(U,F):=0 for p<0.

Restriction to increasing tuples is the homomorphism ρp:C~p(U,F)⟶Cp(U,F),ρp(s):=(si0⋯ip)i0<⋯<ip, and the differential of the alternating model is the formula (δps)i0⋯ip+1:=∑j=0p+1(−1)j si0⋯ij^⋯ip+1∣Ui0∩⋯∩Uip+1. Then the following hold.

  1. ρp is an isomorphism of abelian groups for every p. Its inverse ep extends an ordered cochain: for t∈Cp(U,F) and a tuple K=(i0,…,ip) of pairwise distinct indices one sets (ept)K:=sgn⁡(τK) tiτK(0)⋯iτK(p), where τK∈Sp+1 is the sorting permutation with iτK(0)<⋯<iτK(p), while (ept)K:=0 for tuples with a repeated index.
  2. The displayed formula defines a homomorphism δp:C~p(U,F)→C~p+1(U,F) for every p, and ρp+1∘δp=δp∘ρp. Consequently ρ∙ is an isomorphism of cochain complexes and δp+1∘δp=0 on C~∙(U,F).

In particular a cochain of U may be evaluated at an arbitrary tuple of U-indices, not only at an increasing one, and its values are determined by its values on increasing tuples through the signs sgn⁡(τK).

Facts & Assumptions

[F1]

The ordered Čech cochains are Cp(U,F)=∏i0<⋯<ipF(Ui0∩⋯∩Uip) with (δps)i0⋯ip+1=∑j=0p+1(−1)jsi0⋯ij^⋯ip+1∣Ui0∩⋯∩Uip+1, a sum inside the single group F(Ui0∩⋯∩Uip+1) (Ordered Čech cochain complex of a cover).

[F2]

δp+1∘δp=0 for every p, so the ordered Čech cochains form a cochain complex (The Čech differential squares to zero).

[F3]

Restrictions of a section are compatible: (s∣V)∣W=s∣W for W⊆V⊆U, and each restriction map is a group homomorphism (Sections, restrictions, and global sections of a presheaf).

[F4]

The sign of a permutation is sgn⁡(σ)=(−1)inv⁡(σ)∈{+1,−1}, so every sign is its own inverse (Inversions, inversion number, the sign sgn⁡(σ)=(−1)inv⁡(σ), and even and odd permutations).

[F5]

sgn⁡:Sn→{+1,−1} is a group homomorphism, so sgn⁡(σ−1)=sgn⁡(σ) and sgn⁡(στ)=sgn⁡(σ)sgn⁡(τ) (The sign is a homomorphism Sn→{+1,−1}, surjective exactly when n≥2).

Proof

Given: A topological space X, a sheaf of abelian groups F and an open cover U=(Ui)i∈I indexed by a linearly ordered set, together with a degree p≥0 and the ordered Čech complex C∙(U,F).

1.1

Fix p≥0 and a tuple K=(i0,…,ip) of pairwise distinct indices. There is exactly one permutation τK∈Sp+1 with iτK(0)<⋯<iτK(p), because the indices are pairwise distinct; call it the sorting permutation of K and write sort⁡(K):=τK⋅K for the increasing rearrangement. For σ∈Sp+1 one has τσK=σ−1τK: the entry of σ⋅K at position τσK(j) is iσ(τσK(j)), and this is increasing in j exactly when στσK=τK; taking signs gives sgn⁡(τσK)=sgn⁡(σ−1)sgn⁡(τK)=sgn⁡(σ)sgn⁡(τK) by multiplicativity of the sign [F5] and [F4]. Also sort⁡(σK)=sort⁡(K), since K and σ⋅K have the same underlying set of indices. Now define ep:Cp(U,F)→∏K∈Ip+1F(⋂K) by (ept)K:=sgn⁡(τK)tsort⁡(K) for pairwise distinct K and (ept)K:=0 otherwise; this is well defined because ⋂sort⁡(K)=⋂K as open sets. The map ep is a homomorphism of abelian groups, it vanishes on tuples with a repeated index by construction, and for σ∈Sp+1 one has (ept)σK=sgn⁡(τσK)tsort⁡(σK)=sgn⁡(σ)sgn⁡(τK)tsort⁡(K)=sgn⁡(σ)(ept)K, so ep takes values in C~p(U,F); moreover ρpep=id⁡, because τK is the identity for increasing K.

F4F5
1.2

Fix σ∈Sp+2, a tuple K=(i0,…,ip+1) of pairwise distinct indices and a position a∈{0,…,p+1}. Let ιa be the order-preserving bijection from the positions of the tuple K∖a:=(i0,…,ia^,…,ip+1) onto the set {0,…,p+1}∖{a}, and define the permutation σa∈Sp+1 of the positions of K∖a by σa:=ισ(a)−1∘σ∘ιa. Claim: sgn⁡(σa)=sgn⁡(σ)(−1)a+σ(a). Since ιa and ισ(a) preserve order, inv⁡(σa) counts the pairs of positions c<c′ of K with c,c′≠a and σ(c)>σ(c′), that is inv⁡(σa)=inv⁡(σ)−A−B with A:=#{c<a:σ(c)>σ(a)} and B:=#{c′>a:σ(a)>σ(c′)}. Among the a positions c<a exactly A satisfy σ(c)>σ(a) and the remaining a−A satisfy σ(c)<σ(a); of the σ(a) values below σ(a) exactly those a−A are images of positions <a, so the remaining σ(a)−(a−A) of them are images of positions >a, that is B=σ(a)−a+A. Hence inv⁡(σa)=inv⁡(σ)+a−σ(a)−2A, and reducing modulo 2 and using sgn⁡=(−1)inv⁡ [F4] gives the claim.

F4
1.3

For an increasing tuple i0<⋯<ip+1 every tuple i0⋯ij^⋯ip+1 obtained by deleting one entry is increasing again, so restricting to increasing tuples changes none of the values: expanding both sides with the differential formula [F1] gives (ρp+1δps)i0⋯ip+1=∑j=0p+1(−1)jsi0⋯ij^⋯ip+1∣Ui0∩⋯∩Uip+1=(δpρps)i0⋯ip+1 term by term, with the same restriction maps on both sides [F3].

F1F3
2.1

Conversely epρp=id⁡ on C~p(U,F). Let s be alternating and let K be a tuple of pairwise distinct indices; applying the second alternating condition to the sorting permutation τK gives ssort⁡(K)=sτK⋅K=sgn⁡(τK)sK, hence sK=sgn⁡(τK)ssort⁡(K)=(ep(ρps))K, because sgn⁡(τK) is its own inverse [F4] and ρps records the values of s on increasing tuples; on a tuple with a repeated index both sK and (ep(ρps))K are 0. Together with ρpep=id⁡ from [step 1.1] this shows that ρp is a bijection with inverse ep, hence an isomorphism of abelian groups, and proves assertion 1 of the statement. [F4, step 1.1]

F4
2.2

Let s∈C~p(U,F), let K have pairwise distinct entries and length p+2, and let σ∈Sp+2. Deleting position a in σK deletes the entry iσ(a), so the definition in step 1.2 gives (σK)∖a=σa⋅(K∖σ(a)). Thus s(σK)∖a=sgn⁡(σa)sK∖σ(a). Including all restrictions to the common full intersection, the sign identity in step 1.2 gives (δps)σK=∑a(−1)asgn⁡(σa)sK∖σ(a)=sgn⁡(σ)∑a(−1)σ(a)sK∖σ(a)=sgn⁡(σ)(δps)K. The last sum is reindexed by b=σ(a). Restrictions commute with these signs by [F3], so this proves alternation on distinct tuples.

F3step 1.2
3.1

Next, δps vanishes on a tuple K with a repeated entry. Choose positions u<v with iu=iv. In the sum of the statement every term with j∉{u,v} contributes sK∖j=0, because the equal pair survives in K∖j; and if K∖u has a repeated entry then K∖v has the same multiset of entries and also has one, so the two remaining terms vanish as well. Otherwise K∖u and K∖v have pairwise distinct entries and equal multisets, and K∖u arises from K∖v by moving the entry iv=iu from position u to position v−1 past the entries iu+1,…,iv−1, that is by the (v−u)-cycle of positions (u u+1 ⋯ v−1), whose sign is (−1)v−u−1 [F6]; hence sK∖u=sgn⁡(π)sK∖v for that cycle π and (−1)usK∖u+(−1)vsK∖v=[(−1)u(−1)v−u−1+(−1)v]sK∖v=[(−1)v−1+(−1)v]sK∖v=0. In every case (δps)K=0, all values being taken in the group F(Ui0∩⋯∩Uip+1) [F3].

F3F6step 2.1
4.1

Combining: the formula of the statement is additive in s and, by [step 2.2] and [step 3.1], it maps C~p(U,F) into C~p+1(U,F); by [step 1.3] it satisfies ρp+1δp=δpρp; and by [step 1.1] and [step 2.1] the map ρp is bijective with inverse ep in every degree. Hence ρ∙ is an isomorphism of cochain complexes and assertion 2 holds. Finally, for s∈C~p(U,F) one has ρp+2(δp+1δps)=(δp+1δp)(ρps)=0 by [F2], and ρp+2 is injective by [step 2.1], so δp+1δp=0; in the negative degrees both complexes are 0 by their conventions, and the extension formula exhibits the values of any cochain at arbitrary tuples of U-indices. ∎

F2step 1.3

Depends on

Used by

Dependency tree · two levels

17 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