AFTD Auto-Formalizing Theoretical Domains

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.
Verified
07 Oct 2026
Axioms
none listed
Used by 9

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.
-/
See it in the graphDiscuss this resultChallenge it