Bounded set

Last updated
An artist's impression of a bounded set (top) and of an unbounded set (bottom). The set at the bottom continues forever towards the right. Bounded unbounded.svg
An artist's impression of a bounded set (top) and of an unbounded set (bottom). The set at the bottom continues forever towards the right.

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 a general topological space without a corresponding metric.

Contents

Boundary is a distinct concept: for example, a circle in isolation is a boundaryless bounded set, while the half plane is unbounded yet has a boundary.

A bounded set is not necessarily a closed set and vice versa. For example, a subset S of a 2-dimensional real space R2 constrained by two parabolic curves x2 + 1 and x2 - 1 defined in a Cartesian coordinate system is closed by the curves but not bounded (so unbounded).

Definition in the real numbers

A real set with upper bounds and its supremum. Illustration of supremum.svg
A real set with upper bounds and its supremum.

A set S of real numbers is called bounded from above if there exists some real number k (not necessarily in S) such that k s for all s in S. The number k is called an upper bound of S. The terms bounded from below and lower bound are similarly defined.

A set S is bounded if it has both upper and lower bounds. Therefore, a set of real numbers is bounded if it is contained in a finite interval.

Definition in a metric space

A subset S of a metric space (M, d) is bounded if there exists r > 0 such that for all s and t in S, we have d(s, t) < r. The metric space (M, d) is a bounded metric space (or d is a bounded metric) if M is bounded as a subset of itself.

Boundedness in topological vector spaces

In topological vector spaces, a different definition for bounded sets exists which is sometimes called von Neumann boundedness. If the topology of the topological vector space is induced by a metric which is homogeneous, as in the case of a metric induced by the norm of normed vector spaces, then the two definitions coincide.

Boundedness in order theory

A set of real numbers is bounded if and only if it has an upper and lower bound. This definition is extendable to subsets of any partially ordered set. Note that this more general concept of boundedness does not correspond to a notion of "size".

A subset S of a partially ordered set P is called bounded above if there is an element k in P such that ks for all s in S. The element k is called an upper bound of S. The concepts of bounded below and lower bound are defined similarly. (See also upper and lower bounds.)

A subset S of a partially ordered set P is called bounded if it has both an upper and a lower bound, or equivalently, if it is contained in an interval. Note that this is not just a property of the set S but also one of the set S as subset of P.

A bounded posetP (that is, by itself, not as subset) is one that has a least element and a greatest element. Note that this concept of boundedness has nothing to do with finite size, and that a subset S of a bounded poset P with as order the restriction of the order on P is not necessarily a bounded poset.

A subset S of Rn is bounded with respect to the Euclidean distance if and only if it bounded as subset of Rn with the product order. However, S may be bounded as subset of Rn with the lexicographical order, but not with respect to the Euclidean distance.

A class of ordinal numbers is said to be unbounded, or cofinal, when given any ordinal, there is always some element of the class greater than it. Thus in this case "unbounded" does not mean unbounded by itself but unbounded as a subclass of the class of all ordinal numbers.

See also

Related Research Articles

<span class="mw-page-title-main">Compact space</span> Type of mathematical 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., it includes all limiting values of points. For example, the open interval (0,1) would not be compact because it excludes the limiting values of 0 and 1, whereas the closed interval [0,1] would be compact. Similarly, the space of rational numbers is not compact, because it has infinitely many "punctures" corresponding to the irrational numbers, and the space of real numbers is not compact either, because it excludes the two limiting values and . However, the extended real number linewould be compact, since it contains both infinities. There are many ways to make this heuristic notion precise. These ways usually agree in a metric space, but may not be equivalent in other topological spaces.

In mathematical analysis, a metric space M is called complete if every Cauchy sequence of points in M has a limit that is also in M.

In mathematics, a directed set is a nonempty set together with a reflexive and transitive binary relation , with the additional property that every pair of elements has an upper bound. In other words, for any and in there must exist in with and A directed set's preorder is called a direction.

<span class="mw-page-title-main">Filter (mathematics)</span> In mathematics, a special subset of a partially ordered set

