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 be a topological space, let be a sheaf of abelian groups on and let be an open cover of indexed by a linearly ordered set , with ordered Čech cochains and differential (Ordered Čech cochain complex of a cover, The Čech differential squares to zero).
Let be the set of all -tuples of elements of , let be the permutation group of the position set with sign (Inversions, inversion number, the sign , and even and odd permutations), and let a permutation act on tuples by . An alternating Čech -cochain of with values in is a family with for every tuple, such that and The second condition compares elements of one and the same group, because the intersection depends only on the set of indices. These families form a subgroup of , and we set for .
Restriction to increasing tuples is the homomorphism and the differential of the alternating model is the formula Then the following hold.
- is an isomorphism of abelian groups for every . Its inverse extends an ordered cochain: for and a tuple of pairwise distinct indices one sets where is the sorting permutation with , while for tuples with a repeated index.
- The displayed formula defines a homomorphism for every , and Consequently is an isomorphism of cochain complexes and on .
In particular a cochain of may be evaluated at an arbitrary tuple of -indices, not only at an increasing one, and its values are determined by its values on increasing tuples through the signs .
Facts & Assumptions
The ordered Čech cochains are with , a sum inside the single group (Ordered Čech cochain complex of a cover).
for every , so the ordered Čech cochains form a cochain complex (The Čech differential squares to zero).
Restrictions of a section are compatible: for , and each restriction map is a group homomorphism (Sections, restrictions, and global sections of a presheaf).
The sign of a permutation is , so every sign is its own inverse (Inversions, inversion number, the sign , and even and odd permutations).
is a group homomorphism, so and (The sign is a homomorphism , surjective exactly when ).
A cycle of length has sign (A -cycle has sign , and when fixed points are counted as cycles).
Proof
Given: A topological space , a sheaf of abelian groups and an open cover indexed by a linearly ordered set, together with a degree and the ordered Čech complex .
Fix and a tuple of pairwise distinct indices. There is exactly one permutation with , because the indices are pairwise distinct; call it the sorting permutation of and write for the increasing rearrangement. For one has : the entry of at position is , and this is increasing in exactly when ; taking signs gives by multiplicativity of the sign [F5] and [F4]. Also , since and have the same underlying set of indices. Now define by for pairwise distinct and otherwise; this is well defined because as open sets. The map is a homomorphism of abelian groups, it vanishes on tuples with a repeated index by construction, and for one has , so takes values in ; moreover , because is the identity for increasing .
Fix , a tuple of pairwise distinct indices and a position . Let be the order-preserving bijection from the positions of the tuple onto the set , and define the permutation of the positions of by . Claim: . Since and preserve order, counts the pairs of positions of with and , that is with and . Among the positions exactly satisfy and the remaining satisfy ; of the values below exactly those are images of positions , so the remaining of them are images of positions , that is . Hence , and reducing modulo and using [F4] gives the claim.
For an increasing tuple every tuple 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 term by term, with the same restriction maps on both sides [F3].
Conversely on . Let be alternating and let be a tuple of pairwise distinct indices; applying the second alternating condition to the sorting permutation gives , hence , because is its own inverse [F4] and records the values of on increasing tuples; on a tuple with a repeated index both and are . Together with from [step 1.1] this shows that is a bijection with inverse , hence an isomorphism of abelian groups, and proves assertion 1 of the statement. [F4, step 1.1]
Let , let have pairwise distinct entries and length , and let . Deleting position in deletes the entry , so the definition in step 1.2 gives . Thus . Including all restrictions to the common full intersection, the sign identity in step 1.2 gives The last sum is reindexed by . Restrictions commute with these signs by [F3], so this proves alternation on distinct tuples.
Next, vanishes on a tuple with a repeated entry. Choose positions with . In the sum of the statement every term with contributes , because the equal pair survives in ; and if has a repeated entry then has the same multiset of entries and also has one, so the two remaining terms vanish as well. Otherwise and have pairwise distinct entries and equal multisets, and arises from by moving the entry from position to position past the entries , that is by the -cycle of positions , whose sign is [F6]; hence for that cycle and . In every case , all values being taken in the group [F3].
Combining: the formula of the statement is additive in and, by [step 2.2] and [step 3.1], it maps into ; by [step 1.3] it satisfies ; and by [step 1.1] and [step 2.1] the map is bijective with inverse in every degree. Hence is an isomorphism of cochain complexes and assertion 2 holds. Finally, for one has by [F2], and is injective by [step 2.1], so ; in the negative degrees both complexes are by their conventions, and the extension formula exhibits the values of any cochain at arbitrary tuples of -indices. ∎
Depends on
- Ordered Čech cochain complex of a cover
- The Čech differential squares to zero
- Sections, restrictions, and global sections of a presheaf
- Inversions, inversion number, the sign $\operatorname{sgn}(\sigma)=(-1)^{\operatorname{inv}(\sigma)}$, and even and odd permutations
- The sign is a homomorphism $S_n\to\{+1,-1\}$, surjective exactly when $n\ge 2$
- A $k$-cycle has sign $(-1)^{k-1}$, and $\operatorname{sgn}(\sigma)=(-1)^{n-c(\sigma)}$ when fixed points are counted as cycles
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
- The Stacks Project, Cohomology of Sheaves (standard reference, not scraped)