`BookProof.ChapterSoftmaxOrder.scoreSoftmax_shift` (beta c : ℝ) (s : Fin m → ℝ) (j : Fin m) : scoreSoftmax beta (fun l => s l + c) j = scoreSoftmax beta s j

Proved

BookProof.ChapterSoftmaxOrder.scoreSoftmax_shift

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

theoremstimepiece

Prove the following Lean 4 theorem from ChapterSoftmaxOrder.

BookProof.ChapterSoftmaxOrder.scoreSoftmax_shift (beta c : ℝ) (s : Fin m → ℝ) (j : Fin m) : scoreSoftmax beta (fun l => s l + c) j = scoreSoftmax beta s j

Formalization note: Lean 4 identifier BookProof.ChapterSoftmaxOrder.scoreSoftmax_shift.

Preamble

-- Generated from ChapterSoftmaxOrder.lean — theorem BookProof.ChapterSoftmaxOrder.scoreSoftmax_shift
import Definitions.Def_ChapterSoftmaxBorn
import Mathlib
import Definitions.Def_ChapterSoftmaxOrder
import Definitions.Def_ChapterSoftmaxSharpness
open BookProof.ChapterSoftmaxSharpness
open BookProof.ChapterSoftmaxOrder


open scoped BigOperators

noncomputable section


open BookProof.ChapterSoftmaxBorn BookProof.ChapterSoftmaxSharpness

variable {m : ℕ}

Formal statement

theorem BookProof.ChapterSoftmaxOrder.scoreSoftmax_shift (beta c : ℝ) (s : Fin m → ℝ) (j : Fin m) :
    scoreSoftmax beta (fun l => s l + c) j = scoreSoftmax beta s j := by sorry

View graph