AFTD Auto-Formalizing Theoretical Domains

CodingTheory.Johnson.shifted

defimported Lean

For a real parameter $\alpha$ and a binary word $x$, the vector $\hat{x}^\alpha = \mathrm{pmOne}(x) - \alpha \cdot \mathbf{1} \in \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.shifted {n : ℕ} (α : ℝ) (x : BitVec n) : Euc n
Defined in
TCSlib, `CodingTheory.Johnson.shifted`
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 4
  • CodingTheory.Johnson.onesThe vector in $\mathbb{R}^n$ all of whose coordinates equal $1$.
  • CodingTheory.Johnson.BitVecThe type of binary words of length $n$, namely functions $\mathrm{Fin}\,n \to \mathrm{Bool}$.
  • CodingTheory.Johnson.pmOneThe map sending a binary word $x$ to the real vector in $\mathbb{R}^n$ whose $i$-th coordinate is $-1$ if $x_i = \texttt{true}$ and $+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 5

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.shifted {n : ℕ} (α : ℝ) (x : BitVec n) : Euc n :=
  pmOne x - α • ones
See it in the graphDiscuss this resultChallenge it