HOME

TheInfoList



OR:

In
mathematics Mathematics is a field of study that discovers and organizes methods, Mathematical theory, theories and theorems that are developed and Mathematical proof, proved for the needs of empirical sciences and mathematics itself. There are many ar ...
, a function f defined on some set X with real or complex values is called bounded if the set of its values (its
image An image or picture is a visual representation. An image can be Two-dimensional space, two-dimensional, such as a drawing, painting, or photograph, or Three-dimensional space, three-dimensional, such as a carving or sculpture. Images may be di ...
) is bounded. In other words, there exists a real number M such that :, f(x), \le M
for all In mathematical logic, a universal quantification is a type of quantifier, a logical constant which is interpreted as "given any", "for all", "for every", or "given an arbitrary element". It expresses that a predicate can be satisfied by e ...
x in X. A function that is ''not'' bounded is said to be unbounded. If f is real-valued and f(x) \leq A for all x in X, then the function is said to be bounded (from) above by A. If f(x) \geq B for all x in X, then the function is said to be bounded (from) below by B. A real-valued function is bounded if and only if it is bounded from above and below. An important special case is a bounded sequence, where ''X'' is taken to be the set \mathbb N of
natural number In mathematics, the natural numbers are the numbers 0, 1, 2, 3, and so on, possibly excluding 0. Some start counting with 0, defining the natural numbers as the non-negative integers , while others start with 1, defining them as the positive in ...
s. Thus a
sequence In mathematics, a sequence is an enumerated collection of objects in which repetitions are allowed and order matters. Like a set, it contains members (also called ''elements'', or ''terms''). The number of elements (possibly infinite) is cal ...
f = (a_0, a_1, a_2, \ldots) is bounded if there exists a real number M such that :, a_n, \le M for every natural number n. The set of all bounded sequences forms the
sequence space In functional analysis and related areas of mathematics, a sequence space is a vector space whose elements are infinite sequences of real or complex numbers. Equivalently, it is a function space whose elements are functions from the natural num ...
l^\infty. The definition of boundedness can be generalized to functions f: X \rightarrow Y taking values in a more general space Y by requiring that the image f(X) is a
bounded set In mathematical analysis and related areas of mathematics, a set is called bounded if all of its points are within a certain distance of each other. Conversely, a set which is not bounded is called unbounded. The word "bounded" makes no sense in ...
in Y.


Related notions

Weaker than boundedness is local boundedness. A family of bounded functions may be uniformly bounded. A bounded operator ''T: X \rightarrow Y'' is not a bounded function in the sense of this page's definition (unless T=0), but has the weaker property of preserving boundedness; bounded sets M \subseteq X are mapped to bounded sets ''T(M) \subseteq Y.'' This definition can be extended to any function f: X \rightarrow Y if ''X'' and ''Y'' allow for the concept of a bounded set. Boundedness can also be determined by looking at a graph.


Examples

* The sine function \sin: \mathbb R \rightarrow \mathbb R is bounded since , \sin (x), \le 1 for all x \in \mathbb. * The function f(x)=(x^2-1)^, defined for all real x except for −1 and 1, is unbounded. As ''x'' approaches −1 or 1, the values of this function get larger in magnitude. This function can be made bounded if one restricts its domain to be, for example, , \infty) or (-\infty, -2/math>. * The function f(x)= (x^2+1)^, defined for all real ''x'', ''is'' bounded, since , f(x), \le 1 for all ''x''. * The inverse trigonometric function arctangent defined as: y= \arctan (x) or x = \tan (y) is increasing for all real numbers ''x'' and bounded with -\frac < y < \frac radians * By the boundedness theorem, every
continuous function In mathematics, a continuous function is a function such that a small variation of the argument induces a small variation of the value of the function. This implies there are no abrupt changes in value, known as '' discontinuities''. More preci ...
on a closed interval, such as f: , 1\rightarrow \mathbb R, is bounded. More generally, any continuous function from a
compact space In mathematics, specifically general topology, compactness is a property that seeks to generalize the notion of a closed and bounded subset of Euclidean space. The idea is that a compact space has no "punctures" or "missing endpoints", i.e., i ...
into a metric space is bounded. *All complex-valued functions f: \mathbb C \rightarrow \mathbb C which are entire are either unbounded or constant as a consequence of Liouville's theorem. In particular, the complex \sin: \mathbb C \rightarrow \mathbb C must be unbounded since it is entire. * The function f which takes the value 0 for x
rational number In mathematics, a rational number is a number that can be expressed as the quotient or fraction of two integers, a numerator and a non-zero denominator . For example, is a rational number, as is every integer (for example, The set of all ...
and 1 for ''x''
irrational number In mathematics, the irrational numbers are all the real numbers that are not rational numbers. That is, irrational numbers cannot be expressed as the ratio of two integers. When the ratio of lengths of two line segments is an irrational number, ...
(cf. Dirichlet function) ''is'' bounded. Thus, a function does not need to be "nice" in order to be bounded. The set of all bounded functions defined on , 1/math> is much larger than the set of
continuous function In mathematics, a continuous function is a function such that a small variation of the argument induces a small variation of the value of the function. This implies there are no abrupt changes in value, known as '' discontinuities''. More preci ...
s on that interval. Moreover, continuous functions need not be bounded; for example, the functions g:\mathbb^2\to\mathbb and h: (0, 1)^2\to\mathbb defined by g(x, y) := x + y and h(x, y) := \frac are both continuous, but neither is bounded. (However, a continuous function must be bounded if its domain is both closed and bounded.)


See also

*
Bounded set In mathematical analysis and related areas of mathematics, a set is called bounded if all of its points are within a certain distance of each other. Conversely, a set which is not bounded is called unbounded. The word "bounded" makes no sense in ...
*
Compact support In mathematics, the support of a real-valued function f is the subset of the function domain of elements that are not mapped to zero. If the domain of f is a topological space, then the support of f is instead defined as the smallest closed ...
* Local boundedness * Uniform boundedness


References

{{DEFAULTSORT:Bounded Function Complex analysis Real analysis Types of functions