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

Cech hypercohomology of an affine cover computes Ext of the cotangent complex

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let X be a quasi-compact separated scheme with a finite affine open cover U={Ui}, let L be a bounded-above complex of OX-modules with quasi-coherent cohomology, and let M be a quasi-coherent module. Put K=RHomOX(L,M). Form the derived Cech total complex whose component on Ui0…ip is RΓ(Ui0…ip,K). Its degree-n cohomology is canonically Ext⁡OXn(L,M) (Ext groups of the cotangent complex). If K is represented by a bounded-below complex whose terms are acyclic on every cover intersection, ordinary sections of that representative give the same total complex. In particular, under this acyclicity hypothesis, a complex of locally free resolutions computing derived Hom can be used for the usual Cech double complex. Arbitrary underived Hom∙(L,M) is not asserted to compute Ext.

Consequently, whenever local deformation classes, automorphisms and compatibility data are represented by the degree 0,1,2 truncation of this derived Hom complex, their descent classes and obstruction classes are computed by the global groups Ext⁡1 and Ext⁡2, respectively.

Facts & Assumptions

Given: X,L,M,U as in the Statement and the Axiom of Choice.

[F1]

Ext is the cohomology of global derived Hom, equivalently of RΓ(X,RHom(L,M)). (Ext groups of the cotangent complex, Derived hom in the bounded setting)

[F2]

Flasque abelian sheaves are acyclic on every open (Flasque abelian sheaves are Γ-acyclic). Module-injectives are flasque as abelian sheaves and compute the stipulated sheaf cohomology (Injective modules are flasque and Ext from the structure sheaf is cohomology). Sheaf cohomology is computed by an injective resolution, and bounded-below complex hypercohomology is its derived global sections. (Sheaf cohomology as right derived global sections, First hypercohomology spectral sequence)

[F3]

The ordered Cech complex of a finite open cover has the usual alternating restriction differential. (Ordered Čech cochain complex of a cover)

[F4]

Higher cohomology of a quasi-coherent sheaf on an affine scheme vanishes. (Affine acyclicity of quasi-coherent sheaves)

Proof

1.1F1F2given

The global/internal derived-Hom comparison in [F1] can be computed explicitly. Let M→I∙ be a bounded-below module-injective resolution. Since restriction preserves injectives (its left adjoint, extension by zero, is exact), the bounded-below complex K0=Hom∙(L,I∙) computes internal derived Hom on every open. Each term is a finite product of sheaves Hom(La,Ib), because L is bounded above. These sheaves are flasque: a morphism L∣U→I∣U extends over V⊃U by injectivity of I∣V applied to j!(L∣U)↪L∣V. Thus K0 has global-section-acyclic terms and the bounded-below hypercohomology comparison [F2] identifies RΓ(X,K0) with Γ(X,K0)=Hom⁡∙(L,I∙), the complex computing global derived Hom. This establishes [F1].

1.2F1F2F3given

Resolve M injectively and compute the internal derived Hom, then replace the resulting bounded-below complex K by a bounded-below injective complex J, using Stacks tag 013K and the enough-injectives assertion of Injective modules are flasque and Ext from the structure sheaf is cohomology through its module-injective supplier. Boundedness below follows from L being bounded above and M being in degree zero. The augmented sheaf Cech complex of each Jq is exact: near a point choose one cover member containing it, shrink inside that member, and insert its index in the alternating Cech differential to obtain a contracting homotopy of the augmentation. Restriction of an injective sheaf of modules to an open is injective, since extension by zero is its exact left adjoint. Thus every intersection has no higher cohomology for Jq. For an intersection inclusion j, the module j∗(Jq∣U) is injective because j∗ is right adjoint to the exact restriction functor. Thus the augmented sheaf Cech complex is an injective resolution of the injective Jq and splits into short exact sequences, so applying global sections preserves its exactness. The double-complex filtration therefore gives a quasi-isomorphism from Γ(X,J) to the total complex of Γ(Ui0…ip,J). The cover direction is finite, so totalization and its filtration converge in every degree. Each column computes RΓ(Ui0…ip,K) by injectivity, and Γ(X,J) computes RΓ(X,K). Taking cohomology and [F1] proves the derived Cech assertion.

2.1F1F2F4step 1.2∎

For a bounded-below representative K′ with acyclic terms on every intersection, the first hypercohomology spectral sequence [F2] collapses to the ordinary section complex on each intersection. Replacing the derived columns in step 1.2 by these section complexes therefore preserves the total cohomology; the finite cover filtration again ensures convergence. Affine quasi-coherent terms are one sufficient case of the required acyclicity by [F4]. Finally, when the local deformation data are represented by the indicated truncation of derived Hom, their degree-one descent cocycles and degree-two obstruction cocycles have precisely the total cohomology just computed. This last application requires the stated representation of local deformation data; cohomology comparison by itself does not construct that representation.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

91 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