(redirected from Order embedding)
Also found in: Wikipedia.


A function f : D -> C is order-embedding iff for all x, y in D,

f(x) <= f(y) <=> x <= y.

I.e. arguments and results compare similarly. A function which is order-embedding is monotonic and one-to-one and an injection.

("<=" is written in LaTeX as \sqsubseteq).
References in periodicals archive ?
An order embedding from a poset (A, [[less than or equal to].
It is natural to consider injectivity in the category of posemigroups with respect to posemigroup homomorphisms that are order embeddings.