Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Order embedding
Replies: 8   Last Post: Sep 16, 2013 10:01 PM

 Messages: [ Previous | Next ]
 Victor Porton Posts: 621 Registered: 8/1/05
Re: Order embedding
Posted: Sep 16, 2013 7:24 AM

William Elliot wrote:

> Let X,Y be (partially) ordered sets. Are these definitions correct?
>
> f:X -> Y is order preserving when
> for all x,y, (x <= y implies f(x) <= f(y).

Yes.

> f:X -> Y is an order embedding when
> for all x,y, (x <= y iff f(x) <= f(y)).

Yes.

> f:X -> Y is an order isomorphism when f is surjective
> and for all x,y, (x <= y iff f(x) <= f(y)).

Yes.

> The following are immediate consequences.
>
> Order embedding maps and order isomorphisms are injections.

Yes.

> If f:X -> Y is an order embedding,
> then f:X -> f(X) is an order isomorphism.

Yes.

> Furthermore the composition of two order preserving, order
> embedding or order isomorphic maps is again resp., order

> preserving, order embedding or order isomorphic.

Yes.

> Finally, the inverse of an order isomorphism is an order isomorphism.

Yes.

> That all is the basics of order maps, is it not?
> Or is the more to be included?

Probably all.

There are also Galois connections.

Date Subject Author
9/16/13 William Elliot
9/16/13 Victor Porton
9/16/13 Peter Percival
9/16/13 David Bernier
9/16/13 David Bernier
9/16/13 David C. Ullrich
9/16/13 Victor Porton
9/16/13 David Hartley
9/16/13 William Elliot