`BookProof.ChapterAttentionSparse.maskedSoftmax_eq_of_mass_one` (beta : ℝ) (s : Fin m → ℝ) {S : Finset (Fin m)} (hS : S.Nonempty) (i : Fin m) (h : attendedMass beta s S = 1) (j : F

Proved

BookProof.ChapterAttentionSparse.maskedSoftmax_eq_of_mass_one

by leonardopedro · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

theoremstimepiece

Prove the following Lean 4 theorem from ChapterAttentionSparse.

BookProof.ChapterAttentionSparse.maskedSoftmax_eq_of_mass_one (beta : ℝ) (s : Fin m → ℝ) {S : Finset (Fin m)} (hS : S.Nonempty) (i : Fin m) (h : attendedMass beta s S = 1) (j : Fin m) : maskedSoftmax beta s S j = scoreSoftmax beta s j

Formalization note: Lean 4 identifier BookProof.ChapterAttentionSparse.maskedSoftmax_eq_of_mass_one.

Preamble

-- Generated from ChapterAttentionSparse.lean — theorem BookProof.ChapterAttentionSparse.maskedSoftmax_eq_of_mass_one
import Definitions.Def_ChapterSoftmaxOrder
import Mathlib
import Definitions.Def_ChapterAttentionSparse
import Definitions.Def_ChapterSoftmaxSharpness
import Definitions.Def_ChapterAttentionMasking
open BookProof.ChapterSoftmaxSharpness
open BookProof.ChapterAttentionSparse


open scoped BigOperators

noncomputable section


open BookProof.ChapterSoftmaxSharpness BookProof.ChapterSoftmaxOrder
open BookProof.ChapterAttentionMasking

variable {m : ℕ} {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]

Formal statement

theorem BookProof.ChapterAttentionSparse.maskedSoftmax_eq_of_mass_one (beta : ℝ) (s : Fin m → ℝ) {S : Finset (Fin m)}
    (hS : S.Nonempty) (i : Fin m) (h : attendedMass beta s S = 1) (j : Fin m) :
    maskedSoftmax beta s S j = scoreSoftmax beta s j := by sorry

View graph