Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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-colimit Čech cohomology

Definition

Assume the Axiom of Choice (The Axiom of Choice). Let X be a topological space and let F be a sheaf of abelian groups on X. The topology TX is a set of open subsets. Fix a well-order of TX using the Axiom of Choice, and let Cov⁡(X) consist of all subsets U⊆TX whose union is X, each indexed by its distinct members in the inherited well-order. This is a set of ordered covers. An arbitrary indexed open cover is represented by its distinct-member cover: under Choice, one may choose an index for each distinct member, so the two cover presentations refine one another and yield canonically isomorphic Čech cohomology under refinement independence. For U∈Cov⁡(X) write Hˇp(U,F) for its fixed-cover Čech cohomology (Fixed-cover Čech cohomology).

Say that U⪯V, or that V refines U, when there is a refinement function from V to U, that is, a map c from the index set of V to the index set of U with V⊆c(V) for every V∈V (Refinement map of ordered open covers). This relation is a preorder: it is reflexive through the identity map, and it is transitive because a composite of refinement functions is a refinement function. It is directed: for covers U,V∈Cov⁡(X) the set of distinct intersections W={U∩V:U∈U, V∈V} is another member of Cov⁡(X), indexed by the same inherited well-order, and covers X. For each W∈W, choose the least U∈U and the least V∈V with W=U∩V; the resulting maps refine W to both covers. Repeating this construction stays within the same set Cov⁡(X).

The Axiom of Choice is used to fix transition data: for every pair U⪯V choose one refinement function cVU from V to U. By Refinement choices induce the same Čech map any two refinement functions from V to U induce the same homomorphism Hˇp(U,F)→Hˇp(V,F) in every degree, so the chosen data give well-defined maps Hˇp(U,F)⟶Hˇp(V,F)(U⪯V), and these maps are compatible with composition and with identities: the composite of the chosen refinement functions along U⪯V⪯W is again a refinement function from W to U and hence induces the composite of the two induced maps, while the identity is a refinement function of a cover to itself and induces the identity. Thus U↦Hˇp(U,F) is a functor from the directed preorder Cov⁡(X) to the category of abelian groups.

The Čech cohomology of X with values in F is the filtered colimit Hˇp(X,F):=lim→⁡U∈Cov⁡(X)Hˇp(U,F), taken in the category of abelian groups, of that functor (Filtered categories and filtered colimits). A class of Hˇp(X,F) is represented by a pair (U,α) with U∈Cov⁡(X) and α∈Hˇp(U,F), and two such pairs represent the same class exactly when the two classes agree after refinement to a common cover. A morphism φ:F→G of abelian sheaves induces the maps Hˇp(U,φ) on fixed covers, which commute with the refinement maps because the cochain maps of Refinement map of ordered open covers are defined componentwise from the values of the cochains; these maps pass to the filtered colimit and give Hˇp(X,φ):Hˇp(X,F)⟶Hˇp(X,G), so that Hˇp(X,−) is a functor on the abelian sheaves on X with Hˇp(X,F)=0 for p<0.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

18 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