Search results
Results From The WOW.Com Content Network
The term monotonic transformation (or monotone transformation) may also cause confusion because it refers to a transformation by a strictly increasing function. This is the case in economics with respect to the ordinal properties of a utility function being preserved across a monotonic transform (see also monotone preferences ). [ 5 ]
These maps are quasisymmetric, although they are a much narrower subclass of quasisymmetric maps. For example, while a general quasisymmetric map in the complex plane could map the real line to a set of Hausdorff dimension strictly greater than one, a δ-monotone will always map the real line to a rotated graph of a Lipschitz function L:ℝ → ...
Contractive maps are sometimes called Lipschitzian maps. If the above condition is instead satisfied for k ≤ 1, then the mapping is said to be a non-expansive map . More generally, the idea of a contractive mapping can be defined for maps between metric spaces.
For instance, the function that maps a natural number to its successor is clearly monotone with respect to the natural order. Any function from a discrete order, i.e. from a set ordered by the identity order "=", is also monotone. Mapping each natural number to the corresponding real number gives an example for an order embedding.
Then F and G form a monotone Galois connection between the power set of X and the power set of Y, both ordered by inclusion ⊆. There is a further adjoint pair in this situation: for a subset M of X, define H(M) = {y ∈ Y | f −1 {y} ⊆ M}. Then G and H form a monotone Galois connection between the power set of Y and the power set of X.
In order theory, a branch of mathematics, an order embedding is a special kind of monotone function, which provides a way to include one partially ordered set into another. Like Galois connections , order embeddings constitute a notion which is strictly weaker than the concept of an order isomorphism .
In mathematics, the concept of a residuated mapping arises in the theory of partially ordered sets.It refines the concept of a monotone function.. If A, B are posets, a function f: A → B is defined to be monotone if it is order-preserving: that is, if x ≤ y implies f(x) ≤ f(y).
A map : is called an open map or a strongly open map if it satisfies any of the following equivalent conditions: Definition: f : X → Y {\displaystyle f:X\to Y} maps open subsets of its domain to open subsets of its codomain; that is, for any open subset U {\displaystyle U} of X {\displaystyle X} , f ( U ) {\displaystyle f(U)} is an open ...