Mixing
Proof about ordering-preserving function
up vote
0
down vote
favorite
Let $f: C_1 to C_2$ be an order preserving function. Assume that for $A subset C_1$ there exist $Sup(A) in C_1$ and $Sup(f(A)) in C_2$. Prove that $Sup(f(A)) leq f(Sup(A))$.
The statement seems obvious, but how would one go about proving this?
analysis functions upper-lower-bounds
asked 2 days ago
user14513462563
846
add a comment |
up vote
0
down vote
favorite
Let $f: C_1 to C_2$ be an order preserving function. Assume that for $A subset C_1$ there exist $Sup(A) in C_1$ and $Sup(f(A)) in C_2$. Prove that $Sup(f(A)) leq f(Sup(A))$.
The statement seems obvious, but how would one go about proving this?
analysis functions upper-lower-bounds
asked 2 days ago
user14513462563
846
Show (using the "order-preserving" assumption) that $f(sup(A))$ is an upper bound for $f(A)$. Then use that $sup(f(A))$ is the least upper bound of the same set $f(A)$.
– Andreas Blass
2 days ago
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
Let $f: C_1 to C_2$ be an order preserving function. Assume that for $A subset C_1$ there exist $Sup(A) in C_1$ and $Sup(f(A)) in C_2$. Prove that $Sup(f(A)) leq f(Sup(A))$.
The statement seems obvious, but how would one go about proving this?
analysis functions upper-lower-bounds
asked 2 days ago
user14513462563
846
Let $f: C_1 to C_2$ be an order preserving function. Assume that for $A subset C_1$ there exist $Sup(A) in C_1$ and $Sup(f(A)) in C_2$. Prove that $Sup(f(A)) leq f(Sup(A))$.
The statement seems obvious, but how would one go about proving this?
analysis functions upper-lower-bounds
analysis functions upper-lower-bounds
asked 2 days ago
user14513462563
846
asked 2 days ago
user14513462563
846
asked 2 days ago
user14513462563
846
asked 2 days ago
user14513462563
846
asked 2 days ago
user14513462563
846
846
Show (using the "order-preserving" assumption) that $f(sup(A))$ is an upper bound for $f(A)$. Then use that $sup(f(A))$ is the least upper bound of the same set $f(A)$.
– Andreas Blass
2 days ago
add a comment |
Show (using the "order-preserving" assumption) that $f(sup(A))$ is an upper bound for $f(A)$. Then use that $sup(f(A))$ is the least upper bound of the same set $f(A)$.
– Andreas Blass
2 days ago
Show (using the "order-preserving" assumption) that $f(sup(A))$ is an upper bound for $f(A)$. Then use that $sup(f(A))$ is the least upper bound of the same set $f(A)$.
– Andreas Blass
2 days ago
Show (using the "order-preserving" assumption) that $f(sup(A))$ is an upper bound for $f(A)$. Then use that $sup(f(A))$ is the least upper bound of the same set $f(A)$.
– Andreas Blass
2 days ago
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
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%2f3005689%2fproof-about-ordering-preserving-function%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
Show (using the "order-preserving" assumption) that $f(sup(A))$ is an upper bound for $f(A)$. Then use that $sup(f(A))$ is the least upper bound of the same set $f(A)$.
– Andreas Blass
2 days ago