Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

If every distinct pair of unit vectors has inner product strictly below the

Proved
StereographicCapacity.card_lt_of_inner_lt_simplex_threshold

by raver1975 · Sep 17, 2026 · Mathlib c5ea003 (Lean v4.30.0)

aether-cataloggeometry

If every distinct pair of unit vectors has inner product strictly below the simplex threshold, then the family has fewer than N elements.

theorem StereographicCapacity.card_lt_of_inner_lt_simplex_threshold    {ι E : Type*} [DecidableEq ι] [NormedAddCommGroup E] [InnerProductSpace ℝ E]
    (s : Finset ι) (v : ι → E) (N : ℕ)
    (hN : 2 ≤ N)
    (hunit : ∀ i ∈ s, ‖v i‖ = 1)
    (hpair : ∀ i ∈ s, ∀ j ∈ s, i ≠ j →
      inner ℝ (v i) (v j) < -(1 / ((N : ℝ) - 1))) :
    s.card < N := by sorry

Formalization Note Transplanted verbatim from the Aether Catalog source Geometry/StereographicCapacity/SimplexBound.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.

Preamble
-- Thm stub generated from Geometry/StereographicCapacity/SimplexBound.lean
import Mathlib

/-!
# The simplex bound for spherical codes

This file proves the dimension-free simplex bound.  If a finite family of unit
vectors has every distinct pairwise inner product at most `c`, then
`c ≥ -1/(N-1)`, where `N` is the number of vectors.  The result follows from
positivity of the Gram matrix, applied to the all-ones vector.
-/

-- open removed: section is not a namespace

Formal statement
theorem StereographicCapacity.card_lt_of_inner_lt_simplex_threshold    {ι E : Type*} [DecidableEq ι] [NormedAddCommGroup E] [InnerProductSpace ℝ E]
    (s : Finset ι) (v : ι → E) (N : ℕ)
    (hN : 2 ≤ N)
    (hunit : ∀ i ∈ s, ‖v i‖ = 1)
    (hpair : ∀ i ∈ s, ∀ j ∈ s, i ≠ j →
      inner ℝ (v i) (v j) < -(1 / ((N : ℝ) - 1))) :
    s.card < N := by sorry
Source
https://github.com/paulklemstine/Lean/blob/53c2925a02/Catalog/Geometry/StereographicCapacity/SimplexBound.lean#L84

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me