CodingTheory.Johnson.orthProj_ne_zero
theoremverifiedimported Lean
Nonvanishing of the projection off a unit vector. Let $u$ and $v$ be unit vectors in a real inner product space, and suppose that $v \neq u$ and $v \neq -u$. Then the projection of $v$ onto the orthogonal complement of $\mathrm{span}\{u\}$, namely $v - \langle u,v\rangle\, u$, is nonzero.
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.orthProj_ne_zero {V : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] (u v : V) (hu : ‖u‖ = 1) (hv : ‖v‖ = 1) (hne1 : v ≠ u) (hne2 : v ≠ -u) : orthProj u v ≠ 0
- Source
- TCSlib, `CodingTheory.Johnson.orthProj_ne_zero`
- 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_ne_zero← CodingTheory.Johnson.orthProj_ne_zero (TCSlib/ErrorCorrectingCodes/JohnsonBound.lean:265): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- 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…
- Used by 3
- 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.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.normalized_orthProj_injectiveDistinct normalized projections off a unit vector. Let $u,v,w$ be unit vectors in a real inner product space satisfying…
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inopen scoped BigOperators RealInnerProductSpace inopen Finset inopen Classical inopen scoped RealInnerProductSpace inopen scoped InnerProductSpace inopen Finset inopen Classical inattribute [local instance] Classical.dec inlemma CodingTheory.Johnson.orthProj_ne_zero {V : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] (u v : V) (hu : ‖u‖ = 1) (hv : ‖v‖ = 1) (hne1 : v ≠ u) (hne2 : v ≠ -u) : orthProj u v ≠ 0 := by -- Assume for contradiction that $v - ⟪u, v⟫ • u = 0$. by_contra h_contra have h_eq : v = (inner ℝ u v) • u := by exact eq_of_sub_eq_zero h_contra; -- Taking norms on both sides, we get $1 = |⟪u, v⟫|$. have h_norm : |(inner ℝ u v)| = 1 := by replace h_eq := congr_arg Norm.norm h_eq ; simp_all +decide [ norm_smul ] ; rcases eq_or_eq_neg_of_abs_eq h_norm with ( h | h ) <;> simp +decide [ h ] at h_eq ⊢ <;> tauto;/-PROVIDED SOLUTIONFirst show orthProj_inner: ⟪proj v, proj w⟫ = ⟪v,w⟫ - ⟪u,v⟫·⟪u,w⟫ by expanding the inner product bilinearly (unfold orthProj, use inner_sub_left/right, inner_smul_left/right, and ‖u‖=1). Then: ⟪v,w⟫ ≤ 0, and ⟪u,v⟫ = ⟪v,u⟫ ≤ 0, ⟪u,w⟫ = ⟪w,u⟫ ≤ 0 (by real_inner_comm), so ⟪u,v⟫·⟪u,w⟫ ≥ 0. Result ≤ 0 by nlinarith.-/