46 Functional analysis
TheoremBanach–Alaoglu theorem#
The Banach-Alaoglu theorem: the polar set of a neighborhood s of the origin in a
normed space E is a compact subset of WeakDual 𝕜 E.
WeakDual.isCompact_polar.{u_1, u_3} (𝕜 : Type u_1) {E : Type u_3} [NontriviallyNormedField 𝕜]
[SeminormedAddCommGroup E] [NormedSpace 𝕜 E] [ProperSpace 𝕜] {s : Set E} (s_nhds : s ∈ nhds 0) :
IsCompact (WeakDual.polar 𝕜 s)
Sources
TheoremClosed graph theorem#
The closed graph theorem : a linear map between two Banach spaces whose graph is closed is continuous.
LinearMap.continuous_of_isClosed_graph.{u_1, u_3, u_5} {𝕜 : Type u_1} [NontriviallyNormedField 𝕜]
{E : Type u_3} [NormedAddCommGroup E] [NormedSpace 𝕜 E] [CompleteSpace E] {F : Type u_5}
[NormedAddCommGroup F] [NormedSpace 𝕜 F] [CompleteSpace F] (g : E →ₗ[𝕜] F)
(hg : IsClosed ↑g.graph) : Continuous ⇑g
Sources
Uses 6 · Used by 1
DefinitionGelfand–Mazur theorem#
Mathlib records this with 3 declarations.
NormedRing.algEquivComplexOfComplete: Gelfand-Mazur theorem: For a complex Banach division algebra, the natural algebraMap ℂ A
is an algebra isomorphism whose inverse is given by selecting the (unique) element of
spectrum ℂ a. In addition, algebraMap_isometry guarantees this map is an isometry.
Note: because NormedDivisionRing requires the field norm_mul : ∀ a b, ‖a * b‖ = ‖a‖ * ‖b‖, we
don't use this type class and instead opt for a NormedRing in which the nonzero elements are
precisely the units. This allows for the application of this isomorphism in broader contexts, e.g.,
to the quotient of a complex Banach algebra by a maximal ideal. In the case when A is actually a
NormedDivisionRing, one may fill in the argument hA with the lemma isUnit_iff_ne_zero.
NormedRing.algEquivComplexOfComplete.{u_2} {A : Type u_2} [NormedRing A] [NormedAlgebra ℂ A]
[CompleteSpace A] (hA : ∀ {a : A}, IsUnit a ↔ a ≠ 0) : ℂ ≃ₐ[ℂ] A
NormedAlgebra.Complex.algEquivOfNormMul: A version of the Gelfand-Mazur Theorem.
If F is a nontrivial normed ℂ-algebra with multiplicative norm, then we obtain a
ℂ-algebra equivalence with ℂ.
NormedAlgebra.Complex.algEquivOfNormMul.{u_1} (F : Type u_1) [NormedRing F] [NormOneClass F]
[NormMulClass F] [NormedAlgebra ℂ F] [Nontrivial F] : ℂ ≃ₐ[ℂ] F
NormedAlgebra.Real.nonempty_algEquiv_or: A version of the Gelfand-Mazur Theorem over ℝ.
If a field F is a normed ℝ-algebra, then F is isomorphic as an ℝ-algebra
either to ℝ or to ℂ.
NormedAlgebra.Real.nonempty_algEquiv_or.{u_2} (F : Type u_2) [NormedField F] [NormedAlgebra ℝ F] :
Nonempty (F ≃ₐ[ℝ] ℝ) ∨ Nonempty (F ≃ₐ[ℝ] ℂ)
The first two are over the complex numbers (with different assumptions), the third is over the real numbers.
Sources
- Mathlib documentation:
NormedRing.algEquivComplexOfComplete - Source of
NormedRing.algEquivComplexOfCompletein Mathlib/Analysis/Normed/Algebra/GelfandFormula.lean - Mathlib documentation:
NormedAlgebra.Complex.algEquivOfNormMul - Source of
NormedAlgebra.Complex.algEquivOfNormMulin Mathlib/Analysis/Normed/Algebra/GelfandMazur.lean - Mathlib documentation:
NormedAlgebra.Real.nonempty_algEquiv_or - Source of
NormedAlgebra.Real.nonempty_algEquiv_orin Mathlib/Analysis/Normed/Algebra/GelfandMazur.lean - 1000+ theorems list: Q2226677
- 1000+ theorems project: Q2226677
- Wikipedia: Gelfand–Mazur theorem
- Wikidata: Q2226677
Uses 8
TheoremHellinger–Toeplitz theorem#
The Hellinger--Toeplitz theorem: if a symmetric operator is defined on a complete space, then it is automatically continuous.
LinearMap.IsSymmetric.continuous.{u_1, u_2} {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜]
[NormedAddCommGroup E] [InnerProductSpace 𝕜 E] [CompleteSpace E] {T : E →ₗ[𝕜] E}
(hT : T.IsSymmetric) : Continuous ⇑T
Sources
Uses 6 · Used by 1
TheoremM. Riesz extension theorem#
M. Riesz extension theorem: given a convex cone s in a vector space E, a submodule p,
and a linear f : p → ℝ, assume that f is nonnegative on p ∩ s and p + s = E. Then
there exists a globally defined linear function g : E → ℝ that agrees with f on p,
and is nonnegative on s.
riesz_extension.{u_1} {E : Type u_1} [AddCommGroup E] [_root_.Module ℝ E] (s : PointedCone ℝ E)
(f : E →ₗ.[ℝ] ℝ) (nonneg : ∀ (x : ↥f.domain), ↑x ∈ s → 0 ≤ ↑f x)
(dense : ∀ (y : E), ∃ x, ↑x + y ∈ s) : ∃ g, (∀ (x : ↥f.domain), g ↑x = ↑f x) ∧ ∀ x ∈ s, 0 ≤ g x
Sources
Uses 7
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.