Refining quasi-coherent data #
Quasi-coherent data for a sheaf of modules M consists of a covering family X i together with
a presentation of each restriction M.over (X i). Given a second covering family Y j refining
the first one, meaning that each Y j comes with an arrow to some X i, restricting the
presentations along these arrows gives quasi-coherent data for M on the family Y j.
Restriction along an arrow f : Y ⟶ X is Mathlib's SheafOfModules.overMap. On a site with
pullbacks it is a left adjoint, so it maps presentations to presentations
(SheafOfModules.Presentation.map); SheafOfModules.overFunctorMap identifies the restriction of
M.over X with M.over Y.
The same restriction applies to local generators (SheafOfModules.LocalGeneratorsData), and it
preserves local freeness and finiteness of the generating families. Both restriction along an
arrow and the transport of the next paragraph are instances of one construction,
SheafOfModules.GeneratingSections.mapIso, from the lower-level generating-sections transport
module: generating sections are carried along a colimit-preserving functor by Mathlib's
SheafOfModules.GeneratingSections.map and then read through an isomorphism by
SheafOfModules.GeneratingSections.equivOfIso.
This lets two quasi-coherent sheaves be presented on a common refinement of their covers, which is how the tensor product and the biproduct of quasi-coherent sheaves are shown to be quasi-coherent.
Restricting a presentation preserves finiteness, and it preserves presentations whose generating morphism is an isomorphism, that is, presentations exhibiting a free sheaf. Hence refining finite quasi-coherent data or locally free data gives data of the same kind.
Main declarations #
SheafOfModules.QuasicoherentData.ofRefinement;SheafOfModules.QuasicoherentData.isIso_ofRefinement_presentation_generators_π: refinement preserves presentations with an invertible generating morphism;SheafOfModules.LocalGeneratorsData.ofRefinement.
Generating sections pushed forward along an isomorphism exhibit a free sheaf if the original ones do.
A presentation transported along an isomorphism has an invertible generating morphism if the original one does.
The image of a finite presentation under a colimit-preserving functor is finite.
The image under a colimit-preserving functor of a presentation with an invertible generating morphism has an invertible generating morphism.
Quasi-coherent data for M transported to a refining covering family Y: each Y i maps to
the member q.X (index i) of the original cover by map i, and the presentation of
M.over (Y i) is the restriction of the presentation of M.over (q.X (index i)) along
map i.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Local generators for M transported to a refining covering family Y: each Y i maps to the
member q.X (index i) of the original cover by map i, and the generators of M.over (Y i) are
the restrictions of the generators of M.over (q.X (index i)) along map i.
Equations
- q.ofRefinement Y coversTop index map = { I := I, X := Y, coversTop := coversTop, generators := fun (i : I) => (q.generators (index i)).restrict (map i) }
Instances For
Restricting locally free data to a refinement gives locally free data.
Restricting local generators of finite type to a refinement gives local generators of finite type.
Refining quasi-coherent data preserves presentations with an invertible generating morphism.
Refining finite quasi-coherent data gives finite presentations.
Refining finite quasi-coherent data gives finite quasi-coherent data.