`BookProof.ChapterAttentionCollision.renyi2_le_shannonEntropy` {p : Fin m → ℝ} (hp0 : ∀ j, 0 ≤ p j) (hsum : ∑ j, p j = 1) : renyi2 p ≤ shannonEntropy p

Proved

BookProof.ChapterAttentionCollision.renyi2_le_shannonEntropy

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

theoremstimepiece

Prove the following Lean 4 theorem from ChapterAttentionCollision.

BookProof.ChapterAttentionCollision.renyi2_le_shannonEntropy {p : Fin m → ℝ} (hp0 : ∀ j, 0 ≤ p j) (hsum : ∑ j, p j = 1) : renyi2 p ≤ shannonEntropy p

Formalization note: Lean 4 identifier BookProof.ChapterAttentionCollision.renyi2_le_shannonEntropy.

Preamble

-- Generated from ChapterAttentionCollision.lean — theorem BookProof.ChapterAttentionCollision.renyi2_le_shannonEntropy
import Definitions.Def_ChapterSoftmaxSharpness
import Definitions.Def_ChapterSoftmaxOrder
import Mathlib
import Definitions.Def_ChapterAttentionCollision
import Definitions.Def_ChapterAttentionEntropy
open BookProof.ChapterAttentionCollision


open scoped BigOperators

noncomputable section


open BookProof.ChapterSoftmaxSharpness BookProof.ChapterSoftmaxOrder
open BookProof.ChapterAttentionEntropy

variable {m : ℕ}

Formal statement

theorem BookProof.ChapterAttentionCollision.renyi2_le_shannonEntropy {p : Fin m → ℝ} (hp0 : ∀ j, 0 ≤ p j)
    (hsum : ∑ j, p j = 1) : renyi2 p ≤ shannonEntropy p := by sorry

View graph