InformationTheory

InformationTheory.Shannon.EPI.Unconditional.TruncationLimit.Mono

source

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.

theorem

InformationTheory.Shannon.lintegral_ofReal_neg_ne_top_of_integrable

source
{α : Type u_2} {m : MeasurableSpace α} {μ : MeasureTheory.Measure α} {g : α} (hg : MeasureTheory.Integrable g μ) :
∫⁻ (x : α), ENNReal.ofReal (-g x) μ
Used by
    theorem

    InformationTheory.Shannon.mul_abs_log_eq_abs_negMulLog_of_nonneg

    source
    {r : } (hr : 0 r) :
    Used by
      theorem

      InformationTheory.Shannon.lintegral_enorm_eq_lintegral_ofReal_add_ofReal_neg

      source
      {α : Type u_2} {m : MeasurableSpace α} {μ : MeasureTheory.Measure α} {g : α} (hg : Measurable g) :
      ∫⁻ (x : α), g x‖ₑ μ = ∫⁻ (x : α), ENNReal.ofReal (g x) μ + ∫⁻ (x : α), ENNReal.ofReal (-g x) μ
      Used by
        theorem

        InformationTheory.Shannon.lintegral_ofReal_eq_top_of_not_hasFiniteIntegral

        source
        {α : Type u_2} {m : MeasurableSpace α} {μ : MeasureTheory.Measure α} {g : α} (hg : Measurable g) (hnotfin : ¬MeasureTheory.HasFiniteIntegral g μ) (hneg : ∫⁻ (x : α), ENNReal.ofReal (-g x) μ ) :
        ∫⁻ (x : α), ENNReal.ofReal (g x) μ =
        Used by
          theorem

          InformationTheory.Shannon.differentialEntropy_eq_neg_integral_mul_log

          source
          Used by
            theorem

            InformationTheory.Shannon.differentialEntropyExt_eq_top_of_not_integrable

            source
            Used by
              theorem

              InformationTheory.Shannon.differentialEntropyExt_posPart_le_liminf_of_ae_tendsto

              source

              Fatou 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
                theorem

                InformationTheory.Shannon.integral_map_add_const_eq_integral_translate_mul

                source
                (μW : MeasureTheory.Measure ) [MeasureTheory.SigmaFinite μW] (hμW_ac : μW.AbsolutelyContinuous MeasureTheory.volume) (z : ) (g : ) :
                (x : ), g x MeasureTheory.Measure.map (fun (x : ) => x + z) μW = (x : ), (μW.rnDeriv MeasureTheory.volume (x - z)).toReal * g x
                Used by
                  theorem

                  InformationTheory.Shannon.rnDeriv_conv_toReal_aeeq_integral_translate

                  source
                  Used by
                    theorem

                    InformationTheory.Shannon.lintegral_ofReal_translate_density_aeeq

                    source
                    Used by
                      theorem

                      InformationTheory.Shannon.lintegral_translate_mul_abs_log_ne_top

                      source
                      Used by
                        theorem

                        InformationTheory.Shannon.integrable_translate_mul_log

                        source
                        Used by
                          theorem

                          InformationTheory.Shannon.integral_neg_translate_log_eq_differentialEntropy

                          source
                          Used by
                            theorem

                            InformationTheory.Shannon.differentialEntropyExt_mono_add_of_integrable

                            source

                            Finite-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
                              theorem

                              InformationTheory.Shannon.truncW_indepFun_of_indepFun

                              source
                              {Ω : Type u_1} [MeasurableSpace Ω] (W V : Ω) (P : MeasureTheory.Measure Ω) [MeasureTheory.IsProbabilityMeasure P] (hW : Measurable W) (_hV : Measurable V) (hWV : ProbabilityTheory.IndepFun W V P) (n : ) (hn : P {ω : Ω | |W ω| n} 0) :
                              Used by
                                theorem

                                InformationTheory.Shannon.truncW_map_negMulLog_negPart_lintegral_ne_top

                                source
                                {Sn : Set } (_hSn_meas : MeasurableSet Sn) {ρ : ENNReal} (hρ_meas : Measurable ρ) (hρ_lint : ∫⁻ (x : ), ENNReal.ofReal (ρ x).toReal = 1) {c : ENNReal} (_hc_top : c ) {fn : } (h_fn_ae : ∀ᵐ (x : ), fn x = (c⁻¹ * Sn.indicator ρ x).toReal) (hρ_negPart_fin : ∫⁻ (x : ), ENNReal.ofReal (-(ρ x).toReal.negMulLog) ) :
                                Used by
                                  theorem

                                  InformationTheory.Shannon.differentialEntropyExt_mono_add_truncW

                                  source

                                  Per-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

                                  Used by