Show that the assignment $f(x) to f(cx+b)$ is one-to-one












0












$begingroup$


I'm trying to prove that,



For a commutative ring $R$ with identity, the assignment $phi: f(x) to f(cx+b)$ on $R[x]$, where $c,bin R$ and $c$ is a unit, is a one-to-one map.



To show this, I tried to show that the kernel is zero, so given $f = sum_k^n a_k x^k in Ker phi$,
$$f to sum_{k=0}^n sum_{t=0}^k binom{k}{t} a_k (cx)^t b^{k-t} = 0,$$



but this implies
$$a_r (1+b+b^2+...+b^{n-r}) = 0 quad forall r=0,1,..,n.$$



However, I stuck at this point; since $R$ is not a integral domain in general, I don't know how to proceed.



I would appreciate any help or hint.










share|cite|improve this question











$endgroup$












  • $begingroup$
    When you write, "... and $c$ is unit...", do you mean $c$ is the unit of $R?$ Or do you simply mean $R$ is a ring with unit (and there was a typo)?
    $endgroup$
    – Adrian Keister
    Jan 11 at 16:26






  • 1




    $begingroup$
    @AdrianKeister it means $c$ has an inverse; so it is a unit, not the unity.
    $endgroup$
    – onurcanbektas
    Jan 11 at 16:27








  • 4




    $begingroup$
    It's probably just easier to prove that $x mapsto c^{-1}(x-b)$ is the inverse, thereby getting injectivity and surjectivity at once.
    $endgroup$
    – Randall
    Jan 11 at 16:35










  • $begingroup$
    In that case, it is better English to say that $c$ is a unit.
    $endgroup$
    – Adrian Keister
    Jan 11 at 16:35






  • 1




    $begingroup$
    Yep, no problem. It's fun.
    $endgroup$
    – Randall
    Jan 11 at 16:55
















0












$begingroup$


I'm trying to prove that,



For a commutative ring $R$ with identity, the assignment $phi: f(x) to f(cx+b)$ on $R[x]$, where $c,bin R$ and $c$ is a unit, is a one-to-one map.



To show this, I tried to show that the kernel is zero, so given $f = sum_k^n a_k x^k in Ker phi$,
$$f to sum_{k=0}^n sum_{t=0}^k binom{k}{t} a_k (cx)^t b^{k-t} = 0,$$



but this implies
$$a_r (1+b+b^2+...+b^{n-r}) = 0 quad forall r=0,1,..,n.$$



However, I stuck at this point; since $R$ is not a integral domain in general, I don't know how to proceed.



I would appreciate any help or hint.










share|cite|improve this question











$endgroup$












  • $begingroup$
    When you write, "... and $c$ is unit...", do you mean $c$ is the unit of $R?$ Or do you simply mean $R$ is a ring with unit (and there was a typo)?
    $endgroup$
    – Adrian Keister
    Jan 11 at 16:26






  • 1




    $begingroup$
    @AdrianKeister it means $c$ has an inverse; so it is a unit, not the unity.
    $endgroup$
    – onurcanbektas
    Jan 11 at 16:27








  • 4




    $begingroup$
    It's probably just easier to prove that $x mapsto c^{-1}(x-b)$ is the inverse, thereby getting injectivity and surjectivity at once.
    $endgroup$
    – Randall
    Jan 11 at 16:35










  • $begingroup$
    In that case, it is better English to say that $c$ is a unit.
    $endgroup$
    – Adrian Keister
    Jan 11 at 16:35






  • 1




    $begingroup$
    Yep, no problem. It's fun.
    $endgroup$
    – Randall
    Jan 11 at 16:55














0












0








0





$begingroup$


I'm trying to prove that,



For a commutative ring $R$ with identity, the assignment $phi: f(x) to f(cx+b)$ on $R[x]$, where $c,bin R$ and $c$ is a unit, is a one-to-one map.



To show this, I tried to show that the kernel is zero, so given $f = sum_k^n a_k x^k in Ker phi$,
$$f to sum_{k=0}^n sum_{t=0}^k binom{k}{t} a_k (cx)^t b^{k-t} = 0,$$



but this implies
$$a_r (1+b+b^2+...+b^{n-r}) = 0 quad forall r=0,1,..,n.$$



However, I stuck at this point; since $R$ is not a integral domain in general, I don't know how to proceed.



I would appreciate any help or hint.










share|cite|improve this question











$endgroup$




I'm trying to prove that,



