Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://en.wikipedia.org/wiki/Bounded_function below:

Bounded function - Wikipedia

From Wikipedia, the free encyclopedia

A mathematical function the set of whose values is bounded

In mathematics, a function f {\displaystyle f} defined on some set X {\displaystyle X} 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 M {\displaystyle M} such that

| f ( x ) | ≤ M {\displaystyle |f(x)|\leq M}

for all x {\displaystyle x} in X {\displaystyle X} .^[1] A function that is not bounded is said to be unbounded.^{[citation needed]}

If f {\displaystyle f} is real-valued and f ( x ) ≤ A {\displaystyle f(x)\leq A} for all x {\displaystyle x} in X {\displaystyle X} , then the function is said to be bounded (from) above by A {\displaystyle A} . If f ( x ) ≥ B {\displaystyle f(x)\geq B} for all x {\displaystyle x} in X {\displaystyle X} , then the function is said to be bounded (from) below by B {\displaystyle B} . 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 X {\displaystyle X} is taken to be the set N {\displaystyle \mathbb {N} } of natural numbers. Thus a sequence f = ( a 0 , a 1 , a 2 , … ) {\displaystyle f=(a_{0},a_{1},a_{2},\ldots )} is bounded if there exists a real number M {\displaystyle M} such that

| a n | ≤ M {\displaystyle |a_{n}|\leq M}

for every natural number n {\displaystyle n} . The set of all bounded sequences forms the sequence space l ∞ {\displaystyle l^{\infty }} .^{[citation needed]}

The definition of boundedness can be generalized to functions f : X → Y {\displaystyle f:X\rightarrow Y} taking values in a more general space Y {\displaystyle Y} by requiring that the image f ( X ) {\displaystyle f(X)} is a bounded set in Y {\displaystyle Y} .^{[citation needed]}

Weaker than boundedness is local boundedness. A family of bounded functions may be uniformly bounded.

A bounded operator T : X → Y {\displaystyle T:X\rightarrow Y} is not a bounded function in the sense of this page's definition (unless T = 0 {\displaystyle T=0} ), but has the weaker property of preserving boundedness; bounded sets M ⊆ X {\displaystyle M\subseteq X} are mapped to bounded sets T ( M ) ⊆ Y {\displaystyle T(M)\subseteq Y} . This definition can be extended to any function f : X → Y {\displaystyle f:X\rightarrow Y} if X {\displaystyle X} and Y {\displaystyle Y} allow for the concept of a bounded set. Boundedness can also be determined by looking at a graph.^{[citation needed]}

• The sine function sin : R → R {\displaystyle \sin :\mathbb {R} \rightarrow \mathbb {R} } is bounded since | sin ⁡ ( x ) | ≤ 1 {\displaystyle |\sin(x)|\leq 1} for all x ∈ R {\displaystyle x\in \mathbb {R} } .^[1][2]
• The function f ( x ) = ( x 2 − 1 ) − 1 {\displaystyle f(x)=(x^{2}-1)^{-1}} , defined for all real x {\displaystyle x} except for −1 and 1, is unbounded. As x {\displaystyle 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, [ 2 , ∞ ) {\displaystyle [2,\infty )} or ( − ∞ , − 2 ] {\displaystyle (-\infty ,-2]} .^{[citation needed]}
• The function f ( x ) = ( x 2 + 1 ) − 1 {\textstyle f(x)=(x^{2}+1)^{-1}} , defined for all real x {\displaystyle x} , is bounded, since | f ( x ) | ≤ 1 {\textstyle |f(x)|\leq 1} for all x {\displaystyle x} .^{[citation needed]}
• The inverse trigonometric function arctangent defined as: y = arctan ⁡ ( x ) {\displaystyle y=\arctan(x)} or x = tan ⁡ ( y ) {\displaystyle x=\tan(y)} is increasing for all real numbers x {\displaystyle x} and bounded with − π 2 < y < π 2 {\displaystyle -{\frac {\pi }{2}}<y<{\frac {\pi }{2}}} radians^[3]
• By the boundedness theorem, every continuous function on a closed interval, such as f : [ 0 , 1 ] → R {\displaystyle f:[0,1]\rightarrow \mathbb {R} } , is bounded.^[4] More generally, any continuous function from a compact space into a metric space is bounded.^{[citation needed]}
• All complex-valued functions f : C → C {\displaystyle f:\mathbb {C} \rightarrow \mathbb {C} } which are entire are either unbounded or constant as a consequence of Liouville's theorem.^[5] In particular, the complex sin : C → C {\displaystyle \sin :\mathbb {C} \rightarrow \mathbb {C} } must be unbounded since it is entire.^{[citation needed]}
• The function f {\displaystyle f} which takes the value 0 for x {\displaystyle x} rational number and 1 for x {\displaystyle x} 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 [ 0 , 1 ] {\displaystyle [0,1]} 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 g : R 2 → R {\displaystyle g:\mathbb {R} ^{2}\to \mathbb {R} } and h : ( 0 , 1 ) 2 → R {\displaystyle h:(0,1)^{2}\to \mathbb {R} } defined by g ( x , y ) := x + y {\displaystyle g(x,y):=x+y} and h ( x , y ) := 1 x + y {\displaystyle h(x,y):={\frac {1}{x+y}}} are both continuous, but neither is bounded.^[6] (However, a continuous function must be bounded if its domain is both closed and bounded.^[6])

• Bounded set
• Compact support
• Local boundedness
• Uniform boundedness

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4