Metric Space¶
Important Equations¶
Lemma
Assume positive real number \(\alpha\), \(\beta\) satisfies conjugate condition \(\alpha+\beta=1\), then
Since \(f(x)=x^\alpha (0<\alpha<1)\) is concave function, so tangent function at any point on the function curve lies above it. Choose \((1,1)\), we have tangent function
with \(\beta=1-\alpha\in (0,1)\). So
Let \(x=\frac{u}{v}\), then
If we let \(\alpha=\frac{1}{p}\), \(\beta=\frac{1}{q}\) in inequation, we have
Hölder Inequation
Assume \(p\), \(q\) satisfies conjugate condition \(\frac{1}{p}+\frac{1}{q}=1\), then
(i) For \(\{\xi_n\}_{n\geq 1}\) and \(\{\eta_n\}_{n\geq 1}\), \(\xi_n,\eta_n\in \mathbb{C}\) we have
(ii) For \(f\), \(g\) satisfies \(\int_E |f(x)|^pdx<\infty\), \(\int_E |g(x)|^qdx<\infty\), we have
In inequation \(\ref{conjugate-inequation}\), for \(n=1,2,\cdots\) let
we have
summing up \(n=1,2,\cdots\), we have
In inequation \(\ref{conjugate-inequation}\), let
we have
integrate on \(E\) on both sides, we have
Minkowski Inequation
Assume \(p\), \(q\) satisfies conjugate condition \(\frac{1}{p}+\frac{1}{q}=1\), then
(i) For \(\{\xi_n\}_{n\geq 1}\) and \(\{\eta_n\}_{n\geq 1}\), \(\xi_n,\eta_n\in \mathbb{C}\), we have
(ii) For \(f\), \(g\) satisfies \(\int_E |f(x)|^pdx<\infty\), \(\int_E |g(x)|^qdx<\infty\), we have
Basic Concepts¶
度量空间的定义 | Definition of Metric Space
Assume \(M\) is a set. If there is a function \(\rho: M\times M\mapsto \mathbb{R}\) defined on it, satisfies the following axioms. That is, \(\forall x,y,z \in M\)
- Positive
- Definite
- Symmetry
- Triangle inequality
then \(M\) is called metric space with metrc \(\rho\), denoted as \((M,\rho)\).
Example. Cases for \((M,\rho)\) with background of Mathematical analysis, show that the following \(\rho\) satisfies axiom of triangle inequation.
(i) \(M=\mathbb{R}^n\), \(\forall x=(\xi_1,\cdots,\xi_2), y=(\eta_1,\cdots,\eta_n)\in \mathbb{R}\), their metric is defined by
(ii) \(M=C[a,b]\), \(\forall f,g\in C[a,b]\), their metric is defined by
(i) Use Cauchy inequation.
Example. Cases for \((M,\rho)\) regarding sequence space, show that the following \(\rho\) satisfies axiom of triangle inequation.
(i) \(M=l^p(1\leq p<\infty)\), i.e.
\(\forall x=\{\xi_n\}_{n\geq 1}, y=\{\eta_n\}_{n\geq 1}\in l^p\), their metric is defined by
(ii) \(M=l^\infty\), or
\(\forall x=\{\xi_n\}_{n\geq 1}, y=\{\eta_n\}_{n\geq 1}\in l^\infty\), their metric is defined by
Example. Cases for \((M,\rho)\) with background of Real analysis, to be more specific, \(L^p\) Space, show that the following \(\rho\) satisfies axiom of triangle inequation. Note that we use "\(=\)" to denote equation almost everywhere.
(i) \(M=L^p(E), (1\leq p<\infty, E\subset \mathbb{R} \text{ is measurable})\), i.e.
\(\forall f, g \in L^p(E)\), their metric is defined by
(ii) \(M=L^\infty(E)\), or
\(\forall f,g\in L^\infty(E)\), their metric is defined by
(i)
Convergence¶
Readers could compare this definition to convergence in \(L^p\) Space.
Definitions of Convergence
Assume \(\{x_n\}_{n\geq 1}\subset M\). If there exists \(x_0\in M\), such that \(\rho(x_n,x_0)\rightarrow 0(n\rightarrow \infty)\), then we call \(\{x_n\}\) converges to \(x_0\), denoted by
and \(x_0\) is a limit of \(\{x_n\}\).
Properties of convergence
Assume \(\{x_n\}_{n\geq 1}\subset M\) is a convergent sequence, then
(i) Limit of \(\{x_n\}_{n\geq 1}\) exists uniquely.
(ii) \(\forall y_0\in M\), \(\{\rho(x_n,y_0)\}_{n\geq 1}\) is bounded.
(iii) Subsequence. for all subsequence \(\{x_{n_j}\}\) converges to the same limit. Conversely, if for all subsequence \(\{x_{n_j}\}\) converges, then \(\{x_n\}\) also converges.
(i) Assume there are two distinct limits \(x_0,y_0\in M\),
(ii) easy to see.
(iii) The forward direction is easy. But reversely, if \(\{x_n\}\) does not converge, then there exist at least two distinct subsequential limits \(L_1\) and \(L_2\), \(L_1\neq L_2\), so which contradicts the assumption!
Topology¶
Definitions
Assume metric space \((M,\rho)\).
(i) If \(x_0\in M\), \(r>0\), Define open ball (neighborhood)
and closed ball
(ii) Assume \(G\subset M\), \(x\in G\), \(x\) is an interior point of \(G\), if \(\exists\) neighborhood \(B(x,r)\subset G\). The kernel of a set \( G \) is a set made up of all its interior points, denoted as \(G^o\). \(G\) is an open set if
Define \(\varnothing\) is an open set.
Properties of open sets
(i) \(M\) is an open set.
(ii) \(\{X_\lambda\}_{\lambda\in \Lambda}\), \(\bigcup_{\lambda\in \Lambda} X_\lambda\) is an open set.
(iii) \(\{X_n\}_{1\leq n\leq N}\), \(\bigcap_{n=1}^N X_n\) is an open set.
Definitions 2
Assume metric space \((M,\rho)\). \(G\subset M\), \(x_0\in M\).
(i) If \(\forall \varepsilon>0\),
then \(G\) is an accumulation point.
(ii) The Derived Set of \( G \) is defined as the set composed of all accumulation points of \( G \), denoted as \( G' \).
(iii) The Closure of \( G \) is the union of \( G \) and its derived set, denoted as:
Properties of Closure
Assume metric space \((M,\rho)\), \(A,B\subset X\), then
(i) \(A\subset \overline{A}\), (ii) \(\overline{\overline{A}}=\overline{A}\), (iii) \(\overline{A\cup B}=\overline{A}\cup \overline{B}\), (iv) \(\overline{\varnothing}=\varnothing\).
Density & Seperability¶
Definition of Density
Assume \(X\) is a metric space, \(A,B\subset X\). If \(\overline{B}\supset A\), then \(B\) is dense in \(A\).
Equivalent proposition of Density
Assume \(X\) is a metric space, \(A,B\subset X\). Then the following statements are equivalent.
(i) \(B\) is dense in \(A\),
(ii) \(\forall x\in A\), \(\forall \varepsilon>0\), \(\exists y\in B\), such that \(x\in B(y,\varepsilon)\) (or \(\rho(x,y)<\varepsilon\)).
(iii) \(\forall x\in A\), \(\exists \{x_n\}\in B\), such that \(\lim\limits_{n\rightarrow\infty}x_n=x\).
(iv) \(\forall \varepsilon>0\), \(A\subset \bigcup\limits_{x\in B}B(x, \varepsilon)\).
- (i) \(\Rightarrow\) (ii)
\(\forall x\in A\), since \(A\subset \overline{B}\), then \(x\in \overline{B}\), so \(\forall \varepsilon>0\), \(B(x,\varepsilon)\cap B\neq\varnothing\). So \(\exists y\in B(x,\varepsilon)\cap B\), which satisfies \(\rho(x,y)<\varepsilon\).
- (ii) \(\Rightarrow\) (iii)
\(\forall x\in A\), \(\forall \varepsilon_k=\frac{1}{k}>0\), \(\exists y_k\in B\), such that \(\rho(x,y_k)<\varepsilon_k\). So \(\lim\limits_{k\rightarrow \infty}y_k=x\).
- (iii) \(\Rightarrow\) (iv)
\(\forall x\in A\), \(\exists \{x_n\}\in B\), such that \(\lim\limits_{n\rightarrow\infty}x_n=x\). So \(\forall \varepsilon>0\), \(\exists N>0\), \(\rho(x,x_N)<\varepsilon\), which means \(x\in B(x_N,\varepsilon)\). So \(A\subset \bigcup\limits_{x\in B}B(x, \varepsilon)\).
- (iv) \(\Rightarrow\) (i)
\(\forall \varepsilon>0\), \(A\subset \bigcup\limits_{x\in B}B(x, \varepsilon)\), so \(\forall x\in A\), \(\exists y\in B\), \(x\in B(y,\varepsilon)\), which means \(B(x,\varepsilon)\cap B=\neq \varnothing\) (at least we have \(y\)), so \(x\in \overline{B}\).
Definition of Seperability
Assume \(X\) is a metric space. If there exists denumerable set \(B\subset X\), \(B\) is dense in \(X\), then \(X\) is seperable.
Continuous Mapping¶
Mapping & Continuous Mapping
Assume \(X,Y\) are metric space, with its distance \(\rho\), \(\rho_1\), respectively. If \(\forall x\in X\), \(\exists ! y\in Y\), such that \(Tx=y\), then we call \(T\) is a mapping from \(X\) to \(Y\).
If mapping \(T\) satisfies that for a fixed poinr \(x_0\in X\), \(\forall \varepsilon>0\), \(\exists \delta>0\), such that \(\rho_1(Tx,Tx_0)<\varepsilon\) whenever \(\rho(x,x_0)<\delta\), then we call \(T\) is a continuous mapping at \(x_0\).
If the above property holds for all \(x_0\in X\), then we call \(T\) continuous mapping on \(X\).
Usually we call a mapping from metric space \(X\) to \(\mathbb{R}\) functional.
Example. (i) Assume \(X\) is a metric space, \(x_0\in X\), mapping \(T(x)=\rho(x,x_0), (x\in X)\) is a continuous functional from \(X\) to \(\mathbb{R}\).
(ii) Assume \(X\) is a metric space, \(F\subset X\), mapping \(T(x)=\inf\limits_{y\in F}\rho(x,y), (x\in X)\) is continuous functional from \(X\) to \(\mathbb{R}\).
\(\square\)
\(\square\)
Equivalent definition for continuous mapping
Assume \(X,Y\) are metric space, with its distance \(\rho\), \(\rho_1\), respectively.
(i) Choose a point \(x_0\in X\). A mapping \(T\) from \(X\) to \(Y\) is continuous at \(x_0\), iff
(ii) A mapping \(T\) from \(X\) to \(Y\) is continuous, iff one of the following two condition holds
\(\square\)
Definition of inverse mapping
Assume \(X,Y\) are metric space, with its distance \(\rho\), \(\rho_1\), respectively. If a mapping \(T\) from \(X\) to \(Y\) is injective and surjective, or bijective, then \(\forall y\in Y\), \(\exists ! x\in X\), such that
here we have a new mapping, called Inverse Mapping, deonted as \(T^{-1}\).
Definition of Homeomorphic Mapping
Assume \(X,Y\) are metric space, with its distance \(\rho\), \(\rho_1\), respectively. If a mapping \(T\) from \(X\) to \(Y\) is bijective, and \(T\), \(T^{-1}\) are both continuous on \(X\), \(Y\), respectively, then we call \(T\) is a Homeomorphic Mapping.
If there exists a homeomorphic mapping \(T\) from \(X\) to \(Y\), then we call \(X\) and \(Y\) are homeomorphic.
Definition of Isometric Mapping
Assume \(X,Y\) are metric space, with its distance \(\rho\), \(\rho_1\), respectively. If a mapping \(T\) from \(X\) to \(Y\), satisfies that \(\forall x,y\in X\), \(\rho(x,y)=\rho_1(Tx,Ty)\), then we call \(T\) is an isometric mapping.
If there exists a bijective and isometric mapping \(T\) from \(X\) to \(Y\), then we call \(X\) and \(Y\) are isometric.
When Two metric space are homeomorphic or isometric, we view them as the same.
Completeness¶
Definition of Basic sequence (Cauchy Sequence)
Assume \(X\) is a metric space with metric \(\rho\). Sequence \(\{x_n\}_{n\geq 1}\subset X\) is said to be a Cauchy Sequence, if \(\forall \varepsilon>0\), \(\exists N>0\), \(\forall n,m>N\), such that
The core problem of functional analysis, lies in formulating a complete space, i.e. every Cauchy sequence of \(X\) converge to the point in the space \(X\) itself.
Example. Basic space \(\mathbb{R}\) and \(C[a,b]\) are complete.
Meager sets¶
Definition of nowhere dense sets
Assume \(X\) is a metric space, \(A\subset X\). \(A\) is said to be Nowhere Dense Set, if \(\forall \text{ open set }G\subset X\), \(A\) is not dense in \(G\).
Equivalent definition of nowhere dense sets
Assume \(X\) is a metric space, \(A\subset X\). \(A\) is said to be Nowhere Dense Set, iff
\(\square\)
Set of the first & second category
Assume \(X\) is a metric space, \(A\subset X\). \(A\) is said to be a set of the first category, if there exists a sequence of nowhere dense sets \(\{F_n\}_{n\geq 1}\), such that
If not, we call \(A\) a set of the second category.
Theorem of Nested Closed Balls
Metric Space \(X\) is complete, iff $\forall $ nested closed ball \(\{K_n=\overline{S}(x_n,r_n)\}_{n\geq 1}\), which satisfies
and \(\lim\limits_{n\rightarrow \infty}r_n=0\), then there exists a unique point \(x_0\in X\), such that \(x_0\in \bigcap_{n=1}^\infty \overline{S}(x_n,r_n)\).
\(\square\)
Baire Theorem
Every complete space is a set of the second category.
\(\square\)
Compact Sets¶
Definition of Bounded set
Assume \(X\) is a metric space, and \(A\subset X\). \(A\) is said to be a bounded set, if there exists a open ball \(K=S(x,r)\) (or closed ball \(K=\overline{S}(x,r)\)) such that \(A\subset K\).
Definition for relative compact set & compact set
Assume \(X\) is a metric space, \(A\subset X\). If \(\forall \{x_n\}\subset A\), \(\exists \{n_k\}_{k\geq 1}\) and \(x\in X\), such that \(\lim\limits_{k\rightarrow \infty}x_{n_k}=x\), then we call \(A\) a relative compact set. If the limit point \(x\in A\), then \(A\) is called compact set.
If \(X\) itself is a compact set, then \(X\) is called compact metric space.
Properties for relative compact set & compact set
(i) Any set with finite number elements is compact set.
(ii) Assume \(A\subset X\) is a relative compact set, then \(\forall B\subset A\), \(B\) is also a relative compact set.
(iii) Assume \(A\subset X\) is a compact set, then \(\forall \text{ closed set }B\subset A\), \(B\) is also a compact set.
(ii) By definition. \(\forall \{x_n\}_{n\geq 1}\subset B\subset A\), so \(\exists \{n_k\}_{k\geq 1}\) and \(x\in X\), such that \(\lim\limits_{k\rightarrow \infty}x_{n_k}=x\), so \(B\) is a relative compact set.
(iii) \(\forall \{x_n\}_{n\geq 1}\subset B\subset A\), \(\exists \{n_k\}_{k\geq 1}\) and \(x\in A\), such that \(\lim\limits_{k\rightarrow \infty}x_{n_k}=x\). Since \(B\) is a closed set, the limit point should be in \(B\), i.e. \(x\in B\). So \(B\) is a compact set.
\(\square\)
Now we give a description for relative compact set.
Definition for \(\varepsilon\)-net
Assume \(X\) is a metric space with metric \(\rho\), \(A,B\subset X\). If for a given number \(\varepsilon>0\), \(\forall x\in A\), \(\exists y\in B\), such that \(\rho(x,y)<\varepsilon\), then we call \(B\) is an \(\varepsilon\)-net of \(A\).
Note we do not ask \(B\cap A\neq \varnothing\).
Definition for Totally Bounded Set
Assume \(X\) is a metric space, \(A\subset X\). If \(\forall \varepsilon>0\), \(\exists \varepsilon\)-net with finite number of elements for \(A\), then we call \(A\) is a Totally Bounded Set.
Properties for totally bounded set
(i) Any set with finite number of elements is a totally bounded set.
(ii) Assume \(A\subset X\) is a totally bounded set, then \(\forall B\subset A\), \(B\) is also a totally bounded set.
(iii) Assume \(A\subset X\) is a totally bounded set, then \(\forall\varepsilon>0\), \(\exists B\subset A\), s.t \(B\) is a \(\varepsilon\)-net of \(A\).
(i) Choose the set itself as an \(\varepsilon\)-net, which has finite number of elements.
(ii) \(\forall \varepsilon>0\), \(\exists C\) with finite number of elements, such that \(B\subset A\subset \bigcup\limits_{x\in C}S(x,\varepsilon)\), so \(C\) is also an \(\varepsilon\)-net of \(B\).
(iii) \(\forall \varepsilon>0\), \(\exists C=\{y_n\}_{1\leq n\leq N}\) is an \(\frac{\varepsilon}{2}\)-net of \(A\). That is, \(\forall x\in A\), \(\exists y\in C\), such that \(\rho(x,y)<\frac{\varepsilon}{2}\). By assumption, \(\exists \{n_k\}_{1\leq k\leq K} (K\leq N)\), such that \(S(y_{n_k},\frac{\varepsilon}{2})\cap A\neq \varnothing\), then choose \(z_k\in S(y_{n_k},\frac{\varepsilon}{2})\cap A\). Then define \(B=\bigcup_{k=1}^K \{z_k\}\), which satisfies
So \(B\) is a \(\varepsilon\)-net of \(A\).
Theorem for totally bounded set
Totally bounded set is bounded and seperable.
(i) easy to see it is bounded. Choose one element of an \(\varepsilon\)-net as center of ball, estimate the sufficient radious of the ball.
(ii) Leverage the \(\frac{1}{n}\)-net to formulate a dense denumerable subsequence.
\(\square\)
.Theorem for relative compact description
Assume \(X\) is a metric space with metric \(\rho\), \(A\subset X\) is a relative compact set, then \(A\) is totally bounded set.
On the other hand, If \(X\) is a complete metric space, if \(A\subset X\) is a totally bounded set, then \(A\) is also a relative compact set.
The following theorem is useful in proof. Because it is hard to find an \(\varepsilon\)-net which proved to be finite number, but easy to show it is relative compact.
Theorem for relative compact set
Assume \(X\) is a complete metric space, \(A\subset X\) is a relative compact set, iff \(A\) has a relative compact \(\varepsilon\)-net.