Unnumbered numerical identity: HRW squashed CMI equals nonlocality cost
OpenQAlgorithms.Papers.Independent.Intakethird100.P22.hrw_cmi_costLet . For real parameters , define the binary HRW device as follows. At , each equal-output event has probability and each unequal-output event has probability . At every other setting, each CHSH-winning event has probability and each losing event has probability . Let be the CHSH loss averaged over independent uniform inputs. In the printed single-vertex convention, is the infimum of in decompositions with a nonlocal extreme non-signaling device and local.
Assume and . Compute squashed CMI from the vertex-labelled complete extension, with a general Eve input randomizer after the honest input choice. Define the source cost using maximum marginal support sizes. Then
The binary HRW marginals have support two. Optimality against every general CE measurement is asserted as conclusion, never as a hypothesis.
Eve retains the dice result and extension output . Squashed CMI conditions on ; intrinsic-information channels may depend on both. This is the operational convention of XI.B.3 used by the proof, rather than discarding the dice result in display (7).
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P22
noncomputable section
open scoped BigOperators
namespace QAlgorithms.Papers.Independent.Intakethird100.P22
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Advance50.P47
(Box IsCorrelation IsNoSignaling HasLocalModel correlationMixture prBox)
open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw)
open QAlgorithms.Papers.Independent.Information100.P27 (shannon)
open QAlgorithms.Papers.Independent.Gap48.P25 (classicalMI)
/-- PDF pp.56,58: the source's HRW squashed-CMI/cost identity on its binary
CHSH sector. The equality against ALL general CE measurements is the conclusion;
the displayed witness ensemble is never assumed optimal. Source convention: Eve keeps the dice
result (p.22, XI.B.3); CE members may depend on (z,e) -/
theorem hrw_cmi_cost (delta eta : ℝ) (hd : 0 ≤ delta) (hdOne : delta ≤ 1)
(he : -(1/4 : ℝ) ≤ eta) (heUpper : eta ≤ 1/12 - delta/3)
(c : CompleteExtension (hrwBox delta eta)) :
squashedCMI c = nonlocalityCost (hrwBox delta eta) false false ∧
nonlocalityCost (hrwBox delta eta) false false = 1/4 - delta - 3*eta := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P22
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every satisfying and , let be the Boolean array given at by when and otherwise, and at every other input pair by when and otherwise. A valid array means a nonnegative array normalized over at each , whose -marginal is independent of and whose -marginal is independent of . A finite decomposition of consists of a natural number , weights summing to , and valid arrays , with pointwise; its support is the set of arrays with . Such a decomposition is minimal when every positively weighted member is a vertex and no finite decomposition of has support strictly contained in its support; a vertex is a valid array for which , with valid and , implies . For every supplied complete extension of , the hypotheses therefore include validity of , positive natural numbers , and, for each , a minimal decomposition of ; all these decompositions use fixed member labels , and every minimal finite decomposition of has exactly one index such that, for every array , equals the total weight assigned to by . Zero weights and repeated member labels are allowed. For every probability vector , meaning and , define . For a finite real-valued array , put , using the total real logarithm, and define
The quantity called is . To define the other quantity, an array is local when it is nonnegative and normalized and admits a representation for some arbitrary latent type , probability mass function , and nonnegative, normalized local response functions . Let be the real infimum of admitting , where is a vertex without a local model and is local, with the total real-infimum convention giving if this set is empty. Set
The nonlocality cost at inputs false, false is, by definition, . The theorem asserts both equalities
The parameter bounds are inclusive, and the assertion applies to every complete extension satisfying the stated structure.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.