Basic example of a formal affine scheme, functorial point of viewIs there functorial point of view to differential operator?Functorial point of view of spectrum (Looking for reference)Functorial point of view for formal schemesNon-algebraizable Formal Scheme?coherent sheaves on affine formal schemesglobal section of affine $C^infty$-schemeBasic questions about formal schemesFunctorial description of a certain subgroup schemeReference Request: Categorical/Functorial approach to Formal Schemes and Formal GroupsCoproduct in the category of affine schemes, functorial point of view

Basic example of a formal affine scheme, functorial point of view


Is there functorial point of view to differential operator?Functorial point of view of spectrum (Looking for reference)Functorial point of view for formal schemesNon-algebraizable Formal Scheme?coherent sheaves on affine formal schemesglobal section of affine $C^infty$-schemeBasic questions about formal schemesFunctorial description of a certain subgroup schemeReference Request: Categorical/Functorial approach to Formal Schemes and Formal GroupsCoproduct in the category of affine schemes, functorial point of view













2












$begingroup$


$letopn=operatorname$For my BA thesis I have to describe formal groups from the functorial point of view. I am hence reading Strickland - Formal Schemes and Formal Groups, which is apparently the only article that deals with this topic in that way.



He defines (4.1) an formal scheme as a functor $X: opnCRingsto opnSet$ that is a small filtered colimit of affine schemes i.e., $X(R)=limlimits_rightarrow iX_i(R)$.



The first example (4.2) is given by the functor $widehatmathbb A^1 $ defined as $widehatmathbb A^1(R)mathrel:=opnNil(R)$.



I don't understand why this functor is the colimit over $N$ of the functors $opnspec(mathbbZ[x]/x^N+1)mathrel:=opnHom_opnCRing(mathbbZ[x]/x^N+1,_)$.



I would appreciate it if someone could explain it in general and kindly give an illustrating example. Other simple examples of formal schemes are also highly welcome. Many thanks!










share|cite|improve this question











$endgroup$







  • 4




    $begingroup$
    You seem to be asking a lot of questions about basic examples and definitions from this paper. In order that your BA thesis represent your own work, it is probably better to work these out yourself, or at least to seek help from your advisor or classmates.
    $endgroup$
    – LSpice
    6 hours ago















2












$begingroup$


$letopn=operatorname$For my BA thesis I have to describe formal groups from the functorial point of view. I am hence reading Strickland - Formal Schemes and Formal Groups, which is apparently the only article that deals with this topic in that way.



He defines (4.1) an formal scheme as a functor $X: opnCRingsto opnSet$ that is a small filtered colimit of affine schemes i.e., $X(R)=limlimits_rightarrow iX_i(R)$.



The first example (4.2) is given by the functor $widehatmathbb A^1 $ defined as $widehatmathbb A^1(R)mathrel:=opnNil(R)$.



I don't understand why this functor is the colimit over $N$ of the functors $opnspec(mathbbZ[x]/x^N+1)mathrel:=opnHom_opnCRing(mathbbZ[x]/x^N+1,_)$.



I would appreciate it if someone could explain it in general and kindly give an illustrating example. Other simple examples of formal schemes are also highly welcome. Many thanks!










share|cite|improve this question











$endgroup$







  • 4




    $begingroup$
    You seem to be asking a lot of questions about basic examples and definitions from this paper. In order that your BA thesis represent your own work, it is probably better to work these out yourself, or at least to seek help from your advisor or classmates.
    $endgroup$
    – LSpice
    6 hours ago













2












2








2


1



$begingroup$


$letopn=operatorname$For my BA thesis I have to describe formal groups from the functorial point of view. I am hence reading Strickland - Formal Schemes and Formal Groups, which is apparently the only article that deals with this topic in that way.



He defines (4.1) an formal scheme as a functor $X: opnCRingsto opnSet$ that is a small filtered colimit of affine schemes i.e., $X(R)=limlimits_rightarrow iX_i(R)$.



The first example (4.2) is given by the functor $widehatmathbb A^1 $ defined as $widehatmathbb A^1(R)mathrel:=opnNil(R)$.



I don't understand why this functor is the colimit over $N$ of the functors $opnspec(mathbbZ[x]/x^N+1)mathrel:=opnHom_opnCRing(mathbbZ[x]/x^N+1,_)$.



I would appreciate it if someone could explain it in general and kindly give an illustrating example. Other simple examples of formal schemes are also highly welcome. Many thanks!










