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: Homomorphism of posets and lattices
Replies: 16   Last Post: Sep 20, 2013 6:22 AM

 Messages: [ Previous | Next ]
 quasi Posts: 12,067 Registered: 7/15/05
Re: Homomorphism of posets and lattices
Posted: Sep 18, 2013 1:55 PM

Victor Porton wrote:
>
>I've corrected the definitions:
>
>Definition 1. A monotone function (also called order
>homomorphism) from a poset A to a poset B is such a function f
>that x<=y -> fx<=fy.
>
>Definition 2. Order embedding is an monotone function whose
>inverse is also monotone.

Not quite right.

To have an inverse, it would have to be bijective.

Given posets X,Y, a function f:X -> Y is called an order
embedding if (x <= y iff f(x) <= f(y)).

>Obvious 3. Order embeddings are always injective.

Yes.

>Definition 4. Order isomorphism is a surjective order embedding.

Yes, that's Wiki's definition.

quasi

Date Subject Author
9/18/13 William Elliot
9/18/13 quasi
9/18/13 William Elliot
9/18/13 quasi
9/18/13 William Elliot
9/18/13 quasi
9/18/13 Peter Percival
9/18/13 quasi
9/18/13 William Elliot
9/19/13 William Elliot
9/19/13 quasi
9/18/13 Victor Porton
9/18/13 quasi
9/18/13 quasi
9/20/13 @less@ndro
9/19/13 William Elliot
9/19/13 Victor Porton