FINDING: Buscemi's framework unifies Bell inequalities with entanglement witnesses via "semidefinite programming" and "facet structure" of correlation polytopes, showing quantum violations correspond to specific geometric facets. | MATH: Bell inequalities are linear inequalities over the correlation polytope P; quantum correlations form a convex set Q strictly larger than P (local hidden variable polytope). Buscemi's unification maps entanglement witnesses (Hermitian operators W≥0 with Tr(Wρ)≥0 for separable ρ) to Bell-type inequalities via a "quantum channel" transformation. Key constants: the Tsirelson bound 22 for CHSH, and the ratio 22/2=2≈1.414 (not a golden ratio, but a quadratic irrational). Facet structure: the polytope P has facets defined by inequalities like \( \langle A_1B_1 \rangle + \langle A_1B_2 \rangle + \langle A_2B_1 \r Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Bell inequalities characterize the boundary of the local-realist correlation polytope -- the set of joint probability distributions achievable by classical hidden-variable models. Quantum mechanics exceeds this boundary through non-commutativity, reaching the Tsirelson bound 22 for CHSH. We show that this polytope structure is not specific to quantum foundations: it appears identically in the causal inference literature, where the instrumental inequality, the Balke--Pearl linear programming bounds, and the Tian--Pearl probabilities of causation all arise as facets of the same marginal compatibility polytope. Fine's theorem -- that CHSH inequalities hold if and only if a joint distribution exists -- is precisely the pivot: the instrumental variable model in causal inference is structurally equivalent to the Bell local hidden-variable model, with the instrument playing the role of the measurement setting and the latent confounder playing the role of the hidden variable λ. We develop this correspondence in detail, extending it to algorithmic (Kolmogorov complexity) and entropic formulations of Bell inequalities, the NPA semidefinite programming hierarchy, and the MIP∗=RE undecidability result. We further show that the Born-rule / Bayes-rule duality underlying quantum Bayesian computation exploits the same non-commutativity that enables Bell violation, providing polynomial speedups for posterior inference. The framework yields a concrete dictionary between quantum information theory, causal econometrics, and Bayesian computation, and suggests new directions including NPA-based quantum causal inference algorithms and quantum architectures for function approximation.
We establish a relation between the two-party Bell inequalities for two-valued measurements and a high-dimensional convex polytope called the cut polytope in polyhedral combinatorics. Using this relation, we propose a method, triangular elimination , to derive tight Bell inequalities from facets of the cut polytope. This method gives two hundred million inequivalent tight Bell inequalities from currently known results on the cut polytope. In addition, this method gives general formulae which represent families of infinitely many Bell inequalities. These results can be used to examine general properties of Bell inequalities.