Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Additive étale cohomology via an ordered affine Čech cover

Proved
AlgebraicGeometry.Scheme.smallEtale_additive_cohomology_equiv_orderedCech

by tomasz · Nov 19, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-geometryetale-cohomology

Let XXX be a separated scheme over a field KKK, and let U\mathcal UU be a finite ordered affine open cover of XXX. For each q≥0q\geq 0q≥0, there is a KKK-linear isomorphism

Hetq(X,Ga)≃Hˇq(U,OX).H^q_{\mathrm{et}}(X,\mathbf G_a)\simeq \check H^q(\mathcal U,\mathcal O_X).Hetq​(X,Ga​)≃Hˇq(U,OX​).

On the small étale site Ga\mathbf G_aGa​ assigns to each object its additive group of global functions. Its cohomology has the scalar action induced by multiplication on sections. On the right, the differential uses the alternating restriction maps on strictly increasing tuples of cover indices.

Preamble
import Definitions.Def_AlgebraicGeometry_SmallEtaleAdditive
import Definitions.Def_AlgebraicGeometry_OrderedAffineCoverCech

set_option autoImplicit false

open AlgebraicGeometry CategoryTheory

universe u
Formal statement
theorem AlgebraicGeometry.Scheme.smallEtale_additive_cohomology_equiv_orderedCech
    (K : Type u) [Field K] {X : Scheme.{u}} (π : X ⟶ Spec (.of K)) [IsSeparated π]
    (U : X.OrderedAffineCover) :
    letI : ∀ q : ℕ, Module K ((SmallEtaleAdditive.sheaf X).H q) :=
      fun q => SmallEtaleAdditive.cohomologyModule π q
    Nonempty (((SmallEtaleAdditive.sheaf X).H 0) ≃ₗ[K] (OModulePresheaf.unit π).H0 U) ∧
      ∀ q : ℕ, Nonempty (((SmallEtaleAdditive.sheaf X).H (q + 1)) ≃ₗ[K]
        (OModulePresheaf.unit π).HSucc U q) := by sorry
Source
Stacks Project, Theorem 59.22.4 (étale–Zariski comparison), https://stacks.math.columbia.edu/tag/03P2, and Cohomology of Schemes, Lemma 30.2.6 (separated affine-cover comparison), cited in its proof.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me