roseking's picture
Add lean source and binary files (part 84)
cdec422 verified
Raw History Blame Contribute Delete
4.45 kB
import Mathlib
namespace OAI
section
noncomputable section
open scoped BigOperators
namespace SoftChannel204
abbrev Cube (n : ℕ) := Fin n → Bool
def sign (b : Bool) : ℝ := if b then 1 else -1
def avg {n : ℕ} (g : Cube n → ℝ) : ℝ := (∑ x, g x) / (2 : ℝ) ^ n
def L : ℝ := Real.log 2
def psi (r : ℝ) : ℝ :=
(1 + r) / 2 * Real.log (1 + r) + (1 - r) / 2 * Real.log (1 - r)
def H (r : ℝ) : ℝ := L - psi r
def info {n : ℕ} (u : Cube n → ℝ) : ℝ := H (avg u) - avg (H ∘ u)
def psiInv (s : ℝ) : ℝ := Function.invFunOn psi (Set.Icc 0 1) s
def kernel {n : ℕ} (ρ : ℝ) (x y : Cube n) : ℝ :=
∏ i, if x i = y i then (1 + ρ) / 2 else (1 - ρ) / 2
def noise {n : ℕ} (ρ : ℝ) (u : Cube n → ℝ) (y : Cube n) : ℝ :=
∑ x, kernel ρ y x * u x
def Closed {n : ℕ} (u : Cube n → ℝ) : Prop := ∀ x, u x ∈ Set.Icc (-1) 1
def Interior {n : ℕ} (g : Cube n → ℝ) : Prop := ∀ x, g x ∈ Set.Ioo (-1) 1
def softCoordinate {n : ℕ} (i : Fin n) (a : ℝ) (x : Cube n) : ℝ := a * sign (x i)
def flip {n : ℕ} (i : Fin n) (x : Cube n) : Cube n := Function.update x i (!(x i))
def numberOperator {n : ℕ} (g : Cube n → ℝ) (x : Cube n) : ℝ :=
(1 / 2 : ℝ) * ∑ i, (g x - g (flip i x))
def production {n : ℕ} (g : Cube n → ℝ) : ℝ :=
avg (fun x => Real.artanh (g x) * numberOperator g x)
/-- Defined by this formula on `[0, L)`; no finite endpoint value at `L` is asserted. -/
def F (s : ℝ) : ℝ := psiInv s * Real.artanh (psiInv s)
/-- The excess `F s - 2 * s`, used for `s < L`, is extended by zero to negative arguments. -/
def S (s : ℝ) : ℝ := if s < 0 then 0 else F s - 2 * s
/-- The reserve is used for `|m| < 1` and `0 ≤ I < H m`. -/
def reserve (m I : ℝ) : ℝ :=
2 * I + (1 - m ^ 2) * S (L - (H m - I) / (1 - m ^ 2))
def hybrid (m I : ℝ) : ℝ := max (reserve m I) (F I)
def softJoint {n : ℕ} (ρ : ℝ) (u : Cube n → ℝ) (b : Bool) (y : Cube n) : ℝ :=
avg (fun x => (1 + sign b * u x) / 2 * kernel ρ x y)
def boolJoint {n : ℕ} (ρ : ℝ) (f : Cube n → Bool) (b : Bool) (y : Cube n) : ℝ :=
avg (fun x => if f x = b then kernel ρ x y else 0)
def leftMarginal {n : ℕ} (p : Bool → Cube n → ℝ) (b : Bool) : ℝ := ∑ y, p b y
def rightMarginal {n : ℕ} (p : Bool → Cube n → ℝ) (y : Cube n) : ℝ := ∑ b, p b y
def mutualInformation {n : ℕ} (p : Bool → Cube n → ℝ) : ℝ :=
∑ b, ∑ y, if 0 < p b y then
p b y * Real.log (p b y / (leftMarginal p b * rightMarginal p y)) else 0
def binaryEntropyBits (ε : ℝ) : ℝ :=
-(ε * Real.log ε + (1 - ε) * Real.log (1 - ε)) / L
def SoftContraction : Prop := ∀ (n : ℕ) (u : Cube n → ℝ), Closed u →
∀ ρ ∈ Set.Icc (-1 : ℝ) 1,
info (noise ρ u) ≤ psi (|ρ| * psiInv (info u))
def SoftAttainment : Prop := ∀ (n : ℕ) (i : Fin n) (a : ℝ), |a| ≤ 1 →
∀ ρ ∈ Set.Icc (-1 : ℝ) 1,
info (noise ρ (softCoordinate i a)) =
psi (|ρ| * psiInv (info (softCoordinate i a)))
def SoftInformationIdentity : Prop := ∀ (n : ℕ) (u : Cube n → ℝ), Closed u →
∀ ρ ∈ Set.Icc (-1 : ℝ) 1,
mutualInformation (softJoint ρ u) = info (noise ρ u)
def RefinedBoolean : Prop := ∀ (n : ℕ) (f : Cube n → Bool)
(ρ : ℝ), ρ ∈ Set.Icc (-1 : ℝ) 1 →
let m := avg (sign ∘ f)
let bound := psi (|ρ| * psiInv (H m))
mutualInformation (boolJoint ρ f) = info (noise ρ (sign ∘ f)) ∧
mutualInformation (boolJoint ρ f) ≤ bound ∧ bound ≤ psi |ρ| ∧
(0 < |m| → |m| < 1 → 0 < |ρ| → bound < psi |ρ|)
def BooleanAttainment : Prop := ∀ (n : ℕ) (i : Fin n)
(ρ : ℝ), ρ ∈ Set.Icc (-1 : ℝ) 1 →
mutualInformation (boolJoint ρ (fun x => x i)) = psi |ρ| ∧
mutualInformation (boolJoint ρ (fun x => !(x i))) = psi |ρ|
def BitsConversion : Prop := ∀ (n : ℕ) (f : Cube n → Bool)
(ε : ℝ), ε ∈ Set.Icc (0 : ℝ) (1/2) →
psi (1 - 2 * ε) / L = 1 - binaryEntropyBits ε ∧
mutualInformation (boolJoint (1 - 2 * ε) f) / L ≤ 1 - binaryEntropyBits ε
def SharpProduction : Prop := ∀ (n : ℕ) (g : Cube n → ℝ), Interior g →
hybrid (avg g) (info g) ≤ production g ∧ F (info g) ≤ hybrid (avg g) (info g)
def FullMain : Prop := SoftContraction ∧ SoftAttainment ∧ SoftInformationIdentity ∧
RefinedBoolean ∧ BooleanAttainment ∧ BitsConversion ∧ SharpProduction
end SoftChannel204
end
end
end OAI