mathlib documentation

analysis.inner_product_space.projection

The orthogonal projection #

Given a nonempty complete subspace K of an inner product space E, this file constructs orthogonal_projection K : E →L[𝕜] K, the orthogonal projection of E onto K. This map satisfies: for any point u in E, the point v = orthogonal_projection K u in K minimizes the distance ∥u - v∥ to u.

Also a linear isometry equivalence reflection K : E ≃ₗᵢ[𝕜] E is constructed, by choosing, for each u : E, the point reflection K u to satisfy u + (reflection K u) = 2 • orthogonal_projection K u.

Basic API for orthogonal_projection and reflection is developed.

Next, the orthogonal projection is used to prove a series of more subtle lemmas about the the orthogonal complement of complete subspaces of E (the orthogonal complement itself was defined in analysis.inner_product_space.basic); the lemma submodule.sup_orthogonal_of_is_complete, stating that for a complete subspace K of E we have K ⊔ Kᗮ = ⊤, is a typical example.

The last section covers orthonormal bases, Hilbert bases, etc. The lemma maximal_orthonormal_iff_dense_span, whose proof requires the theory on the orthogonal complement developed earlier in this file, states that an orthonormal set in an inner product space is maximal, if and only if its span is dense (i.e., iff it is Hilbert basis, although we do not make that definition). Various consequences are stated, including that if E is finite-dimensional then a maximal orthonormal set is a basis (maximal_orthonormal_iff_basis_of_finite_dimensional).

References #

The orthogonal projection construction is adapted from

[Clément & Martin, The Lax-Milgram Theorem. A detailed proof to be formalized in Coq]
[Clément & Martin, A Coq formal proof of the Lax–Milgram theorem]

The Coq code is available at the following address: http://www.lri.fr/~sboldo/elfic/index.html

Orthogonal projection in inner product spaces #

theorem exists_norm_eq_infi_of_complete_convex {F : Type u_3} [inner_product_space ℝ F] {K : set F} (ne : K.nonempty) (h₁ : is_complete K) (h₂ : convex ℝ K) (u : F) :

∃ (v : F) (H : v ∈ K), ∥u - v∥ = ⨅ (w : ↥K), ∥u - ↑w∥

Existence of minimizers Let u be a point in a real inner product space, and let K be a nonempty complete convex subset. Then there exists a (unique) v in K that minimizes the distance ∥u - v∥ to u.

theorem norm_eq_infi_iff_real_inner_le_zero {F : Type u_3} [inner_product_space ℝ F] {K : set F} (h : convex ℝ K) {u v : F} (hv : v ∈ K) :

(∥u - v∥ = ⨅ (w : ↥K), ∥u - ↑w∥) ↔ ∀ (w : F), w ∈ K → inner (u - v) (w - v) ≤ 0

Characterization of minimizers for the projection on a convex set in a real inner product space.

theorem exists_norm_eq_infi_of_complete_subspace {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] (K : submodule 𝕜 E) (h : is_complete ↑K) (u : E) :

∃ (v : E) (H : v ∈ K), ∥u - v∥ = ⨅ (w : ↥↑K), ∥u - ↑w∥

Existence of projections on complete subspaces. Let u be a point in an inner product space, and let K be a nonempty complete subspace. Then there exists a (unique) v in K that minimizes the distance ∥u - v∥ to u. This point v is usually called the orthogonal projection of u onto K.

theorem norm_eq_infi_iff_real_inner_eq_zero {F : Type u_3} [inner_product_space ℝ F] (K : submodule ℝ F) {u v : F} (hv : v ∈ K) :

(∥u - v∥ = ⨅ (w : ↥↑K), ∥u - ↑w∥) ↔ ∀ (w : F), w ∈ K → inner (u - v) w = 0

