InformationTheory.Shannon.EPI.Unconditional.Dispatch
Entropy power inequality — case-1 dispatch #
The two-a.c. classical entropy power inequality N(X+Y) ≥ N(X) + N(Y) (case 1 of the
absolute-continuity case split) together with the four-case dispatch skeleton that combines it
with the mixed and singular cases.
Main statements #
entropyPowerExt_add_ge_finite_ac— case 1 (both push-forwards a.c. with finite differential entropy): the extended-real entropy power inequality, split by finiteness of variance.entropy_power_inequality_of_ac— the real-valued entropy power inequality under absolute continuity and finite differential entropy.
Implementation notes #
- This file sits downstream of both
EPIUncondMixedCaseandEPICase1SmoothingLimitso that the case-1 lemma can delegate toEPICase1SmoothingLimit.entropyPowerExt_add_ge_of_finite_variance. Placing the dispatch in either of those files instead would introduce an import cycle, sinceEPICase1SmoothingLimitalready (transitively) importsEPIUncondMixedCase. - Case 1 is split by whether both inputs have finite variance: the finite-variance branch
delegates to the smoothing-limit closure, the infinite-variance branch to the conditioning
truncation (route T) closure. Both branches are
sorryAx-free.
InformationTheory.Shannon.entropyPowerExt_add_ge_finite_ac
sourceThe classical entropy power inequality N(X+Y) ≥ N(X) + N(Y) when both P.map X and
P.map Y are absolutely continuous and have finite differential entropy. The proof splits on
whether both inputs have finite variance: the finite-variance branch delegates to the
smoothing-limit closure, the infinite-variance branch to the conditioning-truncation (route T)
closure. The hypotheses hX_ent/hY_ent/hW_ent are finite-differential-entropy regularity
preconditions.
@audit:ok
Used by
InformationTheory.Shannon.entropyPowerExt_add_ge_dispatch_skeleton
sourceFour-case dispatch for the extended-real entropy power inequality, splitting on absolute
continuity of P.map X and P.map Y: both a.c. delegates to entropyPowerExt_add_ge_finite_ac,
the mixed cases to entropyPowerExt_mixed_add_ge_of_regular / _symm_of_regular, and the
doubly-singular case to entropyPowerExt_singular_add_ge. The integrability and finite-entropy
hypotheses are path-dependent regularity preconditions threaded into the mixed-case lemmas.
@audit:superseded-by(entropyPowerExt_add_ge) The fully unconditional version
entropyPowerExt_add_ge (in EPI.Unconditional.DispatchFull, taking only hX hY hXY) is the
canonical headline; this skeleton is retained as a proof-done leaf with no consumers.
@audit:ok
Used by
InformationTheory.Shannon.entropy_power_inequality_of_ac
sourceThe real-valued entropy power inequality N(X+Y) ≥ N(X) + N(Y) (with entropyPower μ = exp (2 · h μ)) for independent X, Y whose push-forwards are absolutely continuous with finite
differential entropy. The inequality is supplied by the extended-real version
entropyPowerExt_add_ge_finite_ac; this lemma only transports it across ℝ≥0∞ → ℝ via
entropyPowerExt_of_ac_integrable.
@audit:ok