AFTD Auto-Formalizing Theoretical Domains

CodingTheory.Johnson.pmOne_apply_false

theoremverifiedimported Lean

Value 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 the vector in $\bbr^n$ whose $i$-th coordinate is $-1$ when $x_i$ is true and $+1$ when $x_i$ is false. If the $i$-th entry of $x$ is false, then the $i$-th coordinate of the embedded vector 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_false {n : ℕ} (x : BitVec n) (i : Fin n) (h : x i = false) :
    pmOne x i = (1 : ℝ)
Source
TCSlib, `CodingTheory.Johnson.pmOne_apply_false`
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
Classical.choiceQuot.soundpropext
Built on 2
  • 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$…
Used by 5

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen scoped BigOperators RealInnerProductSpace inopen Finset in@[simp] lemma CodingTheory.Johnson.pmOne_apply_false {n : ℕ} (x : BitVec n) (i : Fin n) (h : x i = false) :    pmOne x i = (1 : ℝ) := by  simp [pmOne, h]
See it in the graphDiscuss this resultChallenge it