A sufficient (?) condition under which a linear order is order-isomorphic to a subset of the real line
up vote
0
down vote
favorite
Let $(mathbb{X},<)$ be a linear order. Assume that there exists $g:mathbb{X} times mathbb{R} rightarrow mathbb{R}$ such that for each fixed $x<x'$ the function $y mapsto g(x,y)-g(x',y)$ is a strictly increasing bijection of $mathbb{R}$ onto itself.
I am trying to prove (or disprove) that then $(mathbb{X},<)$ is necessarily order-isomorphic to a subset of $mathbb{R}$ with the usual order. That is, there exists a strictly increasing function $f:mathbb{X} rightarrow mathbb{R}$.
Thank you.
order-theory
add a comment |
up vote
0
down vote
favorite
Let $(mathbb{X},<)$ be a linear order. Assume that there exists $g:mathbb{X} times mathbb{R} rightarrow mathbb{R}$ such that for each fixed $x<x'$ the function $y mapsto g(x,y)-g(x',y)$ is a strictly increasing bijection of $mathbb{R}$ onto itself.
I am trying to prove (or disprove) that then $(mathbb{X},<)$ is necessarily order-isomorphic to a subset of $mathbb{R}$ with the usual order. That is, there exists a strictly increasing function $f:mathbb{X} rightarrow mathbb{R}$.
Thank you.
order-theory
Do you know that every finite or countably infinite linear ordering is order isomorphic to a subset of the rationals? I haven't given much thought to your actual question, so if this result is well known to you and doesn't seem relevant, then ignore my comment.
– Dave L. Renfro
Nov 16 at 18:15
Is it even straightforward that $|X|le|Bbb R|$?
– Hagen von Eitzen
Nov 16 at 18:17
@DaveL.Renfro, thank you. Yes, I know this fact, but I don't know how to use it to prove (or disprove) the statement of interest.
– Mikhail
Nov 16 at 18:54
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
Let $(mathbb{X},<)$ be a linear order. Assume that there exists $g:mathbb{X} times mathbb{R} rightarrow mathbb{R}$ such that for each fixed $x<x'$ the function $y mapsto g(x,y)-g(x',y)$ is a strictly increasing bijection of $mathbb{R}$ onto itself.
I am trying to prove (or disprove) that then $(mathbb{X},<)$ is necessarily order-isomorphic to a subset of $mathbb{R}$ with the usual order. That is, there exists a strictly increasing function $f:mathbb{X} rightarrow mathbb{R}$.
Thank you.
order-theory
Let $(mathbb{X},<)$ be a linear order. Assume that there exists $g:mathbb{X} times mathbb{R} rightarrow mathbb{R}$ such that for each fixed $x<x'$ the function $y mapsto g(x,y)-g(x',y)$ is a strictly increasing bijection of $mathbb{R}$ onto itself.
I am trying to prove (or disprove) that then $(mathbb{X},<)$ is necessarily order-isomorphic to a subset of $mathbb{R}$ with the usual order. That is, there exists a strictly increasing function $f:mathbb{X} rightarrow mathbb{R}$.
Thank you.
order-theory
order-theory
edited Nov 16 at 18:07
asked Nov 16 at 17:31
Mikhail
605
605
Do you know that every finite or countably infinite linear ordering is order isomorphic to a subset of the rationals? I haven't given much thought to your actual question, so if this result is well known to you and doesn't seem relevant, then ignore my comment.
– Dave L. Renfro
Nov 16 at 18:15
Is it even straightforward that $|X|le|Bbb R|$?
– Hagen von Eitzen
Nov 16 at 18:17
@DaveL.Renfro, thank you. Yes, I know this fact, but I don't know how to use it to prove (or disprove) the statement of interest.
– Mikhail
Nov 16 at 18:54
add a comment |
Do you know that every finite or countably infinite linear ordering is order isomorphic to a subset of the rationals? I haven't given much thought to your actual question, so if this result is well known to you and doesn't seem relevant, then ignore my comment.
– Dave L. Renfro
Nov 16 at 18:15
Is it even straightforward that $|X|le|Bbb R|$?
– Hagen von Eitzen
Nov 16 at 18:17
@DaveL.Renfro, thank you. Yes, I know this fact, but I don't know how to use it to prove (or disprove) the statement of interest.
– Mikhail
Nov 16 at 18:54
Do you know that every finite or countably infinite linear ordering is order isomorphic to a subset of the rationals? I haven't given much thought to your actual question, so if this result is well known to you and doesn't seem relevant, then ignore my comment.
– Dave L. Renfro
Nov 16 at 18:15
Do you know that every finite or countably infinite linear ordering is order isomorphic to a subset of the rationals? I haven't given much thought to your actual question, so if this result is well known to you and doesn't seem relevant, then ignore my comment.
– Dave L. Renfro
Nov 16 at 18:15
Is it even straightforward that $|X|le|Bbb R|$?
– Hagen von Eitzen
Nov 16 at 18:17
Is it even straightforward that $|X|le|Bbb R|$?
– Hagen von Eitzen
Nov 16 at 18:17
@DaveL.Renfro, thank you. Yes, I know this fact, but I don't know how to use it to prove (or disprove) the statement of interest.
– Mikhail
Nov 16 at 18:54
@DaveL.Renfro, thank you. Yes, I know this fact, but I don't know how to use it to prove (or disprove) the statement of interest.
– Mikhail
Nov 16 at 18:54
add a comment |
1 Answer
1
active
oldest
votes
up vote
2
down vote
accepted
Define $FcolonBbb Xto Bbb R$ as
$$F(x)=g(x,0)-g(x,1).$$
Claim. Then $x<x'$ implies $F(x)<F(x')$.
Proof.
Let $h(y)=g(x,y)-g(x',y)$. We are given that $hcolonBbb RtoBbb R$ is strictly increasing.
Now we have $$F(x')-F(x)=g(x',0)-g(x',1)-g(x,0)+g(x,1)=h(1)-h(0)>0$$
as desired. $square$
Great! Thank you very much!
– Mikhail
Nov 16 at 21:00
add a comment |
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
2
down vote
accepted
Define $FcolonBbb Xto Bbb R$ as
$$F(x)=g(x,0)-g(x,1).$$
Claim. Then $x<x'$ implies $F(x)<F(x')$.
Proof.
Let $h(y)=g(x,y)-g(x',y)$. We are given that $hcolonBbb RtoBbb R$ is strictly increasing.
Now we have $$F(x')-F(x)=g(x',0)-g(x',1)-g(x,0)+g(x,1)=h(1)-h(0)>0$$
as desired. $square$
Great! Thank you very much!
– Mikhail
Nov 16 at 21:00
add a comment |
up vote
2
down vote
accepted
Define $FcolonBbb Xto Bbb R$ as
$$F(x)=g(x,0)-g(x,1).$$
Claim. Then $x<x'$ implies $F(x)<F(x')$.
Proof.
Let $h(y)=g(x,y)-g(x',y)$. We are given that $hcolonBbb RtoBbb R$ is strictly increasing.
Now we have $$F(x')-F(x)=g(x',0)-g(x',1)-g(x,0)+g(x,1)=h(1)-h(0)>0$$
as desired. $square$
Great! Thank you very much!
– Mikhail
Nov 16 at 21:00
add a comment |
up vote
2
down vote
accepted
up vote
2
down vote
accepted
Define $FcolonBbb Xto Bbb R$ as
$$F(x)=g(x,0)-g(x,1).$$
Claim. Then $x<x'$ implies $F(x)<F(x')$.
Proof.
Let $h(y)=g(x,y)-g(x',y)$. We are given that $hcolonBbb RtoBbb R$ is strictly increasing.
Now we have $$F(x')-F(x)=g(x',0)-g(x',1)-g(x,0)+g(x,1)=h(1)-h(0)>0$$
as desired. $square$
Define $FcolonBbb Xto Bbb R$ as
$$F(x)=g(x,0)-g(x,1).$$
Claim. Then $x<x'$ implies $F(x)<F(x')$.
Proof.
Let $h(y)=g(x,y)-g(x',y)$. We are given that $hcolonBbb RtoBbb R$ is strictly increasing.
Now we have $$F(x')-F(x)=g(x',0)-g(x',1)-g(x,0)+g(x,1)=h(1)-h(0)>0$$
as desired. $square$
answered Nov 16 at 20:50
Hagen von Eitzen
275k21266494
275k21266494
Great! Thank you very much!
– Mikhail
Nov 16 at 21:00
add a comment |
Great! Thank you very much!
– Mikhail
Nov 16 at 21:00
Great! Thank you very much!
– Mikhail
Nov 16 at 21:00
Great! Thank you very much!
– Mikhail
Nov 16 at 21:00
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3001409%2fa-sufficient-condition-under-which-a-linear-order-is-order-isomorphic-to-a-s%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
Do you know that every finite or countably infinite linear ordering is order isomorphic to a subset of the rationals? I haven't given much thought to your actual question, so if this result is well known to you and doesn't seem relevant, then ignore my comment.
– Dave L. Renfro
Nov 16 at 18:15
Is it even straightforward that $|X|le|Bbb R|$?
– Hagen von Eitzen
Nov 16 at 18:17
@DaveL.Renfro, thank you. Yes, I know this fact, but I don't know how to use it to prove (or disprove) the statement of interest.
– Mikhail
Nov 16 at 18:54