CodingTheory.Johnson.mkProj_val
theoremverifiedimported Lean
Underlying 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$. Write $w = v - \langle u, v\rangle\, u$ for the component of $v$ orthogonal to $u$. The normalized vector $\norm{w}^{-1} w$, regarded as an element of the orthogonal complement $(\mathrm{span}_{\bbr}\{u\})^{\perp}$ of the line spanned by $u$, has underlying vector in $V$ equal to $\norm{w}^{-1} w$.
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 lemma CodingTheory.Johnson.mkProj_val {V : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] (u : V) (hu : ‖u‖ = 1) (v : V) : ((mkProj u hu v : (↑(Submodule.span ℝ {u})ᗮ)) : V) = ‖orthProj u v‖⁻¹ • orthProj u v
- Source
- TCSlib, `CodingTheory.Johnson.mkProj_val`
- 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.mkProj_val← CodingTheory.Johnson.mkProj_val (TCSlib/ErrorCorrectingCodes/JohnsonBound.lean:360): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- CodingTheory.Johnson.orthProjFor $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…
- CodingTheory.Johnson.mkProjGiven a unit vector $u$, this packages the normalized projection $\norm{\mathrm{orthProj}(u,v)}^{-1}\mathrm{orthProj}(u,v)$ together with…
- Used by 1
- 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…
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 lemma CodingTheory.Johnson.mkProj_val {V : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] (u : V) (hu : ‖u‖ = 1) (v : V) : ((mkProj u hu v : (↑(Submodule.span ℝ {u})ᗮ)) : V) = ‖orthProj u v‖⁻¹ • orthProj u v := rfl