In mathematics, a filter or order filter is a special subset of a partially ordered set (poset), describing "large" or "eventual" elements. Filters appear in order and lattice theory, but also topology, whence they originate. The notion dual to a filter is an order ideal.

<span class="mw-page-title-main">Partially ordered set</span> Mathematical set with an ordering

In mathematics, especially order theory, a partial order on a set is an arrangement such that, for certain pairs of elements, one precedes the other. The word partial is used to indicate that not every pair of elements needs to be comparable; that is, there may be pairs for which neither element precedes the other. Partial orders thus generalize total orders, in which every pair is comparable.

In mathematics, a topological space is called separable if it contains a countable, dense subset; that is, there exists a sequence of elements of the space such that every nonempty open subset of the space contains at least one element of the sequence.

In mathematics, a total order or linear order is a partial order in which any two elements are comparable. That is, a total order is a binary relation on some set , which satisfies the following for all and in :

  1. (reflexive).
  2. If and then (transitive).
  3. If and then (antisymmetric).
  4. or .

In mathematics, a well-order on a set S is a total ordering on S with the property that every non-empty subset of S has a least element in this ordering. The set S together with the ordering is then called a well-ordered set. In some academic articles and textbooks these terms are instead written as wellorder, wellordered, and wellordering or well order, well ordered, and well ordering.

In mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum (join) and an infimum (meet). A lattice which satisfies at least one of these properties is known as a conditionally complete lattice. For comparison, in a general lattice, only pairs of elements need to have a supremum and an infimum. Every non-empty finite lattice is complete, but infinite lattices may be incomplete.

<span class="mw-page-title-main">Lipschitz continuity</span> Strong form of uniform continuity

In mathematical analysis, Lipschitz continuity, named after German mathematician Rudolf Lipschitz, is a strong form of uniform continuity for functions. Intuitively, a Lipschitz continuous function is limited in how fast it can change: there exists a real number such that, for every pair of points on the graph of this function, the absolute value of the slope of the line connecting them is not greater than this real number; the smallest such bound is called the Lipschitz constant of the function. For instance, every function that is defined on an interval and has bounded first derivative is Lipschitz continuous.

In real analysis the Heine–Borel theorem, named after Eduard Heine and Émile Borel, states:

<span class="mw-page-title-main">Ball (mathematics)</span> Volume space bounded by a sphere

In mathematics, a ball is the solid figure bounded by a sphere; it is also called a solid sphere. It may be a closed ball or an open ball.

<span class="mw-page-title-main">General topology</span> Branch of topology

In mathematics, general topology is the branch of topology that deals with the basic set-theoretic definitions and constructions used in topology. It is the foundation of most other branches of topology, including differential topology, geometric topology, and algebraic topology.

Order theory is a branch of mathematics that investigates the intuitive notion of order using binary relations. It provides a formal framework for describing statements such as "this is less than that" or "this precedes that". This article introduces the field and provides basic definitions. A list of order-theoretic terms can be found in the order theory glossary.

In mathematical analysis, a family of functions is equicontinuous if all the functions are continuous and they have equal variation over a given neighbourhood, in a precise sense described herein. In particular, the concept applies to countable families, and thus sequences of functions.

<span class="mw-page-title-main">Real coordinate space</span> Space formed by the n-tuples of real numbers

In mathematics, the real coordinate space or real coordinate n-space, of dimension n, denoted Rn or , is the set of the n-tuples of real numbers, that is the set of all sequences of n real numbers. Special cases are called the real lineR1, the real coordinate planeR2, and the real coordinate three-dimensional spaceR3. With component-wise addition and scalar multiplication, it is a real vector space, and its elements are called coordinate vectors.

Boundedness or bounded may refer to:

In topology and related branches of mathematics, total-boundedness is a generalization of compactness for circumstances in which a set is not necessarily closed. A totally bounded set can be covered by finitely many subsets of every fixed “size”.

This is a glossary of set theory.

This is a glossary for the terminology in a mathematical field of functional analysis.

References