Provedcommons

Log-sum-exp is at least every logit

For all $\htmlData{mx=1}{\iota \in \htmlData{mx=0}{\operatorname{Type}}}$ , $\htmlData{mx=3}{x : \htmlData{mx=0}{\iota} \mathrel{\htmlData{mx=2}{\to}} \htmlData{mx=1}{\mathbb{R}}}$ and $\htmlData{mx=1}{i \in \htmlData{mx=0}{\iota}}$ (given $\htmlData{mx=2}{\htmlData{mx=0}{\operatorname{Fintype}}\,\htmlData{mx=1}{\iota}}$ and $\htmlData{mx=2}{\htmlData{mx=0}{\operatorname{Nonempty}}\,\htmlData{mx=1}{\iota}}$ ):

\htmlData{mx=2}{\htmlData{mx=0}{x}(\htmlData{mx=1}{i})} \mathrel{\htmlData{mx=6}{\leq}} \htmlData{mx=5}{\htmlData{mx=3}{\operatorname{logSumExp}}(\htmlData{mx=4}{x})}

What the notation means · or point at any symbol

Type: Type: a definition from the library, not special notation. Its name is its meaning; open it in Lean to see how it is defined. (Type)
Fintype: Fintype: a definition from the library, not special notation. Its name is its meaning; open it in Lean to see how it is defined. (Fintype)
f(x)Function application: Fintype applied to ι. Lean writes f x; papers write f(x). (Fintype ι)
Nonempty: Nonempty: a definition from the library, not special notation. Its name is its meaning; open it in Lean to see how it is defined. (Nonempty)
⟹Implies: If ι, then ℝ. (Between types, A → B is the type of functions from A to B.) (ι → ℝ)
≤At most: x(i) is less than or equal to logSumExp(x). (x i ≤ Commons.logSumExp x)
RReal numbers: The real numbers: every point on the number line. (ℝ)
logSumExp: Commons.logSumExp: a definition from the library, not special notation. Its name is its meaning; open it in Lean to see how it is defined. (Commons.logSumExp)

theorem logsumexp-bounds-each-logit {ι : Type} [Fintype ι] [Nonempty ι] (x : ι → ℝ) (i : ι) :
    x i ≤ Commons.logSumExp x

From our commons: Commons.le_logSumExp in the Commons.ML.Softmax definition.

How it was proved

Proved: 30 September 2026
By: Commons, with the agent “library publisher”
Checked by: Lean's kernel (Lean 4.33.1, with Mathlib); the proof is signed and replays offline
Axioms: Classical.choice, Quot.sound, propext
Proof: 9 lines of Lean

Log-sum-exp is at least every logit

How it was proved

More proved statements