This paper introduces a new framework for modulus sheaves with transfers, extending Voevodsky's theory, and lays the groundwork for the broader development of motives with modulus.
Contribution
It develops a foundational theory of modulus sheaves with transfers, generalizing existing sheaf theories for use in motives with modulus.
Findings
01
Established a new theory of modulus sheaves with transfers
02
Generalized Voevodsky's sheaves with transfers
03
Laid groundwork for motives with modulus
Abstract
We develop a theory of modulus sheaves with transfers, which generalizes Voevodsky's theory of sheaves with transfers. This paper and its sequel are foundational for the theory of motives with modulus, which is developed in [KMSY20].
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
Motives with modulus, I:
Modulus sheaves with transfers for non-proper modulus pairs
Bruno Kahn
IMJ-PRG, Case 247, 4 place Jussieu, 75252 Paris Cedex 05, France
scAbstract. scWe develop a theory of modulus sheaves with transfers, which generalizes
Voevodsky’s theory of sheaves with transfers.
This paper and its sequel are foundational for the theory of motives with modulus, which is developed in [KMSY20].
scKeywords. modulus pair; presheaf with transfers; cd-structure
scMotifs avec modules, I : faisceaux avec transferts pour les couples modulaires non propres
scRésumé. scNous présentons une théorie de faisceaux modulaires avec transferts qui généralise la théorie des faisceaux avec transferts de Voevodsky.
Cet article et celui qui lui fait suite sont les fondements d’une théorie de motifs avec modules, qui est développée dans ****[KMSY20]****.
cNovember 26, 2020Received by the Editors on December 17,
Accepted on December 19, 2020.
IMJ-PRG, Case 247, 4 place Jussieu, 75252 Paris Cedex 05, France
scThe first author acknowledges the support of Agence Nationale de la Recherche (ANR) under reference ANR-12-BL01-0005.
The work of the second author is supported in part by Fondation des Sciences Mathématiques de Paris (FSMP), and in part by RIKEN Special Postdoctoral Researchers (SPDR) Program and RIKEN Interdisciplinary Theoretical and Mathematical Sciences (iTHEMS) Program.
The third author is supported by JSPS KAKENHI Grant (15H03606).
The fourth author is supported by JSPS KAKENHI Grant (15K04773).
The aim of this paper is to lay a foundation for a theory of
motives with modulus,
which will be completed in [KMSY20],
generalizing Voevodsky’s theory of motives.
Voevodsky’s construction is based on A1-invariance. It captures many important invariants such as Bloch’s higher Chow groups, but not their natural generalisations like additive Chow groups [BE03, Par09] or higher Chow groups with modulus [BS19]. Our basic motivation is to build a theory that captures such non A1-invariant phenomena, as an extension of [KSY16].
Let Sm be the category of smooth separated schemes of finite type
over a field k.
Voevodsky’s construction starts from an additive category Cor, whose objects are those of Sm and morphisms are finite correspondences.
We define PST as the category of
additive presheaves of abelian groups on Cor
(i.e. functors Cor→Ab that commute with finite sums).
Let NST⊂PST be the full subcategory of
those objects F∈PST whose restrictions FX to
XNis is a sheaf for any X∈Sm,
where XNis denotes the small Nisnevich site of X,
that is, the category of all étale schemes over X
equipped with the Nisnevich topology.
Objects of NST are called (Nisnevich) sheaves with transfers.
For F∈NST, we write
[TABLE]
The following result of Voevodsky [Voe00, Theorem 3.1.4] plays a fundamental rôle in his theory of motives.
Theorem 1** (Voevodsky).**
The following assertions hold.
(1)
The inclusion NST→PST has an exact left adjoint aNisV such that for any F∈PST and X∈Sm,
(aNisVF)X is the Nisnevich sheafication of
FX as a presheaf on XNis. In particular NST is a Grothendieck abelian category.
(2)
For X∈Sm, let Ztr(X)=Cor(−,X)∈PST be the associated representable additive presheaf. Then we have Ztr(X)∈NST and there is a canonical
isomorphism for any i≥0 and F∈NST:
[TABLE]
Our basic principle for generalizing Voevodsky’s theory of sheaves with transfers is that the category Cor should be replaced by the larger category of modulus pairs, MCor: objects are pairs
M=(M,M∞) consisting of a separated k-scheme of finite type M and an effective (possibly empty) Cartier divisor M∞ on it such that the complement
M∘:=M∖M∞ is smooth over k. The group MCor(M,N) of morphisms is defined as the subgroup of Cor(M∘,N∘)
consisting of finite correspondences between Mo and No whose closures in
M×kN are proper111Here we stress that we do not assume it is finite over M. over M
and satisfy certain admissibility conditions with respect to M∞ and N∞
(see Definition 1.1.1).
Let MCor⊂MCor be the full subcategory consisting of objects (M,M∞) with M proper over k.
We then define MPST (resp. MPST) as the category of additive presheaves of abelian groups
on MCor (resp. MCor). We have a functor
[TABLE]
and two pairs of adjunctions
[TABLE]
where τ∗ is induced by the inclusion τ:MCor→MCor and
τ! is its left Kan extension, and ω∗ is induced by ω and ω! is its left Kan extension
(see Propositions 2.4.1 and 2.2.1).
The main aim of this paper is to develop a sheaf theory on MCor
generalizing Voevodsky’s theory.
For M=(M,M∞)∈MCor and F∈MPST,
let FM be the presheaf on MNis which associates F(U,M∞×MU) to an étale map U→M.
Definition 1**.**
We define MNST to be
the full subcategory of MPST of objects F such that FM is a Nisnevich sheaf on M for any M∈MCor.
For F∈MPST and M=(M,M∞), let (FM)Nis be the Nisnevich sheafication of the preshseaf FM on MNis.
Let Σfin be the subcategory of MCor
which has the same objects as MCor
and such that a morphism f∈MCor(M,N)
belongs to Σfin if and only if
fo∈Cor(Mo,No) is the graph of an isomorphism
Mo∼No in Sm
that extends to a proper morphism f:M→N
of k-schemes such that M∞=f∗N∞.
(See Theorems 4.5.5, 4.6.3
and Lemma 4.5.3.)
Theorem 2**.**
The following assertions hold.
(1)
The inclusion MNST→MPST has an exact left adjoint aNis
such that
[TABLE]
for every F∈MPST and M∈MCor.
In particular MNST is a Grothendieck abelian category.
(See §A.1 for the comma category
Σfin↓M.)
(2)
For M∈MCor, let Ztr(M)=MCor(−,M)∈MPST be the associated representable presheaf. Then we have Ztr(M)∈MNST and there is a canonical isomorphism for any i≥0 and F∈MNST:
[TABLE]
Remark 1*.*
Theorem 2 (2) describes
the extension groups in MNST
in terms of classical cohomology.
It also implies that the formation
[TABLE]
is contravariantly functorial for morphisms in MCor, which does not follow
immediately from the definition.
The preprint [KSY15] contained a mistake, pointed out by Joseph Ayoub: namely, Proposition 3.5.3 of loc. cit. is false. Theorem 2 (1) shows that the only false thing in that proposition is that the functor bNis of loc. cit. is not exact, but only left exact (see Proposition 4.5.4 of the present paper.) This weakens [KSY15, Proposition 3.6.2] into Theorem 2 (2); see however Question 1 below. What we gain in the present correction is that the notion of sheaf, which was artificially developed in [KSY15] for MCor, corresponds now to a genuine Grothendieck topology.
Another proposition incorrectly proven in [KSY15] was Proposition 3.7.3. In Part II of this work [KMSY21], we correct this proof and recover the proposition in full, hence get a good sheaf theory also for proper modulus pairs.
This allows us to develop the categories of motives again in [KMSY20].
In the last part of this introduction, we raise the following question.
Its affirmative answer would simplify the right hand side of
Theorem 2 (2)
under two additional conditions (i) and (ii) below.
(These conditions turn out to be essential in [Sai20].)
Question 1*.*
Assume that F∈MNST satisfies the following conditions:
(i)
F is □-invariant, namely, for any M=(M,M∞)∈MCor the map F(M)→F(M⊗□) is an isomorphism, where
[TABLE]
(ii)
F lies in the essential image of τ!:MPST→MPST.
Then, is the map
[TABLE]
an isomorphism for M∈MCorls?
Here MCorls denotes the full subcategory of MCor consisting of the objects M=(M,M∞) such that M∈Sm and ∣M∞∣ is a simple normal crossing divisor on M.
If ch(k)=0, by resolution of marked ideals ([BM08, the case d=1 of Theorem 1.3]),
the above question is reduced to the following.
Question 2*.*
Let the assumptions be as in Question 1 and
M=(M,M∞)∈MCorls.
Let Z⊂M∞ be a regular closed subscheme such that,
for any point x of Z, there exists a system z1,…,zd of regular parameters of M at x (with d=dimxM) satisfying the following conditions:
•
Locally at x, Z={z1=⋯=zr=0} for
r=codimMZ.
•
Locally at x, ∣M∞∣={\prodop\displaylimitsj∈Jzj=0}
for some J⊂{1,…,r}.
Consider π:N=BlZ(M)→M and N∞=N×MM∞.
Then, is the map
[TABLE]
an isomorphism?
Acknowledgements
Part of this work was done while the authors stayed at the university of Regensburg supported by the SFB grant “Higher Invariants". Another part was done in a Research in trio in CIRM, Luminy. Yet another part was done while the fourth author was visiting IMJ-PRG supported by Fondation des Sciences Mathématiques de Paris. We are grateful to the support and hospitality received in all places.
We thank Ofer Gabber and Michel Raynaud for their help with Lemma 1.6.1, and Kay Rülling for pointing out an error and correcting Definition 1.8.1.
We are very grateful to Joseph Ayoub for pointing out
a flaw on the computation of the sheafification functor aNis
and on the non-exactness of the functor bNis
in the earlier version. The authors believe that the whole theory has been deepened by the effort to fix it.
We also thank the referees for a careful reading and many useful comments.
Finally, the influence of Voevodsky’s ideas is all-pervasive, as will be evident when reading this paper.
Notation and conventions
In the whole paper we fix a base field k.
Let Sm be the category of separated smooth schemes of finite type over k,
and let Sch be the category of separated schemes of finite type over k.
We write Cor for Voevodsky’s
category of finite correspondences [Voe00].
1. Modulus pairs and admissible correspondences
1.1. Admissible correspondences
Definition 1.1.1**.**
(1)
A modulus pairM
consists of M∈Sch
and an effective Cartier divisor M∞⊆M
such that the open subset Mo:=M−∣M∞∣ is smooth over k. (The case ∣M∞∣=∅ is allowed.) We say that M is proper if M is proper over k.
We write
M=(M,M∞),
since M is completely determined by the pair,
although
we regard Mo as the main part of M.
We call M the ambient space of M and Mo the interior of M.
2. (2)
Let M1,M2 be modulus pairs.
Let Z∈Cor(M1o,M2o) be an elementary correspondence
(i.e. an integral closed subscheme of M1o×M2o
which is finite and surjective over an irreducible component of M1o).
We write ZN for the normalization
of the closure Z of Z in M1×M2
and pi:ZN→Mi
for the canonical morphisms for i=1,2.
We say Z is admissible for (M1,M2)
if p1∗M1∞≥p2∗M2∞.
An element of Cor(M1o,M2o) is called admissible
if all of its irreducible components are admissible.
We write Coradm(M1,M2) for the subgroup of Cor(M1o,M2o) consisting of all admissible correspondences.
Remarks 1.1.2*.*
(1)
In [KSY16, Definition 2.1.1], we used a different notion of modulus pair, where M is supposed proper, Mo smooth quasi-affine and
M∞ is any closed subscheme of M.
Definition 1.1.1 (1) is the right one for the present work.
Definition 1.1.1 (2) is the same as [KSY16, Definition 2.6.1], mutatis mutandis.
An analogous condition was considered much earlier
in the context of the additive Chow groups
(see, e.g. [BE03, (6.4)], [Par09, Definition 2.2], [Rül07, Definition 3.1]).
2. (2)
In the first version of this paper,
we imposed the condition that M is locally integral;
it is now removed.
The main reason for this change is that
this condition is not stable under products or extension of the base field. The next remark shows that this removal is reasonable (see also Remark 1.3.8).
3. (3)
Let M be a modulus pair.
Then Mo is dense in M, since the Cartier divisor M∞ is everywhere of codimension 1. Moreover, M is reduced.
(In particular, M has no embedded component.)
Indeed, take x∈M
and let f∈OM,x be a local equation for M∞.
Then f is not a zero-divisor (since M∞ is Cartier),
and hence
OM,x→OM,x[1/f] is injective,
but OM,x[1/f] is reduced as Mo is smooth. In particular, M is integral if Mo is.
4. (4)
Let M be a modulus pair, and let f:M1→M be a morphism such that f(T)\nsubset∣M∞∣ for any irreducible component T of M1 and M1o:=M1−∣f∗M∞∣ is smooth. Then M1=(M1,f∗M∞) defines a modulus pair.
We call it the minimal modulus structure induced by f. We shall use this construction several times.
Also, f defines a minimal morphism f:M1→M in the sense of Definition 1.3.4 below.
5. (5)
If Z is an admissible elementary correspondence as in Definition 1.1.1 (2), then
[TABLE]
since ZN→Z is surjective. On the other hand,
the inequality
(M1∞×M2)∣Z≥(M1×M2∞)∣Z
may fail.
As an example, let C be the affine cusp curve Speck[x,y]/(x2−y3). Its normalization is A1, via the morphism t↦(t3,t2). Let M1=(C,(x)) and M2=(C,(y)). Then 1C defines an admissible correspondence M1→M2,
even though (x)≥(y) does not hold on C.
The following lemma will play a key rôle:
Lemma 1.1.3**.**
Let X∈Sch and let X be an open dense subscheme of X. Assume that X∈Sm and that X−X is the support of a Cartier divisor. Then for any modulus pair N
we have
[TABLE]
*where M ranges over all modulus pairs
such that M=X and Mo=X.
(Note that by definition
we have Coradm(M,N)⊂Cor(X,No).)
*
Proof.
This is proven in [KSY16, Lemma 2.6.2]. In loc. cit.X and No are assumed to be quasi-affine,
and X and N proper and normal (see Remark 1.1.2).
But these assumptions are not used in the proof. (Nor is the assumption on Cartier divisors, but the latter is essential for the proof of Proposition 1.2.4 below.)
∎
1.2. Composition
To discuss composability of admissible correspondences,
we need the following lemma of
Krishna and Park [KP12, Lemma 2.2].
Lemma 1.2.1**.**
Let f:X→Y be a surjective morphism of normal integral schemes,
and let D,D′ be two Cartier divisors on Y.
If f∗D′≤f∗D, then D′≤D.
We also need the following “containment lemma” from [KP12, Proposition 2.4], [BS19, Lemma 2.1], [Miy19, Lemma 2.4].
We provide a proof for self-containedness.
Lemma 1.2.2**.**
Let M=(M,M∞) be a modulus pair.
Let V′⊂V⊂M∘=M−∣M∞∣ be two integral closed subschemes.
Let V and V′ be their closures in M and VN→V, V′N→V′ the normalizations.
If M∞∣VN is effective, so is M∞∣V′N.
Proof.
Set Z:=VN×VV′ and consider the following commutative diagram:
[TABLE]
Here, Zγ⊂Z is an irreducible component
of Z such that the composite map
[TABLE]
is finite surjective. To see that such a Zγ exists, it suffices to note that VN→V is finite surjective, hence so is its base change Z→V′ (recall that for any scheme S of finite type over k, the normalization SN→S is a finite surjective morphism). Then ZγN is also irreducible.
Since ZγN→V′ is dominant, the vertical map h on the left exists by the universal property of normalization, and is finite surjective.
Note that we can pullback the Cartier divisor M∞ to any scheme except for Z in the diagram, since none of their irreducible components maps into the support ∣M∞∣⊂M.
Since the pullback of an effective Cartier divisor is effective, the assumption that M∞∣VN is effective implies that
[TABLE]
is effective. By Lemma 1.2.1, M∞∣V′N is effective since h is surjective.
This finishes the proof.
∎
Definition 1.2.3**.**
Let M1,M2,M3 be three modulus pairs,
and let us consider α∈Coradm(M1,M2) and β∈Coradm(M2,M3).
We say that α and β are composable if their composition βα in Cor(M1o,M3o) is admissible.
Proposition 1.2.4**.**
With the above notations, assume α and β are integral and let αˉ and βˉ be their closures in M1×M2 and M2×M3 respectively. Then
α and β are composable provided the projection αˉ×M2βˉ→M1×M3 is proper. This happens in the following cases:
(i)
αˉ→M1* is proper.*
(ii)
βˉ→M3* is proper.*
(iii)
M2* is proper over k.*
Proof.
Note that α×M2oβ is a closed subscheme of
(M1o×M2o)×M2o(M2o×M3o)=M1o×M2o×M3o; we have
∣βα∣=∣p13∗(α×M2oβ)∣
where p13:M1o×M2o×M3o→M1o×M3o is the projection. Let γ be a component of α×M2oβ.
We have a commutative diagram
[TABLE]
where
pij:M1×M2×M3→Mi×Mj denotes the projection,
δ=p13(γ),
and ˉ denotes closure.
The hypothesis implies that γˉ→δˉ is proper surjective.
The same holds for πγδN
appearing in
the second of the two other commutative diagrams:
[TABLE]
where N means normalisation. (Note that πγα and πγβ need not extend to the normalisations, as they need not be dominant.) We have the admissibility conditions for α and β:
[TABLE]
Applying222To apply this lemma, factor πγα and πγβ into dominant morphisms followed by closed immersions. Lemma 1.2.2, we get inequalities
[TABLE]
which implies
by the right half of the above diagram
[TABLE]
hence φδ∗(M1×M3∞)≤φδ∗(M1∞×M3) by Lemma 1.2.1.
Finally,
one trivially checks that (i) or (ii) implies that
the projection α×M2β→M1×M3 is proper,
and that (iii) implies both of (i) and (ii).
∎
Example 1.2.5*.*
Let M1=M3=P1, M2=A1, Mio=A1, M1∞=∞, M2∞=0, M3∞=2⋅∞, and α=β= graph of the identity on A1. Then α and β are admissible but β∘α is not admissible
because ∞≥2⋅∞ does not hold.
(Note that
neither of α=α or β=β
is proper over P1.)
Definition 1.2.6**.**
Let M,N be two modulus pairs. A correspondence α∈Cor(Mo,No) is left proper (relatively to M,N) if the closures of all components of α are proper over M; this is automatic if N is proper.
Proposition 1.2.7**.**
Let M1,M2,M3 be three modulus pairs and let α∈Cor(M1o,M2o), β∈Cor(M2o,M3o) be left proper. Then βα is left proper.
Proof.
We may assume α and β are irreducible.
The assumption on β means
β→M2 is proper,
hence so is its base change
α×M2β→α.
The assumption on α means
α→M1 is proper,
hence so is
α×M2β→M1
as a composition of proper morphisms.
This implies the left properness of βα,
since βα is
the image of α×M2β
in M1×M3.
∎
1.3. Categories of modulus pairs
Definition 1.3.1**.**
By Propositions 1.2.4 and 1.2.7, modulus pairs and left proper admissible correspondences define an additive category that we denote by MCor. We write MCor for the full subcategory of MCor whose objects are proper modulus pairs (see Definition 1.1.1 (1)).
In the context of modulus pairs, the category Sm and the graph functor Sm→Cor are replaced by the following:
Definition 1.3.2**.**
We write MSm for the category with the same objects as MCor, and a morphism of MSm(M1,M2) is given by a (scheme-theoretic) k-morphism f:M1o→M2o whose graph belongs to MCor(M1,M2). We write MSm for the full subcategory of MSm whose objects are proper modulus pairs.
We will need some variants of these categories.
Definition 1.3.3**.**
(1)
We write MCorfin for the subcategory of MCor with the same objects and the following condition on morphisms: α∈MCor(M,N) belongs to MCorfin(M,N) if and only if, for any component Z of α, the projection Z→M is finite,
where Z is the closure of Z in M×N.
The same argument as in the proof of Proposition 1.2.7 shows that MCorfin is indeed a subcategory of MCor.
We write MCorfin for the full subcategory of MCor whose objects are proper modulus pairs.
2. (2)
We write MSmfin for the subcategory of MSm with the same objects and such that a morphism f:M→N belongs to MSmfin if and only if
fo:Mo→No extends to a k-morphism f:M→N.
Such extension f is unique
because Mo is dense in the reduced scheme M
and N is separated
([Har77, Chapter II, Exercise 4.2]).
This yields a forgetful functor MSmfin→Sch, which sends M to M.
We write MSmfin for the full subcategory of MSm whose objects are proper modulus pairs.
3. (3)
We write
[TABLE]
for the functors which are the identity on objects
and which carry a morphism f to the graph of fo.
Let f:M→N be a morphism in MSmfin. Since f(Mo)⊆No, none of the images of the generic points of the irreducible components of M is contained in ∣N∞∣, hence the pullback of the Cartier divisor f∗N∞ is well-defined. For ease of notation, we simply write it f∗N∞.
Definition 1.3.4**.**
A morphism f:M→N in MSmfin is minimal if we have f∗N∞=M∞.
Remark 1.3.5*.*
We remark the following.
(1)
Assume that M is normal.
Then Zariski’s connectedness theorem implies
that for any N
[TABLE]
(Indeed, given an elementary correspondence
belonging to the left hand side,
its closure in M×N
is birational and finite over an irreducible component of M,
but such a morphism is an isomorphism
if M is normal by [EGA3, corollaire 4.4.9]).
If fo:Mo→No extends to a morphism between ambient spaces f:M→N, then
the graph of fo is admissible if and only if we have M∞≥f∗N∞.
2. (2)
For M∈MSmfin,
set MN:=(MN,M∞∣MN)
where p:MN→M is the normalization
and M∞∣MN is the pull-back of M∞
to MN.
Then p:MN→M is an isomorphism in MCorfin and MSm (but not in MSmfin in general).
3. (3)
Let M=(M,M∞) and N=(N,N∞) be two modulus pairs and let Z⊂M×N be an integral closed subscheme which is finite and surjective over an irreducible component of M, such that Z\nsubsetM×N∞ and that M∞∣ZN≥N∞∣ZN, where ZN is the normalization of Z. Then Z=Z∩(Mo×N) belongs to Cor(Mo,No) and its closure in M×N is Z: this follows from Remark 1.1.2 (4).
4. (4)
For any morphism f:M→N in MSm, there exists a morphism M′→M in MSmfin which is invertible in MSm such that the induced morphism M′→N is in MSmfin.
More generally, we have the following lemma.
Lemma 1.3.6** (The graph trick).**
Let f:M→N be a morphism in MSm. Then there exists a minimal morphism p:M1→M in MSmfin
such that it is invertible in MSm and the composite f∘p:M1→M→N is a morphism in MSmfin.
Moreover, if fo:Mo→No extends to a morphism U→N for an open subset U⊂M, then we can choose M1 such that M1→M is an isomorphism over U (note that we can always take U=Mo).
Proof.
Let be the graph of the morphism U→N, and let Γ be its closure in M×N.
Then we have natural projections p1:Γ→M and p2:Γ→N.
Since we have Γ≅U, Lemma 1.3.7 below implies that p1 is an isomorphism over U and we have p1−1(U)=Γ.
Defining M1:=(Γ,p1∗M∞), the morphism p1 induces a morphism p1:M1→M in MSmfin such that f∘p1:M1→M→N comes from MSmfin defined by p2.
Also note that Γ→M is proper since f is,
which implies that p1:M1→M is an isomorphism in MSm. This finishes the proof.
∎
Lemma 1.3.7** (No extra fibre lemma).**
Let f:X→Y be a separated morphism of schemes, and let U⊂X be an open dense subset.
Assume that the image f(U) of U is open in Y, and the induced morphism U→f(U) is proper (e.g., an isomorphism).
Then, we have f−1(f(U))=U.
Proof.
Consider the commutative diagram
[TABLE]
where all the horizontal arrows are open immersions, the square is cartesian and the two vertical morphisms are separated.
The triangle diagram on the left implies that j is proper
([Har77, Chapter II, Corollary 4.8]),
hence it is a closed (and open) immersion.
Since U is dense in X, it is dense in f−1(f(U)) as well,
hence the conclusion.
∎
Remark 1.3.8*.*
Let M∈MCorfin. Assume that Mo=M1o\coprodop\displaylimitsM2o; let Mi be the closure of Mio in M and Mi∞ be the pull-back of M∞ to Mi. Then Mi=(Mi,Mi∞) are modulus pairs, the inclusions Mio↪Mo yield morphisms Mi→M in MSmfin, and the induced morphism in MCorfin
[TABLE]
is an isomorphism in MCorfin.
The proof is easy and left to the reader.
This remark may help in reducing some reasonings to the case where Mo is irreducible.
1.4. The functors (−)(n)
Definition 1.4.1**.**
Let n≥1 and M=(M,M∞)∈MCor. We write
[TABLE]
This defines an endofunctor of MCor. These come with natural transformations
[TABLE]
Lemma 1.4.2**.**
The functor (−)(n) is fully faithful.
Proof.
This follows from the definition and the fact that
if A is an integral domain with quotient field K,
then a∈K is integral over A if and only if so is an.
∎
1.5. Changes of categories
We now have a basic diagram of additive categories and functors
[TABLE]
with
[TABLE]
All these functors are faithful, and τ is fully faithful; they “restrict” to analogous functors τs,ωs,ωs,λs between MSm, MSm and Sm. Note that ω∘(−)(n)=ω for any n.
Moreover:
Lemma 1.5.1**.**
We have ωτ=ω.
Moreover, λ is left adjoint to ω,
and the restriction of λ to Corprop(finite correspondences on smooth proper schemes over k)
is “right adjoint” to ω.
(i.e., Cor(ω(M),X)=MCor(M,λ(X))
for M∈MCor and X∈Corprop.) The same statements are valid for τs,ωs,ωs,λs when restricted to MSm, MSm and Sm.
Proof.
The first identity is obvious. For the adjointness, let X∈Cor, M∈MCor and α∈Cor(X,Mo) be an integral finite correspondence. Then α is closed in X×M, since it is finite over X and M is separated; it is evidently finite (hence proper) over X. It also satisfies q∗M∞=0 where q is the composition αN→α→Mo→M, because M∞∣Mo=0.
Therefore α∈MCor(λ(X),M).
For the second statement, assume X proper and let β∈Cor(Mo,X) be an integral finite correspondence. Then β is trivially admissible, and its closure in M×X is proper over M, so β∈MCor(M,λ(X)). The last claim is immediate.
∎
The following theorem is an important refinement of Lemma 1.5.1.
The proof starts from §1.7 and is completed in §1.8.
Theorem 1.5.2**.**
The functors
ω, τ, ωs and τs
have pro-left adjoints
ω!, τ!, ωs! and τs! (see §A.2).
General definitions and results
on pro-objects and pro-adjoints
are gathered in §§A.1 and A.2.
We shall freely use results from there.
1.6. The closure of a finite correspondence
We shall need the following result
for the proof of Theorem 1.5.2.
Lemma 1.6.1**.**
Let X be a Noetherian scheme, (πi:Zi→X)1≤i≤n a finite set of proper surjective morphisms with Zi integral, and let U⊆X be a normal open subset. Suppose that πi:πi−1(U)→U is finite for every i. Then there exists a proper birational morphism X′→X which is an isomorphism over U, such that the closure of πi−1(U) in Zi×XX′ is finite over X′ for every i.
Proof.
By induction, we reduce to n=1; then this follows from [RG71, Corollary 5.7.10] applied with (S,X,U)≡(X,Z1,U) and n=0 (note that a morphism is finite if and only if it is quasi-finite and proper, and that an admissible blow-up of an algebraic space is a scheme if the algebraic space happens to be a scheme).
∎
Theorem 1.6.2**.**
Let X,Y∈Sch. Let U be a normal dense open subscheme of X, and let α be a finite correspondence from U to Y. Suppose that the closure Z of Z in X×Y is proper over X for any component Z of α. Then there is a proper birational morphism X′→X which is an isomorphism over U, such that α extends to a finite correspondence from X′ to Y.
Proof.
Apply Lemma 1.6.1, noting that Z=Z×XU by [KSY16, Lemma 2.6.3].
∎
The following lemma also relies on [RG71]: it will be used several times in the sequel.
Lemma 1.6.3**.**
Let f:U→X be an étale morphism of quasi-compact and quasi-separated integral schemes. Let g:V→U be a proper birational morphism, T⊂U a closed subset such that
g is an isomorphism over U−T
and S the closure of f(T) in X.
Then there exists a closed subscheme Z⊂X supported in S such that
U×XBlZ(X)→U factors through V.
Proof.
The following argument is taken from the proof of [SV00, Proposition 5.9].
Noting V is étale over X−S, we apply the platification theorem [RG71, Corollary 5.7.11] to
V→X and conclude that there exists a closed subscheme Z supported in S such that the proper transform V′ of V under X′=BlZ(X)→X is flat over X′. By the construction the induced morphism φ:V′→U×XX′ is proper birational. On the other hand φ is flat since it becomes flat when composed with the étale morphism U×XX′→X′ ([Har77, Chapter II, Proposition 8.11 and Chapter III, Exercise 10.3]).
Hence it is an isomorphism. This proves the lemma since V′→U factors V→U.
∎
Identities, stability under composition: obvious.
2. (2)
Given a diagram in MCor
[TABLE]
with M2o≅M2′o,
Lemma 1.1.3 provides a
M1′′∈MCor such that M1′′o=M1o and α∈MCor(M1′′,M2′). We may choose M1′′ such that M1′′=M1. Then
M1′=(M1,M1′∞) with
any M1′∞ such that
M1′∞≥M1∞,
M1′∞≥M1′′∞
allows us to complete the square in MCor.
3. (3)
Given a diagram
[TABLE]
with M1,M2,M2′ as in (2) and such that sf=sg, the underlying correspondences to f and g are equal since the one underlying s is 1M2o. Hence f=g.
The above proof of (2) also shows that
we have
[TABLE]
for any M,N∈MCor.
Point b) now follows from a) and Corollary A.5.5, noting that ω is essentially surjective. Indeed, any smooth k-scheme X admits a compactification Xˉ by Nagata’s theorem; blowing up Xˉ−X, we then make it a Cartier divisor. The case of ωs is exactly parallel.
∎
Let
ω!:Cor→pro–MCor
be the pro-left adjoint of ω.
By Proposition A.6.2, we have for X∈Cor:
[TABLE]
and the same formula for the pro-left adjoint ωs! of ωs. Let us spell out the indexing set MSm(X) of these pro-objects, and refine them:
Definition 1.7.3**.**
(1)
For X∈Sm,
we define a subcategory MSm(X)
of MSm as follows.
The objects are those M∈MSm such that Mo=X.
Given M1,M2∈MSm(X),
we define
MSm(X)(M1,M2)
to be {1X}
if 1X belongs to MSm
and ∅ otherwise.
2. (2)
Let X∈Sm and
fix a compactification X such that X−X is the support of a Cartier divisor (for short, a Cartier compactification).
Define MSm(X!X)
to be the full subcategory
of MSm(X)
consisting of objects
M∈MSm(X)
such that M=X.
Lemma 1.7.4**.**
*a) For any X∈Sm and any Cartier compactification X, MSm(X) is a cofiltered ordered set, and MSm(X!X) is cofinal in MSm(X).
b) Let X∈Cor, and let M∈MSm(X). Then {M(n)}n≥1 defines a cofinal subcategory of MSm(X).*
Proof.
a) “Ordered” is obvious and “cofiltered” follows from Propositions 1.7.2 and A.5.2 a); the cofinality follows again from Lemma 1.1.3.
b) Let M=(X,X∞). By a) it suffices to show that (M(n))n≥1 defines a cofinal subcategory of MSm(X!X). If (X,Y)∈MSm(X!X), Y and X∞ both have support X−X, so there exists n>0 such that nX∞≥Y.
∎
Take M=(M,M∞)∈MSm.
Let Comp(M) be the category whose objects are pairs
(N,j) consisting of a modulus pair N=(N,N∞)∈MSm
equipped with a dense open immersion j:M↪N such that
N∞=MN∞+C
for some effective Cartier divisors MN∞,C on N
satisfying
N∖∣C∣=j(M)
and
j induces a minimal morphism M→N in the sense of Def. 1.3.4.
Note that for N∈Comp(M) we have j(Mo)=No and N is equipped with jN∈MSmfin(M,N)⊂MSm(M,N)
which is the graph of j∣Mo:Mo≅No.
For N1,N2∈Comp(M) we define
[TABLE]
Note that any γ as above induces an isomorphism N1o∼N2o in Sm.
Lemma 1.8.2**.**
The category
Comp(M) is a cofiltered ordered set.
Proof.
That it is ordered is obvious
as Comp(M)(N1,N2) has at most 1 element for any (N1,N2).
For “cofiltered”, we first show that Comp(M) is nonempty. For this, choose a compactification j0:M↪N0, with N0∈Sch proper. Let N1=Bl(N0−M)red(N0); then j0 lifts to j1:M↪N1
by the universality of the blowup [Har77, Chapter II, Proposition 7.14],
and N1−M is the support of an effective Cartier divisor C1.
Consider now the scheme-theoretic closure N1∞ of M∞ in N1,
and define N=BlN1∞(N1),
MN∞= pull-back of N1∞, C= pull-back of C1,
N∞=MN∞+C and N=(N,N∞):
then
j1 lifts to j:M↪N
(by the same reason as j0),
which defines an object of Comp(M).
Let N1 and N2 be two objects in Comp(M).
Let be the graph of the rational map N1⇢N2 given by 1Mo.
Then we have morphisms of schemes p:Γ→N1 and q:Γ→N2, and there exists a natural open immersion M→Γ.
Note that (Γ,p∗N1∞) and (Γ,q∗N2∞) are
objects of Comp(M).
Since (Γ,p∗N1∞) dominates N1 and (Γ,q∗N2∞) dominates N2, we are reduced to the case that N1 and
N2 have the same ambient space N.
Let C be the effective Cartier divisor on N such that ∣C∣=N−M, which exists since N1∈Comp(M).
Then for a sufficiently large n we have N1∞+nC≥N2∞
since N1∞∩M=N2∞∩M=M∞.
Therefore N3=(N,N1∞+nC) dominates both N1 and N2.
This finishes the proof.
∎
For M∈MCor and L∈MCor we have a natural map
[TABLE]
which maps a representative
αN∈MCor(N,L)
to αN∘jN.
We also have a natural map
for M,L′∈MCor
The maps and
are isomorphisms. In other words, the formula
[TABLE]
defines a pro-left adjoint to τ,
which is fully faithful.
Proof.
We start with .
Injectivity is obvious since both sides are subgroups of Cor(Mo,Lo).
We prove surjectivity.
Choose a dense open immersion j1:M↪N1 with N1 proper
such that N1−M is the support of an effective Cartier divisor C1.
Let M1∞ be the scheme-theoretic closure of M∞ in N1.
(This may not be Cartier.)
Let π:N2→N1 be the blowup with center in M1∞ and
put M2∞=M1∞×N1N2
and C2=C1×N1N2.
Note that M2∞ and C2 are effective Cartier divisors on N2.
By the universal property of the blowup [Har77, Chapter II, Proposition 7.14], j1 extends to an open immersion j2:M→N2 so that j1=πj2.
Then N2−Mo is the support of the Cartier divisor
N2∞:=M2∞+C2 so that
[TABLE]
Now the claim for follows from the following:
Claim 1.8.4*.*
For any α∈MCor(M,L), there exists an integer n>0 such that
α∈MCor((N2,M2∞+nC2),L).
Indeed we may assume α is an integral closed subscheme of Mo×Lo.
We have a commutative diagram
[TABLE]
where αN (resp. α1N, resp. α2N) is the normalization of the closure of
α⊂Mo×L0 in M×L (resp. N1×L, resp. N2×L), and
j1 and π are induced by j1:M→N1 and π:N2→N1 respectively.
Now the admissibility of α∈MCor(M,L) implies
[TABLE]
Since α1N−j1(αN) is supported on φα1−1(C1×L), this yields an inclusion of closed subschemes
[TABLE]
for a sufficiently large n>0. Applying π∗ to this inclusion, we get an inequality of Cartier divisors
[TABLE]
which proves the claim.
Next we prove that is an isomorphism.
Injectivity is obvious since both sides are subgroups of Cor(Lo,Mo).
We prove surjectivity. Take
[TABLE]
Then γ∈Cor(Lo,Mo) is such that any component δ⊂Lo×Mo of γ satisfies
the following condition:
take any (N,j)∈Comp(M)
and write
N∞=MN∞+C as in Definition 1.8.1.
Let δN be the normalization of the closure of δ in L×N
with the natural map φδ:δN→L×N.
Then we have
[TABLE]
for any integer n>0. Clearly this implies that ∣δ∣ does not intersect with L×∣C∣ so that
δ⊂L×M.
Since δ is proper over L by assumption,
this implies δ∈MCor(L,M) which proves the surjectivity of as desired.
∎
We come back to the proof of Theorem 1.5.2.
It remains to consider τs.
The natural maps
[TABLE]
are also bijective for any M,L′∈MCor and L∈MCor.
The proof is identical to Lemma 1.8.3.
In particular,
the inclusion functor
τs:MSm→MSm
admits a pro-left adjoint given by
[TABLE]
which commutes with the inclusions MSm↪MCor and MSm↪MCor.
This completes the proof of Theorem 1.5.2.
∎
1.9. More on MSmfin and MCorfin
Definition 1.9.1**.**
A morphism f:M→N in MSmfin is in Σfin if it is minimal (Definition 1.3.4), f:M→N is a proper morphism and fo is an isomorphism in Sm.
We write fin for the class of morphisms
in Σfin that belong to MSm.
In particular, we have
fin⊂Σ (see Definition 1.7.1)
and
Σfin↓M=fin↓M
for M∈MSm.
Let us consider the inclusion functors
[TABLE]
The following commutative diagram of categories
will become fundamental
(cf. (2.7.1)):
[TABLE]
Proposition 1.9.2**.**
a)
The class Σfin enjoys a calculus of right fractions within MSmfin and MCorfin.
b)
The functors bs and b
are
localisations having
left pro-adjoints bs! and b!.
They induce equivalences of categories
[TABLE]
c)
A morphism in MCorfin (resp. MSmfin)
is invertible in MCor (resp. MSm)
if and only if it belongs to Σfin.
A morphism f in MCor (resp. MSm) is an isomorphism
if and only if it can be written as
s=s1s2−1 for some s1,s2∈Σfin.
All statements hold for fin (without an underline) as well.
Proof.
a) Same as the proof of Proposition 1.7.2 a), except for (2): consider a diagram in MCorfin
[TABLE]
with f∈Σfin (in particular fo is an isomorphism).
By the properness of f, the finite correspondence αo:M1o→M2′o satisfies the hypothesis of Theorem 1.6.2. Applying this theorem, we find a proper birational morphism f′:M1′→M1 which is an isomorphism over M1o and such that αo defines a finite correspondence α′:M1′→M2′. If we define M1′∞=f′∗M1∞, then f′∈Σfin and α′∈MCorfin(M1′,M2′).
If α∈MSmfin(M1,M2), then α′ is not in MSmfin(M1′,M2′) in general (unless M1′ is normal, see Remark 1.3.5 (1)). However, write M1′′ for the closure of the graph of the rational map α′:M1′⇢M2′, and π for the projection M1′′→M1′: by hypothesis, π is finite birational. Define a modulus pair M1′′=(M1′′,M1′′∞) by putting M1′′∞:=π∗M1′∞. Then π defines a minimal morphism M1′′→M1′ in MSmfin, hence the morphism α′′:M1′′→M2′ determined by α′ is in MSmfin.
For b), all assertions are obvious
except for the equivalences,
for which
it suffices as in Corollary A.5.5 to show that for any M,N∈MCor, the obvious maps
[TABLE]
and the corresponding map for bs
are isomorphisms.
These maps are clearly injective, and its surjectivity follows again from Theorem 1.6.2.
It then follows from Proposition A.6.2
they have pro-left adjoints.
The first statement of c) is clear,
and the second follows from b).
The same proof works for fin.
∎
Corollary 1.9.3**.**
For any M∈MCor,
the category Σfin↓M is
cofiltered.
Let C be a category and let F:MCorfin→C, G:MSm→C be two functors whose restrictions to the common subcategory MSmfin are equal. Then (F,G) extends (uniquely) to a functor H:MCor→C.
Proof.
The hypothesis implies that F inverts the morphisms in Σfin; the conclusion now follows from Proposition 1.9.2 b).
∎
Corollary 1.9.5**.**
Any modulus pair in MSm is isomorphic to a modulus pair M in which M is normal. Under resolution of singularities, we may even choose M smooth and the support of M∞ to be a divisor with normal crossings.
Proof.
Let M0∈MSm. Consider a proper morphism π:M→M0 which is an isomorphism over M0o. Define M∞:=π∗M0∞. Then the induced morphism π:M→M0 of MSmfin is in Σfin, hence invertible in MSm. The corollary readily follows.
∎
We also have the following important lemma:
Lemma 1.9.6**.**
Let M,L,N∈MSm.
Let f:L→N be a minimal morphism in MSmfin
such that f:L→N is faithfully flat.
Then the diagram
[TABLE]
is cartesian.
The same holds when
MCor is replaced by MCorfin.
Proof.
As the second statement is proven in a
completely parallel way,
we only prove the first one.
Take α∈Cor(No,Mo)
such that (fo)∗(α)∈MCor(L,M).
We need to show α∈MCor(N,M).
We first reduce to the case where α is integral.
To do this, it suffices to show that
for two distinct integral finite correspondences
V,V′∈Cor(No,Mo), (fo)∗(V) and (fo)∗(V′) have no common component. For this, we may assume Mo and No integral.
By the injectivity of
Cor(No,Mo)→Cor(k(No),Mo),
this can be reduced to the case where No and Lo are fields,
and then the claim is obvious.
Now assume α is integral
and put β:=(fo)∗(α).
We have a commutative diagram
[TABLE]
Here
α (resp. β)
is the closure of α (resp. β)
in N×M (resp. L×M)
and αN (resp. βN)
is the normalization of
α (resp. β).
By hypothesis
a′ is proper and f is faithfully flat.
This implies that a is proper [SGA1, exposé VIII, corollaire 4.8].
We also have
[TABLE]
(the second equality by the minimality of f). Note that fN is surjective since f is. Hence Lemma 1.2.1 shows that
φα∗(N∞×M)≥φα∗(N×M∞),
and we are done.
∎
1.10. Fiber products and squarable morphisms
We need the following elementary lemma.
Lemma 1.10.1**.**
Let X be a scheme.
For two effective Cartier divisors D and E on X,
the following conditions are equivalent:
(1)
D×XE* is an effective Cartier divisor on X.*
2. (2)
There exist effective Cartier divisors
D′,E′ and F on X such that
D=D′+F,\leavevmodeE=E′+F and ∣D′∣∩∣E′∣=∅.
Moreover, the divisors D′,E′ and F satisfying the conditions in (2)
are uniquely determined by D and E.
Proof.
We may suppose X=SpecA is affine
and D,E are defined by non-zero-divisors d,e∈A, respectively.
Suppose (1).
This means that (d,e)=(f) for some non-zero-divisor f∈A,
because D×XE=SpecA/(d,e).
Thus there are d′,e′∈A such that d=d′f and e=e′f.
Since (f)=(d′,e′)(f) and f is a non-zero-divisor,
we have (d′,e′)=A.
Now (2) holds by taking D′,E′,F to be
the Cartier divisors defined by (d′),(e′) and (f).
(2) immediately implies F=D×XE, whence (1).
This formula also implies the uniqueness of F,
hence D′=D−F and E′=E−F are unique as well.
∎
Definition 1.10.2**.**
Let D and E be effective Cartier divisors on a scheme X.
If the conditions of Lemma 1.10.1 hold,
we say that D and Ehave a universal supremum,
and write
[TABLE]
Remark 1.10.3*.*
Let D and E be effective Cartier divisors on X
having a universal supremum.
The following are obvious from the definition.
(1)
We have ∣sup(D,E)∣=∣D∣∪∣E∣.
2. (2)
If f:Y→X is a morphism
such that f(T)\nsubset∣D∣∪∣E∣
for any irreducible component T of Y,
then f∗D and f∗E have a universal supremum
which is equal to f∗sup(D,E) (hence the name “universal”).
3. (3)
If moreover Y is normal,
then f∗sup(D,E) agrees with
the supremum of f∗D and f∗E
computed as a Weil divisor on Y.
Let ui:Ui→M be morphisms in MSmfin for i=1,2
with projections
pi:W0:=U1×MU2→Ui.
Denote by W1 the union of irreducible components T
of W0 such that pi(T)\nsubset∣Ui∞∣
for each i=1,2.
Observe that W1 is the closure of U:=U1o×MoU2o in W0.
Indeed, let Z be the closure of U in W0. Then any irreducible component T of Z meets U, which implies that T⊂W1. Conversely, any irreducible component T of W1 meets U, hence T∩U is dense in T and thus T⊂Z.
We write qi:W1→Ui for the composition of
the inclusion W1→W0 and pi.
By definition, we have
effective Cartier divisors qi∗(Ui∞) on W1
and q1×q2 restricts to an isomorphism
[TABLE]
Proposition 1.10.4**.**
Suppose that
U1o×MoU2o is smooth over k.
(1)
If q1∗U1∞ and q2∗U2∞ have a universal supremum,
then
[TABLE]
represents the fiber product of U1 and U2 over M
in MSmfin as well as in MSm.
If further U1,U2,M∈MSmfin,
then it holds in MSmfin as well as in MSm.
2. (2)
If u1 is minimal and U2 is normal, then q1∗U1∞ and q2∗U2∞ have a universal supremum, namely q2∗U2∞, and the morphism W1→U2 is a minimal morphism in MSmfin. If moreover u1 is flat333By the local criterion of flatness [Har77, Chapter III, Lemma 10.3.A], this is equivalent to the flatness of U1∞→M∞., we have W1=W0.
3. (3)
In general,
there is a proper birational morphism
π:W2→W1
which restricts to an isomorphism over
W1∖∣q1∗(U1∞)+q2∗(U2∞)∣,
and such that
r1∗U1∞ and r2∗U2∞ have a universal supremum,
where ri:=qiπ for i=1,2.
For such W2,
[TABLE]
represents the fiber product of U1 and U2 over M
in MSm.
If further U1,U2,M∈MSm,
then it holds in MSm.
Proof.
(1)
Let fi:N→Ui be morphisms in MSmfin for i=1,2
such that u1f1=u2f2.
Then the morphisms fi:N→Ui for i=1,2
induce a unique morphism h:N→W0 with fi=pih for i=1,2.
Since fi are morphisms in MSmfin,
for any irreducible component T of N
we have fi(T)\nsubset∣Ui∞∣,
and hence h factors though g:N→W1
so that we have fi=qig.
It remains to prove ν∗N∞≥ν∗g∗W1∞,
where ν:NN→N is the normalization.
As we have
ν∗g∗W1∞=ν∗g∗sup(q1∗U1∞,q2∗U2∞)=sup(ν∗f1∗U1∞,ν∗f1∗U2∞)
by definition and Remark 1.10.3,
this follows from
the admissibility of fi,
that is,
ν∗fi∗Ui∞≤ν∗N∞.
We have shown that W1 represents
the fiber product in MSmfin.
Propositions 1.9.2 and A.5.6
show that the same holds in MSm as well.
(This also follows from (3) below.)
The last statement is an immediate consequence of the first.
(2) Let pW:W1N→W1 and pU1:U1N→U1 be the normalizations.
By the minimality of u1, we have q1∗U1∞=q1∗u1∗M∞=q2∗u2∗M∞≤q2∗U2∞, where the last inequality holds by the admissibility of u2 and the normality of U2.
Then q1∗U1∞ and q2∗U2∞ have a universal supremum since q1∗U1∞⊂q2∗U2∞ implies Condition (1) of Lemma 1.10.1, which also implies that W1∞=sup(q1∗U1∞,q2∗U2∞)=q2∗U2∞.
This shows the minimality of W1→U2.
Suppose now u1 flat, and let T be an irreducible component of W0. Then p2:W0→U2 is also flat, hence T dominates an irreducible component E of U2 [Har77, Chapter III, Proposition 9.5] and we cannot have p2(T)⊂∣U2∞∣ since U2∞ is everywhere of codimension 1 in U2. Suppose that p1(T)⊂∣U1∞∣. By the minimality of u1, this implies u2p2(T)=u1p1(T)⊂∣M∞∣, hence u2(E)⊂∣M∞∣, contradicting the admissibility of u2.
(3)
If π is the blow-up of W1
with center q1∗(U1∞)×W1q2∗(U1∞),
then
r1∗U1∞×W2r2∗U2∞
is precisely the exceptional divisor by definition,
which is therefore an effective Cartier divisor,
showing the first assertion.
Note that W2o≅U1o×MoU2o
by (1.10.1).
Now let fi:N→Ui be morphisms in MSm for i=1,2
such that u1f1=u2f2.
Then the morphisms fio:No→Uio for i=1,2
induce a unique morphism
ho:No→W2o
with fio=piho for i=1,2.
It suffices to prove that ho defines a [unique] morphism in MSm.
By the graph trick (Lemma 1.3.6), we may assume that fio and ho extend to morphisms fi:N→Ui and h:N→W2.
Moreover we may assume that N is normal by Remark 1.3.5 (2).
It remains to prove N∞≥h∗W2∞.
As we have
h∗W2∞=sup(f1∗U1∞,f1∗U2∞)
by the assumption and Remark 1.10.3,
this follows from
the admissibility of fi,
that is,
fi∗Ui∞≤N∞.
∎
Remark 1.10.5*.*
If W represents a fiber product U1×MU2
(either in MSm or in MSmfin),
then we have Wo=U1o×MoU2o.
Indeed, the functors MSm→Sm
and MSmfin→Sm
given by M↦Mo
have the left adjoint
X↦(X,∅)
(Lemma 1.5.1),
hence commute with limits.
Examples 1.10.6*.*
Let B=k[x1,x2], A2=SpecB, Di=Spec(B/xiB) and P=D1∩D2. Let now M=(D1∪D2,P) and Ui=(Di,P) for i=1,2.
Then W0 is a point but W1=∅,
and
W1=(∅,∅) indeed represents
the fiber product U1×MU2.
In particular, fiber products do not commute with
the forgetful functor M↦M from MSmfin to Sch
of Definition 1.3.3 (2). Another counterexample: let M=(A2,D1), U1=BlP(A2), u1:U1→M be the minimal induced modulus structure, U2=(D2,P) and U2→M be given by the inclusion. Then W1⊊W0 is the proper transform of u1.
See however Corollary 1.10.7 (1).
Recall [SGA3, exposé IV, définition 1.4.0] that a morphism f:M→N in a category C is squarable if, for any g:N′→N, the fibred product N′×NM is representable in C. We have:
Corollary 1.10.7**.**
The following assertions hold.
(1)
If f:U→M is a minimal morphism in MSmfin
(see Definition 1.3.4)
such that fo is smooth,
then f is squarable in MSmfin. If f∈MSmfin, it is squarable in this category.
If moreover f is flat, then the pull-back by f of morphisms from normal modulus pairs commutes with the forgetful functor M↦M from MSmfin to Sch of Definition 1.3.3 (2).
2. (2)
If f:U→M is a morphism in MSm such that fo is smooth, then f is squarable in MSm. If f∈MSm, it is squarable in this category.
Proof.
(1) follows from Proposition 1.10.4 (1) and (2); (2) follows from
Proposition 1.10.4 (3).
∎
Corollary 1.10.8**.**
Finite products exist in MSm and MSm.
Proof.
This is the special case M=(Speck,∅) in Corollary 1.10.7 (2).
∎
2. Presheaf theory
2.1. Modulus presheaves with transfers
Definition 2.1.1**.**
By a presheaf we mean a contravariant functor to the category of abelian groups.
(1)
The category of presheaves on MSm (resp. MSm, MSmfin)
is denoted by MPS (resp. MPS, MPSfin).
2. (2)
The category of additive presheaves on MCor
(resp. MCor, MCorfin)
is denoted by MPST (resp. MPST, MPSTfin.)
All these categories are abelian Grothendieck, with projective sets of generators: this is classical for those of (1) and follows from Theorem A.10.2 for those of (2). (See also proof of Proposition 2.6.1 below.)
Notation 2.1.2**.**
We write
[TABLE]
for the associated representable presheaves
(i.e.Ztr(M)∈MPST is given by
Ztr(M)(N)=MCor(N,M), etc.)
We shall use the common notation Ztr
but they will be distinguished by the context.
We now briefly describe the main properties of the functors induced by those of the previous section.
2.2. MPST and PST
We say (f1,f2,…,fn) is a string of adjoint functors
if fi is a left adjoint of fi+1 for each i=1,…,n−1.
Proposition 2.2.1**.**
The functor ω:MCor→Cor of §1.5 yields a string of three adjoint functors (ω!,ω∗,ω∗):
[TABLE]
where ω∗ is fully faithful and ω!,ω∗ are localisations; ω!
has a pro-left adjoint ω!, hence is exact.
Similarly, ωs:MSm→Sm
yields a string of three adjoint functors (ωs!,ωs∗,ωs∗);
ωs∗ is fully faithful and ωs!,ωs∗ are localisations;
ωs!
has a pro-left adjoint ωs!, hence is exact.
Let X∈Sm and let M∈MSm(X).
Lemma 1.7.4 and Proposition A.4.1 show that
the inclusions {M(n)∣n>0}⊂MSm(M!X)⊂MSm(X) induce isomorphisms
(see Definition 1.7.3)
[TABLE]
2.3. MPST and PST
Proposition 2.3.1**.**
The adjoint functors (λ,ω) of Lemma 1.5.1 induce a string (λ!=ω!,λ∗=ω!,λ∗=ω∗,ω∗) of four adjoint functors:
[TABLE]
where ω!,ω∗ are localisations while ω! and ω∗ are fully faithful.
Moreover, if X∈Cor is proper, we have a canonical isomorphism ω∗Ztr(X)≃Ztr(X,∅).
Proof.
The only non obvious statement is the last claim, which follows from Lemma 1.5.1.
∎
2.4. MPST and MPST
Proposition 2.4.1**.**
The functor τ:MCor→MCor of (1.5.1) yields a string of three adjoint functors (τ!,τ∗,τ∗):
[TABLE]
where τ!,τ∗ are fully faithful and τ∗ is a localisation; τ!
has a pro-left adjoint τ!, hence is exact.
There are natural isomorphisms
[TABLE]
The same holds for the functor
τs from Theorem 1.5.2.
Namely, we have
a string of three adjoint functors (τs!,τs∗,τs∗)
and they satisfy
[TABLE]
Proof.
This follows from Theorem 1.5.2 and Proposition A.4.1.
∎
Lemma 2.4.2**.**
(1)
For
G∈MPST,G′∈MPS and M∈MSm,
we have
[TABLE]
2. (2)
The unit maps
Id→τ∗τ! and
Id→τs∗τs!
are isomorphisms.
3. (3)
There is an natural isomorphism
τ!ω∗≃ω∗.
Proof.
(1) This follows from Lemma 1.8.3, Theorem 1.5.2
and Proposition A.4.1.
(2) This follows from (1)
since Comp(M)={M} for M∈MSm.
where the latter inverse limit is computed in MPST.
Question 2.4.4*.*
Is τ! exact?
2.5. MPSTfin and MPST
Proposition 2.5.1**.**
Let
bs:MSmfin→MSm and
b:MCorfin→MCor be the inclusion functors from (1.9.1).
Then bs and b yield strings of three adjoint functors (bs!,bs∗,bs∗) and (b!,b∗,b∗):
[TABLE]
where bs!,bs∗, b!,b∗ are localisations; bs∗, b∗ are exact and fully faithful; bs!, b!
have pro-left adjoints, hence are exact.
The counit maps bs!bs∗→Id and b!b∗→Id are isomorphisms.
For Fs∈MPSfin, F∈MPSTfin and M∈Ob(MSm)=Ob(MCor), we have
(see Def. 1.9.1)
[TABLE]
Proof.
This follows from the usual yoga applied with Proposition 1.9.2 and Lemma A.3.1.
∎
2.6. With and without transfers
Proposition 2.6.1**.**
Let c:MSm→MCor be the functor from (1.3.1).
Then
c yields a string of three adjoint functors (c!,c∗,c∗):
[TABLE]
where c∗ is exact and faithful (but not full). We have
[TABLE]
for any M∈MSm,
where Zp(M) is
444
We put a superscript p to distinguish it from
its associated sheaf Z(M), to be introduced in (4.4.1).
the presheaf N↦Z[MSm(N,M)].
The same statements hold for
c:MSm→MCor and
cfin;MSmfin→MCorfin
from (1.3.1).
Precisely,
they yield strings of three adjoint functors
(c!,c∗,c∗)
and (c!fin,cfin∗,c∗fin);
c∗ and cfin∗ are exact and faithful.
(The analogue of (2.6.1) also holds for c and cfin,
but we will not need it.)
Proof.
To define c!,c∗ and c∗, we use the free additive category ZMSm on MSm [Mac98, Chapter VIII, Section 3, Exercises 5 & 6]: it comes with a canonical functor γ:MSm→ZMSm and is 2-universal for contravariant functors to additive categories. In particular:
•
The functor c induces an additive functor c~:ZMSm→MCor.
•
By the 2-universality,
the functor γ induces an equivalence
γ∗:Mod–ZMSm≅MPS,
where Mod–ZMSm denotes the category
of additive contravariant functors ZMSm→Ab
•
For M,N∈MSm, we have a canonical isomorphism
[TABLE]
As usual, c~ induces
a string of three adjoint functors
(c~!,c~∗,c~∗)
(see §A.4).
We then define c! as
c~!∘(γ∗)−1, etc.
Everything follows from this except the faithfulness of c∗,
which is a consequence of the essential surjectivity of c. The cases of cfin and c are dealt with similarly.
∎
Lemma 2.6.2**.**
(1)
We have
[TABLE]
2. (2)
We have
[TABLE]
Proof.
The first two equalities of (1) follows from the equality
b\leavevmodecfin=c\leavevmodebs
(see (1.9.2)).
Similarly, the first equality of (2) follows from
τc=cτs.
By (2.5.1), we have
[TABLE]
for any F∈MPSTfin and M∈MSm.
(Note that all morphisms of Σfin↓M
are in MSmfin,
and that both of b! and bs!
can be computed by using the same Σfin↓M.)
This proves the last formula of (1).
Lemma 2.4.2 (1) shows that
[TABLE]
for any F∈MPST and M∈MSm.
The last one of (2) is similar.
∎
2.7. A patching lemma
By the previous lemma,
we obtain a commutative diagram of categories
(cf. (1.9.2)):
[TABLE]
All vertical arrows are faithful
and horizontal ones fully faithful.
Lemma 2.7.1**.**
Both squares of (2.7.1) are “2-Cartesian”.
More precisely, the following assertions hold.
(1)
Let
MPS×MPSfinMPSTfin
be the category of pairs
(Fs,Ft) consisting of
Fs∈MPS and Ft∈MPSTfin
such that their restriction to the common subcategory
MSmfin are equal.
The functor
[TABLE]
defined by F↦(c∗F,b∗F)
is an equivalence of categories.
2. (2)
Let MPS×MPSMPST
be the category of triples
(Fs,Ft,φ) consisting of
Fs∈MPS,\leavevmodeFt∈MPST and
an isomorphism φ:τs!Fs≅c∗Ft
in MPS.
The functor
[TABLE]
defined by F↦(c∗F,τ!F,θF),
where θF:τs!c∗F≅c∗τ!F
is from (2.6.3),
is an equivalence of categories.
Proof.
(1) is the content of Corollary 1.9.4.
We show (2). Given (Fs,Ft,φ),
we shall construct F∈MPST as follows.
Set F(M):=Fs(cM) for any M∈MCor.
Since M is proper, we have
an isomorphism
[TABLE]
which we denote by φM.
For γ∈MCor(M,N), we define
F(γ):=φM−1Ft(γ)φN.
It is straightforward to see that
(Fs,Ft,φ)↦F gives a quasi-inverse.
∎
2.8. The functors n! and n∗
As in §A.4, the functor (−)(n) of Definition 1.4.1
induces a string of adjoint endofunctors (n!,n∗,n∗) of MPST,
where n∗ is given by n∗(F)(M)=F(M(n)). We shall not use n∗ in the sequel.
Lemma 2.8.1**.**
The functor n! is fully faithful.
Proof.
This follows formally from the same properties of (−)(n).
∎
Proposition 2.8.2**.**
For any F∈MPST, there is a natural isomorphism
[TABLE]
where ∞∗F(M):=limnF(M(n))(for the natural transformations (1.4.1)).
For all n≥1, the natural transformation ω!→ω!n∗ stemming from (1.4.1) is an isomorphism.
Proof.
Let F∈MPST. For X∈Cor, we have
[TABLE]
where the last isomorphism follows from Lemma 1.7.4.
∎
3. Sheaves on MSmfin and MCorfin
3.1. Nisnevich topology on MSmfin
Definition 3.1.1**.**
We call a morphism p:U→M in MSmfin
a Nisnevich cover if
(i)
p:U→M is a Nisnevich cover
of M in the usual sense;
(ii)
p is minimal (that is, U∞=p∗(M∞)).
Since the morphisms appearing in
the Nisnevich covers are squarable by
Corollary 1.10.7 (1),
we obtain a Grothendieck topology on MSmfin.
The category MSmfin endowed with
this topology will be called
the big Nisnevich site of MSmfin and denoted by
MSmNisfin.
Definition 3.1.2**.**
Let us fix M∈MSmfin.
Let MNis be the category
of minimal morphisms f:N→M in MSmfin
such that f is étale,
endowed with the topology induced by MSmNisfin.
The following lemma is obvious from the definitions:
Lemma 3.1.3**.**
Let M∈MSmfin.
Let (M)Nis be
the (usual) small Nisnevich site on M.
Then we have an isomorphism of sites
[TABLE]
whose inverse is given by
(p:X→M)↦(X,p∗(M∞)). (This isomorphism of sites depends on the choice of M∞.) ∎
Lemma 3.1.4**.**
Let α:M→N be a morphism in MCorfin and
let p:U→N be a Nisnevich over in MSmfin.
Then there is a commutative diagram
[TABLE]
where α′:V→U is a morphism in MCorfin
and p′:V→M is a Nisnevich cover in MSmfin.
Proof.
We may assume α is integral.
Let α be the closure of α
in M×N.
Since α is finite over M,
we may find a Nisnevich cover p′:V→M
such that
p~ in the diagram
(all squares being cartesian)
[TABLE]
has a splitting s.
Put V:=(V,p′∗(M∞))∈MSm.
The image of s gives us a desired correspondence
α′.
∎
Remark 3.1.5*.*
One can also define the Zariski and étale topologies
on MSmfin.
Most results of this section
(notably Theorems 3.4.1, 3.5.3,
and Corollary 3.5.6)
remain true for the étale topology,
but not for the Zariski topology
(e.g. Lemma 3.1.4 already fails for it).
However, from the next section onward
we will make essential use of cd-structures.
As the étale topology cannot be defined by a cd-structure,
we decide to stick to the Nisnevich topology from the beginning.
3.2. A cd-structure on MSmfin
Let Sq be the product category
of [0]={0→1} with itself, depicted as
[TABLE]
For any category C,
denote by CSq for the category of
functors from Sq to C.
A functor f:C→C′
induces a functor fSq:CSq→C′Sq.
We refer to §A.7 for the notion of cd-structure, and its properties.
Definition 3.2.1**.**
(1)
A Cartesian square
[TABLE]
in Sch
is called an elementary Nisnevich square
if p is étale, p−1(X∖U)red→(X∖U)red
is an isomorphism and u is an open embedding,.
In this situation, we say U⊔V→X
is an elementary Nisnevich cover.
Recall that an additive presheaf
is a Nisnevich sheaf if and only if
it transforms any elementary Nisnevich square
into a cartesian square
[Voe10a, Corollary 2.17], [Voe10b, Theorem 2.2].
2. (2)
A diagram (3.2.1) in MSmfin is
called
an MVfin-square
if all morphisms are minimal and it becomes an elementary Nisnevich square (in Sch)
after applying the forgetful functor of Definition 1.3.3 (2).
The last part of Proposition 1.10.4 (2)
shows that no irreducible component of X has its image
inside ∣U∞∣ or ∣V∞∣
(i.e.W1 in loc. cit. agrees with W),
and then Proposition 1.10.4 (1)
shows that X is the fiber product
since q∗U∞=v∗V∞=W∞ by minimality.
∎
Proposition 3.2.3**.**
The following assertions hold.
(1)
The topology on MSmNisfin (cf. Def. 3.1.1) coincides with the topology associated with the cd-structure PMVfin consisting of MVfin-squares.
2. (2)
The cd-structure PMVfin is strongly complete and strongly regular in the sense of Definition A.7.4, hence complete and regular in the sense of **[Voe10a]** (cf. Definition A.7.1).
Proof.
(1) follows from Lemma 3.1.3 and [Voe10b, Remark after Proposition 2.17].
The first assertion of (2) follows from (the proof of) [Voe10b, Theorem 2.2].
The second assertion of (2) follows from [Voe10a, Lemma 2.5, Lemma 2.11]
∎
3.3. Sheaves on MSmfin
Definition 3.3.1**.**
We define MNSfin to be
the full subcategory of MPSfin
consisting of Nisnevich sheaves.
Theorem 3.3.2**.**
Let F∈MNSfin. Then
HNisi(X,F)=0 for any X∈MSmfin
and i>dimX(where dimX is defined as dimX:=dimXo=dimX).
Proof.
This is clear from Lemma 3.1.3
and the known properties of the Nisnevich site.
∎
Definition 3.3.3**.**
An additive functor F between additive categories is strongly additive if it commutes with infinite direct sums.
This property is not used in the present paper, but it will be essential in [KMSY21] when we deal with unbounded derived categories.
Lemma 3.3.4**.**
The category MNSfin is closed under infinite direct sums and the inclusion functor denoted by
isNisfin:MNSfin→MPSfin is strongly additive.
Proof.
Indeed, the sheaf condition is tested on finite diagrams, hence the presheaf given by a direct sum of sheaves is a sheaf (small filtered colimits commute with finite limits, [Mac98, Chapter IX, Section 2, Theorem 1]).
∎
Proposition 3.3.5**.**
For any M∈MSm
we have
[TABLE]
where
Ztrfin,Ztr are the representable presheaves
(notation 2.1.2) and
the functors
b∗ and
cfin∗
are from Propositions 2.5.1, 2.6.1.
Proof.
We show the stronger statement
that Ztr(M) restricts to an étale sheaf
on Neˊt for any N∈MCorfin.
Let p:U→N be an étale cover
and let U:=(U,p∗N∞).
We have a commutative diagram
[TABLE]
The bottom row is exact by [MVW06, Lemma 6.2].
The exactness of the top and middle row now follows from Lemma 1.9.6.
∎
3.4. Čech complex
Let p:U→M be a Nisnevich cover in MSmfin.
We write U×MU for the modulus pair corresponding
to U×MU
under the isomorphism of sites from Lemma 3.1.3.
Note that it is a fibre product in
MSmfin and in MSm,
thanks to Proposition 1.10.4.
Iterating this construction,
we obtain the Čech complex
This result will be refined several times,
see Corollary 3.5.6 and
Theorem 4.5.7.
Its proof is adapted from [Voe00, Proposition 3.1.3].
Before starting the proof of Theorem 3.4.1,
it is convenient to generalize the notion of relative cycles to the modulus setting.
Definition 3.4.3**.**
Let S=(S,D), Z=(Z,Z∞) be two pairs formed of a scheme and an effective Cartier divisor, and let f:Z→S be a morphism. (We don’t put any regularity requirement on S−∣D∣ or Z−∣Z∞∣.) We write L(Z/S) for the free abelian group with basis the closed integral subschemes T⊂Z such that
T is finite and surjective over an irreducible component of S and D∣TN≥Z∞∣TN,
where TN→T is normalization and (−)∣TN denotes pull-back of Cartier divisors.
Example 3.4.4*.*
If S is a modulus pair and M=(M,M∞) is another modulus pair, then we have a canonical isomorphism MCorfin(S,M)≃L(S×M/S), where S×M is the modulus pair (S×M,S×M∞): this follows from Remark 1.3.5 (3).
Define a category D(S) as follows: objects are pairs (Z,f) as in Definition 3.4.3. A morphism in D(S), (Z,f)→(Z′,f′), is a minimal morphism φ:Z→Z′ such that f=f′∘φ. Composition is obvious.
Lemma 3.4.5**.**
The push-forward of cycles makes (Z,f)↦L(Z/S) a covariant functor on D(S).
Proof.
Let φ:(Z,f)→(Z′,f′) be a morphism in D(S), and let T∈L(Z/S). Then φ(T) is still finite and surjective over a component of S [MVW06, Lemma 1.4]. Moreover, it still verifies the modulus condition: this follows from the minimality of φ and from Lemma 1.2.1. We set as usual φ∗T=[k(T):k(φ(T))]φ(T): this defines φ∗:L(Z/S)→L(Z′/S), and the functoriality (ψ∘φ)∗=ψ∗∘φ∗ is obvious.
∎
In view of Lemma 3.1.3,
it suffices to show the exactness of
(3.4.1) evaluated at
S
[TABLE]
for the henselisation S=(S,D) of any modulus pair N=(N,N∞) at any point of N. As in [Voe00], the strategy is to write (3.4.2) as a filtered colimit of contractible chain complexes.
Write E(S,M) for the collection of integral closed subsets of So×Mo which belong to MCorfin(S,M) (this is the canonical basis of MCorfin(S,M)).
Let C(M) be the set of closed subschemes of S×M
that are quasi-finite over
S and not contained in S×M∞, viewed as an (ordered, cofiltered) category. To Z∈C(M)
we associate the subset E(Z)⊂E(S,M) of those F such that F⊂Z.
Provide Z∈C(M) with the minimal modulus structure induced by the projection Z→M (in a sense slightly generalized from Remark 1.1.2 (4), as in Definition 3.4.3: the open subset Z−Z∞ is not necessarily smooth). This yields a functor
[TABLE]
where D(S) is the category defined above. In particular, we have a subgroup L(Z/S)⊂MCorfin(S,M): it is the free abelian group on E(Z).
Let u:M′→M be an étale morphism in MSmfin, as in Definition 3.1.2. For Z∈C(M), define u∗Z=Z×MM′. Then u∗Z∈C(M′), and there is a commutative diagram
[TABLE]
where the bottom horizontal map is composition
by the graph of u. This yields subcomplexes
Let Cf(M)⊂C(M) be the subset of those Z which are finite over S. It is a filtered subcategory, and we have
[TABLE]
Indeed, for Z′∈C(M′), let Z=(IdS×u)(Z′) and let Zf=\bigcupop\displaylimitsF∈E(Z)F. Then E(Z′)⊂E(u∗Zf) since (IdS×u)(F) is finite over S for F∈E(Z′).
This proves that
(3.4.2) is obtained as the filtered inductive limit of the complexes (3.4.3)
when Z ranges over Cf(M).
It suffices to show the exactness of (3.4.3) for such a Z.
Since Z is finite over the henselian local scheme S,
Z is a disjoint union of henselian local schemes.
Thus the Nisnevich cover
Z×MU→Z admits a section
s0:Z→Z×MU.
Define for k≥1
[TABLE]
where
Uk:=U×M⋯×MU.
Then the maps
[TABLE]
induced by sk via Lemma 3.4.5
give us a homotopy from the identity to zero.
∎
3.5. Sheafification preserves finite transfers
Let asNisfin:MPSfin→MNSfin
be the sheafification functor,
that is, the left adjoint of the inclusion functor
isNisfin:MNSfin↪MPSfin. It exists for general reasons and is exact [SGA4, exposé II, théorème 3.4].
Definition 3.5.1**.**
Let MNSTfin be the
full subcategory of MPSTfin consisting of all objects
F∈MPSTfin such that
cfin∗F∈MNSfin
(see Proposition 2.6.1 for cfin∗).
Lemma 3.5.2**.**
The category MNSTfin is closed under infinite direct sums in MPSTfin, and the inclusion functor
iNisfin:MNSTfin→MPSTfin is strongly additive
(Definition 3.3.3).
The objects Ztrfin(M) and b∗Ztr(M) belong to MNSTfin for any M∈MCor.
Proof.
This follows from Lemma 3.3.4,
because cfin∗ is strongly additive as a left adjoint. The last claim follows from Proposition 3.3.5.
∎
We write cfinNis:MNST→MNS
for the functor induced by cfin∗.
By definition, we have
[TABLE]
Theorem 3.5.3**.**
The following assertions hold.
(1)
Let F∈MPSTfin.
There exists a unique object FNis∈MPSTfin
such that
cfin∗(FNis)=asNisfin(cfin∗(F))
and such that
the canonical morphism
u:cfin∗(F)→asNisfin(cfin∗(F))=cfin∗(FNis)
extends to a morphism in MPSTfin.
2. (2)
The functor iNisfin has an exact left adjoint
aNisfin:MPSTfin→MNSTfin
satisfying
[TABLE]
In particular the category MNSTfin
is Grothendieck (§A.10).
3. (3)
*The functor cfinNis
has
a left adjoint cNisfin=aNisfinc!finisNisfin.
Moreover, cfinNis
is exact, strongly additive *(Definition 3.3.3), and faithful.
Proof.
This can be shown by a rather trivial modification
of [Voe00, Theorem 3.1.4],
but for the sake of completeness we include a proof.
To ease the notation,
put F′:=asNisfincfin∗F∈MPSfin.
First we construct a homomorphism
[TABLE]
for any M∈MSm.
Take f∈F′(M).
There exists a Nisnevich cover p:U→M in MSmfin
and g∈cfin∗F(U)=F(U) such that
f∣U=u(g) in F′(U).
There also exists a Nisnevich cover W→U×MU
such that g∣W=0 in F(W).
We have
asNisfincfin∗Ztrfin(M)=cfin∗Ztrfin(M)
because cfin∗Ztrfin(M)∈MPSNisfin by Proposition 3.3.5.
Thus we get a commutative diagram
in which the horizontal maps are induced by
asNisfincfin∗
[TABLE]
Since F′ is a sheaf,
Theorem 3.4.1 implies that
the left vertical column is exact except at the last spot,
and that the map l is injective.
Since g∈F(U)=MPSTfin(Ztrfin(U),F)
satisfies s′′(g)=g∣W=0,
there exists a unique
h∈MPSfin(c∗Ztrfin(M),F′)
such that s(h)=s′(g).
One checks that h does not depend on
the choices of p:U→M, g∈F(U) and W→U×MU
by taking a refinement of covers.
We define M(f):=h.
Now we define G.
On objects we put G(M)=F′(M) for M∈MSm.
For α∈MCorfin(M,N),
we define α∗:F′(N)→F′(M)
as the composition of
[TABLE]
where the middle map is induced by
cfin∗(α):cfin∗Ztrfin(M)→cfin∗Ztrfin(N),
and the last map is given by
f↦fM(IdM).
One checks that, with this definition,
G becomes an object of MPSTfin.
To prove uniqueness, take G,G′∈MPSTfin
which enjoy the stated properties.
For any M∈MSm we have G(M)=G′(M)=F′(M).
We also have G(cfin∗(q))=G′(cfin∗(q))=F′(q)
for any morphism q in MSmfin.
Let α:M→N be a morphism in MCorfin
and let f∈F′(N).
Take a Nisnevich cover p:U→N of MSmfin
and g∈cfin∗F(U)=F(U) such that f∣U=u(g) in F′(U).
Apply Lemma 3.1.4 to
get a morphism α′:V→U in MCorfin
and a Nisnevich cover p′:V→M of MSmfin
such that αp′=pα′.
Then we have
[TABLE]
Since p′:V→M is a Nisnevich cover
and G is separated,
this implies
G(α)(f)=G′(α)(f).
This completes the proof or (1).
(2) is a consequence of (1)
and the fact that MPSTfin is Grothendieck
as a category of modules (see Theorem A.10.1 d)).
Then (3) follows from Lemma A.8.1.
∎
Remark 3.5.4*.*
A different argument may be given by mimicking the proof of [Ayo15, Corollary 2.2.26].
Definition 3.5.5**.**
An additive functor
φ:C→C′ between abelian categories is faithfully exact
if a complex F′→F→F′′ is exact
if and only if φF′→φF→φF′′ is.
This happens if φ is exact and either faithful or conservative.
By Theorems 3.5.3 and 3.4.1,
we get:
Corollary 3.5.6**.**
The functor cfinNis is faithfully exact.
In particular,
if p:U→M is a Nisnevich cover in MSmfin,
then the Čech complex
[TABLE]
is exact in MNSTfin.
3.6. Cohomology in MNSTfin
Notation 3.6.1**.**
Let M∈MSmfin and
let F∈MNSfin (resp. F∈MNSTfin).
We write FM for the sheaf on (M)Nis induced from F
(resp. cfinσF)
via the isomorphism of sites from Lemma 3.1.3.
(Note that FM depends not only on M, but also on M∞.)
We thus have canonical isomorphisms
[TABLE]
where the right hand sides denote the cohomology of
the (usual) small site (M)Nis.
Definition 3.6.2**.**
(1)
Let S be a scheme.
We say a sheaf F on SNis is flasque if
F(V)→F(U) is surjective
for any open dense immersion U→V.
Flasque sheaves are flabby in the sense of
Definition A.9.4
(see [Rio02, lemme 1.40]).
2. (2)
We say F∈MNSfin is flasque
if FM is flasque for any M∈MSmfin (see Notation 3.6.1).
Again, flasque sheaves are flabby by (3.6.1).
Lemma 3.6.3**.**
Let I∈MNSTfin be an injective object.
Then cfinNis(I)∈MNSfin is flasque,
and hence flabby.
Proof.
Let j:U↪M be a minimal open immersion of modulus pairs in MSmfin. The morphism of sheaves Ztrfin(j) is a monomorphism, hence j∗:I(M)→I(U) is surjective.
Alternatively, one can apply
Lemma A.9.5 with (3.5.3)
to show that cfinσ(I) is flabby.
(This proof also works for the étale topology.)
∎
4. Sheaves on MSm and MCor
4.1. A cd-structure on MSm
Let PMV be the collection of commutative squares in MSm which are isomorphic in MSmSq to
bsSq(Q) for some MVfin-square Q
in Definition 3.2.1. Then PMV defines a cd-structure on MSm (see §3.2).
Definition 4.1.1**.**
The squares which belong to PMV
are called MV-squares.
Theorem 4.1.2**.**
The cd-structure PMV is strongly complete and strongly regular, in particular complete and regular (see Definitions A.7.1 and A.7.4).
Consider
the Grothendieck topology on MSm
generated by the squares in PMV.
The resulting site will be denoted by MSmNis.
We write MNS for
the full subcategory of sheaves in MPS.
We denote by
isNis:MNS→MPS
the inclusion functor.
By the general properties of Grothendieck topologies [SGA4, exposé2], we have:
Theorem 4.2.2**.**
The inclusion functor
isNis:MNS→MPS
has an exact left adjoint
asNis.
The category MNS is Grothendieck (§A.10).∎
Lemma 4.2.3**.**
The following conditions are equivalent
for F∈MPS.
(i)
F∈MNS.
(ii)
bs∗F∈MNSfin*; in other words,
(bs∗F)M is a Nisnevich
sheaf for any M∈MSm
*(see (1.9.2) for bs and Notation 3.6.1 for (−)M).
(iii)
F* transforms
any MVfin-square*
[TABLE]
into an exact sequence
[TABLE]
Proof.
In view of Theorem 4.1.2 and [Voe10a, Corollary 2.17], we have (i) ⟺ (iii). On the other hand, (ii) ⟺ (iii) by adjunction and Proposition 3.2.3.
∎
Corollary 4.2.4**.**
The category MNS is closed under infinite direct sums in MPS
and isNis is strongly additive (Definition 3.3.3).
Proof.
This follows from Lemmas 3.3.4, 4.2.3 ((i) ⟺ (ii)) and A.8.1 (2)
because bs∗ is strongly additive as a left adjoint.
∎
4.3. The adjunction (bs,Nis,bsNis)
Definition 4.3.1**.**
A map in MSmNis
is called a strict Nisnevich cover
if it is the image of a cover of MSmNisfin
by bs:MSmfin→MSm.
By definition,
a strict Nisnevich cover is
evidently a cover in MSmNis.
Up to isomorphism,
any cover of MSmNis
can be refined to such a cover.
More precisely, we have the following lemma.
Lemma 4.3.2**.**
Any cover U→M in MSmNis
admits a refinement of the form
V→N→M,
where V→N is a strict Nisnevich cover
and N→M is a morphism in Σfin(see Definition 1.9.1).
Proof.
By Definition 4.2.1 and Proposition 1.9.2,
there is a refinement of U→M of the form
[TABLE]
where for each i we have either
(i) fi∈Σfin,
(ii) fi=g−1 for some g∈Σfin,
or
(iii) fi is a strict Nisnevich cover.
We proceed by induction on n,
the case n=0 being trivial.
Suppose n>0.
By induction, we have a refinement of Un→U1
of the form V′→N′→U1
where V′→N′ is a strict Nisnevich cover
and N′→U1 is in Σfin.
If f1∈Σfin,
then we can take V=V′ and N=N′,
as the composition
N′→U1→U0 belongs to Σfin.
Next, suppose f1=g−1 with g∈Σfin.
Then we can take
V=V′×U1U0 and
N=N′×U1U0,
where U0 is regarded as a U1-scheme by g.
Finally, suppose f1 is a strict Nisnevich cover.
By Lemma 1.6.3,
we may find a morphism N→U0 in Σfin
such that N′′:=N×U0U1→U1
factors through N′.
Then we can take V=V′×N′N′′.
This completes the proof.
∎
We define
bsNis:MNS→MNSfin
to be
the restriction of bs∗, cf. Lemma 4.2.3 (ii).
By definition,
we have
[TABLE]
Proposition 4.3.3**.**
The following assertions hold.
(1)
We have bs!(MNSfin)⊂MNS.
In particular,
bs! restricts to
bsNis:MNSfin→MNS
so that we have
[TABLE]
2. (2)
The functor
bsNis is an exact left adjoint of bsNis.
The functor
bsNis is fully faithful and preserves injectives.
The counit map
bsNisbsNis→Id is an isomorphism and bsNisRqbsNis=0 for q>0.
Proof.
Let F∈MNSfin and
take M∈MSm.
We shall show that (bs∗bs!F)M is a Nisnevich sheaf on M.
For a given MVfin-square in MSmfin
[TABLE]
its pullback via (N→M)∈Σfin↓M
(which exists by Corollary 1.10.7 (1))
[TABLE]
is also an MVfin-square.
By Proposition 3.2.3 (2) and by [Voe10a, Corollary 2.17], the sequence
[TABLE]
is exact. By Lemma 1.6.3, the pullback of
Σfin↓M via U→M is cofinal in
Σfin↓U, and similarly for V→M and W→M.
Hence, by taking its colimit over N∈Σfin↓M,
the above exact sequences
and (2.5.1)
imply the desired exact sequence
[TABLE]
In view of Lemma 4.2.3, this finishes the proof of (1).
(2) The adjunction (bsNis,bsNis) follows from the adjunction (bs!,bs∗) (see Proposition 2.5.1), by the full faithfullness of isNis and isNisfin, and by the formulas (4.3.1) and (4.3.2).
The full faithfulness of bsNis follows from that of bs∗ (see Proposition 2.5.1), isNis and isNisfin.
Then the counit map bsNisbsNis→Id is an isomorphism by Lemma A.3.1.
We prove the exactness of bsNis as follows.
Since it is right exact as a left adjoint, it suffices to show its left exactness.
Assume given an exact sequence in MNSfin:
[TABLE]
Applying the left exact functor isNisfin:MNSfin→MPSfin and the exact functor bs!:MPSfin→MPS
and using (4.3.2),
we get an exact sequence
[TABLE]
For every Q∈MNS, this gives rise to an exact sequence
[TABLE]
Since isNis is fully faithful, this gives an exact sequence
[TABLE]
which shows the exactness of
[TABLE]
as desired.
Therefore, bsNis is exact.
Then bsNis preserves injectives since it has an exact left adjoint bsNis.
Moreover, applying Rq (q>0) to the counit isomorphism bsNisbsNis→Id, we have
[TABLE]
by Example A.9.2 and the exactness of bsNis.
This concludes the proof.
∎
Corollary 4.3.4**.**
We have a natural isomorphism
asNis≃bsNisasNisfinbs∗.
Proof.
By the uniqueness of left adjoints, it suffices to check that the right hand side is also left adjoint to isNis.
We first apply double adjunction by
(bsNis,bsNis) (Proposition 4.3.3 (2))
and (asNisfin,isNisfin),
then use (4.3.1)
and the full faithfulness of bs∗ (Proposition 2.5.1).
∎
4.4. Cohomology in MNS
Notation 4.4.1**.**
(1)
Let M∈MSm and F∈MNS.
Using Notation 3.6.1,
we define
FM:=(bsNisF)M
which is a sheaf on (M)Nis.
2. (2)
For M∈MSm,
let Zp(M)∈MPS be the associated representable additive presheaf
(see (2.6.1)) and let
[TABLE]
be the associated sheaf.
Proposition 4.4.2**.**
For M∈MSm, F∈MNS and i≥0,
we have a natural isomorphism
[TABLE]
Moreover, we have
[TABLE]
Proof.
Define functors
M↓:MNSfin→Ab
and
ΓM:MNS→Ab
by
[TABLE]
We have M↓=ΓMbsNis.
By Theorem A.9.1 and Lemma 4.4.3 below,
we get (RpΓM)bsNis=RpM↓
for any p≥0
since bsNis is exact.
Thus, by Lemma 4.4.4 below we obtain
[TABLE]
for any G∈MNSfin and p≥0.
Setting G=RqbsNisF,
we get (4.4.2) for q=0 (resp. (4.4.3) for q>0) thanks to
Proposition 4.3.3 (2).
∎
Lemma 4.4.3**.**
For an injective I∈MNSfin,
bsNisI∈MNS is flabby
(see Definition A.9.4).
Proof.
Write F=bNisI.
By Lemma A.9.3, it suffices to show
the vanishing of the canonical map
Hˇq(U/M,F)→Hˇq(M,F)
for any cover U→M in MSmNis and any q>0.
By Lemma 4.3.2,
we may assume U→M is a strict Nisnevich cover
(as any morphism in Σfin
is an isomorphism in MSm).
Denote by UMn∈MSm the n-fold fiber product of U over M in MSm
(which exists by Corollary 1.10.7 (1)).
Then Hˇq(U/M,F) is computed as the cohomology of
the complex whose term in degree q is given by
[TABLE]
By Lemma 1.6.3,
for any integer n>0 and given Lq∈Σfin↓UMq+1 for 0≤q≤n, there exists
L∈Σfin↓M in such that L×MUMq+1→UMq+1
factor through Lq for all q=0,…,n.
This implies that for 0≤q≤n−1
the canonical map
Hˇq(U/M,bsNisI)→Hˇq(M,bsNisI)
factors through
[TABLE]
where Hˇq(U×ML/L,I) is
the Čech cohomology of I
with respect to the cover U×ML→L in MSmfin,
but it vanishes since I is injective in MNSfin.
This proves the desired vanishing and completes the proof of Lemma 4.4.3.
∎
Lemma 4.4.4**.**
For any G∈MNSfin and p≥0,
we have
[TABLE]
Proof.
Take an injective resolution G→I∙ in MNSfin.
Then we have
[TABLE]
where
we used Corollary 1.9.3
for the last-but-one isomorphism,
and (3.6.1) for the last one.
∎
4.5. Sheaves on MCor
Lemma 4.5.1**.**
For F∈MPST,
one has c∗F∈MNS if and only if b∗F∈MNSTfin.
Proof.
This follows from (2.6.2)
and Definitions 3.5.1 and 4.2.1.
∎
Definition 4.5.2**.**
We define MNST to be
the full subcategory of MPST consisting of
those F enjoying the conditions of Lemma 4.5.1.
We denote by
iNis:MNST→MPST
the inclusion functor.
Lemma 4.5.3**.**
The category MNST
is closed under infinite direct sums in MPST,
and iNis is strongly additive (Definition 3.3.3).
It contains Ztr(M) for any M∈MCor.
Proof.
This follows from Lemma 3.5.2,
because b∗ is strongly additive as a left adjoint. The last statement follows from Lemma 3.5.2.
∎
By Definition 4.5.2 and Lemma 4.5.1,
the functors b∗
and c∗ restrict to
bNis:MNST→MNSTfin
and
cNis:MNST→MNS.
It holds that
Let
bNis:MNSTfin→MNST
be the restriction of b! so that we have
[TABLE]
Then, the functor
bNis is an exact left adjoint of bNis, which is fully faithful.
3. (3)
The functor
bNis preserves injectives.
Proof.
(1) It suffices to show that c∗b!(MNSTfin)⊂MNS. By (2.6.2), we have c∗b!=bs!cfin∗. Moreover, cfin∗MNSTfin⊂MNSfin by Definition 3.5.1 and bs!MNSfin⊂MNS
by Proposition 4.3.3 (1).
In (2), the adjointness and the full faithfulness are seen by using
Proposition 2.5.1, (4.5.1)
and (4.5.2).
This proves that bNis is right exact,
and it is also exact by (4.5.2) and Proposition 2.5.1 (see also the proof of the exactness of bsNis in Proposition 4.3.3 (2)).
(3) is a consequence of (2).
∎
Theorem 4.5.5**.**
The inclusion functor
iNis:MNST→MPST
has the exact left adjoint
aNis=bNisaNisfinb∗.
In particular, MNST is Grothendieck.
Proof.
The formula defining aNis yields a left adjoint to iNis by the full faithfulness of b∗ (Proposition 2.5.1) and the adjunctions (aNisfin,iNisfin) and (bNis,bNis) (use (4.5.1)). Its exactness follows from the exactness of the three functors.
∎
Proposition 4.5.6**.**
We have
[TABLE]
Moreover, cNis is faithful, exact,
strongly additive (Definition 3.3.3) and has a left adjoint
cNis=aNisc!isNis such that cNisasNis=aNisc!.
Proof.
The first equality follows from
the first formula of (4.5.1) by adjunction.
For the second, we use
Theorems 4.2.2
and 4.5.5,
together with
(2.6.2),
(3.5.2)
and (4.5.1).
The last statement follows from Lemma A.8.1 (3).
∎
Theorem 4.5.7**.**
If p:U→M is a cover in MSmNis,
then the Čech complex
[TABLE]
is exact in MNST.
(Note that the fiber products exist in MSm
by Corollary 1.10.7 (1).)
Moreover, the sequence
[TABLE]
is exact in MNST
for any MVfin-square (3.2.1) in MSmfin.
Proof.
By Lemma 4.3.2,
we may assume M→U is a strict Nisnevich cover.
Then, by (3.5.3) the complex
[TABLE]
is exact in MNSTfin.
Applying the exact functor bNis,
we get (4.5.4).
The second statement follows from the first and a small computation
(cf. [MVW06, Proposition 6.14]).
∎
4.6. Cohomology in MNST
Lemma 4.6.1**.**
Let I∈MNST be an injective object.
Then cNis(I)∈MNS is flabby.
Proof.
This follows from Lemma A.9.5
and Theorem 4.5.7.
∎
Notation 4.6.2**.**
Let M∈MCor and F∈MNST.
Using Notation 3.6.1,
we define
FM:=(bNisF)M,
which is a sheaf on (M)Nis.
Theorem 4.6.3**.**
Let F∈MNST, and let M∈MCor. Then there are canonical isomorphisms for any i≥0:
Applying the last identity of Proposition 4.5.6 to Zp(M), we get
[TABLE]
where the second equality follows from (2.6.1), and the third one holds by Lemma 4.5.3. This yields an isomorphism
[TABLE]
which is the case i=0 of the first isomorphism in the proposition. The general case i≥0 then follows from
Theorem A.9.1, Lemma 4.6.1 and
the exactness of cNis (Proposition 4.5.6),
and the second isomorphism follows from
Proposition 4.4.2
and (4.5.1). The last assertion follows from (4.4.3).
∎
Appendix A Categorical toolbox, I
This appendix gathers known and less-known results that we use constantly.
A.1. Pro-objects ([SGA4, exposé I, §8], [AM69, Appendix 2])
Recall that a pro-object of a category C is a functor F:A→C, where A is a small cofiltered category (dual of [Mac98, Chapter IX, §1]).
They are denoted by {Xα}α∈A
or by ‘‘lim"α∈AXα (Deligne’s notation), with Xα=F(α). Pro-objects of C form a category pro–C, with morphisms given by the formula
[TABLE]
There is a canonical full embedding c:C↪pro–C, sending an object to the corresponding constant pro-object (A={∗}).
For the next lemma, we recall a special case of comma categories from Mac Lane [Mac98, Chapter II, §6]. If ψ:A→B is a functor and b∈B, we write b↓ψ for the category whose objects are pairs (a,f)∈A×B(b,ψ(a)); a morphism (a1,f1)→(a2,f2) is a morphism g∈A(a1,a2) such that f2=ψ(g)f1. The category ψ↓b is defined dually (objects: systems ψ(a)fb, etc.)
According to [Mac98, Chapter IX, §3], ψ is final if, for any b∈B, the category ψ↓b is nonempty and connected; here we shall use the dual property cofinal (same conditions for b↓ψ). As usual, we abbreviate IdA↓a and a↓IdA by A↓a and a↓A.
Let F=(F:A→C)={Xα}α∈A∈pro–C. For each α∈A, we have a “projection” morphism πα:F→c(Xα) in pro–C. This yields an isomorphism in pro–C
[TABLE]
(explaining Deligne’s notation) and a functor
[TABLE]
where we take A=C and B=pro–C in the above setting.
Lemma A.1.1**.**
The functor θ is cofinal.
Proof.
Let Ffc(Y) (Y∈C) be an object of F↓c. An object of θ↓(Ffc(Y)) is a pair (α,φ), with α∈A and φ:F(α)→Y such that f=c(φ)πα.
This category is nonempty because an object α∈A and the morphism f yield the object f(α):F(α)→c(Y)(α)=Y, and we have (α,f(α))∈θ↓(Ffc(Y)).
Note also that it is cofiltered, because A is.
Since any cofiltered category is obviously connected, we are done.
∎
(Warning: the use of co in (co)final and (co)filtered is opposite in [Mac98] and in [KS06]. We use the convention of [Mac98].)
Let u:C→D be a functor: it induces a functor pro–u:pro–C→pro–D.
Recall standard terminology for the functoriality of limits (=inverse limits) and colimits (= direct limits):
Definition A.2.1**.**
A functor u:C→D is left exact (resp. right exact, resp. exact) if it commutes with finite limits (resp. finite colimits, resp. finite limits and colimits).
Proposition A.2.2** (dual of [SGA4, exposé I, proposition 8.11.4]).**
Consider the following conditions:
(i)
The functor pro–u has a left adjoint.
(ii)
There exists a functor v:D→pro–C and an isomorphism
[TABLE]
contravariant in d∈D and covariant in c∈C.
(iii)
u* is left exact.*
Then (i)⟺(ii)⇒(iii), and (iii)⇒(i) if C is essentially small and closed under finite inverse limits.∎
(The condition on finite inverse limits appears in [AM69, p. 158], but is skipped in [SGA4, exposé I, proposition 8.11.4].)
Definition A.2.3**.**
In Condition (ii) of Proposition A.2.2, we say that v is pro-left adjoint to u.
A.3. Localisation ([GZ67, Chapter I], see also [KS06, Chapter 7])
Let C be a category, and let Σ⊂Ar(C) be a class of morphisms: following Grothendieck and Maltsiniotis, we call (C,Σ) a localiser. Consider the functors F:C→D such that F(s) is invertible for all s∈Σ. This “2-universal problem” has a solution Q:C→C[−1]. One may choose C[−1] to have the same objects as C and Q to be the identity on objects; then C[−1] is unique (not just up to unique equivalence of categories).
If C is essentially small, then C[−1] is small, but in general the sets C[−1](X,Y) may be “large”; one can sometimes show that it is not the case (Corollary A.5.4). A functor of the form Q:C→C[−1] will be called a localisation. We have a basic result on adjoint functors [GZ67, Chapter I, Proposition 1.3]:
Lemma A.3.1**.**
Let G:C⇆D:D be a pair of adjoint functors (G is left adjoint to D). Then the following conditions are equivalent:
(i)
D* is fully faithful.*
(ii)
The counit GD⇒IdD is a natural isomorphism.
(iii)
G* is a localisation.*
The same holds if G is right adjoint to D (replacing the counit by the unit).
Definition A.3.2**.**
Let (C,Σ) be a localiser, and let Q:C→C[−1] be the corresponding localisation functor. We write
[TABLE]
This is the saturation of ; we say that is saturated if sat(Σ)=Σ.
Let (C,Σ) be a localiser, D a category, F,G:C[−1]→D two functors and u:F∘Q⇒G∘Q a natural transformation, where Q:C→C[−1] is the localisation functor. Then u induces a unique natural transformation uˉ:F⇒G.
Proof.
Define uˉX=uX:F(X)→G(X) for X∈ObC[−1]=ObC. We must show that uˉ commutes with the morphisms of C[−1]. This is obvious, since u commutes with the morphisms of C and the morphisms of C[−1] are expressed as fractions in the morphisms of C.
∎
A.4. Presheaves and pro-adjoints
Let C be a category. We write C^ for the category of presheaves of sets on C (i.e. functors Cop→Set); it comes with the Yoneda embedding
[TABLE]
which sends an object to the corresponding representable presheaf. If u:C→D is a functor, we have the standard sequence of three adjoint functors
[TABLE]
where u! extends u through the Yoneda embeddings [SGA4, exposé I, proposition 5.4]; u! and u∗ are computed by the usual formulas for left and right Kan extensions (loc. cit., (5.1.1)). If u has a left adjoint v, the sequence (u!,u∗,u∗) extends to
[TABLE]
(ibid., Remark 5.5.2).
Let A be an essentially small additive category. Instead of presheaves of sets on A, one usually uses the category Mod–A of additive presheaves of abelian groups; the above results transfer to this context, mutatis mutandis.
Proposition A.4.1**.**
a)
*The functor u! (resp. u∗, u∗) commutes with all representable colimits (resp. limits, limits and colimits). If u has a left adjoint, then u! also commutes with all limits. If u has a pro-left adjoint v *(Definition A.2.3), so does u! which is therefore exact. Moreover, u! is then given by the formula
[TABLE]
b)
If u is fully faithful, so is u!.
c)
If u is a localisation or is full and essentially surjective, then u! is a localisation.
d)
In the case of c), for C∈C the following conditions are equivalent:
(i)
The representable functor yC(C)∈C^ induces a functor on D via u.
(ii)
The unit map yC(C)→u∗u!yC(C)≃u∗yD(u(C)) is an isomorphism.
(iii)
For any C′∈C, the map C(C′,C)→D(u(C′),u(C)) induced by u is bijective.
Proof.
a) follows from general properties of adjoint functors, except for the case of a pro-left adjoint. Let u admit a pro-left adjoint v, and let Y∈D: so there is an isomorphism of categories Y↓u≃v(Y)↓c. Hence, we get by Lemma A.1.1 a cofinal functor
[TABLE]
where A is the indexing set of v(Y). Thus, for F∈C^, u!F(Y) may be computed as
[TABLE]
The first equality is the formula in the proposition. The second one shows that the pro-left adjoint v! of u! is defined at yD(Y) by yC(v(Y)); since any object of D^ is a colimit of representable objects, this shows that v! is defined everywhere.
For b), see [SGA4, exposé I, proposition 5.6]. In c), it is equivalent to show that u∗ is fully faithful by Lemma A.3.1. Let F,G∈D^, and let φ:u∗F→u∗G be a morphism of functors. In both cases, u is essentially surjective: given X∈D and an isomorphism α:X∼u(Y), we get a morphism
[TABLE]
The fact that ψX is independent of (Y,α) and is natural in X is an easy consequence of each hypothesis (see Lemma A.3.3 in the first case).
In d), the equivalence (ii) ⟺ (iii) is tautological and (iii) ⇒ (i) is obvious. The implication (i) ⇒ (iii) was proven in [GZ67, Chapter I, §4.1.2] assuming that u is a localisation enjoying a calculus of left fractions; let us prove (i) ⇒ (ii) in general. Under (i), we have yC(C)≃u∗F for some F∈D^; the unit map becomes
[TABLE]
On the other hand, the counit map εF:u!u∗F→F is invertible by the full faithfulness of u∗. By the adjunction identities, we have u∗(εF)∘ηu∗F=1u∗F. Hence the conclusion.
∎
We shall usually write u! for the pro-left adjoint of u!, when it exists.
A.5. Calculus of fractions
Definition A.5.1** (dual of [GZ67, Chapter I, Lemma 1.2]).**
A localiser (C,Σ) (or simply ) enjoys a calculus of right fractions if:
(i)
The identities of C are in .
(ii)
is stable under composition.
(iii)
(Ore condition.) For each diagram X′sXuY where s∈Σ, there exists a commutative square
[TABLE]
(iv)
(Cancellation.) If f,g:X⇉Y are morphisms in C and s:Y→Y′ is a morphism of such that sf=sg, there exists a morphism t:X′→X in such that ft=gt.
Proposition A.5.2**.**
Suppose that enjoys a calculus of right fractions. For c∈C, let Σ↓c denote the full subcategory of the comma category C↓c given by the objects c′sc with s∈Σ. Then
a)
Σ↓c* is cofiltered.*
b)
[GZ67, Chapter I, 2.3]** For any d∈C, the obvious map
[TABLE]
is an isomorphism.
c)
Any morphism in C[−1] is of the form Q(f)Q(s)−1 for f∈Ar(C) and s∈Σ; if f1,f2 are two parallel arrows in C, then Q(f1)=Q(f2) if and only if there exists s∈Σ such that f1s=f2s.
Proof.
a)
We need to check the two conditions
(which are dual to those from [Mac98, p. 211]):
(1)
given two objects d,d′∈Σ↓c,
there are arrows d←e→d′ in Σ↓c;
(2)
given two parallel arrows f,g:e→d in Σ↓c,
there is an arrow h:e′→e in Σ↓c such that fh=gh.
(1) (resp. (2)) follows from Axioms (iii) and (ii)
(resp. (iv) and (ii)) of Definition A.5.1.
b) The “obvious map” (A.5.1) sends a pair (c′sc,c′fd) with s∈Σ and f∈C(c′,d) to Q(f)Q(s)−1.
To show it is an isomorphism, we follow the strategy of [GZ67, pp. 13/14].
We consider a category −1C with the same objects as C
and for c,d∈C the Hom set −1C(c,d) is given by
the left hand side of (A.5.1).
Using Axioms (ii) and (iii), we define for three objects c,d,e∈C a composition
[TABLE]
which is shown to be well-defined and associative thanks to Axiom (iv).
Now (A.5.1) yields a functor −1C→C[−1].
But there is also an obvious functor C→−1C
that is the identity on objects.
(We use Axiom (i) to define the maps for the Hom sets.)
It is easily seen to have the universal property of C[−1].
Hence (A.5.1) is an isomorphism for all (c,d).
c) The first statement has already been observed; the second one follows readily from (A.5.1).
∎
Notation A.5.3**.**
We shall write −1C instead of C[−1] if enjoys a calculus of fractions.
Corollary A.5.4**.**
If admits a calculus of right fractions and if for any c∈C, the category Σ↓c contains a small cofinal subcategory, then the Hom sets of −1C are small.∎
Corollary A.5.5**.**
Let (C,Σ) be a localiser such that enjoys a calculus of right fractions. Let F:C→D be a functor. Suppose that F inverts the morphisms of and that, for any c,d∈C, the obvious map
[TABLE]
is an isomorphism. Then the functor −1F:−1C→D induced by F is fully faithful.∎
Proposition A.5.6**.**
a)
Let (C,Σ) be a localiser. Assume that ** enjoys a calculus of right fractions. Then the localisation functor Q:C→−1C is left exact; if limits indexed by a finite category I exist in C, they also exist in −1C.
b)
Let C be an essentially small category closed under finite limits, and let G:C→D be a left exact functor. Let Σ={s∈Ar(C)∣G(s) is invertible}. Then ** enjoys a calculus of right fractions; the induced functor −1C→D is conservative and left exact.
Proof.
After passing to the opposite categories, a) is [GZ67, Chapter I, Proposition 3.1 and Corollary 3.2] and b) is [GZ67, Chapter I, Proposition 3.4].∎
A.6. Pro--objects
Definition A.6.1**.**
Let (C,Σ) be a localiser. We write pro–C for the full subcategory of the category pro–C of pro-objects of C consisting of filtered inverse systems whose transition morphisms belong to . An object of pro–C is called a pro--object.
Proposition A.6.2**.**
Suppose that has a calculus of right fractions and, for any c∈C, the category Σ↓c contains a small cofinal subcategory. Then Q:C→−1C has a pro-left adjoint Q!, which takes an object Y∈−1C to ‘‘lim"X∈Σ↓YX(see §A.1 for the notation ‘‘lim").
In particular, Q!(−1C)⊂prosat(Σ)–C, where sat(Σ) is the saturation of (Definition A.3.2).
Proof.
In view of Corollary A.5.4 and Proposition A.5.6, this follows from Proposition A.5.2 b).
∎
Remark A.6.3*.*
Consider the localisation functor Q:C→−1C: it has a left Kan extension
[TABLE]
[Mac98, Chapter X] along the constant functor C→prosat(Σ)–C, given by the formula
[TABLE]
(The right hand side makes sense as an inverse limit of isomorphisms.) Then one checks easily that Q! is left adjoint to Q^.
Theorem A.6.4**.**
Let (C,Σ) be a localiser verifying the conditions of Proposition A.6.2. Let Q:C→−1C denote the localisation functor, and consider the string of adjoint functors (Q!,Q∗,Q∗) between C^ and −1C from §A.4. Then:
(1)
Q!* has a pro-left adjoint, and is therefore exact.*
2. (2)
For F∈C^ and Y∈−1C, we have
[TABLE]
Proof.
This follows from Propositions A.4.1 a) and A.6.2.
∎
If (A,Σ) is a localiser with A additive and enjoys a calculus of right fractions, then −1A is additive and so is the functor Q:A→−1A [GZ67, Chapter I, Corollary 3.3].
For future reference, we give the additive analogue of Theorem A.6.4
(see the paragraph before Proposition A.4.1 for Mod–A):
Theorem A.6.5**.**
Let (A,Σ) be a localiser; assume that A is an additive category and that has a calculus of right fractions. Let Q:A→−1A denote the localisation functor, as well as the string of adjoint functors (Q!,Q∗,Q∗) between Mod–A and Mod–−1A. Then:
(1)
Q!* has a pro-left adjoint, and is therefore exact.*
2. (2)
For F∈Mod–A and Y∈−1A, we have
[TABLE]
A.7. cd-structures
Let C be a category with an initial object. According to [Voe10a], a cd-structure on C is given by a collection of commutative squares stable under isomorphisms, called distinguished squares. Any cd-structure defines a topology on C: the smallest Grothendieck topology such that for a distinguished square of the form
[TABLE]
the sieve generated by the morphisms
{p:V→X,\leavevmodeu:U→X}
is a cover sieve and such that the empty sieve is a cover sieve of the initial object ∅.
Recall from [Voe10a] some important properties of cd-structures.
Definition A.7.1**.**
Let C be a category with an initial object ∅.
(1)
Let P be a cd-structure on C.
The class SP of simple covers is the smallest class of families of morphisms of the form {Ui→X}i∈I satisfying the following two conditions:
•
for any isomorphism f, {f} is in SP
•
for a distinguished square Q of the form (A.7.1) and families {pi:Vi→V}i∈I and {qj:Uj→U}j∈J in SP the family {p∘pi,u∘qj}i∈I,j∈J is in SP.
2. (2)
A cd-structure on C is called complete if any cover sieve of an object X∈C which is not isomorphic to ∅ contains a sieve generated by a simple cover.
3. (3)
A cd-structure P is called regular if for S∈P of the form (A.7.1) one has
•
S is a pullback square (i.e., is cartesian)
•
u is a monomorphism
•
the morphisms of sheaves
[TABLE]
is surjective, where for C∈C we denote by ρ(C) the sheaf associated with the presheaf represented by C,
and is induced by the diagonal map.
A cd-structure is regular provided, for any distinguished square S of the form (A.7.1) we have
(1)
S* is cartesian,*
2. (2)
u* is a monomorphism, and*
3. (3)
the objects V×XV and W×UW exist in C and the derived square
[TABLE]
is distinguished.∎
Definition A.7.4**.**
A cd-structure verifying the conditions of Lemma A.7.2 (resp. A.7.3) is called strongly complete (resp. strongly regular).
Remark A.7.5*.*
The square (A.7.2) is cartesian.
This is a formal consequence of Lemma A.7.3, since any distinguished square with respect to a regular cd-structure is cartesian by definition.
However, there is a more direct proof: let ZaV and ZbW×UW be two morphisms making the corresponding square commute. Then b amounts to two morphisms b1,b2:Z→W such that (with the notation of (A.7.1)) qb1=qb2 and a=vb1=vb2. Since S is cartesian by (1), we have b1=b2:Z→W, which is a solution to the universal problem.
Proposition A.7.6**.**
Let (C,Σ) be a localiser such that admits a calculus of right fractions.
(1)
If C has an initial object verifying Conditon (1) of Lemma A.7.2, so does −1C.
2. (2)
Assume (1) and let Q:C→−1C be the localisation functor. Suppose given a cd-structure P on C, and let P′ be the cd-structure on −1C given by all squares isomorphic to a square of the form Q(S), where S∈P. If P is strongly complete (resp. strongly regular), so is P′.
Proof.
(1) Let ∅ be an initial object of C. Since Q is (essentially) surjective, Q(∅) admits a morphism to any object; Condition (1) of Lemma A.7.2 for ∅ implies that this morphism is unique, and this in turn implies the same condition for Q(∅).
(2) By Proposition A.5.6 a), Q commutes with finite limits. This implies Condition (2) of Lemma A.7.2. Conditions (1), (3) of Lemma A.7.3 for P′ follow from the same conditions for P (note that the diagonals are preserved by Q, since they are finite limits). It remains to show that Q carries a monomorphism u:U→X to a monomorphism. Let f,g:V→U be two morphisms in −1C such that Q(u)f=Q(u)g. By calculus of fractions, we may write f=Q(f~)Q(s)−1 and g=Q(g~)Q(s)−1 for some f~,g~∈Ar(C) and s∈Σ. Then Q(uf~)=Q(ug~). By Proposition A.5.2 c), we may find t∈Σ such that uf~t=ug~t, which implies f~t=g~t since u is a monomorphism. This shows f=g, as desired.
∎
A.8. A pull-back lemma
We shall use
the following elementary lemma several times.
Lemma A.8.1**.**
Let C,D be abelian categories
and let C′⊂C,D′⊂D
be full abelian subcategories.
Let c:C→D and c′:C′→D′
be additive functors satisfying ciC=iDc′,
where iC:C′→C
and iD:D′→D are inclusion functors.
(1)
If c is faithful, so is c′.
2. (2)
Suppose that iD is strongly additive or has a strongly additive left inverse (for example, a left adjoint). If c and iC are strongly additive, so is c′.
3. (3)
Suppose that iC has a left adjoint aC.
If c has a left adjoint d,
then d′=aCdiD is a left adjoint of c′. If d and aC are exact, so is d′. Moreover, aCd=d′aD if iD has a left adjoint aD.
4. (4)
Suppose that
iC and iD have left adjoints aC and aD,
that aD is exact, and that aDc=c′aC.
If c is exact, then so is c′.
Proof.
(1) is obvious.
(2) Let {Fi}i∈I be a family of objects of C′. We must show that the natural map
[TABLE]
is an isomorphism. The composition
[TABLE]
is an isomorphism by the strong additivity of c and iC. If iD is strongly additive, g is also an isomorphism and we are done. If now iD has a strongly additive left inverse aD, we apply it to the diagram and get a composition
[TABLE]
which is an isomorphism and naturally isomorphic to f. This concludes the proof of (2).
(3) For F∈C′ and G∈D′, we have
C′(aCdiDF,G)=D(iDF,ciCG)=D(iDF,iDc′G)=D′(F,c′G). This proves the first claim; therefore if d and aC are exact, d′ is left exact, hence exact since it is right exact as a left adjoint. The last isomorphism follows from taking left adjoints of the isomorphism ciC=iDc′.
(4) Let us take an exact sequence
0→F→G→H→0 in C′.
Put K:=Coker(iCG→iCH)∈C.
Since aDcK=c′aCK=0,
we get an exact sequence
0→aDciCF→aDciCG→aDciCH→0
by the exactness of c and aD.
Using aDc=c′aC and aCiC=Id (Lemma A.3.1),
we conclude
0→c′F→c′G→c′H→0 is exact.
∎
The proof of Lemma A.8.1 (2) implicitly used the following (trivial) lemma, which we state for the sake of clarity.
Lemma A.8.2**.**
Let D⊆C be a full embedding of categories. Suppose that a direct (resp. inverse) system (dα) of objects of D has a colimit (resp. a limit) in C, which is isomorphic to an object d of D. Then d represents the (co)limit of (dα) in D.
Let AFBGC be a string of left exact functors between abelian categories. Suppose that A and B have enough injectives and that F carries injectives of A to G-acyclics. Then, for any A∈A, there is a convergent spectral sequence
[TABLE]
Examples A.9.2*.*
If F has an exact left adjoint, it carries injectives to injectives. If G is exact, the hypothesis on F is automatically verified.
The following is a slight generalization of [Mil80, Chapter III, Proposition 2.12],
(where the underlying category of S
is supposed to be a category of schemes).
Lemma A.9.3**.**
Let F be a sheaf of abelian groups on a site S.
The following conditions are equivalent.
(1)
We have Hq(X,F)=0
for any X∈S and q>0.
2. (2)
We have Hˇq(X,F)=0
for any X∈S and q>0.
3. (3)
We have Hˇq(U/X,F)=0
for any cover U→X in S and q>0.
4. (4)
The sheaf F is iS-acyclic,
where iS is the inclusion functor
of the category of sheaves to that of presheaves.
Proof.
For X∈S,
we write X (resp. Xpr)
for the functor F↦F(X)
from the category of sheaves
(resp. presheaves) to Ab.
We have X=XpriS.
Since Xpr is exact,
Theorem A.9.1 implies
RqX=XprRqiS,
and hence Hq(X,F)=RqiSF(X).
This proves the equivalence of (1) and (4).
The rest is shown in the same way as
[Mil80, Chapter III, Proposition 2.12].
∎
Definition A.9.4**.**
We say F is flabby
if the conditions of Lemma A.9.3 are satisfied.
Lemma A.9.5**.**
Let S be the category of abelian sheaves on a site C,
T an abelian category,
and c∗:T→S an additive functor
which has a left adjoint c!:S→T.
Suppose that any cover in C
admits a refinement U→X such that
c!(Cˇ(U/X)) is exact in T,
where
[TABLE]
is the Čech complex associated to U→X
(y denotes the Yoneda functor).
Then c∗I is flabby
for any injective object I∈T.
Proof.
(Compare [Voe00, Proposition 3.1.7].)
It suffices to show
Hˇq(U/X,c∗I)=0 for any q>0
and for any U→X as in the assumption.
If we denote by UXn the
n-fold fiber product of U over X,
then Hˇq(U/X,c∗I)
is computed as the cohomology of the complex
[TABLE]
which is acyclic by the assumption and
the injectivity of I.
∎
A.10. Grothendieck categories
Recall that a Grothendieck abelian category (for short, a Grothendieck category) is an abelian category verifying Axiom AB5 of [Gro57]: small colimits are representable and exact, and having a set of generators (equivalently, a generator). These generators are generators by strict epimorphisms.
We have the following basic facts:
Theorem A.10.1**.**
a)
Any Grothendieck category is complete and has enough injectives.
b)
Let F:C→D be a functor, where C is a Grothendieck category. Then F has a right adjoint if and only if it commutes with all colimits.
c)
Let C be a Grothendieck category, B⊂C be a Serre subcategory, D=C/B and G:C→D the (exact) localisation functor. Then G has a right adjoint D if and only if B is stable under infinite direct sums. In this case, B and D are Grothendieck.
d)
Let G:C⇆D:D be a pair of adjoint additive functors between additive categories, with D fully faithful. If C is Grothendieck and G is exact, D is Grothendieck.
Proof.
a) See [Gro57, théorème 1.10.1], [SGA4, exposé V, remarque 0.2.1] or [KS06, Theorem 8.3.27 (i) and 9.6.2]. b) See [KS06, Proposition 8.3.27 (iii)]. c) See [Gab62, chapitre III, proposition 8 and 9]. d) Let B be the kernel of G. Then B is easily seen to be a Serre subcategory (e.g. [Gab62, chapitre III, proposition 5]), so the claim follows from c).
∎
Theorem A.10.2**.**
For any additive category A,
Mod–A is a Grothendieck category
with a set of projective generators.
Proof.
See e.g. [AK02, Proposition 1.3.6] for the first statement; the projective generators are given by E={y(A)∣A∈A}.
∎
Bibliography34
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[AK 02] Y. André, B. Kahn, Nilpotence, radicaux et structures monoïdales (with an appendix by P. O’Sullivan), Rend. Sem. Math. Univ. Padova 108 (2002), 107–291.
2[AM 69] M. Artin, B. Mazur, Étale homotopy , Lect. Notes in Math. 100 , Springer, 1969.
3[Ayo 15] J. Ayoub, Motifs de variétés analytiques rigides , Mém. SMF 140-141 (2015), vi+386.
4[BE 03] S. Bloch, H. Esnault, An additive version of higher Chow groups , Ann. Sci. Éc. Norm. Sup. 36 (2003), no. 3, 463–477.
5[BM 08] E. Bierstone, P. Milman, Functoriality in resolution of singularities , Publ. RIMS, Kyoto Univ. 44 (2008), 609–639.
6[BS 19] F. Binda, S. Saito, Relative cycles with moduli and regulator maps , J. Inst. Math. Jussieu 18 (2019), no. 6, 1233–1293.
7[Gab 62] P. Gabriel, Des catégories abéliennes , Bull. SMF 90 (1962), 323–448.
8[GZ 67] P. Gabriel, M. Zisman, Calculus of fractions and homotopy theory , Springer, 1967.