CodingTheory.Johnson.orthProj_inner_nonpos
theoremverifiedimported Lean
Projection off a unit vector preserves nonpositive inner products. Let $V$ be a real inner product space, and let $u,v,w \in V$ with $\norm{u} = 1$. Suppose the three pairwise inner products $\langle v,w\rangle$, $\langle v,u\rangle$, and $\langle w,u\rangle$ are all nonpositive. For a vector $x \in V$, write $x - \langle u,x\rangle\, u$ for the projection of $x$ onto the orthogonal complement of $\mathrm{span}\{u\}$. Then the projections of $v$ and $w$ again have nonpositive inner product: \[ \bigl\langle\, v - \langle u,v\rangle\, u,\ \ w - \langle u,w\rangle\, u \,\bigr\rangle \le 0. \]
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_inner_nonpos {V : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] (u v w : V) (hu : ‖u‖ = 1) (hvw : inner ℝ v w ≤ 0) (hvu : inner ℝ v u ≤ 0) (hwu : inner ℝ w u ≤ 0) : inner ℝ (orthProj u v) (orthProj u w) ≤ 0
- Source
- TCSlib, `CodingTheory.Johnson.orthProj_inner_nonpos`
- 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_inner_nonpos← CodingTheory.Johnson.orthProj_inner_nonpos (TCSlib/ErrorCorrectingCodes/JohnsonBound.lean:280): 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 1
- 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…
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_inner_nonpos {V : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] (u v w : V) (hu : ‖u‖ = 1) (hvw : inner ℝ v w ≤ 0) (hvu : inner ℝ v u ≤ 0) (hwu : inner ℝ w u ≤ 0) : inner ℝ (orthProj u v) (orthProj u w) ≤ 0 := by have huu : ⟪u, u⟫_ℝ = 1 := by rw [real_inner_self_eq_norm_sq, hu]; norm_num unfold orthProj; simp +decide [ *, inner_sub_left, inner_sub_right, inner_smul_left, inner_smul_right ] ; ring_nf; ( nlinarith [ real_inner_comm u w, real_inner_comm v u, huu ]);