Þ±cell_dependenciesÞÙ$a84d9ce7-b0d9-4c88-a433-dcab67459a11„´precedence_heuristic §cell_idÙ$a84d9ce7-b0d9-4c88-a433-dcab67459a11´downstream_cells_map€²upstream_cells_map‚§@md_str�¨getindex�Ù$32be4960-6c49-4e73-8172-75786ae42ad3„´precedence_heuristic §cell_idÙ$32be4960-6c49-4e73-8172-75786ae42ad3´downstream_cells_map€²upstream_cells_map�¯TableOfContents�Ù$7d7ac845-c19c-4aff-84ed-8a486eb1bc56„´precedence_heuristic §cell_idÙ$7d7ac845-c19c-4aff-84ed-8a486eb1bc56´downstream_cells_map€²upstream_cells_map‚§@md_str�¨getindex�Ù$1100206d-b44d-4625-b425-f506cc258337„´precedence_heuristic §cell_idÙ$1100206d-b44d-4625-b425-f506cc258337´downstream_cells_map€²upstream_cells_map‚§@md_str�¨getindex�Ù$49f2bf4a-8f1a-4122-aad6-8b50db93ac1f„´precedence_heuristic §cell_idÙ$49f2bf4a-8f1a-4122-aad6-8b50db93ac1f´downstream_cells_map€²upstream_cells_map‚§@md_str�¨getindex�Ù$46704182-ef55-11ee-31c7-db589297db34„´precedence_heuristic§cell_idÙ$46704182-ef55-11ee-31c7-db589297db34´downstream_cells_map…§PlutoUI�°HypertextLiteral‘Ù$b9d75bc0-5e4a-4585-b4c0-327c485ad26f¬LaTeXStrings�²PlutoTeachingTools�«TikzPicture�²upstream_cells_map…³RobustLocalResource�®Markdown.parse�¦String�¨Markdown�¤read�Ù$374523ab-decb-42e9-88bf-3420f7552d39„´precedence_heuristic §cell_idÙ$374523ab-decb-42e9-88bf-3420f7552d39´downstream_cells_map€²upstream_cells_map‚§@md_str�¨getindex�Ù$b0b223a5-4b57-4a9f-a525-b0eb3796cd22„´precedence_heuristic §cell_idÙ$b0b223a5-4b57-4a9f-a525-b0eb3796cd22´downstream_cells_map€²upstream_cells_map€Ù$c2b6dc90-b1ca-4641-9bfe-44d1558574f4„´precedence_heuristic §cell_idÙ$c2b6dc90-b1ca-4641-9bfe-44d1558574f4´downstream_cells_map€²upstream_cells_map‚§@md_str�¨getindex�Ù$c0d4d23b-5b3e-441d-8161-59f8f78fbb52„´precedence_heuristic §cell_idÙ$c0d4d23b-5b3e-441d-8161-59f8f78fbb52´downstream_cells_map€²upstream_cells_map‚§@md_str�¨getindex�Ù$c14b2c6a-b7d7-465d-a591-474c703545d5„´precedence_heuristic §cell_idÙ$c14b2c6a-b7d7-465d-a591-474c703545d5´downstream_cells_map€²upstream_cells_map‚§@md_str�¨getindex�Ù$4b412cc4-514c-4f30-b70d-babf8e58979f„´precedence_heuristic §cell_idÙ$4b412cc4-514c-4f30-b70d-babf8e58979f´downstream_cells_map€²upstream_cells_map‚§@md_str�¨getindex�Ù$09efc623-3c15-4b91-8c3d-bda48baa8727„´precedence_heuristic §cell_idÙ$09efc623-3c15-4b91-8c3d-bda48baa8727´downstream_cells_map€²upstream_cells_map‚§@md_str�¨getindex�Ù$a6aafce2-6039-499e-a281-59b0483d8c4b„´precedence_heuristic §cell_idÙ$a6aafce2-6039-499e-a281-59b0483d8c4b´downstream_cells_map€²upstream_cells_map‚§@md_str�¨getindex�Ù$d17f5c96-645f-447a-ac3d-24cfeaed2e35„´precedence_heuristic §cell_idÙ$d17f5c96-645f-447a-ac3d-24cfeaed2e35´downstream_cells_map€²upstream_cells_map‚§@md_str�¨getindex�Ù$972451e6-4e52-4d60-ac58-744e87d752d5„´precedence_heuristic §cell_idÙ$972451e6-4e52-4d60-ac58-744e87d752d5´downstream_cells_map€²upstream_cells_map‚§@md_str�¨getindex�Ù$04821b47-064b-407e-b6a6-aa8439b0f0f6„´precedence_heuristic §cell_idÙ$04821b47-064b-407e-b6a6-aa8439b0f0f6´downstream_cells_map€²upstream_cells_map‚§@md_str�¨getindex�Ù$338c4b80-c710-4e8a-8dcd-e11ff464cbc8„´precedence_heuristic §cell_idÙ$338c4b80-c710-4e8a-8dcd-e11ff464cbc8´downstream_cells_map€²upstream_cells_map‚§@md_str�¨getindex�Ù$526efb20-8bfd-4060-9171-979c43b92435„´precedence_heuristic §cell_idÙ$526efb20-8bfd-4060-9171-979c43b92435´downstream_cells_map€²upstream_cells_map‚§@md_str�¨getindex�Ù$b9d75bc0-5e4a-4585-b4c0-327c485ad26f„´precedence_heuristic §cell_idÙ$b9d75bc0-5e4a-4585-b4c0-327c485ad26f´downstream_cells_map€²upstream_cells_map‹¦String�¤@htl�Ù HypertextLiteral.attribute_value�·HypertextLiteral.Result�³RobustLocalResource�·HypertextLiteral.Bypass�¸HypertextLiteral.content�®Markdown.parse�°HypertextLiteral‘Ù$46704182-ef55-11ee-31c7-db589297db34¨Markdown�¤read�´cell_execution_orderÜÙ$46704182-ef55-11ee-31c7-db589297db34Ù$7d7ac845-c19c-4aff-84ed-8a486eb1bc56Ù$49f2bf4a-8f1a-4122-aad6-8b50db93ac1fÙ$526efb20-8bfd-4060-9171-979c43b92435Ù$338c4b80-c710-4e8a-8dcd-e11ff464cbc8Ù$09efc623-3c15-4b91-8c3d-bda48baa8727Ù$c2b6dc90-b1ca-4641-9bfe-44d1558574f4Ù$1100206d-b44d-4625-b425-f506cc258337Ù$4b412cc4-514c-4f30-b70d-babf8e58979fÙ$c14b2c6a-b7d7-465d-a591-474c703545d5Ù$374523ab-decb-42e9-88bf-3420f7552d39Ù$972451e6-4e52-4d60-ac58-744e87d752d5Ù$a84d9ce7-b0d9-4c88-a433-dcab67459a11Ù$c0d4d23b-5b3e-441d-8161-59f8f78fbb52Ù$04821b47-064b-407e-b6a6-aa8439b0f0f6Ù$a6aafce2-6039-499e-a281-59b0483d8c4bÙ$d17f5c96-645f-447a-ac3d-24cfeaed2e35Ù$b0b223a5-4b57-4a9f-a525-b0eb3796cd22Ù$32be4960-6c49-4e73-8172-75786ae42ad3Ù$b9d75bc0-5e4a-4585-b4c0-327c485ad26f´last_hot_reload_timeË®process_status¥ready¤pathÙZ/home/runner/work/error-control-modelling/error-control-modelling/src/08_Hilbert_spaces.jl­pluto_version¨v0.20.21ªcell_orderÜÙ$7d7ac845-c19c-4aff-84ed-8a486eb1bc56Ù$46704182-ef55-11ee-31c7-db589297db34Ù$49f2bf4a-8f1a-4122-aad6-8b50db93ac1fÙ$526efb20-8bfd-4060-9171-979c43b92435Ù$338c4b80-c710-4e8a-8dcd-e11ff464cbc8Ù$09efc623-3c15-4b91-8c3d-bda48baa8727Ù$c2b6dc90-b1ca-4641-9bfe-44d1558574f4Ù$1100206d-b44d-4625-b425-f506cc258337Ù$4b412cc4-514c-4f30-b70d-babf8e58979fÙ$c14b2c6a-b7d7-465d-a591-474c703545d5Ù$374523ab-decb-42e9-88bf-3420f7552d39Ù$972451e6-4e52-4d60-ac58-744e87d752d5Ù$a84d9ce7-b0d9-4c88-a433-dcab67459a11Ù$c0d4d23b-5b3e-441d-8161-59f8f78fbb52Ù$04821b47-064b-407e-b6a6-aa8439b0f0f6Ù$a6aafce2-6039-499e-a281-59b0483d8c4bÙ$d17f5c96-645f-447a-ac3d-24cfeaed2e35Ù$b0b223a5-4b57-4a9f-a525-b0eb3796cd22Ù$32be4960-6c49-4e73-8172-75786ae42ad3Ù$b9d75bc0-5e4a-4585-b4c0-327c485ad26f±published_objects€¥nbpkgжwaiting_for_permissionÂÙ,waiting_for_permission_but_probably_disabled²installed_versions…§PlutoUI¦0.7.73°HypertextLiteral¥0.9.5¬LaTeXStrings¥1.4.0²PlutoTeachingTools¦0.2.15¬TikzPictures¥3.5.0°terminal_outputs†ªnbpkg_syncÚ Resolving... ===  Installed LoweredCodeUtils ─── v3.4.4 Installed Compiler ─────────── v0.1.1  Installed JuliaInterpreter ─── v0.10.6  Installed CodeTracking ─────── v2.0.1  Installed PlutoTeachingTools ─ v0.2.15  Installed PlutoLinks ───────── v0.1.6  Installed PlutoHooks ───────── v0.0.5  Installed Revise ───────────── v3.11.0  No Changes to `~/.julia/scratchspaces/c3e4b0f8-55cb-11ea-2926-15256bba5781/pkg_envs/env_aswafhiufx/Project.toml`  No Changes to `~/.julia/scratchspaces/c3e4b0f8-55cb-11ea-2926-15256bba5781/pkg_envs/env_aswafhiufx/Manifest.toml` Instantiating... === Precompiling... === Waiting for notebook process to start... Done. Starting precompilation... Precompiling project... 555.8 ms ✓ Compiler 664.4 ms ✓ PlutoHooks 804.9 ms ✓ CodeTracking 3355.5 ms ✓ PlutoUI 10656.8 ms ✓ JuliaInterpreter 7713.8 ms ✓ LoweredCodeUtils 12633.2 ms ✓ Revise 798.4 ms ✓ PlutoLinks 3286.8 ms ✓ PlutoTeachingTools§PlutoUIÚ Resolving... ===  Installed LoweredCodeUtils ─── v3.4.4 Installed Compiler ─────────── v0.1.1  Installed JuliaInterpreter ─── v0.10.6  Installed CodeTracking ─────── v2.0.1  Installed PlutoTeachingTools ─ v0.2.15  Installed PlutoLinks ───────── v0.1.6  Installed PlutoHooks ───────── v0.0.5  Installed Revise ───────────── v3.11.0  No Changes to `~/.julia/scratchspaces/c3e4b0f8-55cb-11ea-2926-15256bba5781/pkg_envs/env_aswafhiufx/Project.toml`  No Changes to `~/.julia/scratchspaces/c3e4b0f8-55cb-11ea-2926-15256bba5781/pkg_envs/env_aswafhiufx/Manifest.toml` Instantiating... === Precompiling... === Waiting for notebook process to start... Done. Starting precompilation... Precompiling project... 555.8 ms ✓ Compiler 664.4 ms ✓ PlutoHooks 804.9 ms ✓ CodeTracking 3355.5 ms ✓ PlutoUI 10656.8 ms ✓ JuliaInterpreter 7713.8 ms ✓ LoweredCodeUtils 12633.2 ms ✓ Revise 798.4 ms ✓ PlutoLinks 3286.8 ms ✓ PlutoTeachingTools°HypertextLiteralÚ Resolving... ===  Installed LoweredCodeUtils ─── v3.4.4 Installed Compiler ─────────── v0.1.1  Installed JuliaInterpreter ─── v0.10.6  Installed CodeTracking ─────── v2.0.1  Installed PlutoTeachingTools ─ v0.2.15  Installed PlutoLinks ───────── v0.1.6  Installed PlutoHooks ───────── v0.0.5  Installed Revise ───────────── v3.11.0  No Changes to `~/.julia/scratchspaces/c3e4b0f8-55cb-11ea-2926-15256bba5781/pkg_envs/env_aswafhiufx/Project.toml`  No Changes to `~/.julia/scratchspaces/c3e4b0f8-55cb-11ea-2926-15256bba5781/pkg_envs/env_aswafhiufx/Manifest.toml` Instantiating... === Precompiling... === Waiting for notebook process to start... Done. Starting precompilation... Precompiling project... 555.8 ms ✓ Compiler 664.4 ms ✓ PlutoHooks 804.9 ms ✓ CodeTracking 3355.5 ms ✓ PlutoUI 10656.8 ms ✓ JuliaInterpreter 7713.8 ms ✓ LoweredCodeUtils 12633.2 ms ✓ Revise 798.4 ms ✓ PlutoLinks 3286.8 ms ✓ PlutoTeachingTools¬LaTeXStringsÚ Resolving... ===  Installed LoweredCodeUtils ─── v3.4.4 Installed Compiler ─────────── v0.1.1  Installed JuliaInterpreter ─── v0.10.6  Installed CodeTracking ─────── v2.0.1  Installed PlutoTeachingTools ─ v0.2.15  Installed PlutoLinks ───────── v0.1.6  Installed PlutoHooks ───────── v0.0.5  Installed Revise ───────────── v3.11.0  No Changes to `~/.julia/scratchspaces/c3e4b0f8-55cb-11ea-2926-15256bba5781/pkg_envs/env_aswafhiufx/Project.toml`  No Changes to `~/.julia/scratchspaces/c3e4b0f8-55cb-11ea-2926-15256bba5781/pkg_envs/env_aswafhiufx/Manifest.toml` Instantiating... === Precompiling... === Waiting for notebook process to start... Done. Starting precompilation... Precompiling project... 555.8 ms ✓ Compiler 664.4 ms ✓ PlutoHooks 804.9 ms ✓ CodeTracking 3355.5 ms ✓ PlutoUI 10656.8 ms ✓ JuliaInterpreter 7713.8 ms ✓ LoweredCodeUtils 12633.2 ms ✓ Revise 798.4 ms ✓ PlutoLinks 3286.8 ms ✓ PlutoTeachingTools¬TikzPicturesÚ Resolving... ===  Installed LoweredCodeUtils ─── v3.4.4 Installed Compiler ─────────── v0.1.1  Installed JuliaInterpreter ─── v0.10.6  Installed CodeTracking ─────── v2.0.1  Installed PlutoTeachingTools ─ v0.2.15  Installed PlutoLinks ───────── v0.1.6  Installed PlutoHooks ───────── v0.0.5  Installed Revise ───────────── v3.11.0  No Changes to `~/.julia/scratchspaces/c3e4b0f8-55cb-11ea-2926-15256bba5781/pkg_envs/env_aswafhiufx/Project.toml`  No Changes to `~/.julia/scratchspaces/c3e4b0f8-55cb-11ea-2926-15256bba5781/pkg_envs/env_aswafhiufx/Manifest.toml` Instantiating... === Precompiling... === Waiting for notebook process to start... Done. Starting precompilation... Precompiling project... 555.8 ms ✓ Compiler 664.4 ms ✓ PlutoHooks 804.9 ms ✓ CodeTracking 3355.5 ms ✓ PlutoUI 10656.8 ms ✓ JuliaInterpreter 7713.8 ms ✓ LoweredCodeUtils 12633.2 ms ✓ Revise 798.4 ms ✓ PlutoLinks 3286.8 ms ✓ PlutoTeachingTools²PlutoTeachingToolsÚ Resolving... ===  Installed LoweredCodeUtils ─── v3.4.4 Installed Compiler ─────────── v0.1.1  Installed JuliaInterpreter ─── v0.10.6  Installed CodeTracking ─────── v2.0.1  Installed PlutoTeachingTools ─ v0.2.15  Installed PlutoLinks ───────── v0.1.6  Installed PlutoHooks ───────── v0.0.5  Installed Revise ───────────── v3.11.0  No Changes to `~/.julia/scratchspaces/c3e4b0f8-55cb-11ea-2926-15256bba5781/pkg_envs/env_aswafhiufx/Project.toml`  No Changes to `~/.julia/scratchspaces/c3e4b0f8-55cb-11ea-2926-15256bba5781/pkg_envs/env_aswafhiufx/Manifest.toml` Instantiating... === Precompiling... === Waiting for notebook process to start... Done. Starting precompilation... Precompiling project... 555.8 ms ✓ Compiler 664.4 ms ✓ PlutoHooks 804.9 ms ✓ CodeTracking 3355.5 ms ✓ PlutoUI 10656.8 ms ✓ JuliaInterpreter 7713.8 ms ✓ LoweredCodeUtils 12633.2 ms ✓ Revise 798.4 ms ✓ PlutoLinks 3286.8 ms ✓ PlutoTeachingTools§enabledìinstantiated÷restart_recommended_msgÀ´restart_required_msgÀ¯install_time_nsÏ düœ„­busy_packages�«cell_inputsÞÙ$a84d9ce7-b0d9-4c88-a433-dcab67459a11„§cell_idÙ$a84d9ce7-b0d9-4c88-a433-dcab67459a11¤codeÚYmd""" This notion allows us to construct new Hilbert spaces : !!! note "Definition (Sobolev spaces)" Let $\Omega \subset \mathbb{R}^{d} $ open. The Sobolev space $H^n(\Omega), n \in \mathbb{N}$ ```math H^{n}(\Omega)= \{\psi \in L^{2}(\Omega) \mid D^{\alpha} \psi \in L^{2}(\Omega) \quad \forall \alpha,\|\alpha\|_{1} \leq n \} ``` with inner product ```math \langle f, g\rangle_{H^{n}}=\sum_{ \| \alpha \|_{1} \leq n}\left\langle D^{\alpha} f, D^{\alpha} g\right\rangle_{L^{2}} ``` and induced norm ```math \|f\|_{H^{n}}=\sum_{\| \alpha \|_{1} \leq n}\left\|D^{\alpha} f\right\|_{L^{2}} ``` is a *Hilbert space.* !!! tip "Remark" The Fourier transform is a useful tool to classify Sobolev spaces ```math f \in H^{n} (\mathbb{R}^{d} ) \iff \int_{\mathbb{R}^{d}}\left(1+|p|^{2 n}\right) |\hat{f}(p) |^{2} d p<\infty ``` """¨metadataƒ©show_logsèdisabled®skip_as_script«code_foldedÃÙ$32be4960-6c49-4e73-8172-75786ae42ad3„§cell_idÙ$32be4960-6c49-4e73-8172-75786ae42ad3¤code±TableOfContents()¨metadataƒ©show_logsèdisabled®skip_as_script«code_foldedÃÙ$7d7ac845-c19c-4aff-84ed-8a486eb1bc56„§cell_idÙ$7d7ac845-c19c-4aff-84ed-8a486eb1bc56¤codeºmd""" # Hilbert Spaces """¨metadataƒ©show_logsèdisabled®skip_as_script«code_foldedÃÙ$1100206d-b44d-4625-b425-f506cc258337„§cell_idÙ$1100206d-b44d-4625-b425-f506cc258337¤codeÚ3md""" ## Compactness We will now discuss compactness, a notion which we will meet in various places in the rest of the lecture. Here we need it to introduce two important variants of $L^p$ spaces. !!! note "Definition (Compactness)" Let $V$ be a normed vector space. A subset $K$ of $V$ is called compact if every sequence $(x_{n} )_n \subset K$ has a converging subsequence whose limit is an element of $K$. A colloquial way of stating this is : !!! tip "" On compact sets Bolzano-Weierstrass works. The extraction of subspaces is central in analysis. For example the *extremal value theorem*, which we used to prove the existence of eigenvalues, is based on this argument and can be generalized to compact sets. !!! tip "Remark (Topological compactness)" Equivalently to this definition in metric spaces is a coverage-based notion of compactness ($K \subseteq V$ is compact if every coverage of open sets admits a coverage using only a finite subcollection) due to the Heine-Borel theorem. !!! tip "Remark (Compactness in finite dimensions)" In finite dimensions : ```math \text{Compact } \iff \text{ Closed and bounded} ``` In infinite dimensions things are trickier as we will see below, pointing as to the fact that our eigenvalue existence proof (Lemma 2.2) will not go through for general operators. """¨metadataƒ©show_logsèdisabled®skip_as_script«code_foldedÃÙ$49f2bf4a-8f1a-4122-aad6-8b50db93ac1f„§cell_idÙ$49f2bf4a-8f1a-4122-aad6-8b50db93ac1f¤codeÚúmd""" In our introductory discussion abut quantum mechanics we already discussed the importance of the probability density $|\Psi(x)|^{2}$. Clearly for this to make sense the wavefunction $\Psi: \mathbb{R}^{n} \rightarrow \mathbb{C}$ needs to be normalized, i.e. the integral ```math \int \overline{\Psi(x)} \Psi(x) d x ``` needs to be un-infinite. Such an integral is *not* well-defined for ordinary functions $\mathbb{R}^{n} \rightarrow \mathbb{C}$ as not all functions are square-integrable over $\mathbb{R}^{n}$ (e.g. a non-zero constant is not). This motivates the study of function spaces equipped with norms and the structure the norms impose. Typical norms for function spaces are the $L^p(\Omega)$-norms (or just $L^{p}$-norms when $\Omega \subset \mathbb{R}^{n}$ is clear from context) : ```math \| f \|_{p} \equiv\left(\int_{\Omega}|f|^{p}\right)^{1 / p}. ``` With this motivation in mind we will now study the structure of normed vector spaces and their companions such as Hilbert and Sobolev spaces. """¨metadataƒ©show_logsèdisabled®skip_as_script«code_foldedÃÙ$46704182-ef55-11ee-31c7-db589297db34„§cell_idÙ$46704182-ef55-11ee-31c7-db589297db34¤codeÚbegin import TikzPictures.TikzPicture using LaTeXStrings using PlutoTeachingTools using PlutoUI using HypertextLiteral RobustLocalResource("https://teaching.matmat.org/error-control/latex_macros.md", "latex_macros.md") Markdown.parse(read("latex_macros.md", String)) end¨metadataƒ©show_logsèdisabled®skip_as_script«code_foldedÃÙ$374523ab-decb-42e9-88bf-3420f7552d39„§cell_idÙ$374523ab-decb-42e9-88bf-3420f7552d39¤codeÚ *Proof* by contradiction. > Assume $\dim (V)=\infty$. We construct a bounded sequence that has no convergent subsequence: > > - Take $x_{1} \in V$ such that $\|x_{1} \|=1$ > - Choose $x_{2} \in V$ such that $\|x_{2} \|=1$ and $\|x_{1}-x_{2}\| \geq 1 / 2$. > - By the Riesz lemma we can choose $x_{k} \in V$ such that $\left\|x_{k}\right\|=1$ and $\left\|x_{k}-x_{i}\right\| \geq 1 / 2$ $\forall i=1, \dots, k-1 .$ > > This constructs a sequence $\left(x_{n}\right)_{n} \subset V$, such that $\left\|x_{n}\right\|=1$ (i.e. it is bounded), but $\left\|x_{n}-x_{m}\right\| \geqslant 1 \quad \forall m \neq n$. > As the Cauchy criterion is never satisfied we cannot extract a convergent subsequence. > $\hspace{11cm} \square$ """¨metadataƒ©show_logsèdisabled®skip_as_script«code_foldedÃÙ$09efc623-3c15-4b91-8c3d-bda48baa8727„§cell_idÙ$09efc623-3c15-4b91-8c3d-bda48baa8727¤codeÚÄmd""" !!! note "Definition (Banach space)" A normed vector space which is complete is called a **Banach space**. !!! warning "Example 1 (Râ�¿)" $\mathbb{R}^{n}$ with any $p$-norm $\|\cdot\|_{p}$. !!! warning "Example 2 (Láµ–)" For $1 \leq p<\infty$ the $L^{p}$ - spaces ```math L^{p}(\Omega)=\left\{ f: \Omega \rightarrow \mathbb{C} \ \middle | \ \int_{\Omega} |f(x)|^{p} d x<\infty \right\} ``` with $\Omega \subset \mathbb R^d$. """¨metadataƒ©show_logsèdisabled®skip_as_script«code_foldedÃÙ$a6aafce2-6039-499e-a281-59b0483d8c4b„§cell_idÙ$a6aafce2-6039-499e-a281-59b0483d8c4b¤codeÚámd""" !!! warning "Example 4 (Examples of separable Hilbert spaces)" Examples of separable Hilbert spaces : - $L^p(\Omega)$ for $1 \leq p<\infty$ if $\Omega \subset \mathbb{R}^{d}$ is open. - $H^{n}(\Omega)$ as subspaces of $L^{2}(\Omega)$ !!! warning "Example 5 (Classic counterexample)" $L^{\infty}([0,1])$ is *not* separable. Consider the family of characteristic functions $f_{t}= \indicator_{[0, t]}$ with $0 0$ there exists a $k \in \mathbb{N}$ such that $\left\|g_{k}-x\right\|<\alpha$. Therefore, there is a $k \in \mathbb{N}$ for each $00 \quad \exists M=M(\varepsilon) \in \mathbb{N}: \quad\left\|x_{n}-x_{m}\right\|<\varepsilon \quad \forall n, m \geq M(\varepsilon) . ``` What the definition says is that for such sequences there is a unique $x_{*} \in V$ with ```math \forall \varepsilon>0 \quad \exists N=N(\varepsilon) \in \mathbb{N}: \quad\left\|x_{n}-x_{*}\right\|<\varepsilon \quad \forall x_{n} \geq N(\varepsilon) . ``` """¨metadataƒ©show_logsèdisabled®skip_as_script«code_foldedÃÙ$b9d75bc0-5e4a-4585-b4c0-327c485ad26f„§cell_idÙ$b9d75bc0-5e4a-4585-b4c0-327c485ad26f¤codeÚ;let RobustLocalResource("https://teaching.matmat.org/error-control/sidebar.md", "sidebar.md") Sidebar(toc, ypos) = @htl("""""") Sidebar(Markdown.parse(read("sidebar.md", String)), 305) end¨metadataƒ©show_logsèdisabled®skip_as_script«code_foldedënotebook_idÙ$1a9aa5b2-c61e-11f0-3bee-c782a486e636¥bonds€¬cell_resultsÞÙ$a84d9ce7-b0d9-4c88-a433-dcab67459a11Цqueued¤logs�§running¦output†¤bodyÚØ

This notion allows us to construct new Hilbert spaces :

Definition (Sobolev spaces)

Let $\Omega \subset \mathbb{R}^{d} $ open. The Sobolev space $H^n(\Omega), n \in \mathbb{N}$

$$ H^{n}(\Omega)= \{\psi \in L^{2}(\Omega) \mid D^{\alpha} \psi \in L^{2}(\Omega) \quad \forall \alpha,\|\alpha\|_{1} \leq n \}$$

with inner product

$$ \langle f, g\rangle_{H^{n}}=\sum_{ \| \alpha \|_{1} \leq n}\left\langle D^{\alpha} f, D^{\alpha} g\right\rangle_{L^{2}}$$

and induced norm

$$ \|f\|_{H^{n}}=\sum_{\| \alpha \|_{1} \leq n}\left\|D^{\alpha} f\right\|_{L^{2}}$$

is a Hilbert space.

Remark

The Fourier transform is a useful tool to classify Sobolev spaces

$$ f \in H^{n} (\mathbb{R}^{d} ) \iff \int_{\mathbb{R}^{d}}\left(1+|p|^{2 n}\right) |\hat{f}(p) |^{2} d p<\infty$$

°persist_js_state¤mime©text/html²last_run_timestampËAÚGÉÆ+‰·has_pluto_hook_features¬rootassigneeÀ§cell_idÙ$a84d9ce7-b0d9-4c88-a433-dcab67459a11¹depends_on_disabled_cells§runtimeÎÙ<µpublished_object_keys�¸depends_on_skipped_cells§erroredÂÙ$32be4960-6c49-4e73-8172-75786ae42ad3Цqueued¤logs�§running¦output†¤bodyÚP¾ °persist_js_state¤mime©text/html²last_run_timestampËAÚGÉÑýf¾·has_pluto_hook_features¬rootassigneeÀ§cell_idÙ$32be4960-6c49-4e73-8172-75786ae42ad3¹depends_on_disabled_cells§runtimeÍ-µpublished_object_keys�¸depends_on_skipped_cells§erroredÂÙ$7d7ac845-c19c-4aff-84ed-8a486eb1bc56Цqueued¤logs�§running¦output†¤bodyÙH

Hilbert Spaces

°persist_js_state¤mime©text/html²last_run_timestampËAÚGÉÆ)Ò¿·has_pluto_hook_features¬rootassigneeÀ§cell_idÙ$7d7ac845-c19c-4aff-84ed-8a486eb1bc56¹depends_on_disabled_cells§runtimeÎé8µpublished_object_keys�¸depends_on_skipped_cells§erroredÂÙ$1100206d-b44d-4625-b425-f506cc258337Цqueued¤logs�§running¦output†¤bodyÚ[

Compactness

We will now discuss compactness, a notion which we will meet in various places in the rest of the lecture. Here we need it to introduce two important variants of $L^p$ spaces.

Definition (Compactness)

Let $V$ be a normed vector space. A subset $K$ of $V$ is called compact if every sequence $(x_{n} )_n \subset K$ has a converging subsequence whose limit is an element of $K$.

A colloquial way of stating this is :

On compact sets Bolzano-Weierstrass works.

The extraction of subspaces is central in analysis. For example the extremal value theorem, which we used to prove the existence of eigenvalues, is based on this argument and can be generalized to compact sets.

Remark (Topological compactness)

Equivalently to this definition in metric spaces is a coverage-based notion of compactness ($K \subseteq V$ is compact if every coverage of open sets admits a coverage using only a finite subcollection) due to the Heine-Borel theorem.

Remark (Compactness in finite dimensions)

In finite dimensions :

$$ \text{Compact } \iff \text{ Closed and bounded}$$

In infinite dimensions things are trickier as we will see below, pointing as to the fact that our eigenvalue existence proof (Lemma 2.2) will not go through for general operators.

°persist_js_state¤mime©text/html²last_run_timestampËAÚGÉÆ*Òž·has_pluto_hook_features¬rootassigneeÀ§cell_idÙ$1100206d-b44d-4625-b425-f506cc258337¹depends_on_disabled_cells§runtimeÎÒ­µpublished_object_keys�¸depends_on_skipped_cells§erroredÂÙ$49f2bf4a-8f1a-4122-aad6-8b50db93ac1fЦqueued¤logs�§running¦output†¤bodyÚÕ

In our introductory discussion abut quantum mechanics we already discussed the importance of the probability density $|\Psi(x)|^{2}$. Clearly for this to make sense the wavefunction $\Psi: \mathbb{R}^{n} \rightarrow \mathbb{C}$ needs to be normalized, i.e. the integral

$$\int \overline{\Psi(x)} \Psi(x) d x$$

needs to be un-infinite. Such an integral is not well-defined for ordinary functions $\mathbb{R}^{n} \rightarrow \mathbb{C}$ as not all functions are square-integrable over $\mathbb{R}^{n}$ (e.g. a non-zero constant is not). This motivates the study of function spaces equipped with norms and the structure the norms impose.

Typical norms for function spaces are the $L^p(\Omega)$-norms (or just $L^{p}$-norms when $\Omega \subset \mathbb{R}^{n}$ is clear from context) :

$$\| f \|_{p} \equiv\left(\int_{\Omega}|f|^{p}\right)^{1 / p}.$$

With this motivation in mind we will now study the structure of normed vector spaces and their companions such as Hilbert and Sobolev spaces.

°persist_js_state¤mime©text/html²last_run_timestampËAÚGÉÆ*Ò·has_pluto_hook_features¬rootassigneeÀ§cell_idÙ$49f2bf4a-8f1a-4122-aad6-8b50db93ac1f¹depends_on_disabled_cells§runtimeÎ" ¢µpublished_object_keys�¸depends_on_skipped_cells§erroredÂÙ$46704182-ef55-11ee-31c7-db589297db34Цqueued¤logs�§running¦output†¤bodyÚƒ

$$\def\resolvent{{\rho}} \def\spectralradius{{\varrho}} \def\laplacian{{\Delta}} \def\contour{C} \def\eigenspace{{\mathcal E}} \def\op{\mathcal} \def\opA{{\mathcal A}} \def\opH{{\mathcal H}} \def\hilbert{{\mathscr H}} \def\graph{G} \def\boundedoperators{\mathscr B} \def\bloch{\mathcal B} \def\indicator{{\mathbf 1}} \def\im{\operatorname{Im}} \def\ker{\operatorname{Ker}} \definecolor{noteblue}{RGB}{123, 145, 178} \definecolor{warnyellow}{RGB}{165, 159, 116} \definecolor{prooftext}{RGB}{85, 85, 85}$$

°persist_js_state¤mime©text/html²last_run_timestampËAÚGÉÑ�D1·has_pluto_hook_features¬rootassigneeÀ§cell_idÙ$46704182-ef55-11ee-31c7-db589297db34¹depends_on_disabled_cells§runtimeÎ5øŽnµpublished_object_keys�¸depends_on_skipped_cells§erroredÂÙ$374523ab-decb-42e9-88bf-3420f7552d39Цqueued¤logs�§running¦output†¤bodyÚ �

Definition (Weak derivative)

The function $u \in L_\text{loc}^{2}(\Omega)$ with $\Omega \subset \mathbb{R}^{d}$ open has a weak derivative along the coordinate $x_i$ in $L^{2}(\Omega)$ if there exists a $g_{i} \in L^{2}(\Omega)$ with

$$\begin{align} \forall \varphi \in C_{0}^{\infty}(\Omega) && \left\langle g_{i}, \varphi \right\rangle_{L^{2}(\Omega)} = -\left\langle u, \frac{\partial \varphi}{\partial x_{i}}\right\rangle_{L^{2}(\Omega)}. \end{align}$$

We then usually employ the same notation as for strong derivatives and e.g. denote $\frac{\partial u}{\partial x_{i}} = g_i$ in the weak sense.

Defining for $\alpha= (\alpha_{1}, \ldots, \alpha_{n} ) \in \mathbb{N}_{0}^{n}$ the notation

$$\begin{align} \|\alpha\|_{1}=\sum_{i=1}^{n} \alpha_{i} && D ^{\alpha}=\frac{\partial^{\|\alpha\|_{1}}}{\partial x_{1}^{\alpha_{1}} \ldots \partial x_{n}^{\alpha_{n}}} . \end{align}$$

we analogously define higher weak derivatives $D^{\alpha} u \in L^{2}(\Omega)$ if there exists $g_{\alpha} \in L^{2}(\Omega)$ with

$$\begin{align} \forall \varphi \in C_{0}^{\infty}(\Omega) && \left\langle g_{\alpha}, \varphi \right\rangle_{L^{2}(\Omega)} = (-1)^{\|\alpha\|_{1}}\left\langle u, D^{\alpha} \varphi \right\rangle_{L^{2}(\Omega)} \end{align}$$

°persist_js_state¤mime©text/html²last_run_timestampËAÚGÉÆ+Nè·has_pluto_hook_features¬rootassigneeÀ§cell_idÙ$374523ab-decb-42e9-88bf-3420f7552d39¹depends_on_disabled_cells§runtimeÎ�Òµpublished_object_keys�¸depends_on_skipped_cells§erroredÂÙ$b0b223a5-4b57-4a9f-a525-b0eb3796cd22Цqueued¤logs�§running¦output†¤body °persist_js_state¤mimeªtext/plain²last_run_timestampËAÚGÉÆ/b™·has_pluto_hook_features¬rootassigneeÀ§cell_idÙ$b0b223a5-4b57-4a9f-a525-b0eb3796cd22¹depends_on_disabled_cells§runtimeÎBFµpublished_object_keys�¸depends_on_skipped_cells§erroredÂÙ$c2b6dc90-b1ca-4641-9bfe-44d1558574f4Цqueued¤logs�§running¦output†¤bodyÚº

Definition (Hilbert space)

A Banach space where the norm is induced by an inner product is a Hilbert space.

Example 3 (Square integrable functions)

An important Hilbert space is the space of square integrable functions

$$ L^{2}\left(\mathbb{R}^{d}\right)=\left\{\psi: \mathbb{R}^{d} \rightarrow \mathbb{C} \ \middle | \ \int_{\mathbb{R}^{d}} | \psi(x) |^{2} d x<\infty\right\}$$

with inner product

$$ \langle\psi, \varphi \rangle_{L^{2}}=\int_{\mathbb{R}^{d}} \overline{\psi(x)} \varphi(x) d x .$$

°persist_js_state¤mime©text/html²last_run_timestampËAÚGÉÆ*¨·has_pluto_hook_features¬rootassigneeÀ§cell_idÙ$c2b6dc90-b1ca-4641-9bfe-44d1558574f4¹depends_on_disabled_cells§runtimeÎÖȵpublished_object_keys�¸depends_on_skipped_cells§erroredÂÙ$c0d4d23b-5b3e-441d-8161-59f8f78fbb52Цqueued¤logs�§running¦output†¤bodyÚZ

Denseness and separability

Before returning our focus to operators, the final concepts we need to discuss are denseness and separability.

Definition (Dense subspaces)

A subspace $S \subset V$ is dense on $V$ if each vector $x_{*} \in V$ is either (1) also a member of $V$ or (2) one can find a Cauchy sequence $\left(x_{n}\right)_{n} \subset S$ which converges to $x_{*}$.

Remark

$\mathbb{Q}$ is dense in $\mathbb{R}$.

If $S \subset V$ is dense this means that, using only elements from $S$, we can construct an approximation to any $x_{*} \in V$ to any desired accuracy. Clearly, finding good dense subspaces is key to do numerical computations involving infinite dimensional spaces like $H^{n}(\Omega)$. In particular the ones with a countable number of basis functions are useful as this provides a natural way to start with a crude approximation (use few basis functions) and then keep refining until the desired accuracy is reached.

Fortunately,

°persist_js_state¤mime©text/html²last_run_timestampËAÚGÉÆ+­›·has_pluto_hook_features¬rootassigneeÀ§cell_idÙ$c0d4d23b-5b3e-441d-8161-59f8f78fbb52¹depends_on_disabled_cells§runtimeÎ+ïµpublished_object_keys�¸depends_on_skipped_cells§erroredÂÙ$c14b2c6a-b7d7-465d-a591-474c703545d5Цqueued¤logs�§running¦output†¤bodyÚF

Weak derivatives & Sobolev spaces

As was the case for matrices, computing Rayleigh quotients

$$R_{\opH}(\psi)=\frac{\langle\psi, \opH \psi\rangle_{L^{2}}}{\langle\psi, \psi\rangle_{L^{2}}} \tag{1}$$

for operators $\opH$ as well as the minimisation of these objects will be central when approximating spectra $\sigma(\opH)$. We must therefore ensure that this quantity is well-defined.

  • All operators $\opH$ which we have studied so far and pretty much all Hamiltonians in quantum mechanics involve the Laplace operator (Kinetic energy). However, if $\psi \in L^{2} (\mathbb{R}^{d} )$ there is no guarantee that derivatives of $\psi$ are still in $L^{2} (\mathbb{R}^{d} )$.

  • Thus, taking wavefunctions to be $L^{2}$ is not sufficient to ensure the $L^{2}$ inner product in (1) even makes sense.

  • Therefore, we seek Hilbert spaces with a more restrictive structure, which ensures derivatives to be $L^{2}$ - integrable as well.

Since we are only interested in integrating over derivatives, it turns out that we can allow ourselves a weaker notion of differentiability. To define this, we first need to introduce two new function spaces :

  • $C_{0}^{\infty}(\Omega)$ is the space of infinitely differentiable functions $\Omega \rightarrow \mathbb{C}$ with compact support.

  • The space of locally integrable functions $L_\text{loc}^p$ :

Definition (Locally integrable functions)

For $\Omega \subset \mathbb{R}^{d}$, we define

$$ L_\text{loc}^{p}(\Omega)=\left \{ f : \Omega \rightarrow \mathbb{C} \ \middle \vert \ f\rvert_K \in L^{p}(K) \quad \forall K \subset \Omega, K \text { compact} \right \}$$

We have $L^{p}(\Omega) \subset L_\text{loc}^{p}(\Omega)$, since local integrability is a less strict criterion : the growth of the function towards the boundary $\partial \Omega$ –- or towards $\infty$ –- is not limited.

Remark

Note $L^{p}(\Omega) \subset L_\text{loc}^{p}(\Omega) \subset L_\text{loc}^{1}(\Omega)$ for $p \geq 1$ and $\Omega \subset \mathbb{R}^{d}$ potentially unbounded, while $L^p(\Omega) \subset L^{1}(\Omega)$ only if $\Omega \subset \mathbb{R}^{d}$ is open and bounded.

With this in mind, we can introduce the weak derivative :

°persist_js_state¤mime©text/html²last_run_timestampËAÚGÉÆ+5"·has_pluto_hook_features¬rootassigneeÀ§cell_idÙ$c14b2c6a-b7d7-465d-a591-474c703545d5¹depends_on_disabled_cells§runtimeΦصpublished_object_keys�¸depends_on_skipped_cells§erroredÂÙ$4b412cc4-514c-4f30-b70d-babf8e58979fЦqueued¤logs�§running¦output†¤bodyÚ£

Theorem 1

Let $V$ be a normed vector space for which every bounded sequence in $V$ contains a convergent subsequence. Then, $\dim (V)<\infty$.

Proof by contradiction. Assume $\dim (V)=\infty$. We construct a bounded sequence that has no convergent subsequence:

  • Take $x_{1} \in V$ such that $\|x_{1} \|=1$

  • Choose $x_{2} \in V$ such that $\|x_{2} \|=1$ and $\|x_{1}-x_{2}\| \geq 1 / 2$.

  • By the Riesz lemma we can choose $x_{k} \in V$ such that $\left\|x_{k}\right\|=1$ and $\left\|x_{k}-x_{i}\right\| \geq 1 / 2$ $\forall i=1, \dots, k-1 .$

This constructs a sequence $\left(x_{n}\right)_{n} \subset V$, such that $\left\|x_{n}\right\|=1$ (i.e. it is bounded), but $\left\|x_{n}-x_{m}\right\| \geqslant 1 \quad \forall m \neq n$. As the Cauchy criterion is never satisfied we cannot extract a convergent subsequence. $\hspace{11cm} \square$

°persist_js_state¤mime©text/html²last_run_timestampËAÚGÉÆ*ìÈ·has_pluto_hook_features¬rootassigneeÀ§cell_idÙ$4b412cc4-514c-4f30-b70d-babf8e58979f¹depends_on_disabled_cells§runtimeÎæcµpublished_object_keys�¸depends_on_skipped_cells§erroredÂÙ$09efc623-3c15-4b91-8c3d-bda48baa8727Цqueued¤logs�§running¦output†¤bodyÚ¯

Definition (Banach space)

A normed vector space which is complete is called a Banach space.

Example 1 (R�)

$\mathbb{R}^{n}$ with any $p$-norm $\|\cdot\|_{p}$.

Example 2 (Láµ–)

For $1 \leq p<\infty$ the $L^{p}$ - spaces

$$ L^{p}(\Omega)=\left\{ f: \Omega \rightarrow \mathbb{C} \ \middle | \ \int_{\Omega} |f(x)|^{p} d x<\infty \right\} $$

with $\Omega \subset \mathbb R^d$.

°persist_js_state¤mime©text/html²last_run_timestampËAÚGÉÆ*�~·has_pluto_hook_features¬rootassigneeÀ§cell_idÙ$09efc623-3c15-4b91-8c3d-bda48baa8727¹depends_on_disabled_cells§runtimeÎI‡µpublished_object_keys�¸depends_on_skipped_cells§erroredÂÙ$a6aafce2-6039-499e-a281-59b0483d8c4bЦqueued¤logs�§running¦output†¤bodyÚ 

Example 4 (Examples of separable Hilbert spaces)

Examples of separable Hilbert spaces :

  • $L^p(\Omega)$ for $1 \leq p<\infty$ if $\Omega \subset \mathbb{R}^{d}$ is open.

  • $H^{n}(\Omega)$ as subspaces of $L^{2}(\Omega)$

Example 5 (Classic counterexample)

$L^{\infty}([0,1])$ is not separable. Consider the family of characteristic functions $f_{t}= \indicator_{[0, t]}$ with $0<t \leq 1$. Clearly,

$$ \forall \delta \text{ s.t. } 0<\delta<t \leq 1:\left\|f_{\delta}-f_{t}\right\|_{L^{\infty}}=\| \indicator_{( \delta, t]} \|_{L^{\infty}}=1 \tag{2}$$

Let $(g_k)_{k \in \mathbb N}$ be a sequence whose elements form a dense countable subset of $V=L^{\infty}([0,1])$. For such a sequence one can show that for each element $x \in V$ of the vector space and for all $\alpha > 0$ there exists a $k \in \mathbb{N}$ such that $\left\|g_{k}-x\right\|<\alpha$. Therefore, there is a $k \in \mathbb{N}$ for each $0<t \leq 1$ such that

$$\left\|g_{k}-f_{t}\right\|<1 / 2$$

Because of (2) this can only be true for a single $t=t(k)$. This results in a surjective map $\mathbb N \supset K \ni k \mapsto \delta(k) \in(0,1]$, which is a contradiction since $(0,1]$ is not countable.

°persist_js_state¤mime©text/html²last_run_timestampËAÚGÉÆ+éò·has_pluto_hook_features¬rootassigneeÀ§cell_idÙ$a6aafce2-6039-499e-a281-59b0483d8c4b¹depends_on_disabled_cells§runtimeÎâµpublished_object_keys�¸depends_on_skipped_cells§erroredÂÙ$d17f5c96-645f-447a-ac3d-24cfeaed2e35Цqueued¤logs�§running¦output†¤bodyÚŒ

Summary of concepts

  • Completeness : Limits of converging sequences remain in normed vector space/Banach space

  • Compactness : Bounded sequences of compact normed vector spaces admit a converging subsequence.

  • Compact subspace of Banach space : Useful in iterative procedures and optimisation. Roughly in these spaces "boundedness $\Rightarrow$ convergence", which is key in proving the existence of eigenvalues in some operators.

  • Sobolev spaces $H^{n}$ : Hilbert space more regular than $L^{2}$, where weak derivatives remain $L^{2}$-integrable.

  • Separability/dense subspaces : Approximations of this Hilbert space by finite-dimensional subspaces is possible. Key ingredient to construct meaningful discretisation techniques and solve physical problems defined on the continuous level.

°persist_js_state¤mime©text/html²last_run_timestampËAÚGÉÆ,)Z·has_pluto_hook_features¬rootassigneeÀ§cell_idÙ$d17f5c96-645f-447a-ac3d-24cfeaed2e35¹depends_on_disabled_cells§runtimeÎ yjµpublished_object_keys�¸depends_on_skipped_cells§erroredÂÙ$972451e6-4e52-4d60-ac58-744e87d752d5Цqueued¤logs�§running¦output†¤bodyÚó

The motivation for this definition is partial integration, where the boundary terms vanish since $\varphi$ has compact support. Explicitly, for $\Omega = (a,b)$, we have

$$ \int_a^b u(x) \frac{\partial \varphi(x)}{\partial x} dx = \underbrace{\bigg [ u(x) \varphi(x) \bigg ]^b_a}_{0 \text{ ($\varphi$ has compact support)}} - \int_a^b \frac{\partial u(x)}{\partial x} \varphi(x) dx $$

If the strong derivative exists, the weak one agrees with it. The weak derivative is well-defined.

°persist_js_state¤mime©text/html²last_run_timestampËAÚGÉÆ+lè·has_pluto_hook_features¬rootassigneeÀ§cell_idÙ$972451e6-4e52-4d60-ac58-744e87d752d5¹depends_on_disabled_cells§runtimeÎõpublished_object_keys�¸depends_on_skipped_cells§erroredÂÙ$04821b47-064b-407e-b6a6-aa8439b0f0f6Цqueued¤logs�§running¦output†¤bodyÚ

Definition (Separability)

A Hilbert space is separable if it has a dense countable subset.

A Hilbert space $\hilbert$ is separable if and only if it admits a countable orthonormal basis $\{\varphi_{\mu} \}_{\mu=1}^{\infty} \subset \hilbert.$ With this each element $\psi \in \hilbert$ can be identified as

$$ \psi=\sum_{\mu=1}^{\infty} c_{\mu} \varphi_{\mu}$$

to a square-summable infinite sequence $\left(c_{\mu}\right)_{\mu} \in \mathbb{C}$. Every infinite-dimensional separable Hilbert space is thus isometrically isomorphic to the sequence space

$$ \ell^{2}(\mathbb{C})= \left\{a: \mathbb N \rightarrow \mathbb{C} \ \middle | \ \sum_{n=1}^{\infty} | a(n) |^{2}<\infty\right\}. $$

Separability is also closely related to being able to approximate the infinite-dimensional space numerically.

°persist_js_state¤mime©text/html²last_run_timestampËAÚGÉÆ+Ïx·has_pluto_hook_features¬rootassigneeÀ§cell_idÙ$04821b47-064b-407e-b6a6-aa8439b0f0f6¹depends_on_disabled_cells§runtimeÎV‡µpublished_object_keys�¸depends_on_skipped_cells§erroredÂÙ$338c4b80-c710-4e8a-8dcd-e11ff464cbc8Цqueued¤logs�§running¦output†¤bodyÚS

To make completeness as a concept more clear consider a counter-example.

  • Let's consider the rational numbers $\mathbb{Q}$ (which can be seen as a vector space over the field $\mathbb{Q}$ itself) and ask whether it is complete with respect to $| \cdot |$.

  • Consider the sequence

    $$x_{n}=\sum_{k=0}^{n} \frac{1}{k !} \in \mathbb{Q}$$

    of rational numbers. It is well known that

    $$\lim _{n \rightarrow \infty} x_{n}=e \notin \mathbb{Q} .$$

    Thus, $\mathbb{Q}$ is not complete.

  • One may, however, build the completion of $\mathbb Q$ by including all possible limit points of all sequences with elements in $\mathbb Q$. This is one way to define the real numbers.

A subtle point about completeness is that it depends on the norm which is used to determine whether a sequence is Cauchy or not. In other words, a vector space may be complete with respect to one norm but not another. Similarly, the completion of a space with respect to different norms may yield different spaces.

In practice the choice of norm is only important for infinite-dimensional vector spaces as for finite-dimensional real/complex vector spaces all norms are equivalent.

°persist_js_state¤mime©text/html²last_run_timestampËAÚGÉÆ*v·has_pluto_hook_features¬rootassigneeÀ§cell_idÙ$338c4b80-c710-4e8a-8dcd-e11ff464cbc8¹depends_on_disabled_cells§runtimeÎ …µpublished_object_keys�¸depends_on_skipped_cells§erroredÂÙ$526efb20-8bfd-4060-9171-979c43b92435Цqueued¤logs�§running¦output†¤bodyÚ%

Completeness

Definition (Completeness)

A normed vector space $(V , \| \cdot \|)$ is called complete if every Cauchy sequence of vectors in $V$ converges to on element in $V$.

Remark (Cauchy sequence)

Let us recall that a sequence $\left(x_{n}\right)_{n \in \mathbb{N}}$ of elements $x_{n} \in V$ is Cauchy if

$$\forall \varepsilon>0 \quad \exists M=M(\varepsilon) \in \mathbb{N}: \quad\left\|x_{n}-x_{m}\right\|<\varepsilon \quad \forall n, m \geq M(\varepsilon) .$$

What the definition says is that for such sequences there is a unique $x_{*} \in V$ with

$$\forall \varepsilon>0 \quad \exists N=N(\varepsilon) \in \mathbb{N}: \quad\left\|x_{n}-x_{*}\right\|<\varepsilon \quad \forall x_{n} \geq N(\varepsilon) .$$

°persist_js_state¤mime©text/html²last_run_timestampËAÚGÉÆ*5Û·has_pluto_hook_features¬rootassigneeÀ§cell_idÙ$526efb20-8bfd-4060-9171-979c43b92435¹depends_on_disabled_cells§runtimeÎìµpublished_object_keys�¸depends_on_skipped_cells§erroredÂÙ$b9d75bc0-5e4a-4585-b4c0-327c485ad26fЦqueued¤logs�§running¦output†¤bodyÚò°persist_js_state¤mime©text/html²last_run_timestampËAÚGÉÒ>Ž·has_pluto_hook_features¬rootassigneeÀ§cell_idÙ$b9d75bc0-5e4a-4585-b4c0-327c485ad26f¹depends_on_disabled_cells§runtimeÎ-!µpublished_object_keys�¸depends_on_skipped_cells§errored©shortpath´08_Hilbert_spaces.jl®last_save_timeËAÚGÉÆ'ð «in_temp_dir¨metadata€