`BookProof.ChapterAttentionOutput.headOutput_mem_convexHull` (beta : ℝ) (s : Fin m → ℝ) (v : Fin m → E) (i : Fin m) : headOutput beta s v ∈ convexHull ℝ (Set.range v)
ProvedBookProof.ChapterAttentionOutput.headOutput_mem_convexHulltheoremstimepiece
Prove the following Lean 4 theorem from ChapterAttentionOutput.
BookProof.ChapterAttentionOutput.headOutput_mem_convexHull (beta : ℝ) (s : Fin m → ℝ) (v : Fin m → E) (i : Fin m) : headOutput beta s v ∈ convexHull ℝ (Set.range v)
Formalization note: Lean 4 identifier BookProof.ChapterAttentionOutput.headOutput_mem_convexHull.
Preamble
-- Generated from ChapterAttentionOutput.lean — theorem BookProof.ChapterAttentionOutput.headOutput_mem_convexHull
import Definitions.Def_ChapterSoftmaxOrder
import Mathlib
import Definitions.Def_ChapterAttentionOutput
import Definitions.Def_ChapterSoftmaxSharpness
open BookProof.ChapterSoftmaxSharpness
open BookProof.ChapterAttentionOutput
open scoped BigOperators
open Filter Topology
noncomputable section
open BookProof.ChapterSoftmaxSharpness BookProof.ChapterSoftmaxOrder
variable {m n : ℕ} {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]Formal statement
theorem BookProof.ChapterAttentionOutput.headOutput_mem_convexHull (beta : ℝ) (s : Fin m → ℝ) (v : Fin m → E) (i : Fin m) :
headOutput beta s v ∈ convexHull ℝ (Set.range v) := by sorry