For a commutative ring $R$ with identity, the assignment $phi: f(x) to f(cx+b)$ on $R[x]$, where $c,bin R$ and $c$ is a unit, is a one-to-one map.



To show this, I tried to show that the kernel is zero, so given $f = sum_k^n a_k x^k in Ker phi$,
$$f to sum_{k=0}^n sum_{t=0}^k binom{k}{t} a_k (cx)^t b^{k-t} = 0,$$



but this implies
$$a_r (1+b+b^2+...+b^{n-r}) = 0 quad forall r=0,1,..,n.$$



However, I stuck at this point; since $R$ is not a integral domain in general, I don't know how to proceed.



I would appreciate any help or hint.







abstract-algebra polynomials ring-theory






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 11 at 16:38







onurcanbektas

















asked Jan 11 at 16:23









onurcanbektasonurcanbektas

3,36511036




3,36511036












  • $begingroup$
    When you write, "... and $c$ is unit...", do you mean $c$ is the unit of $R?$ Or do you simply mean $R$ is a ring with unit (and there was a typo)?
    $endgroup$
    – Adrian Keister
    Jan 11 at 16:26






  • 1




    $begingroup$
    @AdrianKeister it means $c$ has an inverse; so it is a unit, not the unity.
    $endgroup$
    – onurcanbektas
    Jan 11 at 16:27








  • 4




    $begingroup$
    It's probably just easier to prove that $x mapsto c^{-1}(x-b)$ is the inverse, thereby getting injectivity and surjectivity at once.
    $endgroup$
    – Randall
    Jan 11 at 16:35










  • $begingroup$
    In that case, it is better English to say that $c$ is a unit.
    $endgroup$
    – Adrian Keister
    Jan 11 at 16:35






  • 1




    $begingroup$
    Yep, no problem. It's fun.
    $endgroup$
    – Randall
    Jan 11 at 16:55


















  • $begingroup$
    When you write, "... and $c$ is unit...", do you mean $c$ is the unit of $R?$ Or do you simply mean $R$ is a ring with unit (and there was a typo)?
    $endgroup$
    – Adrian Keister
    Jan 11 at 16:26






  • 1




    $begingroup$
    @AdrianKeister it means $c$ has an inverse; so it is a unit, not the unity.
    $endgroup$
    – onurcanbektas
    Jan 11 at 16:27








  • 4




    $begingroup$
    It's probably just easier to prove that $x mapsto c^{-1}(x-b)$ is the inverse, thereby getting injectivity and surjectivity at once.
    $endgroup$
    – Randall
    Jan 11 at 16:35










  • $begingroup$
    In that case, it is better English to say that $c$ is a unit.
    $endgroup$
    – Adrian Keister
    Jan 11 at 16:35






  • 1




    $begingroup$
    Yep, no problem. It's fun.
    $endgroup$
    – Randall
    Jan 11 at 16:55
















$begingroup$
When you write, "... and $c$ is unit...", do you mean $c$ is the unit of $R?$ Or do you simply mean $R$ is a ring with unit (and there was a typo)?
$endgroup$
– Adrian Keister
Jan 11 at 16:26




$begingroup$
When you write, "... and $c$ is unit...", do you mean $c$ is the unit of $R?$ Or do you simply mean $R$ is a ring with unit (and there was a typo)?
$endgroup$
– Adrian Keister
Jan 11 at 16:26




1




1




$begingroup$
@AdrianKeister it means $c$ has an inverse; so it is a unit, not the unity.
$endgroup$
– onurcanbektas
Jan 11 at 16:27






$begingroup$
@AdrianKeister it means $c$ has an inverse; so it is a unit, not the unity.
$endgroup$
– onurcanbektas
Jan 11 at 16:27






4




4




$begingroup$
It's probably just easier to prove that $x mapsto c^{-1}(x-b)$ is the inverse, thereby getting injectivity and surjectivity at once.
$endgroup$
– Randall
Jan 11 at 16:35




$begingroup$
It's probably just easier to prove that $x mapsto c^{-1}(x-b)$ is the inverse, thereby getting injectivity and surjectivity at once.
$endgroup$
– Randall
Jan 11 at 16:35












$begingroup$
In that case, it is better English to say that $c$ is a unit.
$endgroup$
– Adrian Keister
Jan 11 at 16:35




$begingroup$
In that case, it is better English to say that $c$ is a unit.
$endgroup$
– Adrian Keister
Jan 11 at 16:35




1




1




$begingroup$
Yep, no problem. It's fun.
$endgroup$
– Randall
Jan 11 at 16:55




