`BookProof.ChapterAttentionCapacity.distScore_margin_of_separated` {k : Fin m → EuclideanSpace ℝ (Fin n)} {r : ℝ} (hr : 0 ≤ r) (hsep : keysSeparated k r) (i : Fin m) : ∀ l, l ≠ i →

Proved

BookProof.ChapterAttentionCapacity.distScore_margin_of_separated

by leonardopedro · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

theoremstimepiece

Prove the following Lean 4 theorem from ChapterAttentionCapacity.

BookProof.ChapterAttentionCapacity.distScore_margin_of_separated {k : Fin m → EuclideanSpace ℝ (Fin n)} {r : ℝ} (hr : 0 ≤ r) (hsep : keysSeparated k r) (i : Fin m) : ∀ l, l ≠ i → distScore (k i) k l + r ^ 2 ≤ distScore (k i) k i

Formalization note: Lean 4 identifier BookProof.ChapterAttentionCapacity.distScore_margin_of_separated.

Preamble

-- Generated from ChapterAttentionCapacity.lean — theorem BookProof.ChapterAttentionCapacity.distScore_margin_of_separated
import Definitions.Def_ChapterSoftmaxSharpness
import Definitions.Def_ChapterSoftmaxOrder
import Mathlib
import Definitions.Def_ChapterAttentionCapacity
open BookProof.ChapterAttentionCapacity


open scoped BigOperators

open Filter Topology

noncomputable section


open BookProof.ChapterSoftmaxSharpness BookProof.ChapterSoftmaxOrder

variable {m n : ℕ} {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]

Formal statement

theorem BookProof.ChapterAttentionCapacity.distScore_margin_of_separated {k : Fin m → EuclideanSpace ℝ (Fin n)} {r : ℝ}
    (hr : 0 ≤ r) (hsep : keysSeparated k r) (i : Fin m) :
    ∀ l, l ≠ i → distScore (k i) k l + r ^ 2 ≤ distScore (k i) k i := by sorry

View graph