Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Pullback of sections is bijective when the structure map is an isomorphism

Proved
OAI.MaximalSeshadri.Geometry.LineBundle.pullbackSection_bijective

by wurtle · Nov 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

maximal-seshadrioai-math

Let f:X→Yf:X\to Yf:X→Y be a morphism such that the map OY→f∗OX\mathcal O_Y\to f_*\mathcal O_XOY​→f∗​OX​ (IdealModule.structureMap f) is an isomorphism. For every line bundle LLL on YYY the map H0(Y,L)→H0(X,f∗L)H^0(Y,L)\to H^0(X,f^*L)H0(Y,L)→H0(X,f∗L) given by pullbackSection f is a bijection.

Formalization Note The statement is verbatim from OpenAI's Lean development, with Definitions files of this development imported in place of the upstream modules; these are supporting code for the statement.

Preamble
import Mathlib
import Definitions.Def_MaximalSeshadriConstants
import Definitions.Def_SeshadriPrelim6

namespace OAI

section

namespace MaximalSeshadri.Geometry
noncomputable section
open AlgebraicGeometry CategoryTheory TopologicalSpace
open MaximalSeshadri.Frames

variable {X Y : Scheme.{0}} (f : X ⟶ Y)

Formal statement
theorem LineBundle.pullbackSection_bijective [IsIso (IdealModule.structureMap f)]
    (L : LineBundle Y) : Function.Bijective (pullbackSection f (M := L.sheaf)) := by
  sorry

end
end MaximalSeshadri.Geometry
end
end OAI
Source
OpenAI, Maximal Seshadri constants on arbitrary polarized surfaces, September 23, 2026, https://github.com/openai/math (paper: preprints/Maximal-Seshadri-Constants-on-Arbitrary-Polarized-Surfaces-September-23-2026/main.pdf; Lean: lean/OAI/AlgebraicGeometry/Seshadri, Apache License 2.0); Lean declaration `OAI.MaximalSeshadri.Geometry.LineBundle.pullbackSection_bijective`, https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/lean/OAI/AlgebraicGeometry/Seshadri/Blowup/BlowupLineDescent.lean#L59

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me