InformationTheory

InformationTheory.Shannon.BroadcastChannel.OuterBoundUV.Quantization

source

Broadcast channel — truncating the countable auxiliary of the UV outer region #

The UV outer region is indexed by five-tuple laws whose two auxiliaries range over , while an inner bound reads its auxiliary off a finite alphabet. Truncating the first auxiliary at a level m, folding every letter at or above m into a single one, moves a law of the outer region onto the finite alphabet Fin (m + 1), and the two slots the truncated auxiliary appears in move in opposite directions.

The conditional slot I(X; Y₁ ∣ U) can only grow: the truncated auxiliary is a function of the original one, and a channel law makes the auxiliary reach the first output through the input letter only, so the extra conditioning the original auxiliary would supply is already spent. The corner slot I(U; Y₂) can shrink, by exactly the information the original auxiliary still carries once the truncated one is known. That information lives on the fibers of the truncation, all but one of which pin the auxiliary to a single letter, so it is carried by the tail alone and the finite output alphabet caps it by log |β₂|.

Main definitions #

  • uvQuantize m — the truncating quantizer of the countable auxiliary.
  • uvQuantizeLaw ν m — the five-tuple law with its first auxiliary truncated at level m.
  • uvQuantizeSlack ν m — the tail mass of the auxiliary times log |β₂|.

Main statements #

Finiteness and monotonicity of the information slots #

Finiteness of the slots over a countable auxiliary #

theorem

InformationTheory.Shannon.BroadcastChannel.uvInfo₂_ne_top

