q2K BHP
Black History Portal
THE BHP WIRE —
HIDDEN TRUTHS
What's New!
THE JOURNEY THROUGH TIME

Explore Black History

Explore the people, places, events, achievements, struggles and stories that shaped our journey.

✊🏾

Civil Rights

Movements, leaders, victories and the continuing fight for equality.

⚙️

Black Inventors

Innovation, patents, science, technology and world-changing contributions.

🏆

Sports

Pioneers, champions, Negro Leagues, records, activism and excellence.

♟️

People

Meet the people whose lives, choices and achievements shaped the journey.

📍

Places

Black towns, communities, institutions and places where history happened.

📜

Events

Moments that changed communities, movements, institutions and the nation.

Enter a person, place, event, or topic.
MY'STORY

The MOVE Fire

This is a personal recollection on the Move fire on May 13, 1985 Philadelphia police fired thousands of rounds at the MOVE house, city officials approved dropping an explosive device on the roof, the resulting fire was allowed to burn, 11 people—including five children—died, and 61 homes were destroyed. Philadelphia City Council later called it a “brutal attack carried out by the City of Philadelphia on its own citizens” and acknowledged that no individual faced criminal consequences for the bombing. One timeline correction worth preserving for the BHP record: the major previous MOVE-police confrontation was August 8, 1978, about seven years before the bombing, not a year or two earlier. Officer James Ramp was killed, other police and firefighters were wounded, nine MOVE members were later convicted, and television cameras recorded police beating Delbert Africa during his arrest. The 1985 MOVE Commission later specifically criticized city planners for failing to adequately use lessons from that 1978 confrontation. And that actually strengthens the point you’re making: 1985 did not happen without precedent or institutional memory. There had already been a deadly confrontation with MOVE, years of conflict, negotiations and police involvement before Osage Avenue.

MORE →
BLACK FACTS
The Truths They Never Taught You...

Shirley Chisholm — Unbought and Unbossed

In 1968 Shirley Chisholm became the first Black woman elected to the United States Congress. In 1972 she launched a campaign for the Democratic presidential nomination, breaking another political barrier.

MORE →
BHP gathered finds from its connected research sources. Showing the 4 strongest Black History matches.
← BACK TO RESULTS
Wikipedia

Bounded function

A schematic illustration of a bounded function (red) and an unbounded one (blue). Intuitively, the graph of a bounded function stays within a horizontal band, while the graph of an unbounded function does not.

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]

[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]
  1. 1 2 3 Jeffrey, Alan (1996-06-13). Mathematics for Engineers and Scientists, 5th Edition. CRC Press. ISBN 978-0-412-62150-5.
  2. ↑ "The Sine and Cosine Functions" (PDF). math.dartmouth.edu. Archived (PDF) from the original on 2 February 2013. Retrieved 1 September 2021.
  3. ↑ 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.
  4. ↑ Weisstein, Eric W. "Extreme Value Theorem". mathworld.wolfram.com. Retrieved 2021-09-01.
  5. ↑ "Liouville theorems - Encyclopedia of Mathematics". encyclopediaofmath.org. Retrieved 2021-09-01.
  6. 1 2 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.

Source: Wikipedia. Article content is retrieved live through the MediaWiki API.

Wikipedia

Bounded function

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} . A function that is not bounded is said to be unbounded. 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. 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 }} . 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} .

MORE →
No preview image
Wikipedia

Bounded mean oscillation

In harmonic analysis in mathematics, a function of bounded mean oscillation, also known as a BMO function, is a real-valued function whose mean oscillation is bounded (finite). The space of functions of bounded mean oscillation (BMO) is a function space that, in some precise sense, plays the same role in the theory of Hardy spaces Hp that the space L∞ of essentially bounded functions plays in the theory of Lp-spaces. It is also called John–Nirenberg space, after Fritz John and Louis Nirenberg who introduced and studied it for the first time.

MORE →
No preview image
Wikipedia

Nachbin's theorem

In mathematics, in the area of complex analysis, Nachbin's theorem (named after Leopoldo Nachbin) is a result used to establish bounds on the growth rates for analytic functions. In particular, Nachbin's theorem may be used to give the domain of convergence of the generalized Borel transform, also called Nachbin summation. This article provides a brief review of growth rates, including the idea of a function of exponential type. Classification of growth rates based on type help provide a finer tool than big O or Landau notation, since a number of theorems about the analytic structure of the bounded function and its integral transforms can be stated.

MORE →
No preview image
Wikipedia

Content (measure theory)

In mathematics, in particular in measure theory, a content μ {\displaystyle \mu } is a real-valued function defined on a collection of subsets A {\displaystyle {\mathcal {A}}} such that μ ( A ) ∈ [ 0 , ∞ ] whenever A ∈ A . {\displaystyle \mu (A)\in \ [0,\infty ]{\text{ whenever }}A\in {\mathcal {A}}.} μ ( ∅ ) = 0. {\displaystyle \mu (\varnothing )=0.} μ ( ⋃ i = 1 n A i ) = ∑ i = 1 n μ ( A i ) whenever A 1 , … , A n , ⋃ i = 1 n A i ∈ A and A i ∩ A j = ∅ for i ≠ j . {\displaystyle \mu {\Bigl (}\bigcup _{i=1}^{n}A_{i}{\Bigr )}=\sum _{i=1}^{n}\mu (A_{i}){\text{ whenever }}A_{1},\dots ,A_{n},\bigcup _{i=1}^{n}A_{i}\in {\mathcal {A}}{\text{ and }}A_{i}\cap A_{j}=\varnothing {\text{ for }}i\neq j.} That is, a content is a generalization of a measure: while the latter must be countably additive, the former must only be finitely additive. In many important applications the A {\displaystyle {\mathcal {A}}} is chosen to be a ring of sets or to be at least a semiring of sets in which case some additional properties can be deduced which are described below. For this reason some authors prefer to define contents only for the case of semirings or even rings. If a content is additionally σ-additive it is called a pre-measure and if furthermore A {\displaystyle {\mathcal {A}}} is a σ-algebra, the content is called a measure. Therefore, every (real-valued) measure is a content, but not vice versa. Contents give a good notion of integrating bounded functions on a space but can behave badly when integrating unbounded functions, while measures give a good notion of integrating unbounded functions.

MORE →
TOPIC OF THE DAY

Greenwood / Black Wall Street

Before the 1921 destruction of Tulsa’s Greenwood District, Black residents had created a remarkable center of business and community life. The district included stores, professional offices, entertainment venues and homes owned by Black citizens. Understanding Greenwood means learning what was built—not only what was burned.

MORE →
TRIVIA QUESTION OF THE DAY

What prosperous Tulsa district became widely known as “Black Wall Street”?

The Greenwood District.