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

Proved

BookProof.ChapterAttentionCollision.one_le_effectiveSupport

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

theoremstimepiece

Prove the following Lean 4 theorem from ChapterAttentionCollision.

BookProof.ChapterAttentionCollision.one_le_effectiveSupport {p : Fin m → ℝ} (hp0 : ∀ j, 0 ≤ p j) (hp1 : ∀ j, p j ≤ 1) (hsum : ∑ j, p j = 1) : 1 ≤ effectiveSupport p

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

Preamble

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


open scoped BigOperators

noncomputable section


open BookProof.ChapterSoftmaxSharpness BookProof.ChapterSoftmaxOrder

variable {m : ℕ}

Formal statement

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

View graph