Coercive function
From Wikipedia, the free encyclopedia
In mathematics, a coercive function is a function that "grows rapidly" at the extremes of the space on which it is defined. More precisely, a function f : Rn → Rn is called coercive if
where "" denotes the usual dot product and "| u |" denotes the usual Euclidean norm of the vector u.
More generally, a function f : X → Y between two topological spaces X and Y is called coercive if, for every compact subset J of Y there exists a compact subset K of X such that
[edit] References
- Renardy, Michael and Rogers, Robert C. (2004). An introduction to partial differential equations, Second edition, New York, NY: Springer-Verlag, xiv+434. ISBN 0-387-00444-0.
- This article incorporates material from CoerciveFunction on PlanetMath, which is licensed under the GFDL.