source
{α : Type u} {β₁ : Type u_1} {β₂ : Type u_2} [MeasurableSpace α] [MeasurableSpace β₁] [Fintype β₂] [Nonempty β₂] [MeasurableSpace β₂] [MeasurableSingletonClass β₂] {U : Type u_3} {V : Type u_4} [MeasurableSpace U] [StandardBorelSpace U] [Nonempty U] [MeasurableSpace V] (ν : MeasureTheory.Measure (U × V × α × β₁ × β₂)) [MeasureTheory.IsProbabilityMeasure ν] :
Used by
    theorem

    InformationTheory.Shannon.BroadcastChannel.uvInfoSum₂_ne_top

    source
    {α : Type u} {β₁ : Type u_1} {β₂ : Type u_2} [Fintype α] [Nonempty α] [MeasurableSpace α] [MeasurableSingletonClass α] [Fintype β₁] [Nonempty β₁] [MeasurableSpace β₁] [MeasurableSingletonClass β₁] [Fintype β₂] [Nonempty β₂] [MeasurableSpace β₂] [MeasurableSingletonClass β₂] {U : Type u_3} {V : Type u_4} [MeasurableSpace U] [StandardBorelSpace U] [Nonempty U] [MeasurableSpace V] (ν : MeasureTheory.Measure (U × V × α × β₁ × β₂)) [MeasureTheory.IsProbabilityMeasure ν] :
    Used by

      Coarsening the conditioner of the sum-rate slot #

      theorem

      InformationTheory.Shannon.BroadcastChannel.IsUVChannelLaw.condMutualInfo_le_map_cond

      source
      {α : Type u} {β₁ : Type u_1} {β₂ : Type u_2} [Fintype α] [Nonempty α] [MeasurableSpace α] [MeasurableSingletonClass α] [Fintype β₁] [Nonempty β₁] [MeasurableSpace β₁] [MeasurableSingletonClass β₁] [Fintype β₂] [Nonempty β₂] [MeasurableSpace β₂] [MeasurableSingletonClass β₂] {U : Type u_3} {V : Type u_4} [MeasurableSpace U] [StandardBorelSpace U] [Nonempty U] [MeasurableSpace V] [StandardBorelSpace V] [Nonempty V] {U' : Type u_5} [MeasurableSpace U'] [StandardBorelSpace U'] [Nonempty U'] {W : BCChannel α β₁ β₂} [ProbabilityTheory.IsMarkovKernel W] {ν : MeasureTheory.Measure (U × V × α × β₁ × β₂)} [MeasureTheory.IsProbabilityMeasure ν] (h : IsUVChannelLaw W ν) {f : UU'} (hf : Measurable f) :
      (condMutualInfo ν (fun (q : U × V × α × β₁ × β₂) => q.2.2.1) (fun (q : U × V × α × β₁ × β₂) => q.2.2.2.1) fun (q : U × V × α × β₁ × β₂) => q.1) condMutualInfo ν (fun (q : U × V × α × β₁ × β₂) => q.2.2.1) (fun (q : U × V × α × β₁ × β₂) => q.2.2.2.1) fun (q : U × V × α × β₁ × β₂) => f q.1
      Used by

        Truncating the countable auxiliary #

        The truncating quantizer #

        def

        InformationTheory.Shannon.BroadcastChannel.uvQuantize

        source
        (m k : ) :

        The truncating quantizer of the countable auxiliary: letters below the truncation level are kept and every letter at or above it is folded into the top one.

        Equations
        Instances For
          Used by
            theorem

            InformationTheory.Shannon.BroadcastChannel.measurable_uvQuantize

            source
            Used by
              theorem

              InformationTheory.Shannon.BroadcastChannel.uvQuantize_down_eq_iff

              source
              (m k : ) :
              (uvQuantize m k).down = m m k
              Used by
                noncomputable def

                InformationTheory.Shannon.BroadcastChannel.uvQuantizeLaw

                source
                {α : Type u} {β₁ : Type u_1} {β₂ : Type u_2} [MeasurableSpace α] [MeasurableSpace β₁] [MeasurableSpace β₂] (ν : MeasureTheory.Measure ( × × α × β₁ × β₂)) (m : ) :
                MeasureTheory.Measure (ULift.{u, 0} (Fin (m + 1)) × × α × β₁ × β₂)

                The five-tuple law with its first auxiliary truncated at level m.

                Equations
                • One or more equations did not get rendered due to their size.
                Instances For
                  Used by
                    noncomputable def

                    InformationTheory.Shannon.BroadcastChannel.uvQuantizeSlack

                    source
                    {α : Type u} {β₁ : Type u_1} {β₂ : Type u_2} [MeasurableSpace α] [MeasurableSpace β₁] [Fintype β₂] [MeasurableSpace β₂] (ν : MeasureTheory.Measure ( × × α × β₁ × β₂)) (m : ) :

                    The information the truncation can cost: the tail mass of the auxiliary times the largest entropy the second output alphabet can carry.

                    Equations
                    Instances For
                      Used by
                        instance

                        InformationTheory.Shannon.BroadcastChannel.uvQuantizeLaw_isProbabilityMeasure

                        source
                        Used by
                          theorem

                          InformationTheory.Shannon.BroadcastChannel.uvQuantizeLaw_isUVChannelLaw

                          source
                          {α : Type u} {β₁ : Type u_1} {β₂ : Type u_2} [MeasurableSpace α] [MeasurableSpace β₁] [MeasurableSpace β₂] (W : BCChannel α β₁ β₂) [ProbabilityTheory.IsMarkovKernel W] {ν : MeasureTheory.Measure ( × × α × β₁ × β₂)} [MeasureTheory.SFinite ν] (h : IsUVChannelLaw W ν) (m : ) :
                          Used by

                            The slots of the truncated law #

                            theorem

                            InformationTheory.Shannon.BroadcastChannel.uvInfo₁_uvQuantizeLaw

                            source
                            {α : Type u} {β₁ : Type u_1} {β₂ : Type u_2} [MeasurableSpace α] [MeasurableSpace β₁] [MeasurableSpace β₂] (ν : MeasureTheory.Measure ( × × α × β₁ × β₂)) [MeasureTheory.IsProbabilityMeasure ν] (m : ) :
                            Used by
                              theorem

                              InformationTheory.Shannon.BroadcastChannel.uvInfo₂_uvQuantizeLaw

                              source
                              {α : Type u} {β₁ : Type u_1} {β₂ : Type u_2} [MeasurableSpace α] [MeasurableSpace β₁] [MeasurableSpace β₂] (ν : MeasureTheory.Measure ( × × α × β₁ × β₂)) (m : ) :
                              uvInfo₂ (uvQuantizeLaw ν m) = mutualInfo ν (fun (q : × × α × β₁ × β₂) => uvQuantize m q.1) fun (q : × × α × β₁ × β₂) => q.2.2.2.2
                              Used by
                                theorem

                                InformationTheory.Shannon.BroadcastChannel.condMutualInfo_uvQuantizeLaw

                                source
                                {α : Type u} {β₁ : Type u_1} {β₂ : Type u_2} [Fintype α] [Nonempty α] [MeasurableSpace α] [MeasurableSingletonClass α] [Fintype β₁] [Nonempty β₁] [MeasurableSpace β₁] [MeasurableSingletonClass β₁] [MeasurableSpace β₂] (ν : MeasureTheory.Measure ( × × α × β₁ × β₂)) [MeasureTheory.IsProbabilityMeasure ν] (m : ) :
                                (condMutualInfo (uvQuantizeLaw ν m) (fun (q : ULift.{u, 0} (Fin (m + 1)) × × α × β₁ × β₂) => q.2.2.1) (fun (q : ULift.{u, 0} (Fin (m + 1)) × × α × β₁ × β₂) => q.2.2.2.1) fun (q : ULift.{u, 0} (Fin (m + 1)) × × α × β₁ × β₂) => q.1) = condMutualInfo ν (fun (q : × × α × β₁ × β₂) => q.2.2.1) (fun (q : × × α × β₁ × β₂) => q.2.2.2.1) fun (q : × × α × β₁ × β₂) => uvQuantize m q.1
                                Used by
                                  theorem

                                  InformationTheory.Shannon.BroadcastChannel.uvQuantizeSlack_ne_top

                                  source
                                  {α : Type u} {β₁ : Type u_1} {β₂ : Type u_2} [MeasurableSpace α] [MeasurableSpace β₁] [Fintype β₂] [MeasurableSpace β₂] (ν : MeasureTheory.Measure ( × × α × β₁ × β₂)) (m : ) [MeasureTheory.IsFiniteMeasure ν] :
                                  Used by

                                    The tail estimate for the corner slot #

                                    theorem

                                    InformationTheory.Shannon.BroadcastChannel.ae_ae_uvQuantize_eq_fst

                                    source
                                    {α : Type u} {β₁ : Type u_1} {β₂ : Type u_2} [Fintype α] [Nonempty α] [MeasurableSpace α] [MeasurableSingletonClass α] [Fintype β₁] [Nonempty β₁] [MeasurableSpace β₁] [MeasurableSingletonClass β₁] [Fintype β₂] [Nonempty β₂] [MeasurableSpace β₂] [MeasurableSingletonClass β₂] (ν : MeasureTheory.Measure ( × × α × β₁ × β₂)) [MeasureTheory.IsProbabilityMeasure ν] (m : ) :
                                    ∀ᵐ (t : ULift.{u, 0} (Fin (m + 1))) MeasureTheory.Measure.map (fun (q : × × α × β₁ × β₂) => uvQuantize m q.1) ν, ∀ᵐ (q : × × α × β₁ × β₂) (ProbabilityTheory.condDistrib id (fun (q : × × α × β₁ × β₂) => uvQuantize m q.1) ν) t, uvQuantize m q.1 = t
                                    Used by
                                      theorem

                                      InformationTheory.Shannon.BroadcastChannel.lintegral_mutualInfo_condDistrib_le_uvQuantizeSlack

                                      source
                                      {α : Type u} {β₁ : Type u_1} {β₂ : Type u_2} [Fintype α] [Nonempty α] [MeasurableSpace α] [MeasurableSingletonClass α] [Fintype β₁] [Nonempty β₁] [MeasurableSpace β₁] [MeasurableSingletonClass β₁] [Fintype β₂] [Nonempty β₂] [MeasurableSpace β₂] [MeasurableSingletonClass β₂] (ν : MeasureTheory.Measure ( × × α × β₁ × β₂)) [MeasureTheory.IsProbabilityMeasure ν] (m : ) :
                                      ∫⁻ (t : ULift.{u, 0} (Fin (m + 1))), mutualInfo ((ProbabilityTheory.condDistrib id (fun (q : × × α × β₁ × β₂) => uvQuantize m q.1) ν) t) (fun (q : × × α × β₁ × β₂) => q.1) fun (q : × × α × β₁ × β₂) => q.2.2.2.2 MeasureTheory.Measure.map (fun (q : × × α × β₁ × β₂) => uvQuantize m q.1) ν uvQuantizeSlack ν m
                                      Used by
                                        theorem

                                        InformationTheory.Shannon.BroadcastChannel.mutualInfo_le_mutualInfo_uvQuantize_add_slack

                                        source
                                        {α : Type u} {β₁ : Type u_1} {β₂ : Type u_2} [Fintype α] [Nonempty α] [MeasurableSpace α] [MeasurableSingletonClass α] [Fintype β₁] [Nonempty β₁] [MeasurableSpace β₁] [MeasurableSingletonClass β₁] [Fintype β₂] [Nonempty β₂] [MeasurableSpace β₂] [MeasurableSingletonClass β₂] (ν : MeasureTheory.Measure ( × × α × β₁ × β₂)) [MeasureTheory.IsProbabilityMeasure ν] (m : ) :
                                        (mutualInfo ν (fun (q : × × α × β₁ × β₂) => q.1) fun (q : × × α × β₁ × β₂) => q.2.2.2.2) (mutualInfo ν (fun (q : × × α × β₁ × β₂) => uvQuantize m q.1) fun (q : × × α × β₁ × β₂) => q.2.2.2.2) + uvQuantizeSlack ν m
                                        Used by

                                          The truncation estimates at the level of the slots #

                                          theorem

                                          InformationTheory.Shannon.BroadcastChannel.uvInfo₂_le_uvQuantizeLaw_add_slack

                                          source
                                          {α : Type u} {β₁ : Type u_1} {β₂ : Type u_2} [Fintype α] [Nonempty α] [MeasurableSpace α] [MeasurableSingletonClass α] [Fintype β₁] [Nonempty β₁] [MeasurableSpace β₁] [MeasurableSingletonClass β₁] [Fintype β₂] [Nonempty β₂] [MeasurableSpace β₂] [MeasurableSingletonClass β₂] (ν : MeasureTheory.Measure ( × × α × β₁ × β₂)) [MeasureTheory.IsProbabilityMeasure ν] (m : ) :
                                          Used by
                                            theorem

                                            InformationTheory.Shannon.BroadcastChannel.uvInfoSum₂_le_uvQuantizeLaw_add_slack

                                            source
                                            {α : Type u} {β₁ : Type u_1} {β₂ : Type u_2} [Fintype α] [Nonempty α] [MeasurableSpace α] [MeasurableSingletonClass α] [Fintype β₁] [Nonempty β₁] [MeasurableSpace β₁] [MeasurableSingletonClass β₁] [Fintype β₂] [Nonempty β₂] [MeasurableSpace β₂] [MeasurableSingletonClass β₂] (W : BCChannel α β₁ β₂) [ProbabilityTheory.IsMarkovKernel W] {ν : MeasureTheory.Measure ( × × α × β₁ × β₂)} [MeasureTheory.IsProbabilityMeasure ν] (h : IsUVChannelLaw W ν) (m : ) :
                                            Used by
                                              theorem

                                              InformationTheory.Shannon.BroadcastChannel.tendsto_uvQuantizeSlack

                                              source
                                              {α : Type u} {β₁ : Type u_1} {β₂ : Type u_2} [MeasurableSpace α] [MeasurableSpace β₁] [Fintype β₂] [MeasurableSpace β₂] (ν : MeasureTheory.Measure ( × × α × β₁ × β₂)) [MeasureTheory.IsProbabilityMeasure ν] :
                                              Used by