Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30
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.

Injective modules are flasque and Ext from the structure sheaf is cohomology

Statement

Assume the Axiom of Choice. Let (Y,OY) be a ringed space, let Hq(Y,−) be sheaf cohomology computed from the supplied functorial injective resolution datum on Ab(Y) of Sheaf cohomology as right derived global sections, and let Ext⁡OYq be the global sheaf Ext of Sheaf Ext of coherent modules.

  1. Every injective OY-module I (Injective object) is flasque as a sheaf of abelian groups (Flasque sheaf): for all open subsets U⊆V⊆Y the restriction map I(V)→I(U) is surjective.
  2. For every OY-module G and every q≥0 there is a canonical isomorphism χGq:Ext⁡OYq(OY,G)→ ∼ Hq(Y,G), natural in G; in degree zero it is the composite Hom⁡OY(OY,G)≅Γ(Y,G)=H0(Y,G) which sends a morphism to its value at the unit section.

Facts & Assumptions

Given: a ringed space (Y,OY), an open inclusion of opens U⊆V⊆Y, an injective OY-module I, an OY-module G, and the supplied functorial injective resolution data used in Sheaf Ext of coherent modules and in Sheaf cohomology as right derived global sections.

[A1]

The Axiom of Choice states that every family of nonempty sets has a choice function. (The Axiom of Choice)

[F1]

An OY-module is a sheaf of abelian groups with a compatible OY-module structure, and morphisms of OY-modules are the module-structure-compatible morphisms of the underlying sheaves; the forgetful functor to Ab(Y) preserves kernels and cokernels. (Modules on a ringed space)

[F2]

An object I of an abelian category is injective when every morphism M→I out of a subobject extends over the inclusion. (Injective object)

[F3]

Extension by zero j! along an open inclusion j:U↪Y is left adjoint to restriction, Hom⁡Y(j!F,H)≅Hom⁡U(F,j−1H), and j! is exact; over an open W⊆Y its sections are the sections of F over W∩U whose support is closed in W. (Extension by zero is left adjoint to restriction and is exact on abelian sheaves, Extension by zero for abelian sheaves on an open subspace)

[F4]

The kernel of a morphism of sheaves is computed on sections over every open, so a morphism of sheaves whose section maps are all injective has zero kernel and is a monomorphism. (Kernel sheaves are objectwise, while cokernels and images are sheafified, A sequence of abelian sheaves is exact exactly when it is exact on every stalk)

[F5]

A sheaf of abelian groups is flasque when all restriction maps F(V)→F(U) for open U⊆V are surjective, and a flasque abelian sheaf F satisfies Hq(W,F∣W)=0 for every open W and every q>0: it is acyclic for the global-sections functor. (Flasque sheaf, Flasque abelian sheaves are Γ-acyclic, An acyclic object for a left exact functor)

[F6]

With an OY-injective resolution G→I∙ one has Ext⁡OYq(OY,G)=Hq(Hom⁡OY(OY,I∙)), and this is independent of the supplied resolution up to canonical isomorphism; the functorial datum of the cited module-injective supplier provides such a resolution for every G under the Axiom of Choice. (Sheaf Ext of coherent modules, Enough injective sheaves of modules)

[F7]

Hq(Y,H):=RIqΓ(Y,H)=Hq(Γ(Y,I∙(H))del) is the q-th right derived object of the global-sections functor relative to the supplied functorial injective resolution datum on Ab(Y), with Hq(Y,H)=0 for q<0. (Sheaf cohomology as right derived global sections)

[F8]

Acyclic-resolution theorem: if F is additive and left exact, I is a supplied injective resolution datum on a class D containing the object A and the cycles of a given exact coaugmented complex 0→A→J0→J1→⋯, and each Jq is F-acyclic, then under the Axiom of Dependent Choice there is a canonical isomorphism RInF(A)≅Hn(F(Jdel∙)) for every n≥0. (The acyclic-resolution theorem for right derived functors, An F-acyclic resolution)

[F9]

In ZF the Axiom of Choice implies the Axiom of Dependent Choice, which is the choice principle consumed by [F8]. (AC implies DC implies countable choice)

Given: the data of the statement, an open inclusion U⊆V⊆Y, and an injective OY-module I.

Proof

1.1F1F3construct

Extension by zero for modules. Let o:U↪Y be an open inclusion and let G be an OU-module. Define the presheaf o!modG on Y by (o!modG)(W)={s∈G(W∩U):Supp⁡(s) is closed in W},W⊆Y open, with restriction maps those of G and with the OY(W)-module structure induced by the ring map OY(W)→OU(W∩U) [F1]. The support condition is stable under multiplication by functions and under restrictions, and the presheaf is a sheaf because its sections are the sections of the abelian extension by zero o!G of [F3] with the additional module structure: the underlying abelian sheaf of o!modG is exactly o!G, and the module structure is well defined on the same section sets. Consequently the functor o!mod is exact on O-modules, since the forgetful functor to abelian sheaves preserves kernels and cokernels [F1] and o! is exact on abelian sheaves [F3].

1.2F1F6

