Why does $mathbbZ$ represent the forgetful functor $U:mathbfGrptomathbfSet$ Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)$textGL_n:mathbfAlg_krightarrowmathbfSet:Rmapsto textGL_n(R)$ is a representable functorDualizing module and finiteness hypothesisUnderlying set of the free monoid, does it contain the empty string?checking the functor $textttNil_n$ is represented by $(mathbbZ[x]/(x^n), tau_R)$Composition of monadic functors isn't monadicShowing the Affine functor $underlinemathbbA^r$ is representable by Affine Space $mathbbA^r := Spec(mathbbZ[X_1, dots, X_r])$Show that the functor that takes $R$ to the set of invertible elements of $R[X]/(X^2-a)$ is representable.
Significance of Cersei's obsession with elephants?
A term for a woman complaining about things/begging in a cute/childish way
Can a new player join a group only when a new campaign starts?
Crossing US/Canada Border for less than 24 hours
What is this round thing on the pantry door in The Shining
How to dry out epoxy resin faster than usual?
How many serial ports are on the Pi 3?
Is it possible for SQL statements to execute concurrently within a single session in SQL Server?
Would it be possible to dictate a bech32 address as a list of English words?
Take 2! Is this homebrew Lady of Pain warlock patron balanced?
How to make a Field only accept Numbers in Magento 2
Is it fair for a professor to grade us on the possession of past papers?
What happened to Thoros of Myr's flaming sword?
AppleTVs create a chatty alternate WiFi network
Why limits give us the exact value of the slope of the tangent line?
Is there public access to the Meteor Crater in Arizona?
How often does castling occur in grandmaster games?
Most bit efficient text communication method?
Can anything be seen from the center of the Boötes void? How dark would it be?
How to unroll a parameter pack from right to left
How to improve on this Stylesheet Manipulation for Message Styling
Would it be easier to apply for a UK visa if there is a host family to sponsor for you in going there?
Do wooden building fires get hotter than 600°C?
What do you call the main part of a joke?
Why does $mathbbZ$ represent the forgetful functor $U:mathbfGrptomathbfSet$
Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)$textGL_n:mathbfAlg_krightarrowmathbfSet:Rmapsto textGL_n(R)$ is a representable functorDualizing module and finiteness hypothesisUnderlying set of the free monoid, does it contain the empty string?checking the functor $textttNil_n$ is represented by $(mathbbZ[x]/(x^n), tau_R)$Composition of monadic functors isn't monadicShowing the Affine functor $underlinemathbbA^r$ is representable by Affine Space $mathbbA^r := Spec(mathbbZ[X_1, dots, X_r])$Show that the functor that takes $R$ to the set of invertible elements of $R[X]/(X^2-a)$ is representable.
$begingroup$
This is from Emily Riehl's Category theory in context
The forgetful functor $U:mathbfGrptomathbfSet$ is represented by the group $mathbbZ$ thanks to the natural isomorphism $alpha:mathbfGrp(mathbbZ,-)cong U$ whose components are the isomorphisms
$$beginalign
alpha_G:mathbfGrp(mathbbZ,G) & longrightarrow UG\
big[f:mathbbZto Gbig] & longmapsto f(1)
endalign$$
My impression is that if some group $A$ were to represent the functor $U$ it should have some distinguished element we could attach all the information to. If the group $A$ doesn't have such element then the only "reasonable" map $mathbfGrp(A,G)to UG$ would be $big[f:Ato Gbig]mapsto f(id_A)$ and that does not define an isomorphism. The only groups having a "distinguished element" that come to mind are the cyclic groups and their generators.
But then, why $mathbbZ$? Doesn't every (non trivial) cyclic group work? Given the cyclic group $mathbbZ_n$, the components
$$beginalign
alpha_A:mathbfGrp(mathbbZ_n,G) & longrightarrow UG\
big[f:mathbbZ_nto Gbig] & longmapsto f(1)
endalign$$
are isomorphisms: if $f(1)=alpha_A(f)=alpha_A(g)=g(1)$ then, for every $minmathbbZ_n$ $f(m)=f(1)+cdots+f(1)=g(1)+cdots+g(1)=g(m)$ so that $gequiv f$ and for every $gin UG$ there exists a unique $f_g:mathbbZ_nto G$ such that $f_g(1)=g$.
Where am I wrong? Could it be that $mathbbZ=langle1rangle$ is the only cyclic group with only one generator while $mathbbZ_n=langle1rangle=langle n-1rangle$ for every $n$? If so, why? It doesn't seem very important to the problem.
Thanks in advance
representable-functor forgetful-functors
$endgroup$
add a comment |
$begingroup$
This is from Emily Riehl's Category theory in context
The forgetful functor $U:mathbfGrptomathbfSet$ is represented by the group $mathbbZ$ thanks to the natural isomorphism $alpha:mathbfGrp(mathbbZ,-)cong U$ whose components are the isomorphisms
$$beginalign
alpha_G:mathbfGrp(mathbbZ,G) & longrightarrow UG\
big[f:mathbbZto Gbig] & longmapsto f(1)
endalign$$
My impression is that if some group $A$ were to represent the functor $U$ it should have some distinguished element we could attach all the information to. If the group $A$ doesn't have such element then the only "reasonable" map $mathbfGrp(A,G)to UG$ would be $big[f:Ato Gbig]mapsto f(id_A)$ and that does not define an isomorphism. The only groups having a "distinguished element" that come to mind are the cyclic groups and their generators.
But then, why $mathbbZ$? Doesn't every (non trivial) cyclic group work? Given the cyclic group $mathbbZ_n$, the components
$$beginalign
alpha_A:mathbfGrp(mathbbZ_n,G) & longrightarrow UG\
big[f:mathbbZ_nto Gbig] & longmapsto f(1)
endalign$$
are isomorphisms: if $f(1)=alpha_A(f)=alpha_A(g)=g(1)$ then, for every $minmathbbZ_n$ $f(m)=f(1)+cdots+f(1)=g(1)+cdots+g(1)=g(m)$ so that $gequiv f$ and for every $gin UG$ there exists a unique $f_g:mathbbZ_nto G$ such that $f_g(1)=g$.
Where am I wrong? Could it be that $mathbbZ=langle1rangle$ is the only cyclic group with only one generator while $mathbbZ_n=langle1rangle=langle n-1rangle$ for every $n$? If so, why? It doesn't seem very important to the problem.
Thanks in advance
representable-functor forgetful-functors
$endgroup$
$begingroup$
If two objects represent the same functor, they must be isomorphic.
$endgroup$
– Lord Shark the Unknown
Mar 27 at 20:42
add a comment |
$begingroup$
This is from Emily Riehl's Category theory in context
The forgetful functor $U:mathbfGrptomathbfSet$ is represented by the group $mathbbZ$ thanks to the natural isomorphism $alpha:mathbfGrp(mathbbZ,-)cong U$ whose components are the isomorphisms
$$beginalign
alpha_G:mathbfGrp(mathbbZ,G) & longrightarrow UG\
big[f:mathbbZto Gbig] & longmapsto f(1)
endalign$$
My impression is that if some group $A$ were to represent the functor $U$ it should have some distinguished element we could attach all the information to. If the group $A$ doesn't have such element then the only "reasonable" map $mathbfGrp(A,G)to UG$ would be $big[f:Ato Gbig]mapsto f(id_A)$ and that does not define an isomorphism. The only groups having a "distinguished element" that come to mind are the cyclic groups and their generators.
But then, why $mathbbZ$? Doesn't every (non trivial) cyclic group work? Given the cyclic group $mathbbZ_n$, the components
$$beginalign
alpha_A:mathbfGrp(mathbbZ_n,G) & longrightarrow UG\
big[f:mathbbZ_nto Gbig] & longmapsto f(1)
endalign$$
are isomorphisms: if $f(1)=alpha_A(f)=alpha_A(g)=g(1)$ then, for every $minmathbbZ_n$ $f(m)=f(1)+cdots+f(1)=g(1)+cdots+g(1)=g(m)$ so that $gequiv f$ and for every $gin UG$ there exists a unique $f_g:mathbbZ_nto G$ such that $f_g(1)=g$.
Where am I wrong? Could it be that $mathbbZ=langle1rangle$ is the only cyclic group with only one generator while $mathbbZ_n=langle1rangle=langle n-1rangle$ for every $n$? If so, why? It doesn't seem very important to the problem.
Thanks in advance
representable-functor forgetful-functors
$endgroup$
This is from Emily Riehl's Category theory in context
The forgetful functor $U:mathbfGrptomathbfSet$ is represented by the group $mathbbZ$ thanks to the natural isomorphism $alpha:mathbfGrp(mathbbZ,-)cong U$ whose components are the isomorphisms
$$beginalign
alpha_G:mathbfGrp(mathbbZ,G) & longrightarrow UG\
big[f:mathbbZto Gbig] & longmapsto f(1)
endalign$$
My impression is that if some group $A$ were to represent the functor $U$ it should have some distinguished element we could attach all the information to. If the group $A$ doesn't have such element then the only "reasonable" map $mathbfGrp(A,G)to UG$ would be $big[f:Ato Gbig]mapsto f(id_A)$ and that does not define an isomorphism. The only groups having a "distinguished element" that come to mind are the cyclic groups and their generators.
But then, why $mathbbZ$? Doesn't every (non trivial) cyclic group work? Given the cyclic group $mathbbZ_n$, the components
$$beginalign
alpha_A:mathbfGrp(mathbbZ_n,G) & longrightarrow UG\
big[f:mathbbZ_nto Gbig] & longmapsto f(1)
endalign$$
are isomorphisms: if $f(1)=alpha_A(f)=alpha_A(g)=g(1)$ then, for every $minmathbbZ_n$ $f(m)=f(1)+cdots+f(1)=g(1)+cdots+g(1)=g(m)$ so that $gequiv f$ and for every $gin UG$ there exists a unique $f_g:mathbbZ_nto G$ such that $f_g(1)=g$.
Where am I wrong? Could it be that $mathbbZ=langle1rangle$ is the only cyclic group with only one generator while $mathbbZ_n=langle1rangle=langle n-1rangle$ for every $n$? If so, why? It doesn't seem very important to the problem.
Thanks in advance
representable-functor forgetful-functors
representable-functor forgetful-functors
asked Mar 27 at 20:34
PedroPedro
541212
541212
$begingroup$
If two objects represent the same functor, they must be isomorphic.
$endgroup$
– Lord Shark the Unknown
Mar 27 at 20:42
add a comment |
$begingroup$
If two objects represent the same functor, they must be isomorphic.
$endgroup$
– Lord Shark the Unknown
Mar 27 at 20:42
$begingroup$
If two objects represent the same functor, they must be isomorphic.
$endgroup$
– Lord Shark the Unknown
Mar 27 at 20:42
$begingroup$
If two objects represent the same functor, they must be isomorphic.
$endgroup$
– Lord Shark the Unknown
Mar 27 at 20:42
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Take $G=Bbb Z$. Then the only element of $bf Grp(BbbZ_m,Bbb Z)$
is the zero map. But $UBbb Z$ has rather more than one element.
$endgroup$
$begingroup$
so the problem is that defining only the image of $1inmathbbZ_n$ does not necessarily define a homomorphism $mathbbZ_nto$something ??
$endgroup$
– Pedro
Mar 27 at 20:58
1
$begingroup$
@Pedro Exactly. For a homomorphism $f: mathbb Z_n rightarrow G$ the image of $1 in mathbb Z_n$ should have order dividing $n$, for $ncdot f(1) = f(ncdot 1) = f(0)$.
$endgroup$
– lisyarus
Mar 27 at 22:54
add a comment |
$begingroup$
Let $S_1 = 1 $. Then you have a natural bijection between $mathbfSet(S_1,UG)$ and $UG$. Moreover, for any set $S$, you have a natural bijection between $mathbfSet(S,UG)$ and $mathbfGrp(F(S),G)$, where $F(S)$ is the free group with basis $S$. This is the universal property of the free group generated by $S$. But $F(S_1)$ is nothing else than the infinite cyclic group with one generator $1$.
$endgroup$
add a comment |
Your Answer
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
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
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3165094%2fwhy-does-mathbbz-represent-the-forgetful-functor-u-mathbfgrp-to-mathbf%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Take $G=Bbb Z$. Then the only element of $bf Grp(BbbZ_m,Bbb Z)$
is the zero map. But $UBbb Z$ has rather more than one element.
$endgroup$
$begingroup$
so the problem is that defining only the image of $1inmathbbZ_n$ does not necessarily define a homomorphism $mathbbZ_nto$something ??
$endgroup$
– Pedro
Mar 27 at 20:58
1
$begingroup$
@Pedro Exactly. For a homomorphism $f: mathbb Z_n rightarrow G$ the image of $1 in mathbb Z_n$ should have order dividing $n$, for $ncdot f(1) = f(ncdot 1) = f(0)$.
$endgroup$
– lisyarus
Mar 27 at 22:54
add a comment |
$begingroup$
Take $G=Bbb Z$. Then the only element of $bf Grp(BbbZ_m,Bbb Z)$
is the zero map. But $UBbb Z$ has rather more than one element.
$endgroup$
$begingroup$
so the problem is that defining only the image of $1inmathbbZ_n$ does not necessarily define a homomorphism $mathbbZ_nto$something ??
$endgroup$
– Pedro
Mar 27 at 20:58
1
$begingroup$
@Pedro Exactly. For a homomorphism $f: mathbb Z_n rightarrow G$ the image of $1 in mathbb Z_n$ should have order dividing $n$, for $ncdot f(1) = f(ncdot 1) = f(0)$.
$endgroup$
– lisyarus
Mar 27 at 22:54
add a comment |
$begingroup$
Take $G=Bbb Z$. Then the only element of $bf Grp(BbbZ_m,Bbb Z)$
is the zero map. But $UBbb Z$ has rather more than one element.
$endgroup$
Take $G=Bbb Z$. Then the only element of $bf Grp(BbbZ_m,Bbb Z)$
is the zero map. But $UBbb Z$ has rather more than one element.
answered Mar 27 at 20:41
Lord Shark the UnknownLord Shark the Unknown
109k1163136
109k1163136
$begingroup$
so the problem is that defining only the image of $1inmathbbZ_n$ does not necessarily define a homomorphism $mathbbZ_nto$something ??
$endgroup$
– Pedro
Mar 27 at 20:58
1
$begingroup$
@Pedro Exactly. For a homomorphism $f: mathbb Z_n rightarrow G$ the image of $1 in mathbb Z_n$ should have order dividing $n$, for $ncdot f(1) = f(ncdot 1) = f(0)$.
$endgroup$
– lisyarus
Mar 27 at 22:54
add a comment |
$begingroup$
so the problem is that defining only the image of $1inmathbbZ_n$ does not necessarily define a homomorphism $mathbbZ_nto$something ??
$endgroup$
– Pedro
Mar 27 at 20:58
1
$begingroup$
@Pedro Exactly. For a homomorphism $f: mathbb Z_n rightarrow G$ the image of $1 in mathbb Z_n$ should have order dividing $n$, for $ncdot f(1) = f(ncdot 1) = f(0)$.
$endgroup$
– lisyarus
Mar 27 at 22:54
$begingroup$
so the problem is that defining only the image of $1inmathbbZ_n$ does not necessarily define a homomorphism $mathbbZ_nto$something ??
$endgroup$
– Pedro
Mar 27 at 20:58
$begingroup$
so the problem is that defining only the image of $1inmathbbZ_n$ does not necessarily define a homomorphism $mathbbZ_nto$something ??
$endgroup$
– Pedro
Mar 27 at 20:58
1
1
$begingroup$
@Pedro Exactly. For a homomorphism $f: mathbb Z_n rightarrow G$ the image of $1 in mathbb Z_n$ should have order dividing $n$, for $ncdot f(1) = f(ncdot 1) = f(0)$.
$endgroup$
– lisyarus
Mar 27 at 22:54
$begingroup$
@Pedro Exactly. For a homomorphism $f: mathbb Z_n rightarrow G$ the image of $1 in mathbb Z_n$ should have order dividing $n$, for $ncdot f(1) = f(ncdot 1) = f(0)$.
$endgroup$
– lisyarus
Mar 27 at 22:54
add a comment |
$begingroup$
Let $S_1 = 1 $. Then you have a natural bijection between $mathbfSet(S_1,UG)$ and $UG$. Moreover, for any set $S$, you have a natural bijection between $mathbfSet(S,UG)$ and $mathbfGrp(F(S),G)$, where $F(S)$ is the free group with basis $S$. This is the universal property of the free group generated by $S$. But $F(S_1)$ is nothing else than the infinite cyclic group with one generator $1$.
$endgroup$
add a comment |
$begingroup$
Let $S_1 = 1 $. Then you have a natural bijection between $mathbfSet(S_1,UG)$ and $UG$. Moreover, for any set $S$, you have a natural bijection between $mathbfSet(S,UG)$ and $mathbfGrp(F(S),G)$, where $F(S)$ is the free group with basis $S$. This is the universal property of the free group generated by $S$. But $F(S_1)$ is nothing else than the infinite cyclic group with one generator $1$.
$endgroup$
add a comment |
$begingroup$
Let $S_1 = 1 $. Then you have a natural bijection between $mathbfSet(S_1,UG)$ and $UG$. Moreover, for any set $S$, you have a natural bijection between $mathbfSet(S,UG)$ and $mathbfGrp(F(S),G)$, where $F(S)$ is the free group with basis $S$. This is the universal property of the free group generated by $S$. But $F(S_1)$ is nothing else than the infinite cyclic group with one generator $1$.
$endgroup$
Let $S_1 = 1 $. Then you have a natural bijection between $mathbfSet(S_1,UG)$ and $UG$. Moreover, for any set $S$, you have a natural bijection between $mathbfSet(S,UG)$ and $mathbfGrp(F(S),G)$, where $F(S)$ is the free group with basis $S$. This is the universal property of the free group generated by $S$. But $F(S_1)$ is nothing else than the infinite cyclic group with one generator $1$.
answered Mar 27 at 22:48
Paul FrostPaul Frost
12.9k31035
12.9k31035
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- 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.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3165094%2fwhy-does-mathbbz-represent-the-forgetful-functor-u-mathbfgrp-to-mathbf%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
$begingroup$
If two objects represent the same functor, they must be isomorphic.
$endgroup$
– Lord Shark the Unknown
Mar 27 at 20:42