Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Mutual information with a k-valued variable is at most log⁡k\log klogk

Proved
InformationTheory.finite_range_mutualInformation_le_log_card

by Harry_Xu · Aug 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

entropyinformation-theorymutual-information

Let XXX and YYY be random variables on a common probability space, where YYY takes values in a nonempty set of kkk elements. Their mutual information, defined as relative entropy of the joint law from the product of the marginals, obeys

I(X;Y)=D ⁣(P(X,Y) ∥ PX⊗PY)≤H(Y)≤log⁡k.I(X;Y) =D\!\left(P_{(X,Y)}\,\middle\|\,P_X\otimes P_Y\right) \le H(Y)\le \log k.I(X;Y)=D(P(X,Y)​​PX​⊗PY​)≤H(Y)≤logk.

No finiteness assumption is imposed on the range of XXX.

Preamble
import Mathlib.InformationTheory.KullbackLeibler.Basic

open MeasureTheory ProbabilityTheory InformationTheory
Formal statement
theorem InformationTheory.finite_range_mutualInformation_le_log_card
    {Omega Alpha : Type} {mOmega : MeasurableSpace Omega}
    {mAlpha : MeasurableSpace Alpha} {k : ℕ} [NeZero k]
    (mu : Measure Omega) [IsProbabilityMeasure mu]
    (f : Omega → Alpha) (g : Omega → Fin k)
    (hf : Measurable f) (hg : Measurable g) :
    (klDiv (Measure.map (fun x ↦ (f x, g x)) mu)
      ((Measure.map f mu).prod (Measure.map g mu))).toReal ≤ Real.log k := by
  sorry
Source
Lattimore and Szepesvári, Bandit Algorithms (Cambridge UP, 2020), https://tor-lattimore.com/downloads/book/book.pdf, printed p. 471 (PDF p. 480), proof of Theorem 36.5: total information about the k-valued optimal action is at most the log k diameter of negentropy.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me