Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Let \(X\) be a normed space, \(M \subset X\) and \(\varepsilon>0 .\) We say that \(A \subset M\) is an \(\varepsilon=n e t\) in \(M\) if for every \(x \in M\) there is \(y \in A\) such that \(\|x-y\|<\varepsilon\). We say that \(A \subset M\) is \(\varepsilon\) -separated in \(M\) if \(\|x-y\| \geq \varepsilon\) for all \(x \neq y \in A\). Clearly, a maximal \(\varepsilon\) -separated subset of \(M\) in the sense of inclusion is an \(\varepsilon\) -net in \(M\). Let \(X\) be an \(n\) -dimensional real normed space. Show that if \(\left\\{x_{j}\right\\}_{j=1}^{N}\) is an \(\varepsilon\) -net in \(B_{X}\), then \(N \geq \varepsilon^{-n} .\) On the other hand, there is an \(\varepsilon\) -net \(\left\\{x_{j}\right\\}_{j=1}^{N}\) for \(B_{X}\) with \(N \leq\left(\frac{2}{c}+1\right)^{n}\). Hint: Fix a linear isomorphism \(T\) of \(X\) onto \(\mathbf{R}^{n}\). For a compact subset \(C\) of \(X\), we define the volume of \(C\) by \(\operatorname{vol}(C)=\lambda(T(C))\), where \(\lambda\) is the Lebesgue measure on \(\mathbf{R}^{n}\). Let \(B(x, r)\) be the closed ball centered at \(x\) with radius \(r\). We have \(B_{X} \subset \bigcup_{j=1}^{N} B\left(x_{j}, \varepsilon\right)\), so $$ \begin{aligned} \operatorname{vol}\left(B_{X}\right) & \leq \operatorname{vol}\left(\bigcup_{j=1}^{N} B\left(x_{j}, \varepsilon\right)\right) \leq \sum_{j=1}^{N} \operatorname{vol}\left(B\left(x_{j}, \varepsilon\right)\right) \\ &=N \cdot \operatorname{vol}\left(\varepsilon B_{X}\right)=N \cdot \varepsilon^{n} \cdot \operatorname{vol}\left(B_{X}\right) \end{aligned} $$ Thus \(N \geq \varepsilon^{-n}\). On the other hand, if \(\left\\{x_{j}\right\\}_{j=1}^{N}\) is a maximal \(\varepsilon\) -separated set in \(B_{X}\), then \(\left\\{x_{j}\right\\}_{j=1}^{N}\) is an \(\varepsilon\) -net in \(B_{X}\). Since \(B\left(x_{j}, \varepsilon / 2\right) \cap B\left(x_{i}, \varepsilon / 2\right)=\emptyset\) if \(i \neq j\) and \(B\left(x_{j}, \varepsilon / 2\right) \subset(1+\varepsilon / 2) B_{X}\), we have $$ \begin{aligned} N \cdot(\varepsilon / 2)^{n} \cdot \operatorname{vol}\left(B_{X}\right) &=\operatorname{vol}\left(\bigcup_{j=1}^{N} B\left(x_{j}, \varepsilon / 2\right)\right) \\ & \leq \operatorname{vol}\left((1+\varepsilon / 2) B_{X}\right)=(1+\varepsilon / 2)^{n} \operatorname{vol}\left(B_{X}\right) . \end{aligned} $$ Thus \(N \leq\left(\frac{1+\varepsilon / 2}{\varepsilon / 2}\right)^{n}\).

Short Answer

Expert verified
N ≥ ε^{-n} and N ≤ (2/ε + 1)^n.

Step by step solution

01

Define the Volume

Consider the volume of a compact subset in the normed space as defined using a linear isomorphism and the Lebesgue measure.
02

Volume Inequality Setup

Establish the inequality for the volume of the union of closed balls centered at each element of the ε-net.
03

Apply Volume Calculation

Apply the specific volume calculation to the union, which relates to the volume of the scaled ball based on ε.
04

Incorporate Summation

Express the inequality as a summation over the ε-balls and simplify to find the relationship between the volumes and N.
05

Derive Lower Bound

