Hilbert spaces
ClassInner product space, over \(R\) or \(C\)#
A (pre) inner product space is a vector space with an additional operation called inner product.
The (semi)norm could be derived from the inner product, instead we require the existence of a
seminorm and the fact that ‖x‖^2 = re ⟪x, x⟫ to be able to put instances on 𝕂 or product spaces.
Note that NormedSpace does not assume that ‖x‖=0 implies x=0 (it is rather a seminorm).
To construct a seminorm from an inner product, see PreInnerProductSpace.ofCore.
InnerProductSpace.{u_4, u_5} (𝕜 : Type u_4) (E : Type u_5) [RCLike 𝕜] [SeminormedAddCommGroup E] :
Type (max u_4 u_5)
Sources
- Mathlib documentation:
InnerProductSpace - Source of
InnerProductSpacein Mathlib/Analysis/InnerProductSpace/Defs.lean - Mathlib overview: Analysis › Hilbert spaces
- Mathlib undergraduate list: Bilinear and Quadratic Forms Over a Vector Space › Euclidean and Hermitian spaces
- Mathlib undergraduate list: Bilinear and Quadratic Forms Over a Vector Space › Euclidean and Hermitian spaces
Uses 3 · Used by 48
TheoremCauchy-Schwarz inequality#
Cauchy–Schwarz inequality.
inner_mul_inner_self_le.{u_1, u_2} {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜]
[SeminormedAddCommGroup E] [InnerProductSpace 𝕜 E] (x y : E) :
‖inner 𝕜 x y‖ * ‖inner 𝕜 y x‖ ≤ RCLike.re (inner 𝕜 x x) * RCLike.re (inner 𝕜 y y)
Freek Wiedijk's list (no. 78) also cites norm_inner_le_norm.
Sources
- Mathlib documentation:
inner_mul_inner_self_le - Source of
inner_mul_inner_self_lein Mathlib/Analysis/InnerProductSpace/Basic.lean - Mathlib overview: Analysis › Hilbert spaces
- Mathlib undergraduate list: Bilinear and Quadratic Forms Over a Vector Space › Euclidean and Hermitian spaces
- Freek Wiedijk's 100 theorems, no. 78
Uses 1 · Used by 1
DefinitionAdjoint operator#
The adjoint operator as a partially defined linear operator, denoted as T†.
LinearPMap.adjoint.{u_1, u_2, u_3} {𝕜 : Type u_1} {E : Type u_2} {F : Type u_3} [RCLike 𝕜]
[NormedAddCommGroup E] [InnerProductSpace 𝕜 E] [NormedAddCommGroup F] [InnerProductSpace 𝕜 F]
(T : E →ₗ.[𝕜] F) [CompleteSpace E] : F →ₗ.[𝕜] E
Sources
Uses 2
DefinitionSelf-adjoint operator#
An element is self-adjoint if it is equal to its star.
IsSelfAdjoint.{u_1} {R : Type u_1} [Star R] (x : R) : Prop
Sources
Used by 1
DefinitionOrthogonal projection#
The orthogonal projection onto a subspace.
Submodule.orthogonalProjectionOnto.{u_1, u_2} {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜]
[NormedAddCommGroup E] [InnerProductSpace 𝕜 E] (K : Submodule 𝕜 E) [K.HasOrthogonalProjection] :
E →L[𝕜] ↥K
Sources
Uses 5 · Used by 4
DefinitionReflection#
Reflection in a complete subspace of an inner product space. The word "reflection" is sometimes understood to mean specifically reflection in a codimension-one subspace, and sometimes more generally to cover operations such as reflection in a point. The definition here, of reflection in a subspace, is a more general sense of the word that includes both those common cases.
Submodule.reflection.{u_1, u_2} {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E]
[InnerProductSpace 𝕜 E] (K : Submodule 𝕜 E) [K.HasOrthogonalProjection] : E ≃ₗᵢ[𝕜] E
Sources
Uses 1 · Used by 1
DefinitionOrthogonal complement#
The subspace of vectors orthogonal to a given subspace, denoted Kᗮ.
Submodule.orthogonal.{u_1, u_2} {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E]
[InnerProductSpace 𝕜 E] (K : Submodule 𝕜 E) : Submodule 𝕜 E
Sources
Uses 1 · Used by 5
TheoremExistence of Hilbert basis#
A Hilbert space admits a Hilbert basis.
exists_hilbertBasis.{u_2, u_3} (𝕜 : Type u_2) [RCLike 𝕜] (E : Type u_3) [NormedAddCommGroup E]
[InnerProductSpace 𝕜 E] [CompleteSpace E] : ∃ w b, ⇑b = Subtype.val
Sources
Uses 10
TheoremEigenvalues from Rayleigh quotient#
For a self-adjoint operator T, a local extremum of the Rayleigh quotient of T on a sphere
centred at the origin is an eigenvector of T.
IsSelfAdjoint.hasEigenvector_of_isLocalExtrOn.{u_1, u_2} {𝕜 : Type u_1} [RCLike 𝕜] {E : Type u_2}
[NormedAddCommGroup E] [InnerProductSpace 𝕜 E] [CompleteSpace E] {T : E →L[𝕜] E}
(hT : IsSelfAdjoint T) {x₀ : E} (hx₀ : x₀ ≠ 0)
(hextr : IsLocalExtrOn T.reApplyInnerSelf (Metric.sphere 0 ‖x₀‖) x₀) :
Module.End.HasEigenvector (↑T) (↑(T.rayleighQuotient x₀)) x₀
Sources
Uses 11 · Used by 1
DefinitionFréchet-Riesz representation of the dual of a Hilbert space#
Fréchet-Riesz representation: any ℓ in the dual of a Hilbert space E is of the form
fun u => ⟪y, u⟫ for some y : E, i.e. toDualMap is surjective.
InnerProductSpace.toDual.{u_1, u_2} (𝕜 : Type u_1) (E : Type u_2) [RCLike 𝕜] [NormedAddCommGroup E]
[InnerProductSpace 𝕜 E] [CompleteSpace E] : E ≃ₗᵢ⋆[𝕜] StrongDual 𝕜 E
Sources
- Mathlib documentation:
InnerProductSpace.toDual - Source of
InnerProductSpace.toDualin Mathlib/Analysis/InnerProductSpace/Dual.lean - Mathlib overview: Analysis › Hilbert spaces
- Mathlib undergraduate list: Bilinear and Quadratic Forms Over a Vector Space › Euclidean and Hermitian spaces
- Mathlib undergraduate list: Topology › Hilbert spaces
- 1000+ theorems list: Q1357684
- 1000+ theorems project: Q1357684
- Wikipedia: Riesz representation theorem
- Wikidata: Q1357684
Uses 4 · Used by 4
DefinitionLax-Milgram theorem#
The Lax-Milgram equivalence of a coercive bounded bilinear operator:
for all v : V, continuousLinearEquivOfBilin B v is the unique element V
such that continuousLinearEquivOfBilin B v, w⟫ = B v w.
The Lax-Milgram theorem states that this is a continuous equivalence.
IsCoercive.continuousLinearEquivOfBilin.{u} {V : Type u} [NormedAddCommGroup V]
[InnerProductSpace ℝ V] [CompleteSpace V] {B : V →L[ℝ] V →L[ℝ] ℝ} (coercive : IsCoercive B) :
V ≃L[ℝ] V
Sources
- Mathlib documentation:
IsCoercive.continuousLinearEquivOfBilin - Source of
IsCoercive.continuousLinearEquivOfBilinin Mathlib/Analysis/InnerProductSpace/LaxMilgram.lean - Mathlib overview: Analysis › Hilbert spaces
- Mathlib undergraduate list: Topology › Hilbert spaces
- 1000+ theorems list: Q9993851
- 1000+ theorems project: Q9993851
- Wikipedia: Lax–Milgram theorem
- Wikidata: Q9993851
Uses 3
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.