File size: 4,103 Bytes
4a56cd6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 | import OAI.Probability.GaussianReplacement.Comparison
namespace OAI
open MeasureTheory ProbabilityTheory Set Filter
open scoped ENNReal NNReal RealInnerProductSpace Topology
noncomputable section
namespace CurrentProjection
open InnerProductSpace
open InformationTheory
def blockInput {d m : β} {U : Type*} (z : (Sphere d Γ U) Γ Rows m d) :
U Γ (Rows m d Γ (Fin m β β)) :=
(z.1.2, z.2, label z.2 (z.1.1 : Vector d))
lemma measurable_blockInput {d m : β} {U : Type*} [MeasurableSpace U] :
Measurable (blockInput (d:=d) (m:=m) (U:=U)) := by
exact measurable_fst.snd.prodMk (measurable_snd.prodMk
((measurable_own_label (d:=d) (k:=m)).comp
(measurable_snd.prodMk measurable_fst.fst)))
def blockLaw {d m : β} {U V : Type*} [MeasurableSpace U] [MeasurableSpace V]
(P : Measure (Sphere d Γ U))
(ΞΊ : Kernel (U Γ (Rows m d Γ (Fin m β β))) V) :
Measure (((Sphere d Γ U) Γ Rows m d) Γ V) :=
(P.prod (gaussianRows m d)) ββ ΞΊ.comap blockInput measurable_blockInput
instance blockLaw_probability {d m : β} {U V : Type*}
[MeasurableSpace U] [MeasurableSpace V]
(P : Measure (Sphere d Γ U)) [IsProbabilityMeasure P]
(ΞΊ : Kernel (U Γ (Rows m d Γ (Fin m β β))) V) [IsMarkovKernel ΞΊ] :
IsProbabilityMeasure (blockLaw P ΞΊ) := by
unfold blockLaw
infer_instance
def endingSignalLaw {d m : β} {U V : Type*}
[MeasurableSpace U] [MeasurableSpace V]
(P : Measure (Sphere d Γ U))
(ΞΊ : Kernel (U Γ (Rows m d Γ (Fin m β β))) V) : Measure (Sphere d Γ V) :=
(blockLaw P ΞΊ).map (fun z => (z.1.1.1, z.2))
instance endingSignalLaw_probability {d m : β} {U V : Type*}
[MeasurableSpace U] [MeasurableSpace V]
(P : Measure (Sphere d Γ U)) [IsProbabilityMeasure P]
(ΞΊ : Kernel (U Γ (Rows m d Γ (Fin m β β))) V) [IsMarkovKernel ΞΊ] :
IsProbabilityMeasure (endingSignalLaw P ΞΊ) := by
unfold endingSignalLaw
infer_instance
def freshInformation {d : β} {U : Type*} [MeasurableSpace U] [StandardBorelSpace U]
(P : Measure (Sphere d Γ U)) [IsFiniteMeasure P] (k : β) : ββ₯0β :=
exposedInformation (P.prod (gaussianRows k d))
def hybridFirst (d : β) : β := (d+3)/4
def hybridLast (d : β) : β := d/2
def hybridCount (d : β) : β := hybridLast d - hybridFirst d + 1
def averagedFreshInformation {d : β} {U : Type*}
[MeasurableSpace U] [StandardBorelSpace U]
(P : Measure (Sphere d Γ U)) [IsFiniteMeasure P] : β :=
(β k β Finset.Icc (hybridFirst d) (hybridLast d), (freshInformation P k).toReal) /
hybridCount d
def HybridBlockMain : Prop :=
β (C C' : β) (dβ : β), 0 < C β§ 0 < C' β§ β d, dβ β€ d β
β m, 1 β€ m β m β€ d/8 β
β (U V : Type) [Fintype U] [Fintype V]
[MeasurableSpace U] [MeasurableSpace V]
[MeasurableSingletonClass U] [MeasurableSingletonClass V],
β (P : Measure (Sphere d Γ U)) [IsProbabilityMeasure P],
P.fst = uniformSphere d β
β (ΞΊ : Kernel (U Γ (Rows m d Γ (Fin m β β))) V) [IsMarkovKernel ΞΊ],
β (B : β), 0 β€ B β
shannonEntropy (endingSignalLaw P ΞΊ).snd β€ ENNReal.ofReal B β
averagedFreshInformation (endingSignalLaw P ΞΊ) - averagedFreshInformation P β€
C*m + (m:β) / hybridCount d * (C + B / (d/8:β)) + B / (d/32:β) β§
(B β€ (d:β)^2 β
averagedFreshInformation (endingSignalLaw P ΞΊ) - averagedFreshInformation P β€ C'*d)
def FiberBlockMain : Prop :=
β (K : β) (dβ : β), 0 < K β§ β d, dβ β€ d β
β (U V : Type) [Fintype U] [Fintype V]
[MeasurableSpace U] [MeasurableSpace V]
[MeasurableSingletonClass U] [MeasurableSingletonClass V],
β (P : Measure (Sphere dΓU)) [IsProbabilityMeasure P],
P.fst = uniformSphere d β
β (ΞΊ : Kernel (UΓ(Rows (d/10) dΓ(Fin (d/10)ββ))) V) [IsMarkovKernel ΞΊ],
β N : β, 1 β€ N β Fintype.card V β€ N β Real.log N β€ (d:β)^2 β
freshInformation (endingSignalLaw P ΞΊ) (d/3) β€ freshInformation P (d/3) + ENNReal.ofReal (K*d)
end CurrentProjection
end
end OAI
|