AFTD Auto-Formalizing Theoretical Domains

hellinger_information_multiplicative_subadditive

deforiginal

A real number C satisfies multiplicative subadditivity for Hellinger mutual information if for all finite types X, Y, Z, every prior pX on X and channels PY from X to Y and PZ from X to Z forming a Markov chain Y <- X -> Z (so pXYZ(x, y, z) = pX(x) * PY(x, y) * PZ(x, z)), the joint Hellinger mutual information satisfies hellinger_mutual_information (fun x (yz : Y × Z) => pX x * PY x yz.1 * PZ x yz.2) ≤ C * (hellinger_mutual_information (fun x y => pX x * PY x y) + hellinger_mutual_information (fun x z => pX x * PZ x z)).

Statement

def hellinger_information_multiplicative_subadditive (C : ℝ) : Prop
Related work
scout/2610-21231-on-the-subadditivity-of-mutual-f-information.md:123
Verified
12 Nov 2026
Axioms
none listed
Built on 1
  • hellinger_mutual_informationFor finite types U and V, the Hellinger mutual information of a joint distribution p on U × V is defined as ∑ u, ∑ v, (Real.sqrt (p u v) -…
Used by 1

Read back from the Lean

Given a real number C, hellinger_information_multiplicative_subadditive C asserts that for all finite types X, Y, and Z, and all functions pX : X → ℝ, PY : X → Y → ℝ, and PZ : X → Z → ℝ satisfying: 1. pX is non-negative everywhere (∀ x, 0 ≤ pX x), 2. pX sums to 1 (∑ x, pX x = 1), 3. PY is non-negative everywhere (∀ x y, 0 ≤ PY x y), 4. For every x, PY x · sums to 1 (∀ x, ∑ y, PY x y = 1), 5. PZ is non-negative everywhere (∀ x z, 0 ≤ PZ x z), 6. For every x, PZ x · sums to 1 (∀ x, ∑ z, PZ x z = 1), the Hellinger mutual information between X and the product (Y × Z), defined via the joint distribution (x, (y, z)) ↦ pX(x) * PY(x, y) * PZ(x, z), is less than or equal to C times the sum of: - the Hellinger mutual information between X and Y under (x, y) ↦ pX(x) * PY(x, y), and - the Hellinger mutual information between X and Z under (x, z) ↦ pX(x) * PZ(x, z).

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- Multiplicative subadditivity of Hellinger mutual information with factor C. -/
def hellinger_information_multiplicative_subadditive (C : ℝ) : Prop := ∀ (X Y Z : Type) [Fintype X] [Fintype Y] [Fintype Z]
    (pX : X → ℝ) (PY : X → Y → ℝ) (PZ : X → Z → ℝ),
    (∀ x, 0 ≤ pX x) → (∑ x, pX x = 1) →
    (∀ x y, 0 ≤ PY x y) → (∀ x, ∑ y, PY x y = 1) →
    (∀ x z, 0 ≤ PZ x z) → (∀ x, ∑ z, PZ x z = 1) →
    hellinger_mutual_information (fun x (yz : Y × Z) => pX x * PY x yz.1 * PZ x yz.2) ≤
      C * (hellinger_mutual_information (fun x y => pX x * PY x y) +
           hellinger_mutual_information (fun x z => pX x * PZ x z))
See it in the graphDiscuss this resultChallenge it