Characterization of minimizers in the projection on a subspace, in the real case. Let u be a point in a real inner product space, and let K be a nonempty subspace. Then point v minimizes the distance ∥u - v∥ over points in K if and only if for all w ∈ K, ⟪u - v, w⟫ = 0 (i.e., u - v is orthogonal to the subspace K). This is superceded by norm_eq_infi_iff_inner_eq_zero that gives the same conclusion over any is_R_or_C field.

theorem norm_eq_infi_iff_inner_eq_zero {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] (K : submodule 𝕜 E) {u v : E} (hv : v ∈ K) :

(∥u - v∥ = ⨅ (w : ↥↑K), ∥u - ↑w∥) ↔ ∀ (w : E), w ∈ K → inner (u - v) w = 0

Characterization of minimizers in the projection on a subspace. Let u be a point in an inner product space, and let K be a nonempty subspace. Then point v minimizes the distance ∥u - v∥ over points in K if and only if for all w ∈ K, ⟪u - v, w⟫ = 0 (i.e., u - v is orthogonal to the subspace K)

def orthogonal_projection_fn {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] (K : submodule 𝕜 E) [complete_space ↥K] (v : E) :

E

The orthogonal projection onto a complete subspace, as an unbundled function. This definition is only intended for use in setting up the bundled version orthogonal_projection and should not be used once that is defined.

Equations

orthogonal_projection_fn K v = _.some

theorem orthogonal_projection_fn_mem {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] {K : submodule 𝕜 E} [complete_space ↥K] (v : E) :

orthogonal_projection_fn K v ∈ K

The unbundled orthogonal projection is in the given subspace. This lemma is only intended for use in setting up the bundled version and should not be used once that is defined.

theorem orthogonal_projection_fn_inner_eq_zero {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] {K : submodule 𝕜 E} [complete_space ↥K] (v w : E) (H : w ∈ K) :

inner (v - orthogonal_projection_fn K v) w = 0

The characterization of the unbundled orthogonal projection. This lemma is only intended for use in setting up the bundled version and should not be used once that is defined.

theorem eq_orthogonal_projection_fn_of_mem_of_inner_eq_zero {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] {K : submodule 𝕜 E} [complete_space ↥K] {u v : E} (hvm : v ∈ K) (hvo : ∀ (w : E), w ∈ K → inner (u - v) w = 0) :

orthogonal_projection_fn K u = v

The unbundled orthogonal projection is the unique point in K with the orthogonality property. This lemma is only intended for use in setting up the bundled version and should not be used once that is defined.

theorem orthogonal_projection_fn_norm_sq {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] (K : submodule 𝕜 E) [complete_space ↥K] (v : E) :

∥v∥ * ∥v∥ = ∥v - orthogonal_projection_fn K v∥ * ∥v - orthogonal_projection_fn K v∥ + ∥orthogonal_projection_fn K v∥ * ∥orthogonal_projection_fn K v∥

def orthogonal_projection {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] (K : submodule 𝕜 E) [complete_space ↥K] :

E →L[𝕜] ↥K

The orthogonal projection onto a complete subspace.

Equations

orthogonal_projection K = {to_fun := λ (v : E), ⟨orthogonal_projection_fn K v, _⟩, map_add' := _, map_smul' := _}.mk_continuous 1 _

@[simp]

theorem orthogonal_projection_fn_eq {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] {K : submodule 𝕜 E} [complete_space ↥K] (v : E) :

orthogonal_projection_fn K v = ↑(⇑(orthogonal_projection K) v)

@[simp]

theorem orthogonal_projection_inner_eq_zero {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] {K : submodule 𝕜 E} [complete_space ↥K] (v w : E) (H : w ∈ K) :

inner (v - ↑(⇑(orthogonal_projection K) v)) w = 0

The characterization of the orthogonal projection.

theorem eq_orthogonal_projection_of_mem_of_inner_eq_zero {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] {K : submodule 𝕜 E} [complete_space ↥K] {u v : E} (hvm : v ∈ K) (hvo : ∀ (w : E), w ∈ K → inner (u - v) w = 0) :

