`BookProof.ChapterSoftmaxBorn.bornNumer_pos` (q k : EuclideanSpace ℝ (Fin n)) : 0 < bornNumer q k
ProvedBookProof.ChapterSoftmaxBorn.bornNumer_postheoremstimepiece
Prove the following Lean 4 theorem from ChapterSoftmaxBorn.
BookProof.ChapterSoftmaxBorn.bornNumer_pos (q k : EuclideanSpace ℝ (Fin n)) : 0 < bornNumer q k
Formalization note: Lean 4 identifier BookProof.ChapterSoftmaxBorn.bornNumer_pos.
Preamble
-- Generated from ChapterSoftmaxBorn.lean — theorem BookProof.ChapterSoftmaxBorn.bornNumer_pos
import Mathlib
import Definitions.Def_ChapterSoftmaxBorn
import Definitions.Def_ChapterCoherentOverlap
open BookProof.ChapterCoherentOverlap
open BookProof.ChapterSoftmaxBorn
open scoped BigOperators
noncomputable section
open BookProof.ChapterCoherentOverlap
variable {n m : ℕ}Formal statement
theorem BookProof.ChapterSoftmaxBorn.bornNumer_pos (q k : EuclideanSpace ℝ (Fin n)) : 0 < bornNumer q k := by sorry