CodingTheory.Johnson.orthProj
defimported Lean
For $u,v$ in a real inner product space, $\mathrm{orthProj}(u,v) = v - \langle u,v\rangle u$, the projection of $v$ onto the orthogonal complement of $\mathrm{span}\{u\}$.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open scoped BigOperators RealInnerProductSpace in open Finset in open Classical in open scoped RealInnerProductSpace in open scoped InnerProductSpace in open Finset in open Classical in attribute [local instance] Classical.dec in noncomputable def CodingTheory.Johnson.orthProj {V : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] (u : V) (v : V) : V
- Defined in
- TCSlib, `CodingTheory.Johnson.orthProj`
- Lean proof
- By Allan Li, Frederick Dehmel, Hydroxyi (from the file's git history), from github.com/Shilun-Allan-Li/tcslib at
c8a02591b1e5(Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.25.0.CodingTheory.Johnson.orthProj← CodingTheory.Johnson.orthProj (TCSlib/ErrorCorrectingCodes/JohnsonBound.lean:245): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Used by 9
- CodingTheory.Johnson.rankin_bound_generalRankin bound in a finite-dimensional space. Let $V$ be a finite-dimensional real inner product space, and let $S$ be a finite set of…
- CodingTheory.Johnson.normalized_orthProj_inner_nonposNon-positive inner product of normalized projections off a unit vector. Let $u,v,w$ be vectors in a real inner product space with…
- CodingTheory.Johnson.mkProj_valUnderlying vector of the normalized projection. Let $V$ be a real inner product space, let $u \in V$ be a unit vector, and let $v \in V$.…
- CodingTheory.Johnson.norm_normalized_orthProjNormalizing the projection off a unit vector yields a unit vector. Let $u,v$ be unit vectors in a real inner product space, with…
- CodingTheory.Johnson.mkProjGiven a unit vector $u$, this packages the normalized projection $\norm{\mathrm{orthProj}(u,v)}^{-1}\mathrm{orthProj}(u,v)$ together with…
- CodingTheory.Johnson.normalized_orthProj_injectiveDistinct normalized projections off a unit vector. Let $u,v,w$ be unit vectors in a real inner product space satisfying…
- CodingTheory.Johnson.orthProj_mem_orthogonalProjection off a unit vector lands in the orthogonal complement. Let $V$ be a real inner product space, and let $u,v \in V$ with…
- CodingTheory.Johnson.orthProj_ne_zeroNonvanishing of the projection off a unit vector. Let $u$ and $v$ be unit vectors in a real inner product space, and suppose that…
- CodingTheory.Johnson.orthProj_inner_nonposProjection off a unit vector preserves nonpositive inner products. Let $V$ be a real inner product space, and let $u,v,w \in V$ with…
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open scoped BigOperators RealInnerProductSpace in open Finset in open Classical in open scoped RealInnerProductSpace in open scoped InnerProductSpace in open Finset in open Classical in attribute [local instance] Classical.dec in /-- Orthogonal projection onto the complement of span {u}. -/ noncomputable def CodingTheory.Johnson.orthProj {V : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] (u : V) (v : V) : V := v - (inner ℝ u v) • u /- PROVIDED SOLUTION Introduce x ∈ span {u}, get x = k•u via Submodule.mem_span_singleton. Then ⟪k•u, v - ⟪u,v⟫•u⟫ = k(⟪u,v⟫ - ⟪u,v⟫·⟪u,u⟫) = 0 since ⟪u,u⟫ = ‖u‖² = 1. -/