CodingTheory.Johnson.inner_ones_ones
theoremverifiedimported Lean
Squared norm of the all-ones vector. Let $\mathbf{1} \in \bbr^n$ denote the vector all of whose coordinates equal $1$. Then, with respect to the standard $\ell^2$ inner product, $\langle \mathbf{1}, \mathbf{1} \rangle = n$.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open scoped BigOperators RealInnerProductSpace in open Finset in lemma CodingTheory.Johnson.inner_ones_ones {n : ℕ} : ⟪ones (n := n), ones (n := n)⟫_[ℝ] = (n : ℝ)
- Source
- TCSlib, `CodingTheory.Johnson.inner_ones_ones`
- 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.inner_ones_ones← CodingTheory.Johnson.inner_ones_ones (TCSlib/ErrorCorrectingCodes/JohnsonBound.lean:95): 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_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…
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 inlemma CodingTheory.Johnson.inner_ones_ones {n : ℕ} : ⟪ones (n := n), ones (n := n)⟫_[ℝ] = (n : ℝ) := by simp [RCLike.wInner, ones]