# Bounded set

 related topics {math, number, function} {rate, high, increase}

In mathematical analysis and related areas of mathematics, a set is called bounded, if it is, in a certain sense, of finite size. Conversely, a set which is not bounded is called unbounded. The word bounded makes no sense in a general topological space, without a metric.

## Contents

### Definition

A set S of real numbers is called bounded from above if there is a real number k such that ks 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.

### Metric space

A subset S of a metric space (M, d) is bounded if it is contained in a ball of finite radius, i.e. if there exists x in M and r > 0 such that for all s in S, we have d(x, s) < r. M 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 homogenous, 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.)

Full article ▸

 related documents Dimension (vector space) Pre-Abelian category String searching algorithm Fermat's little theorem Tuple Square-free integer Enriched category Transfinite induction Elementary function Banach algebra Linear classifier Commutator Floor and ceiling functions Möbius function Cyclone (programming language) Twin prime Möbius inversion formula HMAC Burali-Forti paradox PSPACE Connected space ElGamal encryption Fuzzy set Principal ideal Loss of significance Caesar cipher Binary space partitioning Multiplication table Discrete space Principal ideal domain