> On Mon, 16 Sep 2013 14:24:06 +0300, Victor Porton <email@example.com> > wrote: > >>William Elliot wrote: >> >>> Let X,Y be (partially) ordered sets. Are these definitions correct? >>> >>> f:X -> Y is an order embedding when >>> for all x,y, (x <= y iff f(x) <= f(y)). >> >>Yes. > > I think no. Surely an embedding is required to be injective. > >> >>> f:X -> Y is an order isomorphism when f is surjective >>> and for all x,y, (x <= y iff f(x) <= f(y)). >> >>Yes. > > No. An isomorphism must be bijective.
Sorry, I was uncareful when answering William' question.