`BookProof.ChapterSoftmaxBorn.softmax_nonneg` (beta : ℝ) (q : EuclideanSpace ℝ (Fin n)) (k : Fin m → EuclideanSpace ℝ (Fin n)) (j : Fin m) : 0 ≤ softmax beta q k j

Proved

BookProof.ChapterSoftmaxBorn.softmax_nonneg

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

theoremstimepiece

Prove the following Lean 4 theorem from ChapterSoftmaxBorn.

BookProof.ChapterSoftmaxBorn.softmax_nonneg (beta : ℝ) (q : EuclideanSpace ℝ (Fin n)) (k : Fin m → EuclideanSpace ℝ (Fin n)) (j : Fin m) : 0 ≤ softmax beta q k j

Formalization note: Lean 4 identifier BookProof.ChapterSoftmaxBorn.softmax_nonneg.

Preamble

-- Generated from ChapterSoftmaxBorn.lean — theorem BookProof.ChapterSoftmaxBorn.softmax_nonneg
import Definitions.Def_ChapterCoherentOverlap
import Mathlib
import Definitions.Def_ChapterSoftmaxBorn
open BookProof.ChapterSoftmaxBorn


open scoped BigOperators

noncomputable section


open BookProof.ChapterCoherentOverlap

variable {n m : ℕ}

Formal statement

theorem BookProof.ChapterSoftmaxBorn.softmax_nonneg (beta : ℝ) (q : EuclideanSpace ℝ (Fin n))
    (k : Fin m → EuclideanSpace ℝ (Fin n)) (j : Fin m) : 0 ≤ softmax beta q k j := by sorry

View graph