InformationTheory.Shannon.ParallelGaussian.Converse.Core
Product-measure absolute continuity #
InformationTheory.Shannon.ParallelGaussian.pi_absolutelyContinuous
sourceMeasure.pi preserves absolute continuity w.r.t. volume. If every factor
μ i ≪ volume (each a probability measure), then Measure.pi μ ≪ volume.
@audit:ok
Used by
InformationTheory.Shannon.ParallelGaussian.pi_absolutelyContinuous_reverse
sourceReverse Measure.pi absolute continuity from componentwise mutual AC. If every factor
is mutually absolutely continuous with volume (ν i ≪ volume and volume ≪ ν i), then
volume ≪ Measure.pi ν.
@audit:ok
Used by
InformationTheory.Shannon.ParallelGaussian.volume_absolutelyContinuous_pi_gaussian
sourceReverse full-support AC for a Gaussian product fibre.
volume ≪ Measure.pi (gaussianReal (x i) (N i)) whenever every N i ≠ 0, since the product
of everywhere-positive Gaussian densities gives the reverse AC.
@audit:ok
Used by
InformationTheory.Shannon.ParallelGaussian.jointDifferentialEntropyPi_pi_eq_sum
sourceProduct → sum differential entropy identity. For a product of probability measures
μ i ≪ volume on ℝ, the joint differential entropy of Measure.pi μ is the coordinate sum
of the 1-D entropies, jointDifferentialEntropyPi (Measure.pi μ) = ∑ i, differentialEntropy (μ i). The per-component log-density integrability h_int is a regularity precondition
(satisfied by Gaussians).
@audit:ok
Used by
InformationTheory.Shannon.ParallelGaussian.gaussianReal_logRnDeriv_integrable
sourcePer-Gaussian log-density integrability. For v ≠ 0,
log ((gaussianReal m v).rnDeriv volume y).toReal is integrable against gaussianReal m v;
it is the affine-in-(y-m)² function -(1/2)log(2πv) - (y-m)²/(2v).
@audit:ok
Used by
Channel↔RV MI decomposition, generic lift #
The single-coordinate decomposition is hardwired to Measure ℝ / differentialEntropy.
The same chain is re-derived over a generic measurable space β with a SigmaFinite
reference measure vol, producing the entropy in raw ∫ log(rnDeriv) ∂ form, then
specialized to β = Fin n → ℝ, vol = volume.
InformationTheory.Shannon.ParallelGaussian.parallel_mutualInfoOfChannel_toReal_eq_diffEntropyPi_sub
sourceChannel↔RV MI decomposition, Fin n → ℝ lift. Specializes the generic chain rule to
β = Fin n → ℝ, vol = volume, producing the entropy in jointDifferentialEntropyPi form.
The absolute-continuity / log-density-integrability hypotheses are regularity preconditions.
@audit:ok
Used by
Correlated-output regularity preconditions #
The decomposition and the subadditivity step both consume regularity preconditions of the
correlated output law μY := outputDistribution p (parallelGaussianChannel N …): absolute
continuity of the joint and of every coordinate marginal w.r.t. Lebesgue measure, the
joint-vs-product absolute continuity, and the log-density integrabilities. These follow from
Gaussian smoothing (each fibre is a full-support product, so the output is
volume-equivalent), supplied here for an arbitrary correlated input as named lemmas.
InformationTheory.Shannon.ParallelGaussian.parallelChannel_fibre_absolutelyContinuous_volume
sourceEach fibre is absolutely continuous w.r.t. volume. Each component
gaussianReal (x i) (N i) ≪ volume, so the product fibre is ≪ volume.
@audit:ok
Used by
InformationTheory.Shannon.ParallelGaussian.piGaussProxy
sourceGaussian-PDF-product proxy density z ↦ ∏ᵢ gaussianPDF (z.1 i) (N i) (z.2 i) for the
Fin n → ℝ fibre, named so the decomposition lift receives a single atomic g argument
rather than a ∏ gaussianPDF lambda that the unifier repeatedly expands.
@audit:ok
Equations
- InformationTheory.Shannon.ParallelGaussian.piGaussProxy N z = ∏ i : Fin n, ProbabilityTheory.gaussianPDF (z.1 i) (N i) (z.2 i)