AFTD Auto-Formalizing Theoretical Domains

CodingTheory.Johnson.normalize

defimported Lean

The rescaling $u \mapsto \norm{u}^{-1} \cdot u$ of a vector of $\mathbb{R}^n$.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open scoped BigOperators RealInnerProductSpace in
open Finset in
noncomputable def CodingTheory.Johnson.normalize {n : ℕ} (u : Euc n) : Euc n
Defined in
TCSlib, `CodingTheory.Johnson.normalize`
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
Built on 1
  • CodingTheory.Johnson.EucAbbreviation for the $n$-dimensional real Euclidean space $\mathbb{R}^n$ with the $\ell^2$ inner product, i.e.\ EuclideanSpace…
Used by 1

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open scoped BigOperators RealInnerProductSpace in
open Finset in
noncomputable def CodingTheory.Johnson.normalize {n : ℕ} (u : Euc n) : Euc n :=
  (‖u‖)⁻¹ • u
See it in the graphDiscuss this resultChallenge it