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.

Long exact global sheaf Ext sequence in the first variable

Statement

Assume the Axiom of Choice. Let (Y,OY) be a ringed space whose structure sheaf is commutative, let 0⟶F′⟶F⟶F′′⟶0 be a short exact sequence of OY-modules and let G be an OY-module. Then the injective-resolution global Ext of Sheaf Ext of coherent modules fits into a natural long exact sequence ⋯→Ext⁡OYq(F′′,G)→Ext⁡OYq(F,G)→Ext⁡OYq(F′,G)→∂qExt⁡OYq+1(F′′,G)→⋯ beginning in degree zero with 0→Hom⁡OY(F′′,G)→Hom⁡OY(F,G)→Hom⁡OY(F′,G)→∂0Ext⁡OY1(F′′,G). The sequence is natural in the short exact sequence and in G; it is made from one fixed OY-injective resolution of G, and the resulting connecting maps do not depend on that choice. No claim is made here about a long exact sequence in the second variable, about vanishing of Ext⁡q for q>0, or about splitting.

Facts & Assumptions

Given: a ringed space (Y,OY) with commutative structure sheaf, a short exact sequence 0→F′→F→F′′→0 of OY-modules, and an OY-module G.

[F1]

An object I of an abelian category is injective when for every monomorphism m:M↣E and every morphism f:M→I there is a morphism f~:E→I with f~m=f. (Injective object)

[F2]

A short exact sequence of cochain complexes in an abelian category yields a natural long exact sequence in cohomology, with connecting maps Hn(C)→∂nHn+1(A). (The long exact sequence in cohomology)

[F3]

For supplied injective-resolution data I the complex CI∙(M,N) has qth term Hom⁡A(M,Iq(N)) and differential dIq(f)=dI(N)q∘f, and its cohomology is Ext⁡In(M,N). (Ext via an injective resolution of the second variable)

[F4]

For an OY-module G and a supplied injective resolution G→I∙ one sets Ext⁡OYq(F,G)=Hq(Hom⁡OY(F,I∙)); the coaugmentation identifies Ext⁡OY0(F,G)≅Hom⁡OY(F,G), and comparison maps and homotopies make all of this independent of the supplied resolution. (Sheaf Ext of coherent modules)

[F5]

Any two coaugmentation-preserving maps between injective resolutions extending the same object morphism are cochain-homotopic. (Injective comparison maps are unique up to cochain homotopy)

[F6]

The declared Axiom of Choice implies the Dependent Choice hypothesis of the published injective-comparison existence and uniqueness theorems. (The Axiom of Choice, AC implies DC implies countable choice, Injective comparison maps exist)

Proof

1.1F3F4given

Using AC and the in-run theorem lem-ringed-space-module-sheaves-enough-injectives of the cohomology-of-quasi-coherent-sheaves pair, which supplies an OY-injective resolution for every OY-module, fix one such resolution G→I∙; by [F3] applied in the abelian category of OY-modules the complex Hom⁡OY(F,I∙) has qth term Hom⁡OY(F,Iq) and differential dq∘(−), and by [F4] its qth cohomology is Ext⁡OYq(F,G).

1.2F1given

For every p the module Ip is injective, so by [F1] every morphism M→Ip defined on a subobject of E extends to E; applying this to the subobject F′⊆F gives exactness of 0→Hom⁡(F′′,Ip)→Hom⁡(F,Ip)→Hom⁡(F′,Ip)→0: surjectivity of the last map is the extension property applied to F′⊆F, injectivity of the first is immediate from the epimorphism F→F′′, and exactness in the middle follows because a morphism F→Ip killing F′ factors through the quotient F/F′≅F′′.

2.1F3step 1.1step 1.2

The three complexes Hom⁡(F′′,I∙), Hom⁡(F,I∙) and Hom⁡(F′,I∙) are concentrated in degrees q≥0, their differentials are post-composition with the differential dq of I∙, so the degreewise exact sequence of step 1.2 commutes with those differentials; hence 0→Hom⁡(F′′,I∙)→Hom⁡(F,I∙)→Hom⁡(F′,I∙)→0 is a short exact sequence of cochain complexes.

3.1F2F4step 2.1

By [F2] the sequence of step 2.1 has a natural long exact sequence ⋯→Hq(Hom⁡(F′′,I∙))→Hq(Hom⁡(F,I∙))→Hq(Hom⁡(F′,I∙))→∂qHq+1(Hom⁡(F′′,I∙))→⋯, and substituting the identification of [F4] turns its terms into Ext⁡OYq(F′′,G), Ext⁡OYq(F,G) and Ext⁡OYq(F′,G).

4.1F2F4step 3.1

Since the complexes are concentrated in degrees q≥0, the terms H−1 in the long exact sequence of step 3.1 vanish, so the sequence begins 0→H0(Hom⁡(F′′,I∙))→H0(Hom⁡(F,I∙))→H0(Hom⁡(F′,I∙))→H1(Hom⁡(F′′,I∙))→⋯; by the degree-zero clause of [F4] the first three terms are Hom⁡OY(F′′,G), Hom⁡OY(F,G) and Hom⁡OY(F′,G), which is the displayed beginning of the statement.

5.1F2F4F5F6step 4.1

Naturality in G and resolution independence hold as follows: a morphism u:G→G′ with injective resolutions I∙, J∙ admits a coaugmentation-preserving comparison map I∙→J∙ extending u by [F6], and post-composition with it is a cochain map Hom⁡(F,I∙)→Hom⁡(F,J∙) inducing maps on cohomology that intertwine the connecting maps of [F2]; two choices of comparison map are cochain-homotopic by [F5], whose Dependent Choice hypothesis is licensed by [F6], so the induced maps on cohomology agree and the sequence depends on G and not on the resolution.

6.1F2F4step 3.1step 5.1discharge-construct∎

Naturality in the short exact sequence holds because a morphism of short exact sequences of OY-modules induces a morphism of the degreewise exact sequences of complexes built in step 2.1, and [F2] provides the induced morphism of long exact sequences; the connecting maps ∂q are then those supplied by [F2] composed with the identifications of [F4]. The statement claims the long exact sequence and its naturality, and no splitting or vanishing beyond degree zero, so nothing further is asserted.

Depends on

Used by

Dependency tree · two levels

45 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