CodingTheory.Johnson.ones_apply
theoremverifiedimported Lean
Coordinates of the all-ones vector. Let $\mathbf{1} \in \bbr^n$ be the all-ones vector. Then for every index $i \in \{1, \dots, n\}$, the $i$-th coordinate satisfies $\mathbf{1}_i = 1$.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open scoped BigOperators RealInnerProductSpace in open Finset in @[simp] lemma CodingTheory.Johnson.ones_apply {n : ℕ} (i : Fin n) : ones (n := n) i = (1 : ℝ)
- Source
- TCSlib, `CodingTheory.Johnson.ones_apply`
- 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.ones_apply← CodingTheory.Johnson.ones_apply (TCSlib/ErrorCorrectingCodes/JohnsonBound.lean:49): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- CodingTheory.Johnson.onesThe vector in $\mathbb{R}^n$ all of whose coordinates equal $1$.
- Used by 1
- 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…
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.ones_apply {n : ℕ} (i : Fin n) : ones (n := n) i = (1 : ℝ) := by simp [ones]