Prove that a specific function is injective…

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
1
down vote

favorite












... In the context of the question:



Say we have a set $S$, that contains all the strings with the alphabet $a$ and $b$, i.e. $$S = lefta, b, aa, bb, ab, ba, aaa, bab, bba, dotsright$$



Now, say we have a function $R(t)$ that replaces the leftmost occurrence of $a$ in $t$ with $b$, i.e. $R(aaabb) = baabb$, and $R(bbaaaab) = bbbaaab$, and so on.



How do we prove that $R$ is injective, or otherwise?










share|cite|improve this question

















  • 5




    I think it isn't injective. Because $R(a)=b$ and $R(b)=b$...
    – Doyun Nam
    3 hours ago






  • 1




    @DoyunNam, thank you; that was short and sweet.
    – SRSR333
    3 hours ago














up vote
1
down vote

favorite












... In the context of the question:



Say we have a set $S$, that contains all the strings with the alphabet $a$ and $b$, i.e. $$S = lefta, b, aa, bb, ab, ba, aaa, bab, bba, dotsright$$



Now, say we have a function $R(t)$ that replaces the leftmost occurrence of $a$ in $t$ with $b$, i.e. $R(aaabb) = baabb$, and $R(bbaaaab) = bbbaaab$, and so on.



How do we prove that $R$ is injective, or otherwise?










share|cite|improve this question

















  • 5




    I think it isn't injective. Because $R(a)=b$ and $R(b)=b$...
    – Doyun Nam
    3 hours ago






  • 1




    @DoyunNam, thank you; that was short and sweet.
    – SRSR333
    3 hours ago












up vote
1
down vote

favorite









up vote
1
down vote

favorite











... In the context of the question:



Say we have a set $S$, that contains all the strings with the alphabet $a$ and $b$, i.e. $$S = lefta, b, aa, bb, ab, ba, aaa, bab, bba, dotsright$$



Now, say we have a function $R(t)$ that replaces the leftmost occurrence of $a$ in $t$ with $b$, i.e. $R(aaabb) = baabb$, and $R(bbaaaab) = bbbaaab$, and so on.



How do we prove that $R$ is injective, or otherwise?










share|cite|improve this question













... In the context of the question:



Say we have a set $S$, that contains all the strings with the alphabet $a$ and $b$, i.e. $$S = lefta, b, aa, bb, ab, ba, aaa, bab, bba, dotsright$$



Now, say we have a function $R(t)$ that replaces the leftmost occurrence of $a$ in $t$ with $b$, i.e. $R(aaabb) = baabb$, and $R(bbaaaab) = bbbaaab$, and so on.



How do we prove that $R$ is injective, or otherwise?







functions elementary-set-theory






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked 3 hours ago









SRSR333

304




304







  • 5




    I think it isn't injective. Because $R(a)=b$ and $R(b)=b$...
    – Doyun Nam
    3 hours ago






  • 1




    @DoyunNam, thank you; that was short and sweet.
    – SRSR333
    3 hours ago












  • 5




    I think it isn't injective. Because $R(a)=b$ and $R(b)=b$...
    – Doyun Nam
    3 hours ago






  • 1




    @DoyunNam, thank you; that was short and sweet.
    – SRSR333
    3 hours ago







5




5




I think it isn't injective. Because $R(a)=b$ and $R(b)=b$...
– Doyun Nam
3 hours ago




I think it isn't injective. Because $R(a)=b$ and $R(b)=b$...
– Doyun Nam
3 hours ago




1




1




@DoyunNam, thank you; that was short and sweet.
– SRSR333
3 hours ago




@DoyunNam, thank you; that was short and sweet.
– SRSR333
3 hours ago










1 Answer
1






active

oldest

votes

















up vote
3
down vote



accepted










It is not injective. Take $s_1 = ab$ and $s_2 = bb$. Then, $R(s_1) = bb = R(s_2) = bb$. But, $s_1 ne s_2$. So, we have one output mapping to two inputs. This is just a more exhaustive explanation of Doyun's answer.






share|cite|improve this answer




















  • Thanks very much for the explanation.
    – SRSR333
    3 hours ago










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',
convertImagesToLinks: true,
noModals: false,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
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%2fmath.stackexchange.com%2fquestions%2f2974182%2fprove-that-a-specific-function-is-injective%23new-answer', 'question_page');

);

Post as a guest






























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes








up vote
3
down vote



accepted










It is not injective. Take $s_1 = ab$ and $s_2 = bb$. Then, $R(s_1) = bb = R(s_2) = bb$. But, $s_1 ne s_2$. So, we have one output mapping to two inputs. This is just a more exhaustive explanation of Doyun's answer.






share|cite|improve this answer




















  • Thanks very much for the explanation.
    – SRSR333
    3 hours ago














up vote
3
down vote



accepted










It is not injective. Take $s_1 = ab$ and $s_2 = bb$. Then, $R(s_1) = bb = R(s_2) = bb$. But, $s_1 ne s_2$. So, we have one output mapping to two inputs. This is just a more exhaustive explanation of Doyun's answer.






share|cite|improve this answer




















  • Thanks very much for the explanation.
    – SRSR333
    3 hours ago












up vote
3
down vote



accepted







up vote
3
down vote



accepted






It is not injective. Take $s_1 = ab$ and $s_2 = bb$. Then, $R(s_1) = bb = R(s_2) = bb$. But, $s_1 ne s_2$. So, we have one output mapping to two inputs. This is just a more exhaustive explanation of Doyun's answer.






share|cite|improve this answer












It is not injective. Take $s_1 = ab$ and $s_2 = bb$. Then, $R(s_1) = bb = R(s_2) = bb$. But, $s_1 ne s_2$. So, we have one output mapping to two inputs. This is just a more exhaustive explanation of Doyun's answer.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered 3 hours ago









D.B.

6337




6337











  • Thanks very much for the explanation.
    – SRSR333
    3 hours ago
















  • Thanks very much for the explanation.
    – SRSR333
    3 hours ago















Thanks very much for the explanation.
– SRSR333
3 hours ago




Thanks very much for the explanation.
– SRSR333
3 hours ago

















 

draft saved


draft discarded















































 


draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2974182%2fprove-that-a-specific-function-is-injective%23new-answer', 'question_page');

);

Post as a guest













































































Comments

Popular posts from this blog

Long meetings (6-7 hours a day): Being “babysat” by supervisor

Is the Concept of Multiple Fantasy Races Scientifically Flawed? [closed]

Confectionery