`BookProof.ChapterSoftmaxBorn.softmaxDenom_pos` (beta : ℝ) (q : EuclideanSpace ℝ (Fin n)) (k : Fin m → EuclideanSpace ℝ (Fin n)) (j : Fin m) : 0 < ∑ l, Real.exp (beta * inner ℝ q (
ProvedBookProof.ChapterSoftmaxBorn.softmaxDenom_postheoremstimepiece
Prove the following Lean 4 theorem from ChapterSoftmaxBorn.
BookProof.ChapterSoftmaxBorn.softmaxDenom_pos (beta : ℝ) (q : EuclideanSpace ℝ (Fin n)) (k : Fin m → EuclideanSpace ℝ (Fin n)) (j : Fin m) : 0 < ∑ l, Real.exp (beta * inner ℝ q (k l))
Formalization note: Lean 4 identifier BookProof.ChapterSoftmaxBorn.softmaxDenom_pos.
Preamble
-- Generated from ChapterSoftmaxBorn.lean — theorem BookProof.ChapterSoftmaxBorn.softmaxDenom_pos
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.softmaxDenom_pos (beta : ℝ) (q : EuclideanSpace ℝ (Fin n))
(k : Fin m → EuclideanSpace ℝ (Fin n)) (j : Fin m) :
0 < ∑ l, Real.exp (beta * inner ℝ q (k l)) := by sorry