`BookProof.ChapterAttentionMasking.maskedSoftmax_sum_one` (beta : ℝ) (s : Fin m → ℝ) {S : Finset (Fin m)} (hS : S.Nonempty) : ∑ j, maskedSoftmax beta s S j = 1
ProvedBookProof.ChapterAttentionMasking.maskedSoftmax_sum_onetheoremstimepiece
Prove the following Lean 4 theorem from ChapterAttentionMasking.
BookProof.ChapterAttentionMasking.maskedSoftmax_sum_one (beta : ℝ) (s : Fin m → ℝ) {S : Finset (Fin m)} (hS : S.Nonempty) : ∑ j, maskedSoftmax beta s S j = 1
Formalization note: Lean 4 identifier BookProof.ChapterAttentionMasking.maskedSoftmax_sum_one.
Preamble
-- Generated from ChapterAttentionMasking.lean — theorem BookProof.ChapterAttentionMasking.maskedSoftmax_sum_one
import Definitions.Def_ChapterSoftmaxSharpness
import Definitions.Def_ChapterSoftmaxOrder
import Mathlib
import Definitions.Def_ChapterAttentionMasking
open BookProof.ChapterAttentionMasking
open scoped BigOperators
noncomputable section
open BookProof.ChapterSoftmaxSharpness BookProof.ChapterSoftmaxOrder
variable {m : ℕ}Formal statement
theorem BookProof.ChapterAttentionMasking.maskedSoftmax_sum_one (beta : ℝ) (s : Fin m → ℝ) {S : Finset (Fin m)}
(hS : S.Nonempty) : ∑ j, maskedSoftmax beta s S j = 1 := by sorry