Injectivity of $f(x) = x + [x/2]$, and finding an explicit inverse
$begingroup$
Context:
This question comes up as a tangent to an earlier MSE question from today. The OP of this question was, in effect, seeking an explicit inverse to the function
$$f(x) = x + left[ frac{x}{2} right]$$
where $[n]$ denotes the rounding function, i.e. outputs $n$ rounded to the nearest integer. It turned out the OP was mistaken and meant to ask about a different function, but this brought about an interesting thought as I played around with it.
The Problem / My Questions:
Let $f$ be as defined previously. On an intuitive glance at the graph of this function, we can see it is injective:
However, a rigorous proof of this (i.e. $f(x_1) = f(x_2) implies x_1 = x_2$) eludes me, namely because of that rounding function. The function $g(x) = x$ is injective, yet $h(x) = [x/2]$ isn't (consider $x_1 = 2$ and $x_2 = 2.2$). So obviously it is possible to have an injective function which is the sum of two functions which are not necessarily injective.
I've tried rigorously proving the injectivity of $f$, making use of various identities from Wikipedia - you can express $[n]$ as $lfloor n + 0.5 rfloor$, so since this page had lots of identities (as opposed to their rounding function page) I figured it'd be useful. No real headway, though.
Which brings up my questions:
How would one prove the injectivity of $f$? So far in my coursework I've typically only done so from the definition. Perhaps there's a different trick to use in this case - a property of injective functions perhaps, or perhaps a property of the rounding, floor, or ceiling functions?
How would one find the inverse of $f$? Clearly, to each $x$, there is a unique $f(x)$, so, in theory, it seems like you'd be able to invert the function, to be able to express $x$ in terms of $f(x)$. This obviously isn't true for the related three functions
$$a(x) = lfloor x rfloor = text{floor}(x) ;;;;;; b(x) = lceil x rceil = text{ceiling}(x) ;;;;;; c(x) = [x] = text{round}(x)$$
but it seems like introducing the lone $x$ term (as in $f$) that would normally change the dynamic. Is it possible that there are indeed just injective (or, what would be even more strange from my experience, bijective) functions for which we cannot find an explicit inverse?
functions floor-function inverse-function ceiling-function
asked Jan 3 at 1:24
Eevee TrainerEevee Trainer
7,61521338
$endgroup$
add a comment |
$begingroup$
Context:
This question comes up as a tangent to an earlier MSE question from today. The OP of this question was, in effect, seeking an explicit inverse to the function
$$f(x) = x + left[ frac{x}{2} right]$$
where $[n]$ denotes the rounding function, i.e. outputs $n$ rounded to the nearest integer. It turned out the OP was mistaken and meant to ask about a different function, but this brought about an interesting thought as I played around with it.
The Problem / My Questions:
Let $f$ be as defined previously. On an intuitive glance at the graph of this function, we can see it is injective:
However, a rigorous proof of this (i.e. $f(x_1) = f(x_2) implies x_1 = x_2$) eludes me, namely because of that rounding function. The function $g(x) = x$ is injective, yet $h(x) = [x/2]$ isn't (consider $x_1 = 2$ and $x_2 = 2.2$). So obviously it is possible to have an injective function which is the sum of two functions which are not necessarily injective.
I've tried rigorously proving the injectivity of $f$, making use of various identities from Wikipedia - you can express $[n]$ as $lfloor n + 0.5 rfloor$, so since this page had lots of identities (as opposed to their rounding function page) I figured it'd be useful. No real headway, though.
Which brings up my questions:
How would one prove the injectivity of $f$? So far in my coursework I've typically only done so from the definition. Perhaps there's a different trick to use in this case - a property of injective functions perhaps, or perhaps a property of the rounding, floor, or ceiling functions?
How would one find the inverse of $f$? Clearly, to each $x$, there is a unique $f(x)$, so, in theory, it seems like you'd be able to invert the function, to be able to express $x$ in terms of $f(x)$. This obviously isn't true for the related three functions
$$a(x) = lfloor x rfloor = text{floor}(x) ;;;;;; b(x) = lceil x rceil = text{ceiling}(x) ;;;;;; c(x) = [x] = text{round}(x)$$
but it seems like introducing the lone $x$ term (as in $f$) that would normally change the dynamic. Is it possible that there are indeed just injective (or, what would be even more strange from my experience, bijective) functions for which we cannot find an explicit inverse?
functions floor-function inverse-function ceiling-function
asked Jan 3 at 1:24
Eevee TrainerEevee Trainer
7,61521338
$endgroup$
$begingroup$
Ahhh, I see, I didn't think to do that, really simple when you frame it that way. Though $f$ is not $f(x) = x + [x]$ here, but I think that's a good enough nudge for me to try proving it myself (it's not a whole lot different). So thanks for that insight! ^_^
$endgroup$
– Eevee Trainer
Jan 3 at 1:41
$begingroup$
Since the comment was deleted, the insight in question: let $x in mathbb{R}$. Then there exists some $n in mathbb{N}$ such that $$n leq x leq n+1$$ Thus, $x$ can be expressed by $x = n + {x}$, where ${x}$ denotes the fractional part of $x$. Consider this in the definition of injectivity and the proof should follow reasonably smoothly. (Which only leaves the tenet of an explicit inverse to address.)
$endgroup$
– Eevee Trainer
Jan 3 at 1:43
add a comment |
$begingroup$
Context:
This question comes up as a tangent to an earlier MSE question from today. The OP of this question was, in effect, seeking an explicit inverse to the function
$$f(x) = x + left[ frac{x}{2} right]$$
where $[n]$ denotes the rounding function, i.e. outputs $n$ rounded to the nearest integer. It turned out the OP was mistaken and meant to ask about a different function, but this brought about an interesting thought as I played around with it.
The Problem / My Questions:
Let $f$ be as defined previously. On an intuitive glance at the graph of this function, we can see it is injective:
However, a rigorous proof of this (i.e. $f(x_1) = f(x_2) implies x_1 = x_2$) eludes me, namely because of that rounding function. The function $g(x) = x$ is injective, yet $h(x) = [x/2]$ isn't (consider $x_1 = 2$ and $x_2 = 2.2$). So obviously it is possible to have an injective function which is the sum of two functions which are not necessarily injective.
I've tried rigorously proving the injectivity of $f$, making use of various identities from Wikipedia - you can express $[n]$ as $lfloor n + 0.5 rfloor$, so since this page had lots of identities (as opposed to their rounding function page) I figured it'd be useful. No real headway, though.
Which brings up my questions:
How would one prove the injectivity of $f$? So far in my coursework I've typically only done so from the definition. Perhaps there's a different trick to use in this case - a property of injective functions perhaps, or perhaps a property of the rounding, floor, or ceiling functions?
How would one find the inverse of $f$? Clearly, to each $x$, there is a unique $f(x)$, so, in theory, it seems like you'd be able to invert the function, to be able to express $x$ in terms of $f(x)$. This obviously isn't true for the related three functions
$$a(x) = lfloor x rfloor = text{floor}(x) ;;;;;; b(x) = lceil x rceil = text{ceiling}(x) ;;;;;; c(x) = [x] = text{round}(x)$$
but it seems like introducing the lone $x$ term (as in $f$) that would normally change the dynamic. Is it possible that there are indeed just injective (or, what would be even more strange from my experience, bijective) functions for which we cannot find an explicit inverse?
functions floor-function inverse-function ceiling-function
asked Jan 3 at 1:24
Eevee TrainerEevee Trainer
7,61521338
$endgroup$
Context:
This question comes up as a tangent to an earlier MSE question from today. The OP of this question was, in effect, seeking an explicit inverse to the function
$$f(x) = x + left[ frac{x}{2} right]$$
where $[n]$ denotes the rounding function, i.e. outputs $n$ rounded to the nearest integer. It turned out the OP was mistaken and meant to ask about a different function, but this brought about an interesting thought as I played around with it.
The Problem / My Questions:
Let $f$ be as defined previously. On an intuitive glance at the graph of this function, we can see it is injective:
However, a rigorous proof of this (i.e. $f(x_1) = f(x_2) implies x_1 = x_2$) eludes me, namely because of that rounding function. The function $g(x) = x$ is injective, yet $h(x) = [x/2]$ isn't (consider $x_1 = 2$ and $x_2 = 2.2$). So obviously it is possible to have an injective function which is the sum of two functions which are not necessarily injective.
I've tried rigorously proving the injectivity of $f$, making use of various identities from Wikipedia - you can express $[n]$ as $lfloor n + 0.5 rfloor$, so since this page had lots of identities (as opposed to their rounding function page) I figured it'd be useful. No real headway, though.
Which brings up my questions:
How would one prove the injectivity of $f$? So far in my coursework I've typically only done so from the definition. Perhaps there's a different trick to use in this case - a property of injective functions perhaps, or perhaps a property of the rounding, floor, or ceiling functions?
How would one find the inverse of $f$? Clearly, to each $x$, there is a unique $f(x)$, so, in theory, it seems like you'd be able to invert the function, to be able to express $x$ in terms of $f(x)$. This obviously isn't true for the related three functions
$$a(x) = lfloor x rfloor = text{floor}(x) ;;;;;; b(x) = lceil x rceil = text{ceiling}(x) ;;;;;; c(x) = [x] = text{round}(x)$$
but it seems like introducing the lone $x$ term (as in $f$) that would normally change the dynamic. Is it possible that there are indeed just injective (or, what would be even more strange from my experience, bijective) functions for which we cannot find an explicit inverse?
functions floor-function inverse-function ceiling-function
functions floor-function inverse-function ceiling-function
asked Jan 3 at 1:24
Eevee TrainerEevee Trainer
7,61521338
asked Jan 3 at 1:24
Eevee TrainerEevee Trainer
7,61521338
edited Jan 3 at 1:36
Eevee Trainer
asked Jan 3 at 1:24
Eevee TrainerEevee Trainer
7,61521338
asked Jan 3 at 1:24
Eevee TrainerEevee Trainer
7,61521338
asked Jan 3 at 1:24
Eevee TrainerEevee Trainer
7,61521338
7,61521338
$begingroup$
Ahhh, I see, I didn't think to do that, really simple when you frame it that way. Though $f$ is not $f(x) = x + [x]$ here, but I think that's a good enough nudge for me to try proving it myself (it's not a whole lot different). So thanks for that insight! ^_^
$endgroup$
– Eevee Trainer
Jan 3 at 1:41
$begingroup$
Since the comment was deleted, the insight in question: let $x in mathbb{R}$. Then there exists some $n in mathbb{N}$ such that $$n leq x leq n+1$$ Thus, $x$ can be expressed by $x = n + {x}$, where ${x}$ denotes the fractional part of $x$. Consider this in the definition of injectivity and the proof should follow reasonably smoothly. (Which only leaves the tenet of an explicit inverse to address.)
$endgroup$
– Eevee Trainer
Jan 3 at 1:43
add a comment |
$begingroup$
Ahhh, I see, I didn't think to do that, really simple when you frame it that way. Though $f$ is not $f(x) = x + [x]$ here, but I think that's a good enough nudge for me to try proving it myself (it's not a whole lot different). So thanks for that insight! ^_^
$endgroup$
– Eevee Trainer
Jan 3 at 1:41
$begingroup$
Since the comment was deleted, the insight in question: let $x in mathbb{R}$. Then there exists some $n in mathbb{N}$ such that $$n leq x leq n+1$$ Thus, $x$ can be expressed by $x = n + {x}$, where ${x}$ denotes the fractional part of $x$. Consider this in the definition of injectivity and the proof should follow reasonably smoothly. (Which only leaves the tenet of an explicit inverse to address.)
$endgroup$
– Eevee Trainer
Jan 3 at 1:43
$begingroup$
Ahhh, I see, I didn't think to do that, really simple when you frame it that way. Though $f$ is not $f(x) = x + [x]$ here, but I think that's a good enough nudge for me to try proving it myself (it's not a whole lot different). So thanks for that insight! ^_^
$endgroup$
– Eevee Trainer
Jan 3 at 1:41
$begingroup$
Ahhh, I see, I didn't think to do that, really simple when you frame it that way. Though $f$ is not $f(x) = x + [x]$ here, but I think that's a good enough nudge for me to try proving it myself (it's not a whole lot different). So thanks for that insight! ^_^
$endgroup$
– Eevee Trainer
Jan 3 at 1:41
$begingroup$
Since the comment was deleted, the insight in question: let $x in mathbb{R}$. Then there exists some $n in mathbb{N}$ such that $$n leq x leq n+1$$ Thus, $x$ can be expressed by $x = n + {x}$, where ${x}$ denotes the fractional part of $x$. Consider this in the definition of injectivity and the proof should follow reasonably smoothly. (Which only leaves the tenet of an explicit inverse to address.)
$endgroup$
– Eevee Trainer
Jan 3 at 1:43
$begingroup$
Since the comment was deleted, the insight in question: let $x in mathbb{R}$. Then there exists some $n in mathbb{N}$ such that $$n leq x leq n+1$$ Thus, $x$ can be expressed by $x = n + {x}$, where ${x}$ denotes the fractional part of $x$. Consider this in the definition of injectivity and the proof should follow reasonably smoothly. (Which only leaves the tenet of an explicit inverse to address.)
$endgroup$
– Eevee Trainer
Jan 3 at 1:43
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Here is alternate take on proving the injectivity of your function.
Define $f:mathbb{R}rightarrowmathbb{R}$ by $f(x)=x+left[frac{x}{2}right]$. Let $x_0<x_1$ be real numbers. Then $f(x_0)<f(x_1)$, and thus $f$ is injective!
Basically, we can leverage the ordering of the reals in order to get at injectivity at little easier. Each component of $f$ is increasing, and the $x$ part is strictly increasing, and monotonicity (of the same type) is preserved under addition.
As far as an explicit inverse goes, it seems to me that it will either be the case that we have to be really clever or that no such explicit representation exists. Not that you should trust Wolfram Alpha, but it doesn't know what to do, and that is usually a sign that you also can't do it.
answered Jan 3 at 1:48
ItsJustASeriesBroItsJustASeriesBro
1563
$endgroup$
$begingroup$
To be fair, we're using the rounding function, not floor, but I think the same idea more or less applies. Personally still like the angle that used the fractional part of $x$ and whatnot from the comments more - it was just more immediately obviously to me. Still, thanks for the (additional) insight! ^_^
$endgroup$
– Eevee Trainer
Jan 3 at 1:53
$begingroup$
Oops, now I see you edited it. lol
$endgroup$
– Eevee Trainer
Jan 3 at 1:53
$begingroup$
@EeveeTrainer Yea, sorry about that. My fingers type faster than my eyes read!
$endgroup$
– ItsJustASeriesBro
Jan 3 at 1:53
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%2f3060168%2finjectivity-of-fx-x-x-2-and-finding-an-explicit-inverse%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$
Here is alternate take on proving the injectivity of your function.
Define $f:mathbb{R}rightarrowmathbb{R}$ by $f(x)=x+left[frac{x}{2}right]$. Let $x_0<x_1$ be real numbers. Then $f(x_0)<f(x_1)$, and thus $f$ is injective!
Basically, we can leverage the ordering of the reals in order to get at injectivity at little easier. Each component of $f$ is increasing, and the $x$ part is strictly increasing, and monotonicity (of the same type) is preserved under addition.
As far as an explicit inverse goes, it seems to me that it will either be the case that we have to be really clever or that no such explicit representation exists. Not that you should trust Wolfram Alpha, but it doesn't know what to do, and that is usually a sign that you also can't do it.
answered Jan 3 at 1:48
ItsJustASeriesBroItsJustASeriesBro
1563
$endgroup$
$begingroup$
To be fair, we're using the rounding function, not floor, but I think the same idea more or less applies. Personally still like the angle that used the fractional part of $x$ and whatnot from the comments more - it was just more immediately obviously to me. Still, thanks for the (additional) insight! ^_^
$endgroup$
– Eevee Trainer
Jan 3 at 1:53
$begingroup$
Oops, now I see you edited it. lol
$endgroup$
– Eevee Trainer
Jan 3 at 1:53
$begingroup$
@EeveeTrainer Yea, sorry about that. My fingers type faster than my eyes read!
$endgroup$
– ItsJustASeriesBro
Jan 3 at 1:53
add a comment |
$begingroup$
Here is alternate take on proving the injectivity of your function.
Define $f:mathbb{R}rightarrowmathbb{R}$ by $f(x)=x+left[frac{x}{2}right]$. Let $x_0<x_1$ be real numbers. Then $f(x_0)<f(x_1)$, and thus $f$ is injective!
Basically, we can leverage the ordering of the reals in order to get at injectivity at little easier. Each component of $f$ is increasing, and the $x$ part is strictly increasing, and monotonicity (of the same type) is preserved under addition.
As far as an explicit inverse goes, it seems to me that it will either be the case that we have to be really clever or that no such explicit representation exists. Not that you should trust Wolfram Alpha, but it doesn't know what to do, and that is usually a sign that you also can't do it.
answered Jan 3 at 1:48
ItsJustASeriesBroItsJustASeriesBro
1563
$endgroup$
$begingroup$
To be fair, we're using the rounding function, not floor, but I think the same idea more or less applies. Personally still like the angle that used the fractional part of $x$ and whatnot from the comments more - it was just more immediately obviously to me. Still, thanks for the (additional) insight! ^_^
$endgroup$
– Eevee Trainer
Jan 3 at 1:53
$begingroup$
Oops, now I see you edited it. lol
$endgroup$
– Eevee Trainer
Jan 3 at 1:53
$begingroup$
@EeveeTrainer Yea, sorry about that. My fingers type faster than my eyes read!
$endgroup$
– ItsJustASeriesBro
Jan 3 at 1:53
add a comment |
$begingroup$
Here is alternate take on proving the injectivity of your function.
Define $f:mathbb{R}rightarrowmathbb{R}$ by $f(x)=x+left[frac{x}{2}right]$. Let $x_0<x_1$ be real numbers. Then $f(x_0)<f(x_1)$, and thus $f$ is injective!
Basically, we can leverage the ordering of the reals in order to get at injectivity at little easier. Each component of $f$ is increasing, and the $x$ part is strictly increasing, and monotonicity (of the same type) is preserved under addition.
As far as an explicit inverse goes, it seems to me that it will either be the case that we have to be really clever or that no such explicit representation exists. Not that you should trust Wolfram Alpha, but it doesn't know what to do, and that is usually a sign that you also can't do it.
answered Jan 3 at 1:48
ItsJustASeriesBroItsJustASeriesBro
1563
$endgroup$
Here is alternate take on proving the injectivity of your function.
Define $f:mathbb{R}rightarrowmathbb{R}$ by $f(x)=x+left[frac{x}{2}right]$. Let $x_0<x_1$ be real numbers. Then $f(x_0)<f(x_1)$, and thus $f$ is injective!
Basically, we can leverage the ordering of the reals in order to get at injectivity at little easier. Each component of $f$ is increasing, and the $x$ part is strictly increasing, and monotonicity (of the same type) is preserved under addition.
As far as an explicit inverse goes, it seems to me that it will either be the case that we have to be really clever or that no such explicit representation exists. Not that you should trust Wolfram Alpha, but it doesn't know what to do, and that is usually a sign that you also can't do it.
answered Jan 3 at 1:48
ItsJustASeriesBroItsJustASeriesBro
1563
answered Jan 3 at 1:48
ItsJustASeriesBroItsJustASeriesBro
1563
answered Jan 3 at 1:48
ItsJustASeriesBroItsJustASeriesBro
1563
answered Jan 3 at 1:48
ItsJustASeriesBroItsJustASeriesBro
1563
1563
$begingroup$
To be fair, we're using the rounding function, not floor, but I think the same idea more or less applies. Personally still like the angle that used the fractional part of $x$ and whatnot from the comments more - it was just more immediately obviously to me. Still, thanks for the (additional) insight! ^_^
$endgroup$
– Eevee Trainer
Jan 3 at 1:53
$begingroup$
Oops, now I see you edited it. lol
$endgroup$
– Eevee Trainer
Jan 3 at 1:53
$begingroup$
@EeveeTrainer Yea, sorry about that. My fingers type faster than my eyes read!
$endgroup$
– ItsJustASeriesBro
Jan 3 at 1:53
add a comment |
$begingroup$
To be fair, we're using the rounding function, not floor, but I think the same idea more or less applies. Personally still like the angle that used the fractional part of $x$ and whatnot from the comments more - it was just more immediately obviously to me. Still, thanks for the (additional) insight! ^_^
$endgroup$
– Eevee Trainer
Jan 3 at 1:53
$begingroup$
Oops, now I see you edited it. lol
$endgroup$
– Eevee Trainer
Jan 3 at 1:53
$begingroup$
@EeveeTrainer Yea, sorry about that. My fingers type faster than my eyes read!
$endgroup$
– ItsJustASeriesBro
Jan 3 at 1:53
$begingroup$
To be fair, we're using the rounding function, not floor, but I think the same idea more or less applies. Personally still like the angle that used the fractional part of $x$ and whatnot from the comments more - it was just more immediately obviously to me. Still, thanks for the (additional) insight! ^_^
$endgroup$
– Eevee Trainer
Jan 3 at 1:53
$begingroup$
To be fair, we're using the rounding function, not floor, but I think the same idea more or less applies. Personally still like the angle that used the fractional part of $x$ and whatnot from the comments more - it was just more immediately obviously to me. Still, thanks for the (additional) insight! ^_^
$endgroup$
– Eevee Trainer
Jan 3 at 1:53
$begingroup$
Oops, now I see you edited it. lol
$endgroup$
– Eevee Trainer
Jan 3 at 1:53
$begingroup$
Oops, now I see you edited it. lol
$endgroup$
– Eevee Trainer
Jan 3 at 1:53
$begingroup$
@EeveeTrainer Yea, sorry about that. My fingers type faster than my eyes read!
$endgroup$
– ItsJustASeriesBro
Jan 3 at 1:53
$begingroup$
@EeveeTrainer Yea, sorry about that. My fingers type faster than my eyes read!
$endgroup$
– ItsJustASeriesBro
Jan 3 at 1:53
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%2f3060168%2finjectivity-of-fx-x-x-2-and-finding-an-explicit-inverse%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$
Ahhh, I see, I didn't think to do that, really simple when you frame it that way. Though $f$ is not $f(x) = x + [x]$ here, but I think that's a good enough nudge for me to try proving it myself (it's not a whole lot different). So thanks for that insight! ^_^
$endgroup$
– Eevee Trainer
Jan 3 at 1:41
$begingroup$
Since the comment was deleted, the insight in question: let $x in mathbb{R}$. Then there exists some $n in mathbb{N}$ such that $$n leq x leq n+1$$ Thus, $x$ can be expressed by $x = n + {x}$, where ${x}$ denotes the fractional part of $x$. Consider this in the definition of injectivity and the proof should follow reasonably smoothly. (Which only leaves the tenet of an explicit inverse to address.)
$endgroup$
– Eevee Trainer
Jan 3 at 1:43