Solve the inequality to show that N is greater than or equal to ε^{-n}.
06

Maximal ε-Separated Set

Use the properties of a maximal ε-separated set to establish another volume-based argument.
07

Second Volume Argument

Consider the volume of the union of smaller balls intersected with scaled balls to create another inequality.
08

Simplify Second Argument

Simplify the second volume inequality to derive an upper bound on N.
09

Combine Results

Combine both volume arguments to conclude the upper and lower bounds for N in terms of ε and n.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

Key Concepts

These are the key concepts you need to understand to accurately answer the question.

normed spaces
A normed space is a vector space equipped with a function called a norm. This norm calculates the 'length' or 'size' of vectors. The concept is crucial in understanding different geometric and functional properties of the space. For any vector \(v\) in the normed space \(X\), the norm is written as \(\|v\|\), which represents the non-negative length of \(v\). Normed spaces generalize many aspects of Euclidean spaces, allowing us to work with infinite-dimensional vectors and more complex structures.
epsilon nets
An \(\varepsilon\)-net is a subset \(A\) of a metric space \(M\) such that every point in \(M\) is within a distance of \(\varepsilon\) from some point in \(A\). This concept is useful for approximating and covering complex sets with simpler ones. Specifically, in normed spaces, if you have a set of points that form an \(\varepsilon\)-net, you can ensure that these points are close enough to cover the entire space with small balls of radius \(\varepsilon\).
Lebesgue measure
The Lebesgue measure provides a way of assigning a 'volume' to subsets of \(\mathbb{R}^n\). For an \(n\)-dimensional normed space, we can use a linear isomorphism to map our space to \(\mathbb{R}^n\), allowing us to transfer the concept of volume. The measure is consistent with our intuitive understanding of length, area, and volume in higher dimensions. Calculations involving Lebesgue measure are vital for understanding the distribution and density of points in a normed space.
volume calculation
Volume calculations in normed spaces often make use of balls centered around points and their relationships through scaling. For instance, the volume of a ball with a scaled radius, like \(\varepsilon B_X\), can be derived from the original volume times \(\varepsilon^n\) where \(n\) is the dimension of the space. Such calculations help in deriving inequalities and covering properties, as shown in exercises involving \(\varepsilon\)-nets.
separated sets
A set \(A\) is \(\varepsilon\)-separated if the distance between any two distinct points in \(A\) is at least \(\varepsilon\). This property ensures that points are 'well-spaced'. In normed spaces, a maximal \(\varepsilon\)-separated set gives rise to an \(\varepsilon\)-net. Using \(\varepsilon\)-separated sets is crucial for constructing covering arguments and understanding how different subsets of a space interrelate, ultimately helping in approximations and bounding arguments.

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

We say that \(\sum x_{i}\) is unconditionally Cauchy if, given \(\varepsilon>0\), there is a finite set \(F\) in \(\mathbf{N}\) such that \(\left\|\sum_{F^{\prime}} x_{i}\right\|<\varepsilon\) whenever \(F^{\prime}\) is a finite set in \(\mathbf{N}\) satisfying \(F^{\prime} \cap F=\emptyset\) Show that a series \(\sum x_{i}\) in a Banach space \(X\) is unconditionally Cauchy if and only if it is unconditionally convergent. Hint: If \(\sum x_{i}\) is unconditionally Cauchy, then it is Cauchy and thus it converges to some \(x \in X\). Given \(\varepsilon>0\), find a finite \(F_{1}\) such that \(\left\|\sum_{\vec{F}^{\prime}} x_{i}\right\|<\varepsilon\) for every finite \(F^{\prime}\) satisfying \(F^{\prime} \cap F_{1}=\emptyset\). Then find \(n_{0}>\max \left(F_{1}\right)\) such that \(\left\|\sum_{i=1}^{n_{0}} x_{i}-x\right\|<\varepsilon\) and set \(F=\left\\{1, \ldots, n_{0}\right\\}\). If \(F^{\prime} \supset F\), then \(\left\\{i \in F^{\prime} ; i\right\rangle\) \(\left.n_{0}\right\\} \cap F_{1}=\emptyset\), so \(\left\|\sum_{F^{\prime}} x_{i}-x\right\| \leq\left\|_{i \in F^{\prime}, i>n_{0}} x_{i}-x\right\|+\left\|\sum_{i=1}^{n_{0}} x_{i}\right\|<2 \varepsilon\)

