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.

Godement terms are flasque and compute cohomology

Statement

Assume the Axiom of Choice, let X be a topological space and let F be a sheaf of abelian groups on X with Godement resolution 0→F→ ε C0(F)→ d0 C1(F)→ d1 ⋯ (Godement resolution of an abelian sheaf). Then

  1. every term Cn(F) is flasque (Flasque sheaf);
  2. the coaugmented complex is exact, so that 0→F→C∙(F) is a resolution of F by flasque sheaves;
  3. for every q≥0 there is an isomorphism Hq(X,F)≅Hq(Γ(X,C∙(F))), natural in F, where Hq(X,−) is sheaf cohomology from the supplied functorial injective resolution datum on Ab(X) (Sheaf cohomology as right derived global sections).

In particular the Godement complex is a Γ-acyclic resolution of F (Gamma-acyclic abelian sheaf) that computes sheaf cohomology.

Facts & Assumptions

[F1]

For a sheaf of abelian groups E on X and a section s over an open U, one has s=0 if and only if all of its germs sx vanish (A section of a sheaf of groups is zero exactly when all of its germs are zero, Germs of sections).

[F2]

Restriction maps of a skyscraper sheaf ix,∗A are the identity on A when both opens contain x, and the zero map to 0 when the smaller open does not contain x; hence a product of skyscraper sheaves has restriction maps given by the corresponding projections (A skyscraper sheaf of abelian groups at a point).

[F3]

The cokernel sheaf of a morphism φ is the sheafification of the objectwise cokernel presheaf, and kernel and cokernel are taken in the abelian category Ab(X) (Kernel sheaves are objectwise, while cokernels and images are sheafified, Sheaves of abelian groups, and likewise sheaves of modules on a ringed space, form abelian categories).

[F4]

A presheaf is a sheaf exactly when sections glue uniquely over open covers: if si∈E(Wi) agree on the pairwise intersections of a cover, there is a section over the union restricting to each si, and it is unique (A sheaf on a topological space).

[F5]

A flasque abelian sheaf E on a space U satisfies Hq(U,E∣U)=0 for every q>0 (Flasque abelian sheaves are Γ-acyclic, Gamma-acyclic abelian sheaf).

[F6]

Let I be a supplied injective resolution datum, F an additive left exact functor and 0→A→J0→J1→⋯ an F-acyclic resolution of A whose successive cokernels all lie in the domain of I; then RInF(A)≅Hn(F(Jdel∙)) for every n≥0 (The acyclic-resolution theorem for right derived functors).

[F7]

In ZF the Axiom of Choice implies the Axiom of Dependent Choice (AC implies DC implies countable choice), the hypothesis under which the flasque-acyclicity and acyclic-resolution theorems are stated.

[F8]

Assuming AC, Ab(X) has enough injectives and carries one functorial injective resolution datum, so every abelian sheaf on X lies in the domain of that datum (Enough injective abelian sheaves, Sheaf cohomology as right derived global sections).

Proof

Given: The Axiom of Choice, a topological space X, and a sheaf of abelian groups F on X with its Godement resolution as displayed.

1.1

For an open V⊆X the assignment V↦∏x∈VEx with the evident projections as restriction maps is a sheaf: locality and gluing are checked coordinate by coordinate in the product of groups, using [F4] at each point, and by [F2] it is the product of the skyscraper sheaves ix,∗Ex in Ab(X). Moreover the germ maps E(V)→∏x∈VEx, s↦(sx)x∈V, are compatible with restrictions by the second half of [F1], so they define a morphism εE:E→C0(E) [F1].

F1F2F4
1.2

For every abelian sheaf E on X the germ map εE is injective: if s∈E(V) maps to 0, all germs sx with x∈V vanish, so s=0 by [F1]; hence ker⁡(εE)=0 and εE is a monomorphism in the abelian category Ab(X) [F3]. Consequently the cokernel Q(E)=coker⁡(εE) fits into a short exact sequence 0→E→C0(E)→Q(E)→0 in Ab(X) [F3].

F1F3
2.1

Every term C0(E) is flasque: for open U⊆V the restriction map ∏x∈VEx→∏x∈UEx is the projection on the coordinates in U [F2, step 1.1], which is surjective. Hence each term Cn(F)=C0(Qn−1(F)) of the Godement resolution is flasque, which is assertion 1.

F2step 1.1
2.2

The coaugmented complex is exact. At F this is the injectivity of εF from step 1.2. In degree n≥0 write qn:Cn(F)→Qn(F) for the quotient morphism, so that dn=εQn∘qn by the definition of the Godement differential and qn is the cokernel of the monomorphism εQn−1 of step 1.2; by the exactness of 0→Qn−1(F)→Cn(F)→qnQn(F)→0 in Ab(X) [F3] one has im⁡(dn−1)=im⁡(εQn−1)=ker⁡(qn), while ker⁡(dn)=ker⁡(εQn∘qn)=ker⁡(qn) because εQn is a monomorphism by step 1.2. Hence im⁡(dn−1)=ker⁡(dn) and the complex is exact at every term, which is assertion 2. [F3, step 1.2, given]

F3step 1.2
3.1

By [F7] AC gives DC. Each term Cn(F) is flasque by step 2.1, hence Γ-acyclic on X by [F5]; the successive cokernels of the resolution are Z0=F and Zq+1=Qq(F) for q≥0, which are abelian sheaves on X, hence lie in the domain of the supplied injective resolution datum by [F8]. Applying [F6] to the additive left exact functor Γ(X,−) (Global sections of an abelian sheaf), the datum and the acyclic resolution 0→F→C∙(F) gives Hq(X,F)=RqΓ(X,F)≅Hq(Γ(X,C∙(F))) for every q≥0, with the naturality supplied by the functoriality of the Godement construction recorded in Godement resolution of an abelian sheaf. This is assertion 3. ∎ [F5, F6, F7, F8, step 2.1, step 2.2]

F5F6F7F8∎

Depends on

Used by

Dependency tree · two levels

65 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