CodingTheory.Johnson.pmOne_apply_true
theoremverifiedimported Lean
Value 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$ embedding, whose $i$-th coordinate is $-1$ when $x_i$ is true and $+1$ when $x_i$ is false. Then for every index $i$ with $x_i$ true, the $i$-th coordinate of $s(x)$ equals $-1$.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open scoped BigOperators RealInnerProductSpace in open Finset in @[simp] lemma CodingTheory.Johnson.pmOne_apply_true {n : ℕ} (x : BitVec n) (i : Fin n) (h : x i = true) : pmOne x i = (-1 : ℝ)
- Source
- TCSlib, `CodingTheory.Johnson.pmOne_apply_true`
- 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.pmOne_apply_true← CodingTheory.Johnson.pmOne_apply_true (TCSlib/ErrorCorrectingCodes/JohnsonBound.lean:55): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- 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.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…
- Used by 4
- 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.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.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.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…
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 in@[simp] lemma CodingTheory.Johnson.pmOne_apply_true {n : ℕ} (x : BitVec n) (i : Fin n) (h : x i = true) : pmOne x i = (-1 : ℝ) := by simp [pmOne, h]