$begingroup$
Yep, no problem. It's fun.
$endgroup$
– Randall
Jan 11 at 16:55










1 Answer
1






active

oldest

votes


















2












$begingroup$

If we let $psi:g(x) mapsto g(c^{-1}(x-b))$, it follows that
$$
(psiphi)(f)(x)=psi(phi(f))(x)=phi(f)(c^{-1}(x-b))=f(cc^{-1}(x-b)+b)=f(x),
$$
and
$$(phipsi)(f)(x)=phi(psi(f))(x) = psi(f)(cx+b)=f(c^{-1}((cx+b)-b))=f(x).
$$
Hence, $psi = phi^{-1}$ and the bijectivity of $phi$ follows.



But I couldn't see how you derived the condition $$
a_r(1+b+cdots b^{n-r})=0.
$$
Shouldn't it be $forall j=0,ldots,n$
$$
sum_{k=j}^n a_kbinom{k}{j}b^{k-j}=0?
$$
If it is the case, we can show inductively that $a_n=0$, $a_{n-1}=0$, ..., etc.






share|cite|improve this answer











$endgroup$









  • 1




    $begingroup$
    Do you have $psi$ and $phi$ transposed?
    $endgroup$
    – Randall
    Jan 11 at 16:42










  • $begingroup$
    @Randall It looks correct. Check again.
    $endgroup$
    – David Hill
    Jan 11 at 16:52










  • $begingroup$
    Do you compose left-to-right?
    $endgroup$
    – Randall
    Jan 11 at 16:53










  • $begingroup$
    Oh wait, I see.
    $endgroup$
    – Randall
    Jan 11 at 16:54











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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3070025%2fshow-that-the-assignment-fx-to-fcxb-is-one-to-one%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









2












$begingroup$

If we let $psi:g(x) mapsto g(c^{-1}(x-b))$, it follows that
$$
(psiphi)(f)(x)=psi(phi(f))(x)=phi(f)(c^{-1}(x-b))=f(cc^{-1}(x-b)+b)=f(x),
$$
and
$$(phipsi)(f)(x)=phi(psi(f))(x) = psi(f)(cx+b)=f(c^{-1}((cx+b)-b))=f(x).
$$
Hence, $psi = phi^{-1}$ and the bijectivity of $phi$ follows.



But I couldn't see how you derived the condition $$
a_r(1+b+cdots b^{n-r})=0.
$$
Shouldn't it be $forall j=0,ldots,n$
$$
sum_{k=j}^n a_kbinom{k}{j}b^{k-j}=0?
$$
If it is the case, we can show inductively that $a_n=0$, $a_{n-1}=0$, ..., etc.






share|cite|improve this answer











$endgroup$









  • 1




    $begingroup$
    Do you have $psi$ and $phi$ transposed?
    $endgroup$
    – Randall
    Jan 11 at 16:42










  • $begingroup$
    @Randall It looks correct. Check again.
    $endgroup$
    – David Hill
    Jan 11 at 16:52










  • $begingroup$
    Do you compose left-to-right?
    $endgroup$
    – Randall
    Jan 11 at 16:53










  • $begingroup$
    Oh wait, I see.
    $endgroup$
    – Randall
    Jan 11 at 16:54
















2












$begingroup$

If we let $psi:g(x) mapsto g(c^{-1}(x-b))$, it follows that
$$
(psiphi)(f)(x)=psi(phi(f))(x)=phi(f)(c^{-1}(x-b))=f(cc^{-1}(x-b)+b)=f(x),
$$
and
$$(phipsi)(f)(x)=phi(psi(f))(x) = psi(f)(cx+b)=f(c^{-1}((cx+b)-b))=f(x).
$$
Hence, $psi = phi^{-1}$ and the bijectivity of $phi$ follows.



But I couldn't see how you derived the condition $$
a_r(1+b+cdots b^{n-r})=0.
$$
Shouldn't it be $forall j=0,ldots,n$
$$
sum_{k=j}^n a_kbinom{k}{j}b^{k-j}=0?
$$
If it is the case, we can show inductively that $a_n=0$, $a_{n-1}=0$, ..., etc.






share|cite|improve this answer











$endgroup$









  • 1




    $begingroup$
    Do you have $psi$ and $phi$ transposed?
    $endgroup$
    – Randall
    Jan 11 at 16:42










  • $begingroup$
    @Randall It looks correct. Check again.
    $endgroup$
    – David Hill
    Jan 11 at 16:52










  • $begingroup$
    Do you compose left-to-right?
    $endgroup$
    – Randall
    Jan 11 at 16:53










  • $begingroup$
    Oh wait, I see.
    $endgroup$
    – Randall
    Jan 11 at 16:54














