The Stacks project

Comments 1221 to 1240 out of 9050 in reverse chronological order.

\begin{equation*} \DeclareMathOperator\Coim{Coim} \DeclareMathOperator\Coker{Coker} \DeclareMathOperator\Ext{Ext} \DeclareMathOperator\Hom{Hom} \DeclareMathOperator\Im{Im} \DeclareMathOperator\Ker{Ker} \DeclareMathOperator\Mor{Mor} \DeclareMathOperator\Ob{Ob} \DeclareMathOperator\Sh{Sh} \DeclareMathOperator\SheafExt{\mathcal{E}\mathit{xt}} \DeclareMathOperator\SheafHom{\mathcal{H}\mathit{om}} \DeclareMathOperator\Spec{Spec} \newcommand\colim{\mathop{\mathrm{colim}}\nolimits} \newcommand\lim{\mathop{\mathrm{lim}}\nolimits} \newcommand\Qcoh{\mathit{Qcoh}} \newcommand\Sch{\mathit{Sch}} \newcommand\QCohstack{\mathcal{QC}\!\mathit{oh}} \newcommand\Cohstack{\mathcal{C}\!\mathit{oh}} \newcommand\Spacesstack{\mathcal{S}\!\mathit{paces}} \newcommand\Quotfunctor{\mathrm{Quot}} \newcommand\Hilbfunctor{\mathrm{Hilb}} \newcommand\Curvesstack{\mathcal{C}\!\mathit{urves}} \newcommand\Polarizedstack{\mathcal{P}\!\mathit{olarized}} \newcommand\Complexesstack{\mathcal{C}\!\mathit{omplexes}} \newcommand\Pic{\mathop{\mathrm{Pic}}\nolimits} \newcommand\Picardstack{\mathcal{P}\!\mathit{ic}} \newcommand\Picardfunctor{\mathrm{Pic}} \newcommand\Deformationcategory{\mathcal{D}\!\mathit{ef}} \end{equation*}

On left comment #8435 on Section 27.4 in Constructions of Schemes

I think it's also interesing to think about the presheaf on that the object represents. Let be a category, and let be an object of . Let be a presheaf on . Consider the induced functor that sends to . Then is representable if and only if is representable (not difficult to show). In our situation, , , the functor sends to , and is 27.4.0.1.

That is, in Görtz & Wedhorn words (see (11.2) of the 2nd ed.), this construction can be regarded as a globalized version of the natural isomorphim where is an -algebra.


On ZL left comment #8434 on Lemma 66.20.2 in Properties of Algebraic Spaces

I'm a little confused about the statement of the lemma and its proof. In the statement, we see is an algebraic space étale over . But in the proof, after citing lemma 17.5.2, we see that , having an underlying topological space, is a scheme.

I guess that previous lemma 66.20.1 is used to prove the space case. Since the , we may assume . Then consider the sheaf assigning to a singleton if and assigning to otherwise. Then using 66.20.1 we get the open subspace .

There is also a typo for the conclusion : where .


On left comment #8433 on Lemma 27.4.4 in Constructions of Schemes

I think the expression should be instead. Here's an alternative way to phrase the proof that doesn't require invoking : "Let be open affine. Since the functor is represented by , let be the universal element. By the proof of 26.15.4 (we verified the hypotheses in the proof of 27.4.3), it suffices to see that . This follows from the construction of and ."


On Ben Church left comment #8432 on Lemma 37.24.7 in More on Morphisms

In line 4, it should read "such that (X_{K'})_{red} is geometrically reduced"


On left comment #8431 on Lemma 27.2.1 in Constructions of Schemes

Okay, sorry, I have just realized that my last comment is just the first paragraph of 27.2.3.


On left comment #8430 on Lemma 27.2.1 in Constructions of Schemes

Here is an elegant argument to argue the uniqueness of up to unique isomorphism over : Define a relative gluing datum over to be a pair as in (1), (2) and satisfying (a), (b). Define a morphism of relative gluing data over to be a collection of maps over such that for with the following diagram commutes: Denote to the category of relative gluing data over . We have an obvious functor that is easily verifiable to be fully faithful. The lemma can be reformulated to "this functor is essentially surjective."


