Information increases when other independent coordinates are disclosed
OpenQAlgorithms.Papers.Independent.Intakenext100.P77.conditioning_independent_coordinatesLet and let be jointly independent random variables with finite alphabets on a normalized finite probability space. Let be any finite-valued random variable on the same space; it may depend arbitrarily on the family. Information is Shannon mutual information in bits. Write for preceding coordinates and for all other coordinates.
For each coordinate ,
Only joint independence of the key coordinates is needed. The statement supports reduction from whole-string information to single-coordinate information.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P77
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P77
open scoped BigOperators ComplexConjugate ComplexOrder
open QAlgorithms
-- The repair instruction authorizes imports of pinned accepted definitions.
-- These are definitions only; no imported paper theorem is used here.
open QAlgorithms.Papers.Independent.Dependency50.P47 (Law)
open QAlgorithms.Papers.Independent.Information100.P04 (Measurement)
open QAlgorithms.Papers.Independent.Information100.P27 (shannon)
open QAlgorithms.Papers.Independent.Information100.P39 (pushLaw)
open QAlgorithms.Papers.Independent.Support50.P16 (trivialMeasurement)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- Lemma H.1, PDF p.24: disclosing the remaining jointly independent
coordinates increases conditional information about one coordinate. No
independence from Eve's variable is assumed. Fin m excludes an empty index. -/
theorem conditioning_independent_coordinates {Omega E : Type}
[Fintype Omega] [Fintype E] {m : ℕ} {A : Fin m → Type}
[∀ i, Fintype (A i)] (p : Law Omega)
(key : (i : Fin m) → Omega → A i) (eve : Omega → E)
(hind : JointIndependent p.prob key) (i : Fin m) :
averagedConditionalInfo p.prob (key i) eve (previous key i) ≤
averagedConditionalInfo p.prob (key i) eve (others key i) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P77
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite types, let , let be a finite type for every , and let satisfy and . Let and be functions, and suppose that the keys are jointly independent in the precise sense that, for every tuple ,
For a finite-valued function , write , and define , where , with . For a disclosure function , set when , and zero otherwise, using division by zero equal to zero, and define . Then for every index ,
Null disclosure outcomes therefore contribute zero. Although is not explicitly assumed positive, the supplied index excludes ; when , the tuple of previous keys is empty.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.