share|cite|improve this question











$endgroup$




$letopn=operatorname$For my BA thesis I have to describe formal groups from the functorial point of view. I am hence reading Strickland - Formal Schemes and Formal Groups, which is apparently the only article that deals with this topic in that way.



He defines (4.1) an formal scheme as a functor $X: opnCRingsto opnSet$ that is a small filtered colimit of affine schemes i.e., $X(R)=limlimits_rightarrow iX_i(R)$.



The first example (4.2) is given by the functor $widehatmathbb A^1 $ defined as $widehatmathbb A^1(R)mathrel:=opnNil(R)$.



I don't understand why this functor is the colimit over $N$ of the functors $opnspec(mathbbZ[x]/x^N+1)mathrel:=opnHom_opnCRing(mathbbZ[x]/x^N+1,_)$.



I would appreciate it if someone could explain it in general and kindly give an illustrating example. Other simple examples of formal schemes are also highly welcome. Many thanks!







ag.algebraic-geometry ct.category-theory limits-and-colimits formal-schemes






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited 6 hours ago









LSpice

3,1282 gold badges26 silver badges31 bronze badges




3,1282 gold badges26 silver badges31 bronze badges










asked 10 hours ago









sagirotsagirot

475 bronze badges




475 bronze badges







  • 4




    $begingroup$
    You seem to be asking a lot of questions about basic examples and definitions from this paper. In order that your BA thesis represent your own work, it is probably better to work these out yourself, or at least to seek help from your advisor or classmates.
    $endgroup$
    – LSpice
    6 hours ago












  • 4




    $begingroup$
    You seem to be asking a lot of questions about basic examples and definitions from this paper. In order that your BA thesis represent your own work, it is probably better to work these out yourself, or at least to seek help from your advisor or classmates.
    $endgroup$
    – LSpice
    6 hours ago







4




4




$begingroup$
You seem to be asking a lot of questions about basic examples and definitions from this paper. In order that your BA thesis represent your own work, it is probably better to work these out yourself, or at least to seek help from your advisor or classmates.
$endgroup$
– LSpice
6 hours ago




$begingroup$
You seem to be asking a lot of questions about basic examples and definitions from this paper. In order that your BA thesis represent your own work, it is probably better to work these out yourself, or at least to seek help from your advisor or classmates.
$endgroup$
– LSpice
6 hours ago










1 Answer
1






active

oldest

votes


















4












$begingroup$

It might be illuminating to first work the example of (ordinary) affine space $mathbbA^1_mathbbZ$ over the integers.



As a functor, $mathbbA^1_mathbbZ$ is the forgetful functor $mathitRings^mathrmoprightarrowmathitSets$, sending a ring $R$ to its underlying set. It is representable by $mathbbZ[t]$, as can be seen by the isomorphism $$mathrmHom_mathitRings(mathbbZ[t],R)cong R.$$
(As a homomorphism $fcolonmathbbZ[t]rightarrow R$ is determined by its value $f(t)$ at $t$, we can define an isomorphism $mathrmHom_mathitRings(mathbbZ[t],R)rightarrow R$ by $fmapsto f(t)$ for all $finmathrmHom_mathitRings(mathbbZ[t],R)$.)



$widehatmathbbA^1_mathbbZ$ is similar: there is an isomorphism
$$mathrmHom_mathitRings(mathbbZ[t]/(t^n),R)congmathrmNil_n(R),$$
where $mathrmNil_n(R)$ denotes the set of nilpotent elements $r$ of $R$ of order $n$ (i.e. $r^n=0$).
(We define an isomorphism as before, but now the element $f(t)$ that we send $f$ to must be nilpotent in $R$, for it to preserve the ring structure: $f(t)^n=f(t^n)=f(0)=0$.)



The answer from here own was changed following Dmitri Pavlov's comment:



As (co)limits of presheaves are computed objectwise, we see that $widehatmathbbA^1_mathbbZ$ sends $R$ to the colimit $mathrmcolim(mathrmNil_n(R))=bigcup_ngeq0mathrmNil_n(R)=mathrmNil(R)$.






share|cite|improve this answer