On left comment #8429 on Lemma 27.2.1 in Constructions of Schemes

In the last paragraph, to give more details for why is an isomorphism, maybe one could say "with the notations of [https://stacks.math.columbia.edu/tag/001L#comment-8427], verify that , where is the inclusion."


On left comment #8428 on Lemma 26.15.4 in Schemes

Minor typo: in the last paragraph, should be . On the other hand, to give more details in "on the overlaps the morphisms and agree," one could write: first note that a morphism factors through if and only if . Thus, the identity implies , for . Hence, and using [https://stacks.math.columbia.edu/tag/001L#comment-8427] we get .


On left comment #8427 on Section 4.3 in Categories

Maybe one could add to this section the definition of subfunctor (given in 26.15.3) stated in a general setting and also add the following remark: Let be a category and let be a morphism in . Suppose is a functor with a representation . For an object , define to be the image of the composite . Then is a subfunctor of and the natural transformation is an isomorphism if and only if is a monomorphism. Moreover, if these conditions hold and is the universal object for , then is the universal object for .


On left comment #8426 on Section 29.32 in Morphisms of Schemes

See 6.30. You can use the search function to find stuff like this.


On YD left comment #8425 on Section 10.29 in Commutative Algebra

In the penultimate paragraph, "Let ": should be instead of .


On Jackson left comment #8424 on Section 29.32 in Morphisms of Schemes

Would you please give me the reference for the remark that we can define the sheaf on basis in which we have the restriction maps and gluing properties? Thank you!


On left comment #8422 on Lemma 13.14.13 in Derived Categories

Typo: instead of “ has a section” it should be “has a retraction.” Also, I am having trouble understanding the proof: the first problem I have is with “hence for some object of such that is zero (Lemma 13.4.12).” I do understand why having a retraction implies that it must be isomorphic to an inclusion (this is a property of monomorphisms in pre-triangulated categories), but where does the latter condition on the vanishment of comes from? On the other hand, taking for granted this vanishment condition, I think I understand everything what comes after until “ annihilates ” (this last thing I understand too). But why is it that after “it follows that is essentially constant on with value ”?


On Ryo Suzuki left comment #8421 on Lemma 29.29.5 in Morphisms of Schemes

The proof can be simplified.

By virtue of Lemma 01TH, it is sufficient to prove that: Let be a locally Noetherian scheme, and . Then is isolated in if and only if .

Proof. If is an isolated point, is open (by Definition 06RM). Hence {\rm dim}_x Y = 0 (by Definition 0055). Conversely, if , then there exists an open subset such that . We can take Noetherian because is locally Noetherian. Since is 0-dimensional Noetherian scheme, it is discrete. Hence is isolated point of . q.e.d.


On left comment #8420 on Lemma 13.23.3 in Derived Categories

I think in the diagram of the statement one should change by .


On left comment #8419 on Lemma 13.20.2 in Derived Categories

To prove (2), is there some reason by which one needs to invoke 13.20.1 and 13.16.8 instead of just saying "(2) is a particular case of (1)"?


On left comment #8418 on Section 13.18 in Derived Categories

To justify the short exactness of , maybe one could link to Homology, Section 12.6 (specifically, to what I comment in https://stacks.math.columbia.edu/tag/010I#comment-8412 )


On left comment #8417 on Lemma 13.18.8 in Derived Categories

To justify "there exists a quasi-isomorphism with homotopic to zero," one could link the result I propose between parentheses in https://stacks.math.columbia.edu/tag/05RW#comment-8372


On left comment #8416 on Lemma 13.18.6 in Derived Categories

It took me a while to find out how the map is defined. Here is a proof by chasing elements: it suffices to show that the composite vanishes. Let . Since is an isomorphism, there are and such that . Hence, the image of along equals and vanishes by commutativity of the solid diagram, for .


On left comment #8415 on Lemma 13.18.4 in Derived Categories

The correct proof is not much different from the actual one: suppose there is and that, for each , there are maps such that for all . We are going to construct a map such that . For this, note that Hence, , and we can reuse the already existing argument.