↑(⇑(orthogonal_projection K) u) = v

The orthogonal projection is the unique point in K with the orthogonality property.

theorem eq_orthogonal_projection_of_eq_submodule {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] {K : submodule 𝕜 E} [complete_space ↥K] {K' : submodule 𝕜 E} [complete_space ↥K'] (h : K = K') (u : E) :

↑(⇑(orthogonal_projection K) u) = ↑(⇑(orthogonal_projection K') u)

The orthogonal projections onto equal subspaces are coerced back to the same point in E.

@[simp]

theorem orthogonal_projection_mem_subspace_eq_self {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] {K : submodule 𝕜 E} [complete_space ↥K] (v : ↥K) :

⇑(orthogonal_projection K) ↑v = v

The orthogonal projection sends elements of K to themselves.

theorem orthogonal_projection_eq_self_iff {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] {K : submodule 𝕜 E} [complete_space ↥K] {v : E} :

↑(⇑(orthogonal_projection K) v) = v ↔ v ∈ K

A point equals its orthogonal projection if and only if it lies in the subspace.

theorem orthogonal_projection_map_apply {𝕜 : Type u_1} [is_R_or_C 𝕜] {E : Type u_2} {E' : Type u_3} [inner_product_space 𝕜 E] [inner_product_space 𝕜 E'] (f : E ≃ₗᵢ[𝕜] E') (p : submodule 𝕜 E) [finite_dimensional 𝕜 ↥p] (x : E') :

↑(⇑(orthogonal_projection (submodule.map ↑(f.to_linear_equiv) p)) x) = ⇑f ↑(⇑(orthogonal_projection p) (⇑(f.symm) x))

Orthogonal projection onto the submodule.map of a subspace.

@[simp]

theorem orthogonal_projection_bot {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] :

orthogonal_projection ⊥ = 0

The orthogonal projection onto the trivial submodule is the zero map.

theorem orthogonal_projection_norm_le {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] (K : submodule 𝕜 E) [complete_space ↥K] :

∥orthogonal_projection K∥ ≤ 1

The orthogonal projection has norm ≤ 1.

theorem smul_orthogonal_projection_singleton (𝕜 : Type u_1) {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] {v : E} (w : E) :

↑∥v∥ ^ 2 • ↑(⇑(orthogonal_projection (submodule.span 𝕜 {v})) w) = inner v w • v

theorem orthogonal_projection_singleton (𝕜 : Type u_1) {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] {v : E} (w : E) :

↑(⇑(orthogonal_projection (submodule.span 𝕜 {v})) w) = (inner v w / ↑∥v∥ ^ 2) • v

Formula for orthogonal projection onto a single vector.

theorem orthogonal_projection_unit_singleton (𝕜 : Type u_1) {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] {v : E} (hv : ∥v∥ = 1) (w : E) :

↑(⇑(orthogonal_projection (submodule.span 𝕜 {v})) w) = inner v w • v

Formula for orthogonal projection onto a single unit vector.

def reflection {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] (K : submodule 𝕜 E) [complete_space ↥K] :

E ≃ₗᵢ[𝕜] E

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.

Equations

reflection K = {to_linear_equiv := {to_fun := (linear_equiv.of_involutive (bit0 (K.subtype.comp (orthogonal_projection K).to_linear_map) - linear_map.id) _).to_fun, map_add' := _, map_smul' := _, inv_fun := (linear_equiv.of_involutive (bit0 (K.subtype.comp (orthogonal_projection K).to_linear_map) - linear_map.id) _).inv_fun, left_inv := _, right_inv := _}, norm_map' := _}

theorem reflection_apply {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] {K : submodule 𝕜 E} [complete_space ↥K] (p : E) :

⇑(reflection K) p = bit0 ↑(⇑(orthogonal_projection K) p) - p

The result of reflecting.

@[simp]

theorem reflection_symm {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] {K : submodule 𝕜 E} [complete_space ↥K] :

(reflection K).symm = reflection K

Reflection is its own inverse.

@[simp]

theorem reflection_reflection {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] (K : submodule 𝕜 E) [complete_space ↥K] (p : E) :

⇑(reflection K) (⇑(reflection K) p) = p

Reflecting twice in the same subspace.

theorem reflection_involutive {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] (K : submodule 𝕜 E) [complete_space ↥K] :

function.involutive ⇑(reflection K)

Reflection is involutive.

theorem reflection_eq_self_iff {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] {K : submodule 𝕜 E} [complete_space ↥K] (x : E) :

⇑(reflection K) x = x ↔ x ∈ K

A point is its own reflection if and only if it is in the subspace.

theorem reflection_mem_subspace_eq_self {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] {K : submodule 𝕜 E} [complete_space ↥K] {x : E} (hx : x ∈ K) :

⇑(reflection K) x = x

theorem reflection_map_apply {𝕜 : Type u_1} [is_R_or_C 𝕜] {E : Type u_2} {E' : Type u_3} [inner_product_space 𝕜 E] [inner_product_space 𝕜 E'] (f : E ≃ₗᵢ[𝕜] E') (K : submodule 𝕜 E) [finite_dimensional 𝕜 ↥K] (x : E') :

⇑(reflection (submodule.map ↑(f.to_linear_equiv) K)) x = ⇑f (⇑(reflection K) (⇑(f.symm) x))

Reflection in the submodule.map of a subspace.

theorem reflection_map {𝕜 : Type u_1} [is_R_or_C 𝕜] {E : Type u_2} {E' : Type u_3} [inner_product_space 𝕜 E] [inner_product_space 𝕜 E'] (f : E ≃ₗᵢ[𝕜] E') (K : submodule 𝕜 E) [finite_dimensional 𝕜 ↥K] :

reflection (submodule.map ↑(f.to_linear_equiv) K) = f.symm.trans ((reflection K).trans f)

Reflection in the submodule.map of a subspace.

@[simp]

theorem reflection_bot {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] :

reflection ⊥ = linear_isometry_equiv.neg 𝕜

Reflection through the trivial subspace {0} is just negation.

theorem submodule.sup_orthogonal_inf_of_is_complete {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] {K₁ K₂ : submodule 𝕜 E} (h : K₁ ≤ K₂) (hc : is_complete ↑K₁) :

K₁ ⊔ K₁ᗮ ⊓ K₂ = K₂

If K₁ is complete and contained in K₂, K₁ and K₁ᗮ ⊓ K₂ span K₂.

theorem submodule.sup_orthogonal_of_is_complete {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] {K : submodule 𝕜 E} (h : is_complete ↑K) :

K ⊔ Kᗮ = ⊤

If K is complete, K and Kᗮ span the whole space.

theorem submodule.sup_orthogonal_of_complete_space {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] {K : submodule 𝕜 E} [complete_space ↥K] :

K ⊔ Kᗮ = ⊤

If K is complete, K and Kᗮ span the whole space. Version using complete_space.

theorem submodule.exists_sum_mem_mem_orthogonal {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] (K : submodule 𝕜 E) [complete_space ↥K] (v : E) :

∃ (y : E) (H : y ∈ K) (z : E) (H : z ∈ Kᗮ), v = y + z

If K is complete, any v in E can be expressed as a sum of elements of K and Kᗮ.

@[simp]

theorem submodule.orthogonal_orthogonal {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] (K : submodule 𝕜 E) [complete_space ↥K] :

If K is complete, then the orthogonal complement of its orthogonal complement is itself.

theorem submodule.orthogonal_orthogonal_eq_closure {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] (K : submodule 𝕜 E) [complete_space E] :

Kᗮ ᗮ = K.topological_closure

theorem submodule.is_compl_orthogonal_of_is_complete {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] {K : submodule 𝕜 E} (h : is_complete ↑K) :

is_compl K Kᗮ

If K is complete, K and Kᗮ are complements of each other.

@[simp]

theorem submodule.orthogonal_eq_bot_iff {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] {K : submodule 𝕜 E} (hK : is_complete ↑K) :

Kᗮ = ⊥ ↔ K = ⊤

theorem eq_orthogonal_projection_of_mem_orthogonal {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] {K : submodule 𝕜 E} [complete_space ↥K] {u v : E} (hv : v ∈ K) (hvo : u - v ∈ Kᗮ) :

↑(⇑(orthogonal_projection K) u) = v

A point in K with the orthogonality property (here characterized in terms of Kᗮ) must be the orthogonal projection.

theorem eq_orthogonal_projection_of_mem_orthogonal' {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] {K : submodule 𝕜 E} [complete_space ↥K] {u v z : E} (hv : v ∈ K) (hz : z ∈ Kᗮ) (hu : u = v + z) :

↑(⇑(orthogonal_projection K) u) = v

A point in K with the orthogonality property (here characterized in terms of Kᗮ) must be the orthogonal projection.

theorem orthogonal_projection_mem_subspace_orthogonal_complement_eq_zero {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] {K : submodule 𝕜 E} [complete_space ↥K] {v : E} (hv : v ∈ Kᗮ) :

⇑(orthogonal_projection K) v = 0

The orthogonal projection onto K of an element of Kᗮ is zero.

theorem reflection_mem_subspace_orthogonal_complement_eq_neg {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] {K : submodule 𝕜 E} [complete_space ↥K] {v : E} (hv : v ∈ Kᗮ) :

⇑(reflection K) v = -v

The reflection in K of an element of Kᗮ is its negation.

theorem orthogonal_projection_mem_subspace_orthogonal_precomplement_eq_zero {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] {K : submodule 𝕜 E} [complete_space E] {v : E} (hv : v ∈ K) :

⇑(orthogonal_projection Kᗮ) v = 0

The orthogonal projection onto Kᗮ of an element of K is zero.

theorem reflection_mem_subspace_orthogonal_precomplement_eq_neg {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] {K : submodule 𝕜 E} [complete_space E] {v : E} (hv : v ∈ K) :

⇑(reflection Kᗮ) v = -v

The reflection in Kᗮ of an element of K is its negation.

theorem orthogonal_projection_orthogonal_complement_singleton_eq_zero {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] [complete_space E] (v : E) :

⇑(orthogonal_projection (submodule.span 𝕜 {v})ᗮ) v = 0

The orthogonal projection onto (𝕜 ∙ v)ᗮ of v is zero.

theorem reflection_orthogonal_complement_singleton_eq_neg {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] [complete_space E] (v : E) :

⇑(reflection (submodule.span 𝕜 {v})ᗮ) v = -v

The reflection in (𝕜 ∙ v)ᗮ of v is -v.

theorem eq_sum_orthogonal_projection_self_orthogonal_complement {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] (K : submodule 𝕜 E) [complete_space E] [complete_space ↥K] (w : E) :

w = ↑(⇑(orthogonal_projection K) w) + ↑(⇑(orthogonal_projection Kᗮ) w)

In a complete space E, a vector splits as the sum of its orthogonal projections onto a complete submodule K and onto the orthogonal complement of K.

theorem id_eq_sum_orthogonal_projection_self_orthogonal_complement {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] (K : submodule 𝕜 E) [complete_space E] [complete_space ↥K] :

continuous_linear_map.id 𝕜 E = K.subtypeL.comp (orthogonal_projection K) + Kᗮ.subtypeL.comp (orthogonal_projection Kᗮ)

In a complete space E, the projection maps onto a complete subspace K and its orthogonal complement sum to the identity.

theorem inner_orthogonal_projection_left_eq_right {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] (K : submodule 𝕜 E) [complete_space E] [complete_space ↥K] (u v : E) :

inner ↑(⇑(orthogonal_projection K) u) v = inner u ↑(⇑(orthogonal_projection K) v)

The orthogonal projection is self-adjoint.

theorem submodule.finrank_add_inf_finrank_orthogonal {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] {K₁ K₂ : submodule 𝕜 E} [finite_dimensional 𝕜 ↥K₂] (h : K₁ ≤ K₂) :

finite_dimensional.finrank 𝕜 ↥K₁ + finite_dimensional.finrank 𝕜 ↥(K₁ᗮ ⊓ K₂) = finite_dimensional.finrank 𝕜 ↥K₂

Given a finite-dimensional subspace K₂, and a subspace K₁ containined in it, the dimensions of K₁ and the intersection of its orthogonal subspace with K₂ add to that of K₂.

theorem submodule.finrank_add_inf_finrank_orthogonal' {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] {K₁ K₂ : submodule 𝕜 E} [finite_dimensional 𝕜 ↥K₂] (h : K₁ ≤ K₂) {n : ℕ} (h_dim : finite_dimensional.finrank 𝕜 ↥K₁ + n = finite_dimensional.finrank 𝕜 ↥K₂) :

finite_dimensional.finrank 𝕜 ↥(K₁ᗮ ⊓ K₂) = n

Given a finite-dimensional subspace K₂, and a subspace K₁ containined in it, the dimensions of K₁ and the intersection of its orthogonal subspace with K₂ add to that of K₂.

theorem submodule.finrank_add_finrank_orthogonal {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] [finite_dimensional 𝕜 E] {K : submodule 𝕜 E} :

finite_dimensional.finrank 𝕜 ↥K + finite_dimensional.finrank 𝕜 ↥Kᗮ = finite_dimensional.finrank 𝕜 E

Given a finite-dimensional space E and subspace K, the dimensions of K and Kᗮ add to that of E.

theorem submodule.finrank_add_finrank_orthogonal' {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] [finite_dimensional 𝕜 E] {K : submodule 𝕜 E} {n : ℕ} (h_dim : finite_dimensional.finrank 𝕜 ↥K + n = finite_dimensional.finrank 𝕜 E) :

finite_dimensional.finrank 𝕜 ↥Kᗮ = n

Given a finite-dimensional space E and subspace K, the dimensions of K and Kᗮ add to that of E.

theorem finrank_orthogonal_span_singleton {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] {n : ℕ} [fact (finite_dimensional.finrank 𝕜 E = n + 1)] {v : E} (hv : v ≠ 0) :

finite_dimensional.finrank 𝕜 ↥(submodule.span 𝕜 {v})ᗮ = n

In a finite-dimensional inner product space, the dimension of the orthogonal complement of the span of a nonzero vector is one less than the dimension of the space.

Existence of Hilbert basis, orthonormal basis, etc. #

theorem maximal_orthonormal_iff_orthogonal_complement_eq_bot {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] {v : set E} (hv : orthonormal 𝕜 coe) :

(∀ (u : set E), u ⊇ v → orthonormal 𝕜 coe → u = v) ↔ (submodule.span 𝕜 v)ᗮ = ⊥

An orthonormal set in an inner_product_space is maximal, if and only if the orthogonal complement of its span is empty.

theorem maximal_orthonormal_iff_dense_span {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] {v : set E} [complete_space E] (hv : orthonormal 𝕜 coe) :

(∀ (u : set E), u ⊇ v → orthonormal 𝕜 coe → u = v) ↔ (submodule.span 𝕜 v).topological_closure = ⊤

An orthonormal set in an inner_product_space is maximal, if and only if the closure of its span is the whole space.

theorem exists_subset_is_orthonormal_dense_span {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] {v : set E} [complete_space E] (hv : orthonormal 𝕜 coe) :

∃ (u : set E) (H : u ⊇ v), orthonormal 𝕜 coe ∧ (submodule.span 𝕜 u).topological_closure = ⊤

Any orthonormal subset can be extended to an orthonormal set whose span is dense.

theorem exists_is_orthonormal_dense_span (𝕜 : Type u_1) (E : Type u_2) [is_R_or_C 𝕜] [inner_product_space 𝕜 E] [complete_space E] :

∃ (u : set E), orthonormal 𝕜 coe ∧ (submodule.span 𝕜 u).topological_closure = ⊤

An inner product space admits an orthonormal set whose span is dense.

theorem maximal_orthonormal_iff_basis_of_finite_dimensional {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] {v : set E} [finite_dimensional 𝕜 E] (hv : orthonormal 𝕜 coe) :

(∀ (u : set E), u ⊇ v → orthonormal 𝕜 coe → u = v) ↔ ∃ (b : basis ↥v 𝕜 E), ⇑b = coe

An orthonormal set in a finite-dimensional inner_product_space is maximal, if and only if it is a basis.

theorem exists_subset_is_orthonormal_basis {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] {v : set E} [finite_dimensional 𝕜 E] (hv : orthonormal 𝕜 coe) :

∃ (u : set E) (H : u ⊇ v) (b : basis ↥u 𝕜 E), orthonormal 𝕜 ⇑b ∧ ⇑b = coe

In a finite-dimensional inner_product_space, any orthonormal subset can be extended to an orthonormal basis.

def orthonormal_basis_index (𝕜 : Type u_1) (E : Type u_2) [is_R_or_C 𝕜] [inner_product_space 𝕜 E] [finite_dimensional 𝕜 E] :

Index for an arbitrary orthonormal basis on a finite-dimensional inner_product_space.

Equations

orthonormal_basis_index 𝕜 E = classical.some _

def orthonormal_basis (𝕜 : Type u_1) (E : Type u_2) [is_R_or_C 𝕜] [inner_product_space 𝕜 E] [finite_dimensional 𝕜 E] :

basis ↥(orthonormal_basis_index 𝕜 E) 𝕜 E

A finite-dimensional inner_product_space has an orthonormal basis.

Equations

orthonormal_basis 𝕜 E = Exists.some _

theorem orthonormal_basis_orthonormal (𝕜 : Type u_1) (E : Type u_2) [is_R_or_C 𝕜] [inner_product_space 𝕜 E] [finite_dimensional 𝕜 E] :

orthonormal 𝕜 ⇑(orthonormal_basis 𝕜 E)

@[simp]

theorem coe_orthonormal_basis (𝕜 : Type u_1) (E : Type u_2) [is_R_or_C 𝕜] [inner_product_space 𝕜 E] [finite_dimensional 𝕜 E] :

⇑(orthonormal_basis 𝕜 E) = coe

@[instance]

def orthonormal_basis_index.fintype (𝕜 : Type u_1) (E : Type u_2) [is_R_or_C 𝕜] [inner_product_space 𝕜 E] [finite_dimensional 𝕜 E] :

fintype ↥(orthonormal_basis_index 𝕜 E)

Equations

orthonormal_basis_index.fintype 𝕜 E = is_noetherian.fintype_basis_index (orthonormal_basis 𝕜 E)

def fin_orthonormal_basis {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] [finite_dimensional 𝕜 E] {n : ℕ} (hn : finite_dimensional.finrank 𝕜 E = n) :

basis (fin n) 𝕜 E

An n-dimensional inner_product_space has an orthonormal basis indexed by fin n.

Equations

fin_orthonormal_basis hn = have h : fintype.card ↥(orthonormal_basis_index 𝕜 E) = n, from _, (orthonormal_basis 𝕜 E).reindex (fintype.equiv_fin_of_card_eq h)

theorem fin_orthonormal_basis_orthonormal {𝕜 : Type u_1} {E : Type u_2} [is_R_or_C 𝕜] [inner_product_space 𝕜 E] [finite_dimensional 𝕜 E] {n : ℕ} (hn : finite_dimensional.finrank 𝕜 E = n) :

orthonormal 𝕜 ⇑(fin_orthonormal_basis hn)