`BookProof.ChapterCoherentGeometry.bornWeight_max_of_nearest` (q : EuclideanSpace ℝ (Fin n)) (k : Fin m → EuclideanSpace ℝ (Fin n)) (j : Fin m) (hj : ∀ l, ‖q - k j‖ ≤ ‖q - k l‖) (i

Proved

BookProof.ChapterCoherentGeometry.bornWeight_max_of_nearest

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

theoremstimepiece

Prove the following Lean 4 theorem from ChapterCoherentGeometry.

BookProof.ChapterCoherentGeometry.bornWeight_max_of_nearest (q : EuclideanSpace ℝ (Fin n)) (k : Fin m → EuclideanSpace ℝ (Fin n)) (j : Fin m) (hj : ∀ l, ‖q - k j‖ ≤ ‖q - k l‖) (i : Fin m) : bornWeight q k i ≤ bornWeight q k j

Formalization note: Lean 4 identifier BookProof.ChapterCoherentGeometry.bornWeight_max_of_nearest.

Preamble

-- Generated from ChapterCoherentGeometry.lean — theorem BookProof.ChapterCoherentGeometry.bornWeight_max_of_nearest
import Definitions.Def_ChapterCoherentOverlap
import Mathlib
import Definitions.Def_ChapterCoherentGeometry
import Definitions.Def_ChapterSoftmaxBorn
open BookProof.ChapterSoftmaxBorn
open BookProof.ChapterCoherentGeometry


open scoped BigOperators

noncomputable section


open BookProof.ChapterCoherentOverlap BookProof.ChapterSoftmaxBorn

variable {n m : ℕ}

Formal statement

theorem BookProof.ChapterCoherentGeometry.bornWeight_max_of_nearest (q : EuclideanSpace ℝ (Fin n))
    (k : Fin m → EuclideanSpace ℝ (Fin n)) (j : Fin m)
    (hj : ∀ l, ‖q - k j‖ ≤ ‖q - k l‖) (i : Fin m) :
    bornWeight q k i ≤ bornWeight q k j := by sorry

View graph