InformationTheory.Shannon.BroadcastChannel.MartonFullSupport
Broadcast channel — Marton's inner bound without the auxiliary support hypotheses #
marton_region_subset_capacity asks the auxiliary law, the input kernel and the channel to
charge every letter, since the random-coding argument behind it counts jointly typical
sequences. Only the channel hypothesis is intrinsic: an auxiliary law or an input kernel that
misses a letter is a limit of ones that do not, and the three informations of the quadrilateral
are continuous along such a smoothing, because on a finite alphabet each of them is a fixed
polynomial expression in the singleton masses composed with Real.negMulLog. This file runs
that limit and removes the two auxiliary hypotheses.
Main definitions #
martonMixKernel K κ₀ ε— the input kernel smoothed toward a fixed anchor measure, letter by letter, by the clamped-weight mixtureInformationTheory.mixLaw.
Main statements #
marton_region_subset_capacity_of_channel_fullSupport— a Marton quadrilateral is contained in the operational capacity region, under a support hypothesis on the channel alone.martonRegionUnion_subset_capacity— the whole union, not only its full-support part, is contained in the operational capacity region.
Smoothing the input kernel #
InformationTheory.Shannon.BroadcastChannel.Marton.martonMixKernel
sourceThe input kernel smoothed toward a fixed anchor measure κ₀, letter by letter:
martonMixKernel K κ₀ ε v = (1 - ε) • K v + ε • κ₀ with the weight clamped to [0, 1]. For
ε > 0 and a full-support anchor every letter is charged, and at ε = 0 the kernel is K.
Equations
- InformationTheory.Shannon.BroadcastChannel.Marton.martonMixKernel K κ₀ ε = ProbabilityTheory.Kernel.ofFunOfCountable fun (v : V₁ × V₂) => InformationTheory.mixLaw (K v) κ₀ ε
Instances For
Used by
InformationTheory.Shannon.BroadcastChannel.Marton.martonMixKernel_apply
sourceUsed by
InformationTheory.Shannon.BroadcastChannel.Marton.martonMixKernel.instIsMarkovKernel
sourceUsed by
InformationTheory.Shannon.BroadcastChannel.Marton.martonMixKernel_zero
sourceUsed by
Continuity of the three informations along the smoothing #
InformationTheory.Shannon.BroadcastChannel.Marton.martonMixJoint_real_continuous
sourceUsed by
InformationTheory.Shannon.BroadcastChannel.Marton.martonMixJoint_map_real_continuous
sourceUsed by
InformationTheory.Shannon.BroadcastChannel.Marton.martonMix_entropy_continuous
sourceUsed by
InformationTheory.Shannon.BroadcastChannel.Marton.martonInfo₁_mix_continuous
sourceUsed by
InformationTheory.Shannon.BroadcastChannel.Marton.martonInfo₂_mix_continuous
sourceUsed by
InformationTheory.Shannon.BroadcastChannel.Marton.martonInfoV₁V₂_mix_continuous
sourceUsed by
The inner bound under a channel hypothesis alone #
InformationTheory.Shannon.BroadcastChannel.Marton.marton_region_subset_capacity_of_channel_fullSupport
sourceMarton's inner bound sits inside the operational capacity region under a support hypothesis
on the channel alone. Smoothing the auxiliary law and the input kernel toward the uniform ones
makes them charge every letter, and the three informations of the quadrilateral are continuous
along that smoothing, so the two support hypotheses that marton_region_subset_capacity asks of
them are not needed. The channel hypothesis hW is a regularity precondition of the coding
argument and carries no part of it.
Used by
InformationTheory.Shannon.BroadcastChannel.Marton.martonRegionUnion_subset_capacity
sourceMarton's inner bound is achievable in full: the union over all auxiliary laws and input kernels, not only over the full-support ones, is contained in the operational capacity region. Only the channel is required to have full support.