Cover-preserving and continuous functors between sites. #
We define the notion of continuous functor between sites: these are functors G
such that
the precomposition with G.op
preserves sheaves of types (and actually sheaves in any
category).
In order to show that a functor is continuous, we define cover-preserving functors between sites as functors that push covering sieves to covering sieves. Then, a cover-preserving and compatible-preserving functor is continuous.
Main definitions #
CategoryTheory.Functor.IsContinuous
: a functor between sites is continuous if the precomposition with this functor preserves sheaves.CategoryTheory.CoverPreserving
: a functor between sites is cover-preserving if it pushes covering sieves to covering sievesCategoryTheory.CompatiblePreserving
: a functor between sites is compatible-preserving if it pushes compatible families of elements to compatible families.CategoryTheory.Functor.sheafPushforwardContinuous
: the induced functorSheaf K A ⥤ Sheaf J A
for a continuous functorG : (C, J) ⥤ (D, K)
. In case this is part of a morphism of sites, this would be understood as the pushforward functor even though it goes in the opposite direction as the functorG
.
Main results #
CategoryTheory.isContinuous_of_coverPreserving
: IfG : C ⥤ D
is cover-preserving and compatible-preserving, thenG
is a continuous functor, i.e.G.op ⋙ -
as a functor(Dᵒᵖ ⥤ A) ⥤ (Cᵒᵖ ⥤ A)
of presheaves maps sheaves to sheaves.
References #
- [Elephant]: Sketches of an Elephant, P. T. Johnstone: C2.3.
- https://stacks.math.columbia.edu/tag/00WU
A functor G : (C, J) ⥤ (D, K)
between sites is cover-preserving
if for all covering sieves R
in C
, R.functorPushforward G
is a covering sieve in D
.
- cover_preserve : ∀ {U : C} {S : CategoryTheory.Sieve U}, S ∈ J.sieves U → CategoryTheory.Sieve.functorPushforward G S ∈ K.sieves (G.toPrefunctor.obj U)
Instances For
The identity functor on a site is cover-preserving.
The composition of two cover-preserving functors is cover-preserving.
A functor G : (C, J) ⥤ (D, K)
between sites is called compatible preserving if for each
compatible family of elements at C
and valued in G.op ⋙ ℱ
, and each commuting diagram
f₁ ≫ G.map g₁ = f₂ ≫ G.map g₂
, x g₁
and x g₂
coincide when restricted via fᵢ
.
This is actually stronger than merely preserving compatible families because of the definition of
functorPushforward
used.
- compatible : ∀ (ℱ : CategoryTheory.SheafOfTypes K) {Z : C} {T : CategoryTheory.Presieve Z} {x : CategoryTheory.Presieve.FamilyOfElements (CategoryTheory.Functor.comp G.op ℱ.val) T}, CategoryTheory.Presieve.FamilyOfElements.Compatible x → ∀ {Y₁ Y₂ : C} {X : D} (f₁ : X ⟶ G.toPrefunctor.obj Y₁) (f₂ : X ⟶ G.toPrefunctor.obj Y₂) {g₁ : Y₁ ⟶ Z} {g₂ : Y₂ ⟶ Z} (hg₁ : T g₁) (hg₂ : T g₂), CategoryTheory.CategoryStruct.comp f₁ (G.toPrefunctor.map g₁) = CategoryTheory.CategoryStruct.comp f₂ (G.toPrefunctor.map g₂) → ℱ.val.toPrefunctor.map f₁.op (x g₁ hg₁) = ℱ.val.toPrefunctor.map f₂.op (x g₂ hg₂)
Instances For
CompatiblePreserving
functors indeed preserve compatible families.
A functor F
is continuous if the precomposition with F.op
sends sheaves of Type w
to sheaves.
- op_comp_isSheafOfTypes : ∀ (G : CategoryTheory.SheafOfTypes K), CategoryTheory.Presieve.IsSheaf J (CategoryTheory.Functor.comp F.op G.val)
Instances
Equations
- (_ : CategoryTheory.Functor.IsContinuous (CategoryTheory.Functor.id C) J J) = (_ : CategoryTheory.Functor.IsContinuous (CategoryTheory.Functor.id C) J J)
If F
is cover-preserving and compatible-preserving,
then F
is a continuous functor.
This result is basically
The induced functor Sheaf K A ⥤ Sheaf J A
given by G.op ⋙ _
if G
is a continuous functor.
Equations
- One or more equations did not get rendered due to their size.