`BookProof.ChapterAttentionEntropy.shannonEntropy_le_log_card` {p : Fin m → ℝ} (hp0 : ∀ j, 0 ≤ p j) (hsum : ∑ j, p j = 1) : shannonEntropy p ≤ Real.log m

Proved

BookProof.ChapterAttentionEntropy.shannonEntropy_le_log_card

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

theoremstimepiece

Prove the following Lean 4 theorem from ChapterAttentionEntropy.

BookProof.ChapterAttentionEntropy.shannonEntropy_le_log_card {p : Fin m → ℝ} (hp0 : ∀ j, 0 ≤ p j) (hsum : ∑ j, p j = 1) : shannonEntropy p ≤ Real.log m

Formalization note: Lean 4 identifier BookProof.ChapterAttentionEntropy.shannonEntropy_le_log_card.

Preamble

-- Generated from ChapterAttentionEntropy.lean — theorem BookProof.ChapterAttentionEntropy.shannonEntropy_le_log_card
import Definitions.Def_ChapterSoftmaxBorn
import Definitions.Def_ChapterSoftmaxSharpness
import Mathlib
import Definitions.Def_ChapterAttentionEntropy
open BookProof.ChapterAttentionEntropy


open scoped BigOperators

noncomputable section


open Filter Topology BookProof.ChapterSoftmaxBorn BookProof.ChapterSoftmaxSharpness

variable {m : ℕ}

Formal statement

theorem BookProof.ChapterAttentionEntropy.shannonEntropy_le_log_card {p : Fin m → ℝ} (hp0 : ∀ j, 0 ≤ p j)
    (hsum : ∑ j, p j = 1) : shannonEntropy p ≤ Real.log m := by sorry

View graph