All analytic and optimizer properties of statistical strength
OpenQAlgorithms.Papers.Independent.Intakethird100.P80.theorem1Fix a finite quantum-generated, normalized, no-signalling conditional table . Write for the setting simplex and for the simplex on all complete potential-outcome assignments . For , let be its measured marginal, , and .
- For every setting law, the joint divergence is the average conditional divergence:
For fixed , is convex and lower semicontinuous on , and finite, continuous, and differentiable at its relative interior. For fixed supporting at every setting, is linear in . 2. Every infimum defining is attained. The function is finite, nonnegative, bounded uniformly over , concave, and continuous on the entire simplex. If has a local model, vanishes everywhere. Otherwise at every full-support setting law. For two parties with two settings each, vanishes at every boundary setting law, with arbitrary nonempty finite outcome alphabets. 3. Suppose for every . If some conditional probability of lies strictly between zero and one, a local law minimizes if and only if it supports and, writing for the outcomes selected from ,
A zero numerator contributes zero. Any two minimizers have identical, strictly positive measured probabilities on every positive- outcome, and both support at every setting.
These conclusions give the optimization and first-order characterization for a fixed experiment. Relative interior means positive simplex coordinates; differentiability is taken within the simplex. The explicit support guard prevents real division by zero from discarding the singular cases.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P80
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakethird100.P80
open scoped BigOperators ENNReal Topology Classical
open MeasureTheory Filter
/-- PDF p.12, Theorem 1, all parts; proof pp.32–34. Relative full support is used.
The ratio test includes the support condition implicit in the differentiation argument on p.34.
Uniqueness is asserted only on positive-Q events, correcting the later prose overstatement. -/
theorem theorem1 {S : BellExperiment} (Q : Table S) (hQ : NonlocalityProof Q) :
(∀ s : Sigma S, ∀ p : PiLocal S,
statisticalPayoff Q s.1 p.1 = ∑ a, ENNReal.ofReal (s.1 a) * kl (Q a) (localTable p.1 a)) ∧
(∀ s : Sigma S,
(∀ (p r : PiLocal S) (a b : ℝ), 0 ≤ a → 0 ≤ b → a + b = 1 →
statisticalPayoff Q s.1 (a • p.1 + b • r.1) ≤
ENNReal.ofReal a * statisticalPayoff Q s.1 p.1 + ENNReal.ofReal b * statisticalPayoff Q s.1 r.1) ∧
LowerSemicontinuousOn (fun p => statisticalPayoff Q s.1 p) (stdSimplex ℝ (Potential S)) ∧
(∀ p : PiLocal S, PositiveCoordinates p.1 →
statisticalPayoff Q s.1 p.1 < ⊤ ∧
ContinuousWithinAt (fun r => statisticalPayoff Q s.1 r) (stdSimplex ℝ (Potential S)) p.1 ∧
DifferentiableWithinAt ℝ (fun r => (statisticalPayoff Q s.1 r).toReal)
(stdSimplex ℝ (Potential S)) p.1)) ∧
(∀ p : PiLocal S, DominatesQuantum Q p.1 →
∃ L : (Settings S → ℝ) →ₗ[ℝ] ℝ,
∀ s : Sigma S, statisticalPayoff Q s.1 p.1 = ENNReal.ofReal (L s.1)) ∧
(∀ s : Sigma S, ∃ p : PiLocal S, statisticalPayoff Q s.1 p.1 = lowerValue Q s.1) ∧
((∀ s : Sigma S, 0 ≤ lowerValue Q s.1 ∧ lowerValue Q s.1 < ⊤) ∧
(∃ B : ℝ≥0∞, B < ⊤ ∧ ∀ s : Sigma S, lowerValue Q s.1 ≤ B) ∧
ConcaveOn ℝ (stdSimplex ℝ (Settings S)) (fun s => (lowerValue Q s).toReal) ∧
ContinuousOn (fun s => (lowerValue Q s).toReal) (stdSimplex ℝ (Settings S))) ∧
((¬ Proper Q → ∀ s : Sigma S, lowerValue Q s.1 = 0) ∧
(Proper Q → ∀ s : Sigma S, PositiveCoordinates s.1 → 0 < lowerValue Q s.1)) ∧
(TwoByTwo S → ∀ s : Sigma S, (∃ a, s.1 a = 0) → lowerValue Q s.1 = 0) ∧
(∀ s : Sigma S, PositiveCoordinates s.1 →
(NontrivialTable Q → ∀ p : PiLocal S,
(statisticalPayoff Q s.1 p.1 = lowerValue Q s.1 ↔
DominatesQuantum Q p.1 ∧
(∀ v, 0 < p.1 v → optimizerScore Q s.1 p.1 v = 1) ∧
(∀ v, p.1 v = 0 → optimizerScore Q s.1 p.1 v ≤ 1))) ∧
(∀ p r : PiLocal S,
statisticalPayoff Q s.1 p.1 = lowerValue Q s.1 →
statisticalPayoff Q s.1 r.1 = lowerValue Q s.1 →
DominatesQuantum Q p.1 ∧ DominatesQuantum Q r.1 ∧
∀ a x, 0 < Q a x → localTable p.1 a x = localTable r.1 a x ∧
0 < localTable p.1 a x)) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P80
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any Bell experiment: it has a positive number of parties, each party has a positive number of settings, and setting at party has a positive number of outcomes. Write for the setting tuples, for the outcome tuples at setting , and for the assignments of an outcome to every setting of every party. For a finite set , write for the nonnegative real functions on summing to . Let be a real table satisfying the following assumptions: each belongs to ; whenever two setting tuples agree on a subset of parties, their marginal probabilities for every outcome tuple on that subset agree; and there exist positive integers , a positive semidefinite matrix of trace indexed by , and positive semidefinite matrices indexed by , with , such that . For , define . For real functions on the same finite set, define
where , regarded as an extended nonnegative real; division by zero is , and the total real logarithm used here has and for . Put and . Then all the following hold. (i) For every and ,
using extended nonnegative arithmetic, including . (ii) For every , all , and all real with ,
the function is lower semicontinuous on ; and at every with for every , its value is finite, it is continuous within that simplex at , and is differentiable over within that simplex at , where takes finite values to their real values and takes to . (iii) For every such that implies for every , there exists a real linear functional satisfying for every . (iv) For every , some satisfies . (v) Every satisfies ; there exists a single finite extended nonnegative number with for all such ; and is concave and continuous on . (vi) If for some , then for every ; if no such exists, then for every whose coordinates are all strictly positive. (vii) If there are exactly two parties and each has exactly two settings, then every having at least one zero coordinate satisfies . (viii) For every with all coordinates strictly positive, define
If there exist with , then, for every , the equality holds if and only if implies for all , whenever , and whenever . Independently of that additional assumption , any two attaining both satisfy this support domination condition, and every with satisfies . Setting and outcome sets of size , and zero coordinates in the probability distributions, are included wherever the stated hypotheses permit them.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.