The Hom complex of the structure sheaf. For every OY-module H the map Hom⁡OY(OY,H)⟶Γ(Y,H),φ⟼φY(1Y), is a bijection: two morphisms with the same value at 1Y agree on the unit section over every open and hence on all sections, and conversely a section s∈Γ(Y,H) defines a morphism whose value on f∈OY(W) is f⋅s∣W, with inverse given by the unit section. This bijection is natural in H and identifies the complex Hom⁡OY(OY,J∙) degreewise with the complex Γ(Y,J∙) of [F1], the differentials corresponding because both are postcomposition with the differentials of J∙. Hence Hq(Hom⁡OY(OY,J∙))≅Hq(Γ(Y,Jdel∙)) for every q≥0.

2.1F1F3step 1.1construct

The adjunction. The abelian-sheaf adjunction of [F3] sends a morphism o!modG→H to its restriction over U. It restricts to an adjunction of O-modules. Indeed an OY-linear map restricts over U to an OU-linear map. Conversely the abelian adjoint of an OU-linear map is OY-linear stalkwise: at a point of U the stalk map is the given OU-linear map, and at a point outside U the source stalk of o!G is zero; equality of the two candidate multiplication morphisms is detected on stalks. Thus Hom⁡OY(o!modG,H)≅Hom⁡OU(G,H∣U). For G=OU and H=I, evaluation at the unit section gives Hom⁡OY(o!modOU,I)≅Hom⁡OU(OU,I∣U)≅I(U). This uses stalkwise module linearity, not surjectivity of OY(W)→OU(W∩U), which need not hold.

2.2F4step 1.1

The comparison map is a monomorphism. For open U⊆V⊆Y let i:U↪V be the inclusion. The natural map α:o!modOU⟶o!modOV that extends a section of OY over W∩U with support closed in W by zero across W∩(V∖U) is a morphism of OY-modules, because extension by zero is OY(W)-linear on the subsheaf of sections with closed support [F1, step 1.1]. Its section maps are injective: a section s over W∩U with closed support in W, extended by zero over W∩(V∖U), has support closed in W as well and restricts back to s. Hence ker⁡(α)=0 by [F4], so α is a monomorphism.

3.1F2F5step 2.1step 2.2

Injective modules are flasque. Let s∈I(U). Under the bijection of step 2.1 for U the element s corresponds to some morphism f:o!modOU→I. By step 2.2 the map α is a monomorphism, so [F2] applied to the subobject α:o!modOU↣o!modOV and the morphism f provides g:o!modOV→I with g∘α=f. Let t∈I(V) correspond to g under the bijection of step 2.1 for V. Precomposition with α corresponds under these two bijections to restriction along U⊆V, so g∘α=f says t∣U=s. Hence every section over U extends to V, the restriction map I(V)→I(U) is surjective, and since U⊆V were arbitrary I is flasque, which is clause 1.

4.1A1F5F6F7F8F9step 3.1

Flasque injective resolutions compute cohomology. Let G be an OY-module and let G→J∙ be the OY-injective resolution supplied by the functorial datum of [F6]. By step 3.1 every Jp is flasque as an abelian sheaf, so Hq(Y,Jp)=0 for every q>0 by [F5]: each Jp is acyclic for the global sections functor Γ(Y,−) on Ab(Y). The underlying abelian complex of G→J∙ is therefore a Γ(Y,−)-acyclic resolution of the abelian sheaf G, with all its cycles lying in the class D of all abelian sheaves on Y, on which the supplied datum of [F7] is defined. The Axiom of Dependent Choice is available by [F9] and [A1], so [F8] gives a canonical isomorphism RIqΓ(Y,G)≅Hq(Γ(Y,Jdel∙)),q≥0.

5.1A1F6F7F8F9step 3.1step 4.1step 1.2∎

Conclusion. Combining steps 4.1 and 1.2 with the identification Ext⁡OYq(OY,G)=Hq(Hom⁡OY(OY,J∙)) of [F6] and Hq(Y,G)=RIqΓ(Y,G) of [F7] gives the canonical isomorphism χGq of clause 2 for every OY-module G and every q≥0; in degree zero both bijections display the value at the unit section, which is the identification asserted in the statement. Naturality in G holds because the supplied resolution datum is functorial: a morphism ψ:G→G′ gives a cochain map J∙(G)→J∙(G′) commuting with the coaugmentations, and the comparisons used in steps 4.1 and 1.2 are built from the datum and the fixed functor Γ(Y,−) and therefore intertwine the two χ's; the right-hand isomorphism of step 4.1 is the canonical comparison of the two acyclic resolutions, so the square commutes. Clause 1 is step 3.1. The Axiom of Choice [A1] is assumed in the statement and is used exactly through the functorial injective resolution data of [F6] and [F7] for modules and for abelian sheaves and, through the Dependent Choice instance of [F9], in the acyclic-resolution comparison of step 4.1; no further selection of resolutions, indices or sections is made, the charts and open sets being arbitrary parameters of the construction.

Depends on

Used by

Dependency tree · two levels

73 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