`BookProof.ChapterSoftmaxSharpness.softmax_smul_query` (beta c : ℝ) (q : EuclideanSpace ℝ (Fin n)) (k : Fin m → EuclideanSpace ℝ (Fin n)) (j : Fin m) : softmax beta (c • q) k j = s
ProvedBookProof.ChapterSoftmaxSharpness.softmax_smul_querytheoremstimepiece
Prove the following Lean 4 theorem from ChapterSoftmaxSharpness.
BookProof.ChapterSoftmaxSharpness.softmax_smul_query (beta c : ℝ) (q : EuclideanSpace ℝ (Fin n)) (k : Fin m → EuclideanSpace ℝ (Fin n)) (j : Fin m) : softmax beta (c • q) k j = softmax (beta * c) q k j
Formalization note: Lean 4 identifier BookProof.ChapterSoftmaxSharpness.softmax_smul_query.
Preamble
-- Generated from ChapterSoftmaxSharpness.lean — theorem BookProof.ChapterSoftmaxSharpness.softmax_smul_query
import Mathlib
import Definitions.Def_ChapterSoftmaxSharpness
import Definitions.Def_ChapterSoftmaxBorn
open BookProof.ChapterSoftmaxBorn
open BookProof.ChapterSoftmaxSharpness
open scoped BigOperators
noncomputable section
open Filter Topology BookProof.ChapterSoftmaxBorn
variable {n m : ℕ}Formal statement
theorem BookProof.ChapterSoftmaxSharpness.softmax_smul_query (beta c : ℝ) (q : EuclideanSpace ℝ (Fin n))
(k : Fin m → EuclideanSpace ℝ (Fin n)) (j : Fin m) :
softmax beta (c • q) k j = softmax (beta * c) q k j := by sorry