The orthogonal projection

Given a nonempty complete subspace K of an inner product space E, this file constructs orthogonalProjection K : E →L[𝕜] K, the orthogonal projection of E onto K. This map satisfies: for any point u in E, the point v = orthogonalProjection 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 • orthogonalProjection K u.

Basic API for orthogonalProjection and reflection is developed.

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

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:

Orthogonal projection in inner product spaces

theorem exists_norm_eq_iInf_of_complete_convex {F : Type u_3} [NormedAddCommGroup F] [InnerProductSpace ℝ F] {K : Set F} (ne : Set.Nonempty K) (h₁ : IsComplete K) (h₂ : Convex ℝ K) (u : F) : ∃ 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_iInf_iff_real_inner_le_zero {F : Type u_3} [NormedAddCommGroup F] [InnerProductSpace ℝ F] {K : Set F} (h : Convex ℝ K) {u : F} {v : F} (hv : v ∈ K) : ‖u - v‖ = ⨅ (w : ↑K), ‖u - ↑w‖ ↔ ∀ w ∈ K, ⟪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_iInf_of_complete_subspace {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] (K : Submodule 𝕜 E) (h : IsComplete ↑K) (u : E) : ∃ 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_iInf_iff_real_inner_eq_zero {F : Type u_3} [NormedAddCommGroup F] [InnerProductSpace ℝ F] (K : Submodule ℝ F) {u : F} {v : F} (hv : v ∈ K) : ‖u - v‖ = ⨅ (w : ↑↑K), ‖u - ↑w‖ ↔ ∀ w ∈ K, ⟪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_iInf_iff_inner_eq_zero that gives the same conclusion over any RCLike field.

theorem norm_eq_iInf_iff_inner_eq_zero {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] (K : Submodule 𝕜 E) {u : E} {v : E} (hv : v ∈ K) : ‖u - v‖ = ⨅ (w : ↥K), ‖u - ↑w‖ ↔ ∀ w ∈ K, ⟪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)

class HasOrthogonalProjection {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] (K : Submodule 𝕜 E) : Prop

A subspace K : Submodule 𝕜 E has an orthogonal projection if evey vector v : E admits an orthogonal projection to K.

• exists_orthogonal : ∀ (v : E), ∃ w ∈ K, v - w ∈ Kᗮ

instance HasOrthogonalProjection.ofCompleteSpace {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] (K : Submodule 𝕜 E) [CompleteSpace ↥K] : HasOrthogonalProjection K

Equations

• ⋯ = ⋯

instance instHasOrthogonalProjectionOrthogonal {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] (K : Submodule 𝕜 E) [HasOrthogonalProjection K] : HasOrthogonalProjection Kᗮ

Equations

• ⋯ = ⋯

instance HasOrthogonalProjection.map_linearIsometryEquiv {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] (K : Submodule 𝕜 E) [HasOrthogonalProjection K] {E' : Type u_4} [NormedAddCommGroup E'] [InnerProductSpace 𝕜 E'] (f : E ≃ₗᵢ[𝕜] E') : HasOrthogonalProjection (Submodule.map (↑f.toLinearEquiv) K)

Equations

• ⋯ = ⋯

