`BookProof.ChapterSoftmaxOrder.scoreSoftmax_sum_one` (beta : ℝ) (s : Fin m → ℝ) (i : Fin m) : ∑ j, scoreSoftmax beta s j = 1
ProvedBookProof.ChapterSoftmaxOrder.scoreSoftmax_sum_onetheoremstimepiece
Prove the following Lean 4 theorem from ChapterSoftmaxOrder.
BookProof.ChapterSoftmaxOrder.scoreSoftmax_sum_one (beta : ℝ) (s : Fin m → ℝ) (i : Fin m) : ∑ j, scoreSoftmax beta s j = 1
Formalization note: Lean 4 identifier BookProof.ChapterSoftmaxOrder.scoreSoftmax_sum_one.
Preamble
-- Generated from ChapterSoftmaxOrder.lean — theorem BookProof.ChapterSoftmaxOrder.scoreSoftmax_sum_one
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_sum_one (beta : ℝ) (s : Fin m → ℝ) (i : Fin m) :
∑ j, scoreSoftmax beta s j = 1 := by sorry