InformationTheory.Shannon.EPI.Unconditional.TruncationLimit.Mono
TruncationLimit — monotonicity part #
Fatou lift of the positive-part lintegral, finite-entropy monotonicity via per-fibre translate
Gibbs, and per-n truncation monotonicity. Depends on the Core part (truncW, convolution
density, per-fibre absolute continuity, cross-entropy); re-exported by the umbrella
InformationTheory.Shannon.EPI.Unconditional.TruncationLimit.
InformationTheory.Shannon.lintegral_ofReal_neg_ne_top_of_integrable
sourceUsed by
InformationTheory.Shannon.mul_abs_log_eq_abs_negMulLog_of_nonneg
sourceUsed by
InformationTheory.Shannon.lintegral_enorm_eq_lintegral_ofReal_add_ofReal_neg
sourceUsed by
InformationTheory.Shannon.lintegral_ofReal_eq_top_of_not_hasFiniteIntegral
sourceUsed by
InformationTheory.Shannon.differentialEntropy_eq_neg_integral_mul_log
sourceUsed by
InformationTheory.Shannon.differentialEntropyExt_eq_top_of_not_integrable
sourceUsed by
InformationTheory.Shannon.differentialEntropyExt_posPart_le_liminf_of_ae_tendsto
sourceFatou lift of the positive-part lintegral A μ = ∫⁻ x, ofReal (negMulLog (rnDeriv μ vol x)):
from a.e. convergence of the densities (μ_n).rnDeriv vol → μ.rnDeriv vol, the lower bound
A μ ≤ liminf (A μ_n). Built from lintegral_liminf_le with continuity of negMulLog and
ENNReal.ofReal.
@audit:ok
Used by
InformationTheory.Shannon.integral_map_add_const_eq_integral_translate_mul
sourceUsed by
InformationTheory.Shannon.rnDeriv_conv_toReal_aeeq_integral_translate
sourceUsed by
InformationTheory.Shannon.lintegral_ofReal_translate_density_aeeq
sourceUsed by
InformationTheory.Shannon.lintegral_translate_mul_abs_log_ne_top
sourceUsed by
InformationTheory.Shannon.integrable_translate_mul_log
sourceUsed by
InformationTheory.Shannon.integral_neg_translate_log_eq_differentialEntropy
sourceUsed by
InformationTheory.Shannon.differentialEntropyExt_mono_add_of_integrable
sourceFinite-entropy monotonicity of differential entropy under independent addition: for W a.c.,
W ⊥ V, and Q.map W of finite differential entropy (hW_ent), h(W) ≤ h(W+V). The proof uses
per-fibre translate Gibbs and splits on finiteness of ν = W+V (finite branch: real-valued Gibbs;
⊤ branch: le_top). It requires no truncation, so it applies directly to an un-truncated W.
@audit:ok
Used by
InformationTheory.Shannon.truncW_indepFun_of_indepFun
sourceUsed by
InformationTheory.Shannon.truncW_map_negMulLog_negPart_lintegral_ne_top
sourceUsed by
InformationTheory.Shannon.differentialEntropyExt_mono_add_truncW
sourcePer-n monotonicity h(W_n) ≤ h(W_n + V), where W_n := truncW P W n is the compact-support
approximation obtained by conditioning P on the W-event {|W| ≤ n}. The preamble supplies the
truncation-specific regularity (a.c., independence, and finite entropy preserved under
conditioning), then delegates to the truncation-free core
differentialEntropyExt_mono_add_of_integrable.
@audit:ok