instance HasOrthogonalProjection.map_linearIsometryEquiv' {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] (K : Submodule 𝕜 E) [HasOrthogonalProjection K] {E' : Type u_4} [NormedAddCommGroup E'] [InnerProductSpace 𝕜 E'] (f : E ≃ₗᵢ[𝕜] E') : HasOrthogonalProjection (Submodule.map (LinearIsometryEquiv.toLinearIsometry f) K)

Equations

• ⋯ = ⋯

instance instHasOrthogonalProjectionTopSubmoduleToSemiringToDivisionSemiringToSemifieldToFieldToNormedFieldToDenselyNormedFieldToAddCommMonoidToAddCommGroupToModuleToSeminormedAddCommGroupToNormedSpaceInstTopSubmodule {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] : HasOrthogonalProjection ⊤

Equations

• ⋯ = ⋯

def orthogonalProjectionFn {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] (K : Submodule 𝕜 E) [HasOrthogonalProjection 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 orthogonalProjection and should not be used once that is defined.

Equations

• orthogonalProjectionFn K v = Exists.choose ⋯

theorem orthogonalProjectionFn_mem {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} [HasOrthogonalProjection K] (v : E) : orthogonalProjectionFn 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 orthogonalProjectionFn_inner_eq_zero {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} [HasOrthogonalProjection K] (v : E) (w : E) : w ∈ K → ⟪v - orthogonalProjectionFn 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_orthogonalProjectionFn_of_mem_of_inner_eq_zero {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} [HasOrthogonalProjection K] {u : E} {v : E} (hvm : v ∈ K) (hvo : ∀ w ∈ K, ⟪u - v, w⟫_𝕜 = 0) : orthogonalProjectionFn 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 orthogonalProjectionFn_norm_sq {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] (K : Submodule 𝕜 E) [HasOrthogonalProjection K] (v : E) : ‖v‖ * ‖v‖ = ‖v - orthogonalProjectionFn K v‖ * ‖v - orthogonalProjectionFn K v‖ + ‖orthogonalProjectionFn K v‖ * ‖orthogonalProjectionFn K v‖

def orthogonalProjection {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] (K : Submodule 𝕜 E) [HasOrthogonalProjection K] : E →L[𝕜] ↥K

The orthogonal projection onto a complete subspace.

Equations

• orthogonalProjection K = LinearMap.mkContinuous { toAddHom := { toFun := fun (v : E) => { val := orthogonalProjectionFn K v, property := ⋯ }, map_add' := ⋯ }, map_smul' := ⋯ } 1 ⋯

@[simp]

theorem orthogonalProjectionFn_eq {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} [HasOrthogonalProjection K] (v : E) : orthogonalProjectionFn K v = ↑((orthogonalProjection K) v)

@[simp]

theorem orthogonalProjection_inner_eq_zero {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} [HasOrthogonalProjection K] (v : E) (w : E) : w ∈ K → ⟪v - ↑((orthogonalProjection K) v), w⟫_𝕜 = 0

The characterization of the orthogonal projection.

@[simp]

theorem sub_orthogonalProjection_mem_orthogonal {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} [HasOrthogonalProjection K] (v : E) : v - ↑((orthogonalProjection K) v) ∈ Kᗮ

The difference of v from its orthogonal projection onto K is in Kᗮ.

theorem eq_orthogonalProjection_of_mem_of_inner_eq_zero {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} [HasOrthogonalProjection K] {u : E} {v : E} (hvm : v ∈ K) (hvo : ∀ w ∈ K, ⟪u - v, w⟫_𝕜 = 0) : ↑((orthogonalProjection K) u) = v

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

theorem eq_orthogonalProjection_of_mem_orthogonal {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} [HasOrthogonalProjection K] {u : E} {v : E} (hv : v ∈ K) (hvo : u - v ∈ Kᗮ) : ↑((orthogonalProjection K) u) = v

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

theorem eq_orthogonalProjection_of_mem_orthogonal' {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} [HasOrthogonalProjection K] {u : E} {v : E} {z : E} (hv : v ∈ K) (hz : z ∈ Kᗮ) (hu : u = v + z) : ↑((orthogonalProjection K) u) = v

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

@[simp]

theorem orthogonalProjection_orthogonal_val {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} [HasOrthogonalProjection K] (u : E) : ↑((orthogonalProjection Kᗮ) u) = u - ↑((orthogonalProjection K) u)

theorem orthogonalProjection_orthogonal {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} [HasOrthogonalProjection K] (u : E) : (orthogonalProjection Kᗮ) u = { val := u - ↑((orthogonalProjection K) u), property := ⋯ }

theorem orthogonalProjection_minimal {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {U : Submodule 𝕜 E} [HasOrthogonalProjection U] (y : E) : ‖y - ↑((orthogonalProjection U) y)‖ = ⨅ (x : ↥U), ‖y - ↑x‖

The orthogonal projection of y on U minimizes the distance ‖y - x‖ for x ∈ U.

theorem eq_orthogonalProjection_of_eq_submodule {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} [HasOrthogonalProjection K] {K' : Submodule 𝕜 E} [HasOrthogonalProjection K'] (h : K = K') (u : E) : ↑((orthogonalProjection K) u) = ↑((orthogonalProjection K') u)

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

@[simp]

theorem orthogonalProjection_mem_subspace_eq_self {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} [HasOrthogonalProjection K] (v : ↥K) : (orthogonalProjection K) ↑v = v

The orthogonal projection sends elements of K to themselves.

theorem orthogonalProjection_eq_self_iff {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} [HasOrthogonalProjection K] {v : E} : ↑((orthogonalProjection K) v) = v ↔ v ∈ K

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

@[simp]

theorem orthogonalProjection_eq_zero_iff {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} [HasOrthogonalProjection K] {v : E} : (orthogonalProjection K) v = 0 ↔ v ∈ Kᗮ

@[simp]

theorem ker_orthogonalProjection {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} [HasOrthogonalProjection K] : LinearMap.ker (orthogonalProjection K) = Kᗮ

theorem LinearIsometry.map_orthogonalProjection {𝕜 : Type u_1} [RCLike 𝕜] {E : Type u_4} {E' : Type u_5} [NormedAddCommGroup E] [NormedAddCommGroup E'] [InnerProductSpace 𝕜 E] [InnerProductSpace 𝕜 E'] (f : E →ₗᵢ[𝕜] E') (p : Submodule 𝕜 E) [HasOrthogonalProjection p] [HasOrthogonalProjection (Submodule.map f.toLinearMap p)] (x : E) : f ↑((orthogonalProjection p) x) = ↑((orthogonalProjection (Submodule.map f.toLinearMap p)) (f x))

theorem LinearIsometry.map_orthogonalProjection' {𝕜 : Type u_1} [RCLike 𝕜] {E : Type u_4} {E' : Type u_5} [NormedAddCommGroup E] [NormedAddCommGroup E'] [InnerProductSpace 𝕜 E] [InnerProductSpace 𝕜 E'] (f : E →ₗᵢ[𝕜] E') (p : Submodule 𝕜 E) [HasOrthogonalProjection p] [HasOrthogonalProjection (Submodule.map f p)] (x : E) : f ↑((orthogonalProjection p) x) = ↑((orthogonalProjection (Submodule.map f p)) (f x))

theorem orthogonalProjection_map_apply {𝕜 : Type u_1} [RCLike 𝕜] {E : Type u_4} {E' : Type u_5} [NormedAddCommGroup E] [NormedAddCommGroup E'] [InnerProductSpace 𝕜 E] [InnerProductSpace 𝕜 E'] (f : E ≃ₗᵢ[𝕜] E') (p : Submodule 𝕜 E) [HasOrthogonalProjection p] (x : E') : ↑((orthogonalProjection (Submodule.map (↑f.toLinearEquiv) p)) x) = f ↑((orthogonalProjection p) ((LinearIsometryEquiv.symm f) x))

Orthogonal projection onto the Submodule.map of a subspace.

@[simp]

theorem orthogonalProjection_bot {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] : orthogonalProjection ⊥ = 0

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

theorem orthogonalProjection_norm_le {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] (K : Submodule 𝕜 E) [HasOrthogonalProjection K] : ‖orthogonalProjection K‖ ≤ 1

The orthogonal projection has norm ≤ 1.

theorem smul_orthogonalProjection_singleton (𝕜 : Type u_1) {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {v : E} (w : E) : ↑(‖v‖ ^ 2) • ↑((orthogonalProjection (Submodule.span 𝕜 {v})) w) = ⟪v, w⟫_𝕜 • v

theorem orthogonalProjection_singleton (𝕜 : Type u_1) {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {v : E} (w : E) : ↑((orthogonalProjection (Submodule.span 𝕜 {v})) w) = (⟪v, w⟫_𝕜 / ↑(‖v‖ ^ 2)) • v

Formula for orthogonal projection onto a single vector.

theorem orthogonalProjection_unit_singleton (𝕜 : Type u_1) {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {v : E} (hv : ‖v‖ = 1) (w : E) : ↑((orthogonalProjection (Submodule.span 𝕜 {v})) w) = ⟪v, w⟫_𝕜 • v

Formula for orthogonal projection onto a single unit vector.

def reflectionLinearEquiv {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] (K : Submodule 𝕜 E) [HasOrthogonalProjection K] : E ≃ₗ[𝕜] E

Auxiliary definition for reflection: the reflection as a linear equivalence.

Equations

• reflectionLinearEquiv K = LinearEquiv.ofInvolutive (2 • Submodule.subtype K ∘ₗ ↑(orthogonalProjection K) - LinearMap.id) ⋯

def reflection {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] (K : Submodule 𝕜 E) [HasOrthogonalProjection 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 = let __src := reflectionLinearEquiv K; { toLinearEquiv := __src, norm_map' := ⋯ }

theorem reflection_apply {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} [HasOrthogonalProjection K] (p : E) : (reflection K) p = 2 • ↑((orthogonalProjection K) p) - p

The result of reflecting.

@[simp]

theorem reflection_symm {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} [HasOrthogonalProjection K] : LinearIsometryEquiv.symm (reflection K) = reflection K

Reflection is its own inverse.

@[simp]

theorem reflection_inv {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} [HasOrthogonalProjection K] : (reflection K)⁻¹ = reflection K

Reflection is its own inverse.

@[simp]

theorem reflection_reflection {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] (K : Submodule 𝕜 E) [HasOrthogonalProjection 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} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] (K : Submodule 𝕜 E) [HasOrthogonalProjection K] : Function.Involutive ⇑(reflection K)

Reflection is involutive.

@[simp]

theorem reflection_trans_reflection {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] (K : Submodule 𝕜 E) [HasOrthogonalProjection K] : LinearIsometryEquiv.trans (reflection K) (reflection K) = LinearIsometryEquiv.refl 𝕜 E

Reflection is involutive.

@[simp]

theorem reflection_mul_reflection {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] (K : Submodule 𝕜 E) [HasOrthogonalProjection K] : reflection K * reflection K = 1

Reflection is involutive.

theorem reflection_orthogonal_apply {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] (K : Submodule 𝕜 E) [HasOrthogonalProjection K] (v : E) : (reflection Kᗮ) v = -(reflection K) v

theorem reflection_orthogonal {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] (K : Submodule 𝕜 E) [HasOrthogonalProjection K] : reflection Kᗮ = LinearIsometryEquiv.trans (reflection K) (LinearIsometryEquiv.neg 𝕜)

theorem reflection_singleton_apply {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] (u : E) (v : E) : (reflection (Submodule.span 𝕜 {u})) v = 2 • (⟪u, v⟫_𝕜 / ↑‖u‖ ^ 2) • u - v

theorem reflection_eq_self_iff {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} [HasOrthogonalProjection 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} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} [HasOrthogonalProjection K] {x : E} (hx : x ∈ K) : (reflection K) x = x

theorem reflection_map_apply {𝕜 : Type u_1} [RCLike 𝕜] {E : Type u_4} {E' : Type u_5} [NormedAddCommGroup E] [NormedAddCommGroup E'] [InnerProductSpace 𝕜 E] [InnerProductSpace 𝕜 E'] (f : E ≃ₗᵢ[𝕜] E') (K : Submodule 𝕜 E) [HasOrthogonalProjection K] (x : E') : (reflection (Submodule.map (↑f.toLinearEquiv) K)) x = f ((reflection K) ((LinearIsometryEquiv.symm f) x))

Reflection in the Submodule.map of a subspace.

theorem reflection_map {𝕜 : Type u_1} [RCLike 𝕜] {E : Type u_4} {E' : Type u_5} [NormedAddCommGroup E] [NormedAddCommGroup E'] [InnerProductSpace 𝕜 E] [InnerProductSpace 𝕜 E'] (f : E ≃ₗᵢ[𝕜] E') (K : Submodule 𝕜 E) [HasOrthogonalProjection K] : reflection (Submodule.map (↑f.toLinearEquiv) K) = LinearIsometryEquiv.trans (LinearIsometryEquiv.symm f) (LinearIsometryEquiv.trans (reflection K) f)

Reflection in the Submodule.map of a subspace.

@[simp]

theorem reflection_bot {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] : reflection ⊥ = LinearIsometryEquiv.neg 𝕜

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

theorem Submodule.sup_orthogonal_inf_of_completeSpace {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K₁ : Submodule 𝕜 E} {K₂ : Submodule 𝕜 E} (h : K₁ ≤ K₂) [HasOrthogonalProjection K₁] : K₁ ⊔ K₁ᗮ ⊓ K₂ = K₂

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

theorem Submodule.sup_orthogonal_of_completeSpace {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} [HasOrthogonalProjection K] : K ⊔ Kᗮ = ⊤

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

theorem Submodule.exists_add_mem_mem_orthogonal {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] (K : Submodule 𝕜 E) [HasOrthogonalProjection K] (v : E) : ∃ y ∈ K, ∃ 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} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] (K : Submodule 𝕜 E) [HasOrthogonalProjection K] : Kᗮᗮ = K

If K admits an orthogonal projection, then the orthogonal complement of its orthogonal complement is itself.

theorem Submodule.orthogonal_orthogonal_eq_closure {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] (K : Submodule 𝕜 E) [CompleteSpace E] : Kᗮᗮ = Submodule.topologicalClosure K

In a Hilbert space, the orthogonal complement of the orthogonal complement of a subspace K is the topological closure of K.

Note that the completeness assumption is necessary. Let E be the space ℕ →₀ ℝ with inner space structure inherited from PiLp 2 (fun _ : ℕ ↦ ℝ). Let K be the subspace of sequences with the sum of all elements equal to zero. Then Kᗮ = ⊥, Kᗮᗮ = ⊤.

theorem Submodule.isCompl_orthogonal_of_completeSpace {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} [HasOrthogonalProjection K] : IsCompl K Kᗮ

If K admits an orthogonal projection, K and Kᗮ are complements of each other.

@[simp]

theorem Submodule.orthogonal_eq_bot_iff {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} [HasOrthogonalProjection K] : Kᗮ = ⊥ ↔ K = ⊤

theorem orthogonalProjection_mem_subspace_orthogonalComplement_eq_zero {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} [HasOrthogonalProjection K] {v : E} (hv : v ∈ Kᗮ) : (orthogonalProjection K) v = 0

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

theorem Submodule.IsOrtho.orthogonalProjection_comp_subtypeL {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {U : Submodule 𝕜 E} {V : Submodule 𝕜 E} [HasOrthogonalProjection U] (h : U ⟂ V) : ContinuousLinearMap.comp (orthogonalProjection U) (Submodule.subtypeL V) = 0

The projection into U from an orthogonal submodule V is the zero map.

theorem orthogonalProjection_comp_subtypeL_eq_zero_iff {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {U : Submodule 𝕜 E} {V : Submodule 𝕜 E} [HasOrthogonalProjection U] : ContinuousLinearMap.comp (orthogonalProjection U) (Submodule.subtypeL V) = 0 ↔ U ⟂ V

The projection into U from V is the zero map if and only if U and V are orthogonal.

theorem orthogonalProjection_eq_linear_proj {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} [HasOrthogonalProjection K] (x : E) : (orthogonalProjection K) x = (Submodule.linearProjOfIsCompl K Kᗮ ⋯) x

theorem orthogonalProjection_coe_linearMap_eq_linearProj {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} [HasOrthogonalProjection K] : ↑(orthogonalProjection K) = Submodule.linearProjOfIsCompl K Kᗮ ⋯

theorem reflection_mem_subspace_orthogonalComplement_eq_neg {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} [HasOrthogonalProjection K] {v : E} (hv : v ∈ Kᗮ) : (reflection K) v = -v

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

theorem orthogonalProjection_mem_subspace_orthogonal_precomplement_eq_zero {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} [HasOrthogonalProjection Kᗮ] {v : E} (hv : v ∈ K) : (orthogonalProjection Kᗮ) v = 0

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

theorem orthogonalProjection_orthogonalProjection_of_le {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {U : Submodule 𝕜 E} {V : Submodule 𝕜 E} [HasOrthogonalProjection U] [HasOrthogonalProjection V] (h : U ≤ V) (x : E) : (orthogonalProjection U) ↑((orthogonalProjection V) x) = (orthogonalProjection U) x

If U ≤ V, then projecting on V and then on U is the same as projecting on U.

theorem orthogonalProjection_tendsto_closure_iSup {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] [CompleteSpace E] {ι : Type u_4} [SemilatticeSup ι] (U : ι → Submodule 𝕜 E) [∀ (i : ι), CompleteSpace ↥(U i)] (hU : Monotone U) (x : E) : Filter.Tendsto (fun (i : ι) => ↑((orthogonalProjection (U i)) x)) Filter.atTop (nhds ↑((orthogonalProjection (Submodule.topologicalClosure (⨆ (i : ι), U i))) x))

Given a monotone family U of complete submodules of E and a fixed x : E, the orthogonal projection of x on U i tends to the orthogonal projection of x on (⨆ i, U i).topologicalClosure along atTop.

theorem orthogonalProjection_tendsto_self {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] [CompleteSpace E] {ι : Type u_4} [SemilatticeSup ι] (U : ι → Submodule 𝕜 E) [∀ (t : ι), CompleteSpace ↥(U t)] (hU : Monotone U) (x : E) (hU' : ⊤ ≤ Submodule.topologicalClosure (⨆ (t : ι), U t)) : Filter.Tendsto (fun (t : ι) => ↑((orthogonalProjection (U t)) x)) Filter.atTop (nhds x)

Given a monotone family U of complete submodules of E with dense span supremum, and a fixed x : E, the orthogonal projection of x on U i tends to x along at_top.

theorem Submodule.triorthogonal_eq_orthogonal {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} [CompleteSpace E] : Kᗮᗮᗮ = Kᗮ

The orthogonal complement satisfies Kᗮᗮᗮ = Kᗮ.

theorem Submodule.topologicalClosure_eq_top_iff {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} [CompleteSpace E] : Submodule.topologicalClosure K = ⊤ ↔ Kᗮ = ⊥

The closure of K is the full space iff Kᗮ is trivial.

theorem Dense.eq_zero_of_inner_left {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} {x : E} (hK : Dense ↑K) (h : ∀ (v : ↥K), ⟪x, ↑v⟫_𝕜 = 0) : x = 0

theorem Dense.eq_zero_of_mem_orthogonal {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} {x : E} (hK : Dense ↑K) (h : x ∈ Kᗮ) : x = 0

theorem Dense.eq_of_sub_mem_orthogonal {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} {x : E} {y : E} (hK : Dense ↑K) (h : x - y ∈ Kᗮ) : x = y

If S is dense and x - y ∈ Kᗮ, then x = y.

theorem Dense.eq_of_inner_left {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} {x : E} {y : E} (hK : Dense ↑K) (h : ∀ (v : ↥K), ⟪x, ↑v⟫_𝕜 = ⟪y, ↑v⟫_𝕜) : x = y

theorem Dense.eq_of_inner_right {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} {x : E} {y : E} (hK : Dense ↑K) (h : ∀ (v : ↥K), ⟪↑v, x⟫_𝕜 = ⟪↑v, y⟫_𝕜) : x = y

theorem Dense.eq_zero_of_inner_right {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} {x : E} (hK : Dense ↑K) (h : ∀ (v : ↥K), ⟪↑v, x⟫_𝕜 = 0) : x = 0

theorem reflection_mem_subspace_orthogonal_precomplement_eq_neg {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K : Submodule 𝕜 E} [HasOrthogonalProjection K] {v : E} (hv : v ∈ K) : (reflection Kᗮ) v = -v

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

theorem orthogonalProjection_orthogonalComplement_singleton_eq_zero {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] (v : E) : (orthogonalProjection (Submodule.span 𝕜 {v})ᗮ) v = 0

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

theorem reflection_orthogonalComplement_singleton_eq_neg {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] (v : E) : (reflection (Submodule.span 𝕜 {v})ᗮ) v = -v

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

theorem reflection_sub {F : Type u_3} [NormedAddCommGroup F] [InnerProductSpace ℝ F] {v : F} {w : F} (h : ‖v‖ = ‖w‖) : (reflection (Submodule.span ℝ {v - w})ᗮ) v = w

theorem orthogonalProjection_add_orthogonalProjection_orthogonal {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] (K : Submodule 𝕜 E) [HasOrthogonalProjection K] (w : E) : ↑((orthogonalProjection K) w) + ↑((orthogonalProjection Kᗮ) w) = w

If the orthogonal projection to K is well-defined, then a vector splits as the sum of its orthogonal projections onto a complete submodule K and onto the orthogonal complement of K.

theorem norm_sq_eq_add_norm_sq_projection {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] (x : E) (S : Submodule 𝕜 E) [HasOrthogonalProjection S] : ‖x‖ ^ 2 = ‖(orthogonalProjection S) x‖ ^ 2 + ‖(orthogonalProjection Sᗮ) x‖ ^ 2

The Pythagorean theorem, for an orthogonal projection.

theorem id_eq_sum_orthogonalProjection_self_orthogonalComplement {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] (K : Submodule 𝕜 E) [HasOrthogonalProjection K] : ContinuousLinearMap.id 𝕜 E = ContinuousLinearMap.comp (Submodule.subtypeL K) (orthogonalProjection K) + ContinuousLinearMap.comp (Submodule.subtypeL Kᗮ) (orthogonalProjection Kᗮ)

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

@[simp]

theorem inner_orthogonalProjection_eq_of_mem_right {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] (K : Submodule 𝕜 E) [HasOrthogonalProjection K] (u : ↥K) (v : E) : ⟪(orthogonalProjection K) v, u⟫_𝕜 = ⟪v, ↑u⟫_𝕜

@[simp]

theorem inner_orthogonalProjection_eq_of_mem_left {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] (K : Submodule 𝕜 E) [HasOrthogonalProjection K] (u : ↥K) (v : E) : ⟪u, (orthogonalProjection K) v⟫_𝕜 = ⟪↑u, v⟫_𝕜

theorem inner_orthogonalProjection_left_eq_right {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] (K : Submodule 𝕜 E) [HasOrthogonalProjection K] (u : E) (v : E) : ⟪↑((orthogonalProjection K) u), v⟫_𝕜 = ⟪u, ↑((orthogonalProjection K) v)⟫_𝕜

The orthogonal projection is self-adjoint.

theorem orthogonalProjection_isSymmetric {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] (K : Submodule 𝕜 E) [HasOrthogonalProjection K] : LinearMap.IsSymmetric ↑(ContinuousLinearMap.comp (Submodule.subtypeL K) (orthogonalProjection K))

The orthogonal projection is symmetric.

theorem Submodule.finrank_add_inf_finrank_orthogonal {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K₁ : Submodule 𝕜 E} {K₂ : Submodule 𝕜 E} [FiniteDimensional 𝕜 ↥K₂] (h : K₁ ≤ K₂) : FiniteDimensional.finrank 𝕜 ↥K₁ + FiniteDimensional.finrank 𝕜 ↥(K₁ᗮ ⊓ K₂) = FiniteDimensional.finrank 𝕜 ↥K₂

Given a finite-dimensional subspace K₂, and a subspace K₁ contained 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} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {K₁ : Submodule 𝕜 E} {K₂ : Submodule 𝕜 E} [FiniteDimensional 𝕜 ↥K₂] (h : K₁ ≤ K₂) {n : ℕ} (h_dim : FiniteDimensional.finrank 𝕜 ↥K₁ + n = FiniteDimensional.finrank 𝕜 ↥K₂) : FiniteDimensional.finrank 𝕜 ↥(K₁ᗮ ⊓ K₂) = n

Given a finite-dimensional subspace K₂, and a subspace K₁ contained 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} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] [FiniteDimensional 𝕜 E] (K : Submodule 𝕜 E) : FiniteDimensional.finrank 𝕜 ↥K + FiniteDimensional.finrank 𝕜 ↥Kᗮ = FiniteDimensional.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} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] [FiniteDimensional 𝕜 E] {K : Submodule 𝕜 E} {n : ℕ} (h_dim : FiniteDimensional.finrank 𝕜 ↥K + n = FiniteDimensional.finrank 𝕜 E) : FiniteDimensional.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} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {n : ℕ} [_i : Fact (FiniteDimensional.finrank 𝕜 E = n + 1)] {v : E} (hv : v ≠ 0) : FiniteDimensional.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.

theorem LinearIsometryEquiv.reflections_generate_dim_aux {F : Type u_3} [NormedAddCommGroup F] [InnerProductSpace ℝ F] [FiniteDimensional ℝ F] {n : ℕ} (φ : F ≃ₗᵢ[ℝ] F) (hn : FiniteDimensional.finrank ℝ ↥(LinearMap.ker (ContinuousLinearMap.id ℝ F - ↑{ toLinearEquiv := φ.toLinearEquiv, continuous_toFun := ⋯, continuous_invFun := ⋯ }))ᗮ ≤ n) : ∃ (l : List F), List.length l ≤ n ∧ φ = List.prod (List.map (fun (v : F) => reflection (Submodule.span ℝ {v})ᗮ) l)

An element φ of the orthogonal group of F can be factored as a product of reflections, and specifically at most as many reflections as the dimension of the complement of the fixed subspace of φ.

theorem LinearIsometryEquiv.reflections_generate_dim {F : Type u_3} [NormedAddCommGroup F] [InnerProductSpace ℝ F] [FiniteDimensional ℝ F] (φ : F ≃ₗᵢ[ℝ] F) : ∃ (l : List F), List.length l ≤ FiniteDimensional.finrank ℝ F ∧ φ = List.prod (List.map (fun (v : F) => reflection (Submodule.span ℝ {v})ᗮ) l)

The orthogonal group of F is generated by reflections; specifically each element φ of the orthogonal group is a product of at most as many reflections as the dimension of F.

Special case of the Cartan–Dieudonné theorem.

theorem LinearIsometryEquiv.reflections_generate {F : Type u_3} [NormedAddCommGroup F] [InnerProductSpace ℝ F] [FiniteDimensional ℝ F] : Subgroup.closure (Set.range fun (v : F) => reflection (Submodule.span ℝ {v})ᗮ) = ⊤

The orthogonal group of F is generated by reflections.

theorem OrthogonalFamily.isInternal_iff_of_isComplete {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {ι : Type u_4} [DecidableEq ι] {V : ι → Submodule 𝕜 E} (hV : OrthogonalFamily 𝕜 (fun (i : ι) => ↥(V i)) fun (i : ι) => Submodule.subtypeₗᵢ (V i)) (hc : IsComplete ↑(iSup V)) : DirectSum.IsInternal V ↔ (iSup V)ᗮ = ⊥

An orthogonal family of subspaces of E satisfies DirectSum.IsInternal (that is, they provide an internal direct sum decomposition of E) if and only if their span has trivial orthogonal complement.

theorem OrthogonalFamily.isInternal_iff {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {ι : Type u_4} [DecidableEq ι] [FiniteDimensional 𝕜 E] {V : ι → Submodule 𝕜 E} (hV : OrthogonalFamily 𝕜 (fun (i : ι) => ↥(V i)) fun (i : ι) => Submodule.subtypeₗᵢ (V i)) : DirectSum.IsInternal V ↔ (iSup V)ᗮ = ⊥

An orthogonal family of subspaces of E satisfies DirectSum.IsInternal (that is, they provide an internal direct sum decomposition of E) if and only if their span has trivial orthogonal complement.

theorem OrthogonalFamily.sum_projection_of_mem_iSup {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {ι : Type u_4} [Fintype ι] {V : ι → Submodule 𝕜 E} [∀ (i : ι), CompleteSpace ↥(V i)] (hV : OrthogonalFamily 𝕜 (fun (i : ι) => ↥(V i)) fun (i : ι) => Submodule.subtypeₗᵢ (V i)) (x : E) (hx : x ∈ iSup V) : (Finset.sum Finset.univ fun (i : ι) => ↑((orthogonalProjection (V i)) x)) = x

If x lies within an orthogonal family v, it can be expressed as a sum of projections.

theorem OrthogonalFamily.projection_directSum_coeAddHom {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {ι : Type u_4} [DecidableEq ι] {V : ι → Submodule 𝕜 E} (hV : OrthogonalFamily 𝕜 (fun (i : ι) => ↥(V i)) fun (i : ι) => Submodule.subtypeₗᵢ (V i)) (x : DirectSum ι fun (i : ι) => ↥(V i)) (i : ι) [CompleteSpace ↥(V i)] : (orthogonalProjection (V i)) ((DirectSum.coeAddMonoidHom V) x) = x i

If a family of submodules is orthogonal, then the orthogonalProjection on a direct sum is just the coefficient of that direct sum.

@[reducible]

def OrthogonalFamily.decomposition {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {ι : Type u_4} [DecidableEq ι] [Fintype ι] {V : ι → Submodule 𝕜 E} [∀ (i : ι), CompleteSpace ↥(V i)] (hV : OrthogonalFamily 𝕜 (fun (i : ι) => ↥(V i)) fun (i : ι) => Submodule.subtypeₗᵢ (V i)) (h : iSup V = ⊤) : DirectSum.Decomposition V

If a family of submodules is orthogonal and they span the whole space, then the orthogonal projection provides a means to decompose the space into its submodules.

The projection function is decompose V x i = orthogonalProjection (V i) x.

See note [reducible non-instances].

Equations

• OrthogonalFamily.decomposition hV h = { decompose' := fun (x : E) => DFinsupp.equivFunOnFintype.symm fun (i : ι) => (orthogonalProjection (V i)) x, left_inv := ⋯, right_inv := ⋯ }

theorem maximal_orthonormal_iff_orthogonalComplement_eq_bot {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {v : Set E} (hv : Orthonormal 𝕜 Subtype.val) : (∀ u ⊇ v, Orthonormal 𝕜 Subtype.val → u = v) ↔ (Submodule.span 𝕜 v)ᗮ = ⊥

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

theorem maximal_orthonormal_iff_basis_of_finiteDimensional {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {v : Set E} [FiniteDimensional 𝕜 E] (hv : Orthonormal 𝕜 Subtype.val) : (∀ u ⊇ v, Orthonormal 𝕜 Subtype.val → u = v) ↔ ∃ (b : Basis (↑v) 𝕜 E), ⇑b = Subtype.val

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