Let \(K, C\) be subsets of a normed space \(X\). (i) Show that if \(K, C\) are closed, \(K+C\) need not be closed. (ii) Show that if \(K\) is compact and \(C\) is closed, then \(K+C\) is closed. Is \(\operatorname{con}(K \cup C)\) closed? (iii) Show that if \(K\) is compact and \(C\) is bounded and closed, then the set \(\operatorname{conv}(K \cup C)\) is closed. Hint: (i): Consider \(K=\\{(x, 0) ; x \in \mathbf{R}\\}\) and \(C=\left\\{\left(x, \frac{1}{x}\right) ; x>0\right\\}\). (ii): If \(x_{n}=k_{n}+c_{n} \rightarrow y\) for \(k_{n} \in K, c_{n} \in C\), then by compactness assume \(k_{n} \rightarrow k\); then also \(c_{n}=x_{n}-k_{n} \rightarrow(y-k)\) and use that \(C\) is closed. For a negative answer to \(\operatorname{conv}(K \cup C)\), see the previous exercise. (iii): If \(x_{n}=\lambda_{n} k_{n}+\left(1-\lambda_{n}\right) c_{n} \rightarrow x\) for \(k_{n} \in K, c_{n} \in C, \lambda \in[0,1]\) find a subsequence \(n_{i}\) such that \(k_{n,} \rightarrow k\) and \(\lambda_{n_{i}} \rightarrow \lambda\). If \(\lambda=1\), then by boundedness \(\left(1-\lambda_{n_{i}}\right) c_{n_{1}} \rightarrow 0\), and \(x=k \in K .\) If \(\lambda \neq 1, c_{n_{i}} \rightarrow \frac{x-\lambda k}{1-\lambda} \in C\) by closedness of \(C\).

Let \(X\) be a normed linear space. Assume that for \(x, y \in X\) we have \(\|x+y\|=\|x\|+\|y\| .\) Show that then \(\|\alpha x+\beta y\|=\alpha\|x\|+\beta\|y\|\) for every \(\alpha, \beta \geq 0\) Hint: Assume \(\alpha \geq \beta .\) Write $$ \begin{aligned} \|\alpha x+\beta y\| &=\|\alpha(x+y)-(\alpha-\beta) y\| \geq \alpha\|x+y\|-(\alpha-\beta)\|y\| \\ &=\alpha(\|x\|+\|y\|)-(\alpha-\beta)\|y\|=\alpha\|x\|+\beta\|y\| \end{aligned} $$

Show that \(C\) is a convex set in a vector space if and only if \(\sum \lambda_{i} x_{i} \in C\) whenever \(x_{1}, \ldots, x_{n} \in C\) and \(\lambda_{1}, \ldots, \lambda_{n} \geq 0\) satisfy \(\sum \lambda_{i}=1\) Hint: (a) \(\lambda_{1} x_{1}+\lambda_{2} x_{2}+\lambda_{3} x_{3}=\left(\lambda_{1}+\lambda_{2}\right)\left(\frac{\lambda_{1}}{\lambda_{1}+\lambda_{2}} x_{1}+\frac{\lambda_{2}}{\lambda_{1}+\lambda_{2}} x_{2}\right)+\lambda_{3} x_{3}\) and induction.

Show that \(\overline{\operatorname{span}}(L)=\overline{\operatorname{span}(L)}\) and \(\overline{\operatorname{conv}}(M)=\overline{\operatorname{conv}(M)}\). Hint: By the definition, \(\overline{\operatorname{span}}(L)\) is the intersection of all closed subspaces containing \(L\), and \(\overline{\operatorname{span}(L)}\) is one such subspace. From this, one inclusion follows. The other inclusion follows similarly because \(\operatorname{span}(L)\) is the intersection of all subspaces containing \(L .\)

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free