`BookProof.ChapterSoftmaxOrder.scoreSoftmax_denom_pos` (beta : ℝ) (s : Fin m → ℝ) (i : Fin m) : 0 < ∑ l, Real.exp (beta * s l)
ProvedBookProof.ChapterSoftmaxOrder.scoreSoftmax_denom_postheoremstimepiece
Prove the following Lean 4 theorem from ChapterSoftmaxOrder.
BookProof.ChapterSoftmaxOrder.scoreSoftmax_denom_pos (beta : ℝ) (s : Fin m → ℝ) (i : Fin m) : 0 < ∑ l, Real.exp (beta * s l)
Formalization note: Lean 4 identifier BookProof.ChapterSoftmaxOrder.scoreSoftmax_denom_pos.
Preamble
-- Generated from ChapterSoftmaxOrder.lean — theorem BookProof.ChapterSoftmaxOrder.scoreSoftmax_denom_pos
import Definitions.Def_ChapterSoftmaxBorn
import Definitions.Def_ChapterSoftmaxSharpness
import Mathlib
import Definitions.Def_ChapterSoftmaxOrder
open BookProof.ChapterSoftmaxOrder
open scoped BigOperators
noncomputable section
open BookProof.ChapterSoftmaxBorn BookProof.ChapterSoftmaxSharpness
variable {m : ℕ}Formal statement
theorem BookProof.ChapterSoftmaxOrder.scoreSoftmax_denom_pos (beta : ℝ) (s : Fin m → ℝ) (i : Fin m) :
0 < ∑ l, Real.exp (beta * s l) := by sorry