AFTD Auto-Formalizing Theoretical Domains

CodingTheory.Johnson.rankin_finset_bound

theoremverifiedimported Lean

Rankin bound for pairwise obtuse unit vectors. Let $S$ be a finite set of vectors in the Euclidean space $\bbr^n$, each of norm $1$, such that any two distinct vectors $u, v \in S$ satisfy $\langle u, v\rangle \le 0$. Then $\abs{S} \le 2n$.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open scoped BigOperators RealInnerProductSpace in
open Finset in
open Classical in
open scoped RealInnerProductSpace in
open scoped InnerProductSpace in
open Finset in
theorem CodingTheory.Johnson.rankin_finset_bound
    {n : ℕ} (S : Finset (Euc n))
    (hunit : ∀ u ∈ S, ‖u‖ = 1)
    (hpair : ∀ u ∈ S, ∀ v ∈ S, u ≠ v → ⟪u, v⟫_[ℝ] ≤ 0) :
    S.card ≤ 2 * n
Source
TCSlib, `CodingTheory.Johnson.rankin_finset_bound`
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.rankin_bound_generalRankin bound in a finite-dimensional space. Let $V$ be a finite-dimensional real inner product space, and let $S$ be a finite set of…
  • CodingTheory.Johnson.EucAbbreviation for the $n$-dimensional real Euclidean space $\mathbb{R}^n$ with the $\ell^2$ inner product, i.e.\ EuclideanSpace…
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen scoped BigOperators RealInnerProductSpace inopen Finset inopen Classical inopen scoped RealInnerProductSpace inopen scoped InnerProductSpace inopen Finset intheorem CodingTheory.Johnson.rankin_finset_bound    {n : ℕ} (S : Finset (Euc n))    (hunit : ∀ u ∈ S, ‖u‖ = 1)    (hpair : ∀ u ∈ S, ∀ v ∈ S, u ≠ v → ⟪u, v⟫_[ℝ] ≤ 0) :    S.card ≤ 2 * n := by  convert rankin_bound_general S _ _ ; aesop;  · assumption;  · norm_num [ RCLike.wInner ] at * ; aesop;
See it in the graphDiscuss this resultChallenge it