InformationTheory.Shannon.RateDistortion.Convexity
Rate-distortion convexity #
Convexity of the rate-distortion function in the distortion threshold
(Cover–Thomas): for all D₁ D₂ : ℝ and λ ∈ [0, 1],
R(λ D₁ + (1-λ) D₂) ≤ λ R(D₁) + (1-λ) R(D₂).
Main definitions #
mixtureMeasure— the convex combination of two joint measures at weightλ.
Main statements #
rateDistortionFunction_convexOn— convexity of the rate-distortion function.
Implementation notes #
The joint convexity of klDiv (Cover–Thomas) is not available directly in
Mathlib, so it is derived along the data-processing route in three layers:
klDiv_joint_convex (a selector-extension on Bool × Ω combined with the
pushforward DPI klDiv_map_le and the per-slice KL additivity of mutually
singular components) → klDiv_mixture_le → rateDistortionFunction_convexOn.
The infimum over feasible joints is pressed through
ENNReal.mul_iInf_of_ne / iInf_add / add_iInf, with the boundary weights
λ = 0, 1 handled in separate branches.
References #
- T. M. Cover and J. A. Thomas, Elements of Information Theory (2nd ed.), Wiley, 2006.
Mixture measure and feasibility #
InformationTheory.Shannon.mixtureMeasure
sourceConvex combination of two joint measures on α × β with weight λ ∈ [0, 1].
Equations
- InformationTheory.Shannon.mixtureMeasure lam ν₁ ν₂ = ENNReal.ofReal lam • ν₁ + ENNReal.ofReal (1 - lam) • ν₂
Instances For
Used by
InformationTheory.Shannon.mixtureMeasure_map_fst
sourceProd.fst pushforward of a convex combination is the convex combination of pushforwards.
Used by
InformationTheory.Shannon.mixtureMeasure_map_snd
sourceProd.snd pushforward of a convex combination is the convex combination of pushforwards.
Used by
InformationTheory.Shannon.mixtureMeasure_map_fst_eq
sourceIf two joint distributions share the same Prod.fst marginal P, then so does
their convex combination (with λ ∈ [0, 1]).
Used by
InformationTheory.Shannon.expectedDistortion_mixtureMeasure
sourceExpected distortion is linear in the joint measure: distortion of the convex combination equals the convex combination of distortions, provided distortion is integrable under each joint.
Used by
InformationTheory.Shannon.mixtureMeasure_feasible
sourceFeasibility is preserved under convex combinations: if ν₁ is feasible at D₁
and ν₂ is feasible at D₂, then mixtureMeasure λ ν₁ ν₂ is feasible at
λ D₁ + (1-λ) D₂.
Used by
Convexity of the rate-distortion function #
The joint convexity of klDiv is obtained along the data-processing route in
three layers: klDiv_joint_convex (joint convexity stripped of the
rate-distortion marginal structure), klDiv_mixture_le (its specialization to
the mixture-measure form), and rateDistortionFunction_convexOn (the infimum
press).
klDiv joint convexity gateway #
InformationTheory.Shannon.klDiv_joint_convex
sourceJoint convexity of klDiv, stated independently of the rate-distortion
marginal structure: built from the selector extension on Bool × Ω, the
pushforward DPI klDiv_map_le (forgetting the selector via Prod.snd), and the
per-slice KL computation klDiv_two_slice.
The hypotheses _hlam₀ / _hlam₁ (lam ∈ [0,1]) are unused in the body: the
ENNReal.ofReal clamp of negative values makes the statement hold for every
lam, so they are kept only as framing.
@audit:ok
Used by
klDiv joint convexity in mixture-measure form #
InformationTheory.Shannon.klDiv_mixture_le
sourceJoint convexity of klDiv in mixture-measure form: the denominator P
(the X-marginal) is fixed across both witnesses, only ν.map snd is linear.
Specialization of klDiv_joint_convex.
@audit:ok
Used by
Convexity of the rate-distortion function (infimum press) #
InformationTheory.Shannon.rateDistortionFunction_convexOn
sourceThe rate-distortion function is convex in the distortion threshold,
R(λ D₁ + (1-λ) D₂) ≤ λ R(D₁) + (1-λ) R(D₂).
The hypothesis h_int_witness (integrability of d on every joint with
Prod.fst-marginal P) is a regularity precondition, needed so that the
mixture witness has well-defined feasibility (expectedDistortion linearity).
@audit:ok