`BookProof.ChapterSoftmaxBorn.coherentBorn_cancel_q` (q : EuclideanSpace ℝ (Fin n)) (k : Fin m → EuclideanSpace ℝ (Fin n)) (j : Fin m) : bornWeight q k j = Real.exp (-‖k j‖ ^ 2) *

Proved

BookProof.ChapterSoftmaxBorn.coherentBorn_cancel_q

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

theoremstimepiece

Prove the following Lean 4 theorem from ChapterSoftmaxBorn.

BookProof.ChapterSoftmaxBorn.coherentBorn_cancel_q (q : EuclideanSpace ℝ (Fin n)) (k : Fin m → EuclideanSpace ℝ (Fin n)) (j : Fin m) : bornWeight q k j = Real.exp (-‖k j‖ ^ 2) * Real.exp (2 * inner ℝ q (k j)) / ∑ l, Real.exp (-‖k l‖ ^ 2) * Real.exp (2 * inner ℝ q (k l))

Formalization note: Lean 4 identifier BookProof.ChapterSoftmaxBorn.coherentBorn_cancel_q.

Preamble

-- Generated from ChapterSoftmaxBorn.lean — theorem BookProof.ChapterSoftmaxBorn.coherentBorn_cancel_q
import Definitions.Def_ChapterCoherentOverlap
import Mathlib
import Definitions.Def_ChapterSoftmaxBorn
open BookProof.ChapterSoftmaxBorn


open scoped BigOperators

noncomputable section


open BookProof.ChapterCoherentOverlap

variable {n m : ℕ}

Formal statement

theorem BookProof.ChapterSoftmaxBorn.coherentBorn_cancel_q (q : EuclideanSpace ℝ (Fin n))
    (k : Fin m → EuclideanSpace ℝ (Fin n)) (j : Fin m) :
    bornWeight q k j =
      Real.exp (-‖k j‖ ^ 2) * Real.exp (2 * inner ℝ q (k j)) /
        ∑ l, Real.exp (-‖k l‖ ^ 2) * Real.exp (2 * inner ℝ q (k l)) := by sorry

View graph