2












2








2





$begingroup$

If we let $psi:g(x) mapsto g(c^{-1}(x-b))$, it follows that
$$
(psiphi)(f)(x)=psi(phi(f))(x)=phi(f)(c^{-1}(x-b))=f(cc^{-1}(x-b)+b)=f(x),
$$
and
$$(phipsi)(f)(x)=phi(psi(f))(x) = psi(f)(cx+b)=f(c^{-1}((cx+b)-b))=f(x).
$$
Hence, $psi = phi^{-1}$ and the bijectivity of $phi$ follows.



But I couldn't see how you derived the condition $$
a_r(1+b+cdots b^{n-r})=0.
$$
Shouldn't it be $forall j=0,ldots,n$
$$
sum_{k=j}^n a_kbinom{k}{j}b^{k-j}=0?
$$
If it is the case, we can show inductively that $a_n=0$, $a_{n-1}=0$, ..., etc.






share|cite|improve this answer











$endgroup$



If we let $psi:g(x) mapsto g(c^{-1}(x-b))$, it follows that
$$
(psiphi)(f)(x)=psi(phi(f))(x)=phi(f)(c^{-1}(x-b))=f(cc^{-1}(x-b)+b)=f(x),
$$
and
$$(phipsi)(f)(x)=phi(psi(f))(x) = psi(f)(cx+b)=f(c^{-1}((cx+b)-b))=f(x).
$$
Hence, $psi = phi^{-1}$ and the bijectivity of $phi$ follows.



But I couldn't see how you derived the condition $$
a_r(1+b+cdots b^{n-r})=0.
$$
Shouldn't it be $forall j=0,ldots,n$
$$
sum_{k=j}^n a_kbinom{k}{j}b^{k-j}=0?
$$
If it is the case, we can show inductively that $a_n=0$, $a_{n-1}=0$, ..., etc.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Jan 11 at 17:03

























answered Jan 11 at 16:40









SongSong

12.2k630




12.2k630








  • 1




    $begingroup$
    Do you have $psi$ and $phi$ transposed?
    $endgroup$
    – Randall
    Jan 11 at 16:42










  • $begingroup$
    @Randall It looks correct. Check again.
    $endgroup$
    – David Hill
    Jan 11 at 16:52










  • $begingroup$
    Do you compose left-to-right?
    $endgroup$
    – Randall
    Jan 11 at 16:53










  • $begingroup$
    Oh wait, I see.
    $endgroup$
    – Randall
    Jan 11 at 16:54














  • 1




    $begingroup$
    Do you have $psi$ and $phi$ transposed?
    $endgroup$
    – Randall
    Jan 11 at 16:42










  • $begingroup$
    @Randall It looks correct. Check again.
    $endgroup$
    – David Hill
    Jan 11 at 16:52










  • $begingroup$
    Do you compose left-to-right?
    $endgroup$
    – Randall
    Jan 11 at 16:53










  • $begingroup$
    Oh wait, I see.
    $endgroup$
    – Randall
    Jan 11 at 16:54








1




1




$begingroup$
Do you have $psi$ and $phi$ transposed?
$endgroup$
– Randall
Jan 11 at 16:42




$begingroup$
Do you have $psi$ and $phi$ transposed?
$endgroup$
– Randall
Jan 11 at 16:42












$begingroup$
@Randall It looks correct. Check again.
$endgroup$
– David Hill
Jan 11 at 16:52




$begingroup$
@Randall It looks correct. Check again.
$endgroup$
– David Hill
Jan 11 at 16:52












$begingroup$
Do you compose left-to-right?
$endgroup$
– Randall
Jan 11 at 16:53




$begingroup$
Do you compose left-to-right?
$endgroup$
– Randall
Jan 11 at 16:53












$begingroup$
Oh wait, I see.
$endgroup$
– Randall
Jan 11 at 16:54




$begingroup$
Oh wait, I see.
$endgroup$
– Randall
Jan 11 at 16:54


















draft saved

draft discarded




















































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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3070025%2fshow-that-the-assignment-fx-to-fcxb-is-one-to-one%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

MongoDB - Not Authorized To Execute Command

How to fix TextFormField cause rebuild widget in Flutter

in spring boot 2.1 many test slices are not allowed anymore due to multiple @BootstrapWith