Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge 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.

Sheaf Ext of coherent modules

Definition

Assume the Axiom of Choice (The Axiom of Choice). Let (Y,OY) be a ringed space and let F,G be OY-modules. An OY-injective resolution of G is an exact sequence 0⟶G⟶I0→d0I1→d1⋯ of OY-modules in which every Ip is an injective object of the category of OY-modules. The in-run theorem lem-ringed-space-module-sheaves-enough-injectives of batch 9 supplies such a resolution for every G, and the published comparison results Injective comparison maps exist and Injective comparison maps are unique up to cochain homotopy (applied in the abelian category of OY-modules) make the constructions below independent of the supplied resolution up to a canonical isomorphism, as recorded in the final paragraph of this definition. Their Dependent Choice hypothesis follows from the declared Axiom of Choice by AC implies DC implies countable choice.

Two complexes are attached to such a resolution:

  • Global Ext. The complex of abelian groups Hom⁡OY(F,I∙) has degree-p term Hom⁡OY(F,Ip) and differential dp∘(−). Its cohomology in the sense of Cohomology object of a cochain complex is written Ext⁡OYq(F,G):=Hq(Hom⁡OY(F,I∙)),q≥0.
  • Sheaf Ext. The complex of OY-modules HomOY(F,I∙), with internal Hom as in The internal Hom sheaf of two module sheaves and the same differential, has cohomology sheaves written ExtOYq(F,G):=Hq(HomOY(F,I∙)),q≥0.

The terms of Hom⁡OY(F,I∙) are the global sections of the terms of HomOY(F,I∙), but the two constructions are different functors: taking global sections does not commute with taking cohomology, so the global Ext for q>0 is not in general the group of global sections of the sheaf Ext.

Because Hom⁡OY(F,−) is left exact, the degree-zero terms are identified with the ordinary Hom modules: Ext⁡OY0(F,G)≅Hom⁡OY(F,G) and ExtOY0(F,G)≅HomOY(F,G), the isomorphisms being induced by the coaugmentation G→I0.

Independence of the resolution. The subscript-free notation is justified as follows. Let G→J∙ be a second OY-injective resolution. The comparison theorem Injective comparison maps exist produces a coaugmentation-preserving cochain map I∙→J∙, and Injective comparison maps are unique up to cochain homotopy shows that any two such maps are cochain-homotopic; applying the additive functors Hom⁡OY(F,−) and HomOY(F,−) to such a homotopy produces a homotopy of the resulting complexes of abelian groups, respectively of sheaves of OY-modules, because these functors are additive and preserve the homotopy relation. Cochain-homotopic maps induce the same map on cohomology, so the groups and sheaves above are well-defined up to canonical isomorphism independent of the resolution. This is the same well-definedness mechanism as in the abstract construction of Ext via an injective resolution of the second variable, specialized to OY-modules.

Local computation. If F admits a resolution ⋯→F1→F0→F→0 by finite locally free OY-modules, then ExtOYq(F,G) is computed by the complex HomOY(F∙,G); this local computation, together with its compatibility with the injective resolution defining sheaf Ext, is proved in Koszul sheaf Ext of a smooth regular immersion is concentrated in codimension in the smooth regular-immersion case where it is used, and is not assumed here.

Depends on

Used by

Dependency tree · two levels

43 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