Pages Totally Bounded Attributions

Attributions & Verification

Track contributions and verify content correctness

Content

In many parts of analysis, the word "bounded" is too coarse to capture compactness. A subset of $\mathbb{R}$ with finite diameter can still have infinitely many separated points, while a bounded interval can be approximated at any fixed resolution by finitely many sample points. Totally boundedness isolates this second, stronger finitary feature: at every scale $\varepsilon > 0$, the whole space can be seen from finitely many centers.

text admin

The concept belongs naturally to [metric spaces](/page/Metric%20Space), because it uses distances rather than only [open sets](/page/Open%20Set). It is one of the main bridges between boundedness and compactness: in a complete metric space, compactness is exactly completeness plus [total boundedness](/page/Total%20Boundedness). In functional analysis it is also the language behind precompact sets, compact embeddings, and compact operators.

text admin

## Definition

h2 admin

The motivating question is not merely whether all points fit inside one large ball, but whether the space admits a finite description at every prescribed accuracy. If a numerical or geometric problem only sees distances smaller than $\varepsilon$ as negligible, a totally bounded space can be represented by finitely many prototypes at that accuracy. Throughout this page, for $y \in M$ and $\varepsilon > 0$, the notation $B(y,\varepsilon)$ means the open metric ball

text admin

\begin{align*} B(y,\varepsilon)=\{x \in M : d(x,y)<\varepsilon\}. \end{align*}

align* admin

[definition: Totally Bounded Metric Space] A metric space $(M,d)$ is totally bounded if for every $\varepsilon > 0$ there exists a finite set $F \subset M$ such that \begin{align*} M = \bigcup_{y \in F} B(y,\varepsilon). \end{align*} [/definition]

definition admin

The finite set in the definition is the data that makes the condition operational. Naming it separately is useful because many arguments construct these finite approximating sets before invoking total boundedness itself.

text admin

[definition: Finite Epsilon Net] Let $(M,d)$ be a metric space, let $A \subset M$, and let $\varepsilon > 0$. A finite subset $F \subset M$ is a finite $\varepsilon$-net for $A$ in $M$ if \begin{align*} A \subset \bigcup_{y \in F} B(y,\varepsilon). \end{align*} If $F \subset A$, then $F$ is called an internal finite $\varepsilon$-net for $A$. [/definition]

definition admin

Many compactness questions concern one family of points or functions inside a larger ambient space. The obstruction is that the set may not carry a useful metric on its own, or its approximating centers may naturally live in the ambient space rather than inside the set. The subset version records finite approximability at every scale relative to that surrounding metric.

text admin

[definition: Totally Bounded Subset] Let $(M,d)$ be a metric space. A subset $A \subset M$ is totally bounded in $M$ if for every $\varepsilon > 0$ there exists a finite set $F \subset M$ such that \begin{align*} A \subset \bigcup_{y \in F} B(y,\varepsilon). \end{align*} [/definition]

definition admin

Qualitative total boundedness says whether finite approximation is possible at each scale, but it does not say how expensive the approximation is. In estimates one often needs to compare two sets that are both totally bounded but require very different numbers of balls at the same resolution. The covering number records this finite cost at scale $\varepsilon$.

text admin

[definition: Covering Number] Let $(M,d)$ be a metric space and let $A \subset M$. For $\varepsilon > 0$, the covering number $N(A,d,\varepsilon)$ is the least cardinality of a finite set $F \subset M$ such that \begin{align*} A \subset \bigcup_{y \in F} B(y,\varepsilon), \end{align*} when such finite sets exist. [/definition]

definition admin

With this language, a subset $A$ is totally bounded exactly when $N(A,d,\varepsilon)$ is finite for every $\varepsilon > 0$. Covering numbers are central in entropy estimates, compactness arguments, and [approximation theory](/page/Approximation%20Theory).

text admin

## Equivalent Characterisations

h2 admin

A covering definition is often the most efficient way to prove total boundedness, but sequences give the most memorable test. If a metric space cannot be covered by finitely many small balls, then it contains an infinite sequence whose terms stay separated at that scale. Total boundedness rules out that kind of persistent separation.

text admin

[quotetheorem:1087]

text admin

The sequential test is useful because it turns a covering property into a compactness-style obstruction: failure of total boundedness produces a sequence with no Cauchy subsequence, while total boundedness forces every sequence to have Cauchy subsequences after repeatedly passing to finer finite covers. This does not by itself give convergence, since the ambient space may be incomplete; it only gives the finite-approximation part of compactness.

text admin

Partition and grid arguments often produce finitely many pieces of small diameter before they produce centers of balls. The obstruction is that a cover by arbitrary small pieces does not initially provide a chosen center for each piece, so it is not visibly the same as a cover by metric balls. The following definition isolates this center-free covering condition so those arguments can be compared with total boundedness without extra bookkeeping.

text admin

[definition: Finite Small-Diameter Cover] Let $(M,d)$ be a metric space, let $A \subset M$, and let $\varepsilon > 0$. A finite family of subsets $U_1,\ldots,U_N \subset M$ is a finite cover of $A$ by sets of diameter less than $\varepsilon$ if \begin{align*} A \subset \bigcup_{i=1}^{N} U_i \end{align*} and \begin{align*} \operatorname{diam}(U_i) < \varepsilon \end{align*} for every $i \in \{1,\ldots,N\}$. [/definition]

definition admin

A definition using small-diameter pieces should agree with the ball definition, or else total boundedness would depend on an arbitrary choice of language. The issue is the mismatch between a ball, which has a chosen center and radius, and a set of small diameter, which may have no distinguished center.

text admin

Showing 20 of 79 blocks

Verification Progress

79 Total Blocks

0 Verified

0% verified

Contributors

admin 79 blocks (0 verified)

Who Can Verify

Areas: Analysis

Viktor Miykov Admin

Max Vassiliev Global Reviewer

Horia Neagu Global Reviewer

강현욱 Global Reviewer

Demo Testing Global Reviewer

Archie Pennycook Global Reviewer

Quick Actions

Edit Page

Raw Attribution Data

Loading attribution data...

What brings you to Androma?

Start with a route through the knowledge graph.

Attributions & Verification

Content

Verification Progress

Contributors

Who Can Verify

Quick Actions

Sign in to Androma

Check your inbox

One last step

Attributions & Verification

Content

Verification Progress

Contributors

Who Can Verify

Quick Actions

Raw Attribution Data