quasi
Posts:
11,307
Registered:
7/15/05


Re: Homomorphism of posets and lattices
Posted:
Sep 18, 2013 5:52 AM


William Elliot wrote: > >Recall, that if f:X > Y, is an embedding, then f:X > f(X) >is an isomorphism.
So define it that way.
Call f:X > Y an order embedding if the map g: X > f(X), defined by g(x) = f(x) for all x in X, is an order isomorphism from X to f(X).
quasi

