CodingTheory.Johnson.BitVec
abbrevimported Lean
The type of binary words of length $n$, namely functions $\mathrm{Fin}\,n \to \mathrm{Bool}$.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open scoped BigOperators RealInnerProductSpace in open Finset in noncomputable abbrev CodingTheory.Johnson.BitVec (n : ℕ)
- Defined in
- TCSlib, `CodingTheory.Johnson.BitVec`
- 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.BitVec← CodingTheory.Johnson.BitVec (TCSlib/ErrorCorrectingCodes/JohnsonBound.lean:27): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Used by 14
- CodingTheory.Johnson.inner_shifted_expandBilinear expansion of the shifted inner product. Let $\alpha \in \bbr$, let $x, y$ be binary words of length $n$, and write $\mathbf{1}$…
- 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.inner_shifted_le_exprUpper bound on the shifted inner product. Let $x$ and $y$ be binary words of length $n$, and let $\alpha \ge 0$. Suppose $d$ and $w$ are…
- CodingTheory.Johnson.inner_pmOne_pmOneInner product of two ±1 embeddings. For any two binary words $x, y$ of length $n$, let $\phi(x), \phi(y) \in \mathbb{R}^n$ be their…
- CodingTheory.Johnson.binary_johnson_card_bound_parametricJohnson cardinality bound, parametric form. Let $n \ge 1$, let $d, w$ be natural numbers, and let $C$ be a finite set of binary words of…
- CodingTheory.Johnson.shifted_ne_zero_of_alpha_lt_oneShifted $\pm 1$ vectors are nonzero for $\alpha < 1$. Let $n \ge 1$ and let $\alpha$ be a real number with $0 \le \alpha < 1$. Then for…
- CodingTheory.Johnson.wtFor a binary word $x$ of length $n$, its weight is the number of coordinates where $x$ takes the value
true:… - CodingTheory.Johnson.pmOne_apply_trueValue of the ±1 embedding at a true coordinate. Let $x$ be a binary word of length $n$, and let $s(x) \in \bbr^n$ denote its $\pm1$…
- CodingTheory.Johnson.inner_pmOne_onesInner product of the ±1 embedding with the all-ones vector. Let $x$ be a binary word of length $n$, and let $s(x) \in \bbr^n$ denote its…
- CodingTheory.Johnson.coord_mul_pmOneCoordinatewise product of $\pm 1$ embeddings. Let $x, y$ be binary words of length $n$, and encode each as a $\pm 1$ vector in $\bbr^n$ by…
- CodingTheory.Johnson.binary_johnson_card_boundBinary Johnson cardinality bound. Let $n \ge 1$ and let $d$ be an integer with $1 \le d$ and $2d \le n$. Suppose $C$ is a finite set of…
- CodingTheory.Johnson.hdistFor binary words $x,y$ of length $n$, the Hamming distance is the number of coordinates on which they differ:…
- CodingTheory.Johnson.pmOne_apply_falseValue of the $\pm 1$ embedding at a false coordinate. Let $x$ be a binary word of length $n$, and let the $\pm 1$ embedding send $x$ to…
- CodingTheory.Johnson.shiftedFor a real parameter $\alpha$ and a binary word $x$, the vector…
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 abbrev CodingTheory.Johnson.BitVec (n : ℕ) := Fin n → Bool