$endgroup$












  • $begingroup$
    (Sorry for the probably very overcomplicated proof.)
    $endgroup$
    – Théo de Oliveira Santos
    7 hours ago






  • 3




    $begingroup$
    Why do you need EGA here? Once you observed that Nil_n computes nilpotents of order n, you can immediately conclude the proof by observing that colimits of functors CRing→Set are computed objectwise and Nil(R)=⋃_n≥0Nil_n(R) because any nilpotent element of R has finite order.
    $endgroup$
    – Dmitri Pavlov
    6 hours ago










  • $begingroup$
    @DmitriPavlov That's precisely the fact I was missing. Thank you!
    $endgroup$
    – Théo de Oliveira Santos
    6 hours ago













Your Answer








StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "504"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);













draft saved

draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f336115%2fbasic-example-of-a-formal-affine-scheme-functorial-point-of-view%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









4












$begingroup$

It might be illuminating to first work the example of (ordinary) affine space $mathbbA^1_mathbbZ$ over the integers.



As a functor, $mathbbA^1_mathbbZ$ is the forgetful functor $mathitRings^mathrmoprightarrowmathitSets$, sending a ring $R$ to its underlying set. It is representable by $mathbbZ[t]$, as can be seen by the isomorphism $$mathrmHom_mathitRings(mathbbZ[t],R)cong R.$$
(As a homomorphism $fcolonmathbbZ[t]rightarrow R$ is determined by its value $f(t)$ at $t$, we can define an isomorphism $mathrmHom_mathitRings(mathbbZ[t],R)rightarrow R$ by $fmapsto f(t)$ for all $finmathrmHom_mathitRings(mathbbZ[t],R)$.)



$widehatmathbbA^1_mathbbZ$ is similar: there is an isomorphism
$$mathrmHom_mathitRings(mathbbZ[t]/(t^n),R)congmathrmNil_n(R),$$
where $mathrmNil_n(R)$ denotes the set of nilpotent elements $r$ of $R$ of order $n$ (i.e. $r^n=0$).
(We define an isomorphism as before, but now the element $f(t)$ that we send $f$ to must be nilpotent in $R$, for it to preserve the ring structure: $f(t)^n=f(t^n)=f(0)=0$.)



The answer from here own was changed following Dmitri Pavlov's comment:



As (co)limits of presheaves are computed objectwise, we see that $widehatmathbbA^1_mathbbZ$ sends $R$ to the colimit $mathrmcolim(mathrmNil_n(R))=bigcup_ngeq0mathrmNil_n(R)=mathrmNil(R)$.






share|cite|improve this answer











$endgroup$












  • $begingroup$
    (Sorry for the probably very overcomplicated proof.)
    $endgroup$
    – Théo de Oliveira Santos
    7 hours ago






  • 3




    $begingroup$
    Why do you need EGA here? Once you observed that Nil_n computes nilpotents of order n, you can immediately conclude the proof by observing that colimits of functors CRing→Set are computed objectwise and Nil(R)=⋃_n≥0Nil_n(R) because any nilpotent element of R has finite order.
    $endgroup$
    – Dmitri Pavlov
    6 hours ago










  • $begingroup$
    @DmitriPavlov That's precisely the fact I was missing. Thank you!
    $endgroup$
    – Théo de Oliveira Santos
    6 hours ago















4












$begingroup$

It might be illuminating to first work the example of (ordinary) affine space $mathbbA^1_mathbbZ$ over the integers.



As a functor, $mathbbA^1_mathbbZ$ is the forgetful functor $mathitRings^mathrmoprightarrowmathitSets$, sending a ring $R$ to its underlying set. It is representable by $mathbbZ[t]$, as can be seen by the isomorphism $$mathrmHom_mathitRings(mathbbZ[t],R)cong R.$$
(As a homomorphism $fcolonmathbbZ[t]rightarrow R$ is determined by its value $f(t)$ at $t$, we can define an isomorphism $mathrmHom_mathitRings(mathbbZ[t],R)rightarrow R$ by $fmapsto f(t)$ for all $finmathrmHom_mathitRings(mathbbZ[t],R)$.)



$widehatmathbbA^1_mathbbZ$ is similar: there is an isomorphism
$$mathrmHom_mathitRings(mathbbZ[t]/(t^n),R)congmathrmNil_n(R),$$
where $mathrmNil_n(R)$ denotes the set of nilpotent elements $r$ of $R$ of order $n$ (i.e. $r^n=0$).
(We define an isomorphism as before, but now the element $f(t)$ that we send $f$ to must be nilpotent in $R$, for it to preserve the ring structure: $f(t)^n=f(t^n)=f(0)=0$.)



The answer from here own was changed following Dmitri Pavlov's comment:



As (co)limits of presheaves are computed objectwise, we see that $widehatmathbbA^1_mathbbZ$ sends $R$ to the colimit $mathrmcolim(mathrmNil_n(R))=bigcup_ngeq0mathrmNil_n(R)=mathrmNil(R)$.






share|cite|improve this answer











$endgroup$












  • $begingroup$
    (Sorry for the probably very overcomplicated proof.)
    $endgroup$
    – Théo de Oliveira Santos
    7 hours ago






  • 3




    $begingroup$
    Why do you need EGA here? Once you observed that Nil_n computes nilpotents of order n, you can immediately conclude the proof by observing that colimits of functors CRing→Set are computed objectwise and Nil(R)=⋃_n≥0Nil_n(R) because any nilpotent element of R has finite order.
    $endgroup$
    – Dmitri Pavlov
    6 hours ago










  • $begingroup$
    @DmitriPavlov That's precisely the fact I was missing. Thank you!
    $endgroup$
    – Théo de Oliveira Santos
    6 hours ago













4












4








4





$begingroup$

It might be illuminating to first work the example of (ordinary) affine space $mathbbA^1_mathbbZ$ over the integers.



As a functor, $mathbbA^1_mathbbZ$ is the forgetful functor $mathitRings^mathrmoprightarrowmathitSets$, sending a ring $R$ to its underlying set. It is representable by $mathbbZ[t]$, as can be seen by the isomorphism $$mathrmHom_mathitRings(mathbbZ[t],R)cong R.$$
(As a homomorphism $fcolonmathbbZ[t]rightarrow R$ is determined by its value $f(t)$ at $t$, we can define an isomorphism $mathrmHom_mathitRings(mathbbZ[t],R)rightarrow R$ by $fmapsto f(t)$ for all $finmathrmHom_mathitRings(mathbbZ[t],R)$.)



$widehatmathbbA^1_mathbbZ$ is similar: there is an isomorphism
$$mathrmHom_mathitRings(mathbbZ[t]/(t^n),R)congmathrmNil_n(R),$$
where $mathrmNil_n(R)$ denotes the set of nilpotent elements $r$ of $R$ of order $n$ (i.e. $r^n=0$).
(We define an isomorphism as before, but now the element $f(t)$ that we send $f$ to must be nilpotent in $R$, for it to preserve the ring structure: $f(t)^n=f(t^n)=f(0)=0$.)



The answer from here own was changed following Dmitri Pavlov's comment:



As (co)limits of presheaves are computed objectwise, we see that $widehatmathbbA^1_mathbbZ$ sends $R$ to the colimit $mathrmcolim(mathrmNil_n(R))=bigcup_ngeq0mathrmNil_n(R)=mathrmNil(R)$.






share|cite|improve this answer











$endgroup$



It might be illuminating to first work the example of (ordinary) affine space $mathbbA^1_mathbbZ$ over the integers.



As a functor, $mathbbA^1_mathbbZ$ is the forgetful functor $mathitRings^mathrmoprightarrowmathitSets$, sending a ring $R$ to its underlying set. It is representable by $mathbbZ[t]$, as can be seen by the isomorphism $$mathrmHom_mathitRings(mathbbZ[t],R)cong R.$$
(As a homomorphism $fcolonmathbbZ[t]rightarrow R$ is determined by its value $f(t)$ at $t$, we can define an isomorphism $mathrmHom_mathitRings(mathbbZ[t],R)rightarrow R$ by $fmapsto f(t)$ for all $finmathrmHom_mathitRings(mathbbZ[t],R)$.)



$widehatmathbbA^1_mathbbZ$ is similar: there is an isomorphism
$$mathrmHom_mathitRings(mathbbZ[t]/(t^n),R)congmathrmNil_n(R),$$
where $mathrmNil_n(R)$ denotes the set of nilpotent elements $r$ of $R$ of order $n$ (i.e. $r^n=0$).
(We define an isomorphism as before, but now the element $f(t)$ that we send $f$ to must be nilpotent in $R$, for it to preserve the ring structure: $f(t)^n=f(t^n)=f(0)=0$.)



The answer from here own was changed following Dmitri Pavlov's comment:



As (co)limits of presheaves are computed objectwise, we see that $widehatmathbbA^1_mathbbZ$ sends $R$ to the colimit $mathrmcolim(mathrmNil_n(R))=bigcup_ngeq0mathrmNil_n(R)=mathrmNil(R)$.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited 6 hours ago

























answered 7 hours ago









Théo de Oliveira SantosThéo de Oliveira Santos

8821 gold badge3 silver badges22 bronze badges




8821 gold badge3 silver badges22 bronze badges











  • $begingroup$
    (Sorry for the probably very overcomplicated proof.)
    $endgroup$
    – Théo de Oliveira Santos
    7 hours ago






  • 3




    $begingroup$
    Why do you need EGA here? Once you observed that Nil_n computes nilpotents of order n, you can immediately conclude the proof by observing that colimits of functors CRing→Set are computed objectwise and Nil(R)=⋃_n≥0Nil_n(R) because any nilpotent element of R has finite order.
    $endgroup$
    – Dmitri Pavlov
    6 hours ago










  • $begingroup$
    @DmitriPavlov That's precisely the fact I was missing. Thank you!
    $endgroup$
    – Théo de Oliveira Santos
    6 hours ago
















  • $begingroup$
    (Sorry for the probably very overcomplicated proof.)
    $endgroup$
    – Théo de Oliveira Santos
    7 hours ago






  • 3




    $begingroup$
    Why do you need EGA here? Once you observed that Nil_n computes nilpotents of order n, you can immediately conclude the proof by observing that colimits of functors CRing→Set are computed objectwise and Nil(R)=⋃_n≥0Nil_n(R) because any nilpotent element of R has finite order.
    $endgroup$
    – Dmitri Pavlov
    6 hours ago










  • $begingroup$
    @DmitriPavlov That's precisely the fact I was missing. Thank you!
    $endgroup$
    – Théo de Oliveira Santos
    6 hours ago















$begingroup$
(Sorry for the probably very overcomplicated proof.)
$endgroup$
– Théo de Oliveira Santos
7 hours ago




$begingroup$
(Sorry for the probably very overcomplicated proof.)
$endgroup$
– Théo de Oliveira Santos
7 hours ago




3




3




$begingroup$
Why do you need EGA here? Once you observed that Nil_n computes nilpotents of order n, you can immediately conclude the proof by observing that colimits of functors CRing→Set are computed objectwise and Nil(R)=⋃_n≥0Nil_n(R) because any nilpotent element of R has finite order.
$endgroup$
– Dmitri Pavlov
6 hours ago




$begingroup$
Why do you need EGA here? Once you observed that Nil_n computes nilpotents of order n, you can immediately conclude the proof by observing that colimits of functors CRing→Set are computed objectwise and Nil(R)=⋃_n≥0Nil_n(R) because any nilpotent element of R has finite order.
$endgroup$
– Dmitri Pavlov
6 hours ago












$begingroup$
@DmitriPavlov That's precisely the fact I was missing. Thank you!
$endgroup$
– Théo de Oliveira Santos
6 hours ago




$begingroup$
@DmitriPavlov That's precisely the fact I was missing. Thank you!
$endgroup$
– Théo de Oliveira Santos
6 hours ago

















draft saved

draft discarded
















































Thanks for contributing an answer to MathOverflow!


  • Please be sure to answer the question. Provide details and share your research!

But avoid


  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.

Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f336115%2fbasic-example-of-a-formal-affine-scheme-functorial-point-of-view%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Canceling a color specificationRandomly assigning color to Graphics3D objects?Default color for Filling in Mathematica 9Coloring specific elements of sets with a prime modified order in an array plotHow to pick a color differing significantly from the colors already in a given color list?Detection of the text colorColor numbers based on their valueCan color schemes for use with ColorData include opacity specification?My dynamic color schemes

Invision Community Contents History See also References External links Navigation menuProprietaryinvisioncommunity.comIPS Community ForumsIPS Community Forumsthis blog entry"License Changes, IP.Board 3.4, and the Future""Interview -- Matt Mecham of Ibforums""CEO Invision Power Board, Matt Mecham Is a Liar, Thief!"IPB License Explanation 1.3, 1.3.1, 2.0, and 2.1ArchivedSecurity Fixes, Updates And Enhancements For IPB 1.3.1Archived"New Demo Accounts - Invision Power Services"the original"New Default Skin"the original"Invision Power Board 3.0.0 and Applications Released"the original"Archived copy"the original"Perpetual licenses being done away with""Release Notes - Invision Power Services""Introducing: IPS Community Suite 4!"Invision Community Release Notes

199年 目錄 大件事 到箇年出世嗰人 到箇年死嗰人 節慶、風俗習慣 導覽選單