When do the endomorphisms of a structure not form a natural semi-group?Does every Abelian group admit a ring...
Why do phishing e-mails use faked e-mail addresses instead of the real one?
Rationale to prefer local variables over instance variables?
How can I portion out frozen cookie dough?
Should I use HTTPS on a domain that will only be used for redirection?
How to distinguish easily different soldier of ww2?
Is this Paypal Github SDK reference really a dangerous site?
What should I do when a paper is published similar to my PhD thesis without citation?
Professor forcing me to attend a conference, I can't afford even with 50% funding
What does it take to become a wilderness skills guide as a business?
Is the differential, dp, exact or not?
What is Tony Stark injecting into himself in Iron Man 3?
After Brexit, will the EU recognize British passports that are valid for more than ten years?
Is there a math expression equivalent to the conditional ternary operator?
Having the player face themselves after the mid-game
Issue with units for a rocket nozzle throat area problem
Cross out words with overlapping to nearby words
Was it really inappropriate to write a pull request for the company I interviewed with?
Why restrict private health insurance?
ESPP--any reason not to go all in?
Are brahmins allowed to drink alcohol?
In Diabelli's "Duet in D" for piano, what are these brackets on chords that look like vertical slurs?
Why is there an extra space when I type "ls" on the Desktop?
Are small insurances worth it?
What do you call someone who likes to pick fights?
When do the endomorphisms of a structure not form a natural semi-group?
Does every Abelian group admit a ring structure?Is the following structure a group?Is there any group structure on the upper half plane?Do normal group endomorphisms form a normal submonoid?A question about endomorphism rings of elliptic curvesWhether a given algebra is the algebra of endomorphisms for a vector space.Is this a group when including the originEndomorphisms of $mathbb Z$-modules are the same as those of $mathbb F_p$-vector spacesStructure of a group $G$ through its isomorphic images in $operatorname{Sym}(G)$What algebraic structure does the set of endomorphisms of a ring have?
$begingroup$
Consider a copy of $mathbb{Z}$
This forms a group when equipped with the "+" operator
Let us consider now $text{End}(mathbb{Z},+) $ the set of endomorphisms that preserve the additive structure, these endomorphisms are functions and have an associative structure that they "fit" into, namely
$$ (text{End}(mathbb{Z}, +), times ) $$
Forms a set with an associative operator.
We can go further and look at the "closure" of
$$ (text{End}(mathbb{Z}, +) - lbrace (x rightarrow 0*x) rbrace, times ) $$
By defining inverses for each of the endomorphisms and this set is equivalent to $mathbb{Q} - lbrace 0 rbrace $.
What is really weird to me, is if I repeat this algorithm, of taking a group, and looking at the endomorphisms of the group, and "completing" the endomorphism structure (and removing some elements) I don't end up with another group.
Exponentiation is neither associative nor commutative.
Why abstractly is this happening? For example if I have some group G and I look at
$$ G rightarrow text{End}(G) rightarrow text{End}^2 (G) rightarrow ...
$$
And G is commutative, and End(G) also forms a natural commutative group, then why does $text{End}^2(G)$ suddenly not form a commutative and associative group, or to relax our constraints maximally, when and why do these endomorphism sequences stop creating semigroups?
Some notes: (in response to @Qiaochu’s answer)
I think our viewpoints are subtly different. If we take the endomorphisms of an object S we can identify each endomorphism with an element of S (often by seeing how the endomorphism moves a non identity element). Having built a map $m: S rightarrow text{End}(S)$ we can then define the binary operator $B: S times S rightarrow S$ by $B(a,b) = m(a)[b]$. It is the case that when S was the integers with Addition then B was commutative and associative (since B was multiplication). But when S is the rationals (without 0) with multiplication then B is exponentiation and exponentiation is neither commutative nor associative. Basically I’m trying to understand what properties does a group S need to have so that the B operation constructed as above is at the least associative
abstract-algebra
$endgroup$
add a comment |
$begingroup$
Consider a copy of $mathbb{Z}$
This forms a group when equipped with the "+" operator
Let us consider now $text{End}(mathbb{Z},+) $ the set of endomorphisms that preserve the additive structure, these endomorphisms are functions and have an associative structure that they "fit" into, namely
$$ (text{End}(mathbb{Z}, +), times ) $$
Forms a set with an associative operator.
We can go further and look at the "closure" of
$$ (text{End}(mathbb{Z}, +) - lbrace (x rightarrow 0*x) rbrace, times ) $$
By defining inverses for each of the endomorphisms and this set is equivalent to $mathbb{Q} - lbrace 0 rbrace $.
What is really weird to me, is if I repeat this algorithm, of taking a group, and looking at the endomorphisms of the group, and "completing" the endomorphism structure (and removing some elements) I don't end up with another group.
Exponentiation is neither associative nor commutative.
Why abstractly is this happening? For example if I have some group G and I look at
$$ G rightarrow text{End}(G) rightarrow text{End}^2 (G) rightarrow ...
$$
And G is commutative, and End(G) also forms a natural commutative group, then why does $text{End}^2(G)$ suddenly not form a commutative and associative group, or to relax our constraints maximally, when and why do these endomorphism sequences stop creating semigroups?
Some notes: (in response to @Qiaochu’s answer)
I think our viewpoints are subtly different. If we take the endomorphisms of an object S we can identify each endomorphism with an element of S (often by seeing how the endomorphism moves a non identity element). Having built a map $m: S rightarrow text{End}(S)$ we can then define the binary operator $B: S times S rightarrow S$ by $B(a,b) = m(a)[b]$. It is the case that when S was the integers with Addition then B was commutative and associative (since B was multiplication). But when S is the rationals (without 0) with multiplication then B is exponentiation and exponentiation is neither commutative nor associative. Basically I’m trying to understand what properties does a group S need to have so that the B operation constructed as above is at the least associative
abstract-algebra
$endgroup$
1
$begingroup$
The question is where your map $m:Sto operatorname{End}(S)$ comes from. Usually there isn't such a map, and I think the process by which you are going from addition to multiplication to exponentiation is a lot less systematic than you suggest.
$endgroup$
– Eric Wofsey
10 hours ago
$begingroup$
I agree with Eric. This is not the right way to think about exponentiation.
$endgroup$
– Qiaochu Yuan
7 hours ago
add a comment |
$begingroup$
Consider a copy of $mathbb{Z}$
This forms a group when equipped with the "+" operator
Let us consider now $text{End}(mathbb{Z},+) $ the set of endomorphisms that preserve the additive structure, these endomorphisms are functions and have an associative structure that they "fit" into, namely
$$ (text{End}(mathbb{Z}, +), times ) $$
Forms a set with an associative operator.
We can go further and look at the "closure" of
$$ (text{End}(mathbb{Z}, +) - lbrace (x rightarrow 0*x) rbrace, times ) $$
By defining inverses for each of the endomorphisms and this set is equivalent to $mathbb{Q} - lbrace 0 rbrace $.
What is really weird to me, is if I repeat this algorithm, of taking a group, and looking at the endomorphisms of the group, and "completing" the endomorphism structure (and removing some elements) I don't end up with another group.
Exponentiation is neither associative nor commutative.
Why abstractly is this happening? For example if I have some group G and I look at
$$ G rightarrow text{End}(G) rightarrow text{End}^2 (G) rightarrow ...
$$
And G is commutative, and End(G) also forms a natural commutative group, then why does $text{End}^2(G)$ suddenly not form a commutative and associative group, or to relax our constraints maximally, when and why do these endomorphism sequences stop creating semigroups?
Some notes: (in response to @Qiaochu’s answer)
I think our viewpoints are subtly different. If we take the endomorphisms of an object S we can identify each endomorphism with an element of S (often by seeing how the endomorphism moves a non identity element). Having built a map $m: S rightarrow text{End}(S)$ we can then define the binary operator $B: S times S rightarrow S$ by $B(a,b) = m(a)[b]$. It is the case that when S was the integers with Addition then B was commutative and associative (since B was multiplication). But when S is the rationals (without 0) with multiplication then B is exponentiation and exponentiation is neither commutative nor associative. Basically I’m trying to understand what properties does a group S need to have so that the B operation constructed as above is at the least associative
abstract-algebra
$endgroup$
Consider a copy of $mathbb{Z}$
This forms a group when equipped with the "+" operator
Let us consider now $text{End}(mathbb{Z},+) $ the set of endomorphisms that preserve the additive structure, these endomorphisms are functions and have an associative structure that they "fit" into, namely
$$ (text{End}(mathbb{Z}, +), times ) $$
Forms a set with an associative operator.
We can go further and look at the "closure" of
$$ (text{End}(mathbb{Z}, +) - lbrace (x rightarrow 0*x) rbrace, times ) $$
By defining inverses for each of the endomorphisms and this set is equivalent to $mathbb{Q} - lbrace 0 rbrace $.
What is really weird to me, is if I repeat this algorithm, of taking a group, and looking at the endomorphisms of the group, and "completing" the endomorphism structure (and removing some elements) I don't end up with another group.
Exponentiation is neither associative nor commutative.
Why abstractly is this happening? For example if I have some group G and I look at
$$ G rightarrow text{End}(G) rightarrow text{End}^2 (G) rightarrow ...
$$
And G is commutative, and End(G) also forms a natural commutative group, then why does $text{End}^2(G)$ suddenly not form a commutative and associative group, or to relax our constraints maximally, when and why do these endomorphism sequences stop creating semigroups?
Some notes: (in response to @Qiaochu’s answer)
I think our viewpoints are subtly different. If we take the endomorphisms of an object S we can identify each endomorphism with an element of S (often by seeing how the endomorphism moves a non identity element). Having built a map $m: S rightarrow text{End}(S)$ we can then define the binary operator $B: S times S rightarrow S$ by $B(a,b) = m(a)[b]$. It is the case that when S was the integers with Addition then B was commutative and associative (since B was multiplication). But when S is the rationals (without 0) with multiplication then B is exponentiation and exponentiation is neither commutative nor associative. Basically I’m trying to understand what properties does a group S need to have so that the B operation constructed as above is at the least associative
abstract-algebra
abstract-algebra
edited 11 hours ago
frogeyedpeas
asked yesterday
frogeyedpeasfrogeyedpeas
7,56572053
7,56572053
1
$begingroup$
The question is where your map $m:Sto operatorname{End}(S)$ comes from. Usually there isn't such a map, and I think the process by which you are going from addition to multiplication to exponentiation is a lot less systematic than you suggest.
$endgroup$
– Eric Wofsey
10 hours ago
$begingroup$
I agree with Eric. This is not the right way to think about exponentiation.
$endgroup$
– Qiaochu Yuan
7 hours ago
add a comment |
1
$begingroup$
The question is where your map $m:Sto operatorname{End}(S)$ comes from. Usually there isn't such a map, and I think the process by which you are going from addition to multiplication to exponentiation is a lot less systematic than you suggest.
$endgroup$
– Eric Wofsey
10 hours ago
$begingroup$
I agree with Eric. This is not the right way to think about exponentiation.
$endgroup$
– Qiaochu Yuan
7 hours ago
1
1
$begingroup$
The question is where your map $m:Sto operatorname{End}(S)$ comes from. Usually there isn't such a map, and I think the process by which you are going from addition to multiplication to exponentiation is a lot less systematic than you suggest.
$endgroup$
– Eric Wofsey
10 hours ago
$begingroup$
The question is where your map $m:Sto operatorname{End}(S)$ comes from. Usually there isn't such a map, and I think the process by which you are going from addition to multiplication to exponentiation is a lot less systematic than you suggest.
$endgroup$
– Eric Wofsey
10 hours ago
$begingroup$
I agree with Eric. This is not the right way to think about exponentiation.
$endgroup$
– Qiaochu Yuan
7 hours ago
$begingroup$
I agree with Eric. This is not the right way to think about exponentiation.
$endgroup$
– Qiaochu Yuan
7 hours ago
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
What is really weird to me, is if I repeat this algorithm, of taking a group, and looking at the endomorphisms of the group, and "completing" the endomorphism structure (and removing some elements) I don't end up with another group.
I don't know what construction you're describing here. The endomorphisms of $mathbb{Q}^{times}$, like the endomorphisms of any abelian group, form a ring (more or less a ring of infinite matrices). Unlike $mathbb{Z}$ this ring is noncommutative and has zero divisors, so it's not at all clear what it would mean to take fractions.
In general,
- the endomorphisms of any object in any category whatsoever always form a monoid under composition,
- for abelian groups we have the special property that $text{Ab}$ is canonically enriched over itself, so endomorphisms form a monoid internal to $text{Ab}$, which is to say a ring. Generally this ring will be noncommutative and have zero divisors.
$endgroup$
$begingroup$
My comment is too long, I’ve made an addendum to the Question, please review and let me know your thoughts :)
$endgroup$
– frogeyedpeas
11 hours ago
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
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%2f3139441%2fwhen-do-the-endomorphisms-of-a-structure-not-form-a-natural-semi-group%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
$begingroup$
What is really weird to me, is if I repeat this algorithm, of taking a group, and looking at the endomorphisms of the group, and "completing" the endomorphism structure (and removing some elements) I don't end up with another group.
I don't know what construction you're describing here. The endomorphisms of $mathbb{Q}^{times}$, like the endomorphisms of any abelian group, form a ring (more or less a ring of infinite matrices). Unlike $mathbb{Z}$ this ring is noncommutative and has zero divisors, so it's not at all clear what it would mean to take fractions.
In general,
- the endomorphisms of any object in any category whatsoever always form a monoid under composition,
- for abelian groups we have the special property that $text{Ab}$ is canonically enriched over itself, so endomorphisms form a monoid internal to $text{Ab}$, which is to say a ring. Generally this ring will be noncommutative and have zero divisors.
$endgroup$
$begingroup$
My comment is too long, I’ve made an addendum to the Question, please review and let me know your thoughts :)
$endgroup$
– frogeyedpeas
11 hours ago
add a comment |
$begingroup$
What is really weird to me, is if I repeat this algorithm, of taking a group, and looking at the endomorphisms of the group, and "completing" the endomorphism structure (and removing some elements) I don't end up with another group.
I don't know what construction you're describing here. The endomorphisms of $mathbb{Q}^{times}$, like the endomorphisms of any abelian group, form a ring (more or less a ring of infinite matrices). Unlike $mathbb{Z}$ this ring is noncommutative and has zero divisors, so it's not at all clear what it would mean to take fractions.
In general,
- the endomorphisms of any object in any category whatsoever always form a monoid under composition,
- for abelian groups we have the special property that $text{Ab}$ is canonically enriched over itself, so endomorphisms form a monoid internal to $text{Ab}$, which is to say a ring. Generally this ring will be noncommutative and have zero divisors.
$endgroup$
$begingroup$
My comment is too long, I’ve made an addendum to the Question, please review and let me know your thoughts :)
$endgroup$
– frogeyedpeas
11 hours ago
add a comment |
$begingroup$
What is really weird to me, is if I repeat this algorithm, of taking a group, and looking at the endomorphisms of the group, and "completing" the endomorphism structure (and removing some elements) I don't end up with another group.
I don't know what construction you're describing here. The endomorphisms of $mathbb{Q}^{times}$, like the endomorphisms of any abelian group, form a ring (more or less a ring of infinite matrices). Unlike $mathbb{Z}$ this ring is noncommutative and has zero divisors, so it's not at all clear what it would mean to take fractions.
In general,
- the endomorphisms of any object in any category whatsoever always form a monoid under composition,
- for abelian groups we have the special property that $text{Ab}$ is canonically enriched over itself, so endomorphisms form a monoid internal to $text{Ab}$, which is to say a ring. Generally this ring will be noncommutative and have zero divisors.
$endgroup$
What is really weird to me, is if I repeat this algorithm, of taking a group, and looking at the endomorphisms of the group, and "completing" the endomorphism structure (and removing some elements) I don't end up with another group.
I don't know what construction you're describing here. The endomorphisms of $mathbb{Q}^{times}$, like the endomorphisms of any abelian group, form a ring (more or less a ring of infinite matrices). Unlike $mathbb{Z}$ this ring is noncommutative and has zero divisors, so it's not at all clear what it would mean to take fractions.
In general,
- the endomorphisms of any object in any category whatsoever always form a monoid under composition,
- for abelian groups we have the special property that $text{Ab}$ is canonically enriched over itself, so endomorphisms form a monoid internal to $text{Ab}$, which is to say a ring. Generally this ring will be noncommutative and have zero divisors.
answered yesterday
Qiaochu YuanQiaochu Yuan
280k32592938
280k32592938
$begingroup$
My comment is too long, I’ve made an addendum to the Question, please review and let me know your thoughts :)
$endgroup$
– frogeyedpeas
11 hours ago
add a comment |
$begingroup$
My comment is too long, I’ve made an addendum to the Question, please review and let me know your thoughts :)
$endgroup$
– frogeyedpeas
11 hours ago
$begingroup$
My comment is too long, I’ve made an addendum to the Question, please review and let me know your thoughts :)
$endgroup$
– frogeyedpeas
11 hours ago
$begingroup$
My comment is too long, I’ve made an addendum to the Question, please review and let me know your thoughts :)
$endgroup$
– frogeyedpeas
11 hours ago
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%2f3139441%2fwhen-do-the-endomorphisms-of-a-structure-not-form-a-natural-semi-group%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
1
$begingroup$
The question is where your map $m:Sto operatorname{End}(S)$ comes from. Usually there isn't such a map, and I think the process by which you are going from addition to multiplication to exponentiation is a lot less systematic than you suggest.
$endgroup$
– Eric Wofsey
10 hours ago
$begingroup$
I agree with Eric. This is not the right way to think about exponentiation.
$endgroup$
– Qiaochu Yuan
7 hours ago