Recent from talks
Nothing was collected or created yet.
Bounded function
View on WikipediaThis article needs additional citations for verification. (September 2021) |

In mathematics, a function defined on some set with real or complex values is called bounded if the set of its values (its image) is bounded. In other words, there exists a real number such that
for all in .[1] A function that is not bounded is said to be unbounded.[citation needed]
If is real-valued and for all in , then the function is said to be bounded (from) above by . If for all in , then the function is said to be bounded (from) below by . A real-valued function is bounded if and only if it is bounded from above and below.[1][additional citation(s) needed]
An important special case is a bounded sequence, where is taken to be the set of natural numbers. Thus a sequence is bounded if there exists a real number such that
for every natural number . The set of all bounded sequences forms the sequence space .[citation needed]
The definition of boundedness can be generalized to functions taking values in a more general space by requiring that the image is a bounded set in .[citation needed]
Related notions
[edit]Weaker than boundedness is local boundedness. A family of bounded functions may be uniformly bounded.
A bounded operator is not a bounded function in the sense of this page's definition (unless ), but has the weaker property of preserving boundedness; bounded sets are mapped to bounded sets . This definition can be extended to any function if and allow for the concept of a bounded set. Boundedness can also be determined by looking at a graph.[citation needed]
Examples
[edit]- The sine function is bounded since for all .[1][2]
- The function , defined for all real except for −1 and 1, is unbounded. As 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, or .[citation needed]
- The function , defined for all real , is bounded, since for all .[citation needed]
- The inverse trigonometric function arctangent defined as: or is increasing for all real numbers and bounded with radians[3]
- By the boundedness theorem, every continuous function on a closed interval, such as , is bounded.[4] More generally, any continuous function from a compact space into a metric space is bounded.[citation needed]
- All complex-valued functions which are entire are either unbounded or constant as a consequence of Liouville's theorem.[5] In particular, the complex must be unbounded since it is entire.[citation needed]
- The function which takes the value 0 for rational number and 1 for 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 is much larger than the set of continuous functions on that interval.[citation needed] Moreover, continuous functions need not be bounded; for example, the functions and defined by and are both continuous, but neither is bounded.[6] (However, a continuous function must be bounded if its domain is both closed and bounded.[6])
See also
[edit]References
[edit]- ^ a b c Jeffrey, Alan (1996-06-13). Mathematics for Engineers and Scientists, 5th Edition. CRC Press. ISBN 978-0-412-62150-5.
- ^ "The Sine and Cosine Functions" (PDF). math.dartmouth.edu. Archived (PDF) from the original on 2 February 2013. Retrieved 1 September 2021.
- ^ Polyanin, Andrei D.; Chernoutsan, Alexei (2010-10-18). A Concise Handbook of Mathematics, Physics, and Engineering Sciences. CRC Press. ISBN 978-1-4398-0640-1.
- ^ Weisstein, Eric W. "Extreme Value Theorem". mathworld.wolfram.com. Retrieved 2021-09-01.
- ^ "Liouville theorems - Encyclopedia of Mathematics". encyclopediaofmath.org. Retrieved 2021-09-01.
- ^ a b Ghorpade, Sudhir R.; Limaye, Balmohan V. (2010-03-20). A Course in Multivariable Calculus and Analysis. Springer Science & Business Media. p. 56. ISBN 978-1-4419-1621-1.
Bounded function
View on GrokipediaDefinition
Real-valued functions
A function , where , is said to be bounded if there exists some such that for all . This condition ensures that the range of lies within a finite interval symmetric about the origin. Formally, this can be expressed as . A function satisfying this property is globally bounded on its domain .[7] Equivalently, is bounded if and only if it is both bounded above and bounded below. The function is bounded above on if there exists some real number such that for all , or equivalently, if . Similarly, is bounded below on if there exists some real number such that for all , or equivalently, if . This definition presupposes a basic understanding of the supremum and infimum as the least upper bound and greatest lower bound of subsets of the real numbers, respectively.[8] While local boundedness—where the function is bounded on every compact subset of the domain—is a related concept, it is distinct from global boundedness and pertains more to analytic properties.Functions on general domains
In the context of metric spaces, the notion of a bounded function extends the real-valued case to mappings between arbitrary metric spaces. Consider a function , where and are metric spaces. The function is bounded if there exists a finite constant such that for all .[9] This condition ensures that the image of has finite diameter in , generalizing the supremum bound on differences in the real-valued setting. Equivalently, is bounded if its range is a bounded subset of , meaning is contained within a ball of finite radius in the metric .[10] In normed vector spaces, where is equipped with a norm , boundedness can be expressed as , or more precisely, there exists such that for all . This formulation emphasizes that the values of remain confined within a bounded region of the norm topology, independent of the domain's structure beyond being a set. For functions mapping to with the Euclidean norm, boundedness aligns with componentwise conditions. Specifically, if where each is bounded, then is bounded in the Euclidean norm, since . The converse holds as well, as each component satisfies . While boundedness controls the extent of the function's values, it does not imply continuity or uniform continuity; for instance, the characteristic function of a nonempty proper subset of is bounded but discontinuous at boundary points. Nonetheless, boundedness serves as a foundational condition in theorems concerning the compactness of function spaces, such as the Arzelà–Ascoli theorem, which characterizes relatively compact subsets of continuous functions on compact metric spaces as those that are uniformly equicontinuous and pointwise bounded.[11]Properties
Algebraic properties
Bounded functions form a vector space over the real or complex numbers under pointwise addition and scalar multiplication. Specifically, if and are bounded functions on a domain , with and for all and some constants , then their sum is bounded, satisfying for all .[12][13] Similarly, the scalar multiple for a constant (or ) is bounded with .[12][13] The set of bounded functions is also closed under pointwise multiplication. For the product , the inequality holds for all , establishing boundedness with bound .[12] This follows directly from the properties of the absolute value, as is bounded whenever is, since .[12][13] Regarding compositions, if is bounded and is continuous and thus bounded on bounded sets (such as the closed interval containing the image of ), then is bounded on .[13] For restrictions to subsets, if a function is bounded on a subset , it remains bounded when restricted to any subset of , but boundedness on does not necessarily extend to the full domain unless the function is defined to remain controlled outside ; counterexamples exist where extensions beyond render the function unbounded on .[12]Analytic properties
In real analysis, a key connection between boundedness and continuity arises on compact domains. Specifically, if a function is continuous on a compact set , then is bounded on . This result, known as part of the Weierstrass theorem, follows from the fact that the image is also compact and hence bounded in ./04:_Function_Limits_and_Continuity/4.08:_Continuity_on_Compact_Sets._Uniform_Continuity) Uniform continuity strengthens this relation on compact sets. A function that is uniformly continuous on a compact set is necessarily continuous on and thus bounded there, as uniform continuity implies continuity. However, the converse does not hold: boundedness does not imply uniform continuity, as demonstrated by bounded but discontinuous functions like the step function on , which is bounded yet fails uniform continuity due to a jump discontinuity./04:_Function_Limits_and_Continuity/4.08:_Continuity_on_Compact_Sets._Uniform_Continuity) The extreme value theorem provides a precise characterization of boundedness for continuous functions on closed bounded intervals. For a continuous function , attains its maximum and minimum values on , implying that is bounded, with bounds given by where are the points achieving the extrema. This attainment ensures the function's range is contained within , a finite interval./04:_Continuity/4.04:_The_Extreme_Value_Theorem) Boundedness also plays a central role in integrability criteria. A bounded function is Riemann integrable if and only if it is continuous almost everywhere on , meaning the set of discontinuities has Lebesgue measure zero. This criterion highlights how boundedness, combined with limited discontinuities, ensures the upper and lower Riemann sums converge to the same value. Regarding limits, the existence of a finite limit implies local boundedness. If where is an accumulation point of the domain, then there exists a neighborhood of such that is bounded on . This follows from the definition of the limit: for , a ensures for , , so nearby, with the value at (if defined) also bounded.[14] Finally, oscillation quantifies variation and ties directly to boundedness. The oscillation of over an interval , defined as , is finite if and only if is bounded on . For unbounded functions, , reflecting infinite variation, whereas bounded functions exhibit controlled oscillation, bounded by twice the bound on . Local oscillation at a point , , is zero precisely when is continuous at .[15]Examples
Bounded functions
Constant functions provide the simplest examples of bounded functions. For any constant , the function for all in its domain satisfies , so it is bounded above by and below by .[16] Trigonometric functions such as sine and cosine are also bounded on the real line. The function satisfies for all real , as represents the y-coordinate on the unit circle, where the distance from the origin ensures the coordinate cannot exceed 1 in absolute value geometrically.[17] Similarly, satisfies , corresponding to the x-coordinate on the same unit circle.[18] Step functions illustrate boundedness in discontinuous cases. The Heaviside step function, defined as for and for , is bounded by 1 on , where it takes the constant value 1.[19] Certain rational functions are bounded even on unbounded domains. For instance, on satisfies , since implies , so with equality at .[20] Periodic continuous functions on are bounded if they are bounded on one period. Specifically, if is continuous and periodic with period , then restricting to the compact interval yields a continuous function that attains its maximum and minimum by the extreme value theorem; periodicity ensures these bounds hold globally.[21] Sums of bounded functions are also bounded, as seen with , which remains bounded despite the combination.Unbounded functions
Unbounded functions are those that are not bounded, meaning there is no finite interval such that for all in the domain, often because the function diverges to at certain points or as the input approaches the boundary of the domain.[22] This failure of boundedness typically arises from the function's growth behavior, which can vary in speed and direction. Polynomial functions provide classic examples of unboundedness on the real line. For instance, where is unbounded on because as , , with the degree determining the rate of this polynomial growth.[23] Similarly, exponential functions like on are unbounded above, as when , while is unbounded below, since as .[24] Logarithmic functions, such as on , are also unbounded, diverging to as and to as .[23] Rational functions can exhibit unboundedness due to vertical asymptotes within or at the boundary of their domains. For example, on is unbounded near , where as because of the vertical asymptote at .[22] These examples highlight distinct growth classifications: polynomial unboundedness grows relatively slowly compared to the rapid, suprapolynomial expansion of exponential functions, which eventually outpace any polynomial for large inputs.[25]Related notions
Bounded sequences and series
In the context of sequences, a real-valued sequence is bounded if there exists some such that for all .[26] This condition is equivalent to the range forming a bounded subset of .[26] Boundedness plays a key role in convergence properties; for instance, the Bolzano-Weierstrass theorem states that every bounded sequence in has a convergent subsequence.[27] Cauchy sequences provide another connection to boundedness. Every Cauchy sequence in is bounded. To verify this, fix ; there exists such that whenever . Setting , it follows that for all . The finitely many terms are bounded by some finite maximum, so the entire sequence is bounded.[28] For series, boundedness refers to the sequence of partial sums . A series is said to have bounded partial sums if there exists such that for all . Bounded partial sums imply that conditional convergence is possible without absolute convergence; for example, conditionally convergent series like the alternating harmonic series have convergent (hence bounded) partial sums, while diverges.[29] However, bounded partial sums do not guarantee convergence of the series. In contrast, unbounded partial sums indicate divergence, as seen in the harmonic series , whose partial sums satisfy for and thus grow without bound.[30]Bounded operators in functional analysis
In functional analysis, a linear operator between normed vector spaces and is bounded if there exists a constant such that for all .[31] This condition ensures that maps bounded sets in to bounded sets in , providing a measure of the operator's "size" or stability.[32] The operator norm is defined as the infimum of all such , or equivalently, which quantifies the maximum stretch induced by .[33] Boundedness is equivalent to continuity of at the origin (and hence everywhere, by linearity), as continuity at zero implies the existence of such an .[34] Examples of bounded operators include the identity operator , which satisfies and thus has norm .[35] Multiplication operators on spaces provide another class: for a measurable function with essential supremum , the operator on (where ) is bounded with .[36] These operators are fundamental in studying function spaces and spectral theory. A key result concerning families of bounded operators is the uniform boundedness principle, also known as the Banach-Steinhaus theorem: if is a Banach space and is a family of bounded linear operators to a normed space that is pointwise bounded (i.e., for each ), then the family is uniformly bounded, meaning .[37] This theorem prevents pathological behaviors in infinite-dimensional spaces and has applications in approximation theory and duality.[38]References
- https://proofwiki.org/wiki/Real_Sine_Function_is_Bounded
- https://proofwiki.org/wiki/Real_Cosine_Function_is_Bounded