Searcharxiv⌕ Search

arXiv · 2611.05656

Every obstruction to noncontextual hidden variables is finite: well-founded refutations in infinitary real-valued logic

Abstract

We study the obstructions to noncontextual hidden variables when quantum probability is described in full, by the complete lattice of closed subspaces of a separable infinite-dimensional Hilbert space together with its countably additive measures. We give such a description in infinitary real-valued logic, the infinitary extension of Keisler's model theory of general structures; the countable suprema and infima of this logic express the completeness of the lattice and the countable additivity of the measures. The standard models of our axioms represent exactly the density-operator measures of Gleason's theorem. The axioms are closed conditions, non-strict inequalities between the values of sentences and rational numbers. The expressive power afforded by infinitary sentences comes at the price of compactness. The hypothesis that at each hidden state every event receives the value 0 or 1, whatever the context of measurement, contradicts the axioms, yet it is consistent with every finite subset of them. The obstructions nevertheless remain finite. We prove that in this logic a countable set of closed conditions is inconsistent if and only if a well-founded tree whose branches end in finite contradictions refutes it; for the hypothesis above, every such tree has an infinitely branching node. The finiteness theorem is therefore maximal: a hidden-variable hypothesis expressed by countably many closed conditions is inconsistent with the axioms, and thus an obstruction, exactly when such a tree refutes the hypothesis together with the axioms. The same language defines, uniformly across standard models, exactly the $σ$-projective sets of probabilities, and all these results are proved in ZFC.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Olivia Aubone, José Iovino. 2026-11-13. Every obstruction to noncontextual hidden variables is finite: well-founded refutations in infinitary real-valued logic. https://searcharxiv.com/abs/2611.05656

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

A Dubnov-Ivanov-Nagata-Higman Theorem for NIP nilrings

We prove that NIP nilrings of bounded nilexponent are nilpotent. We also deduce that NIP $ω$-categorical $n$-Engel Lie algebras of characteristic $p>n$ are nilpotent, yielding a case of the Lie algebra analogous of Wilson conjecture for $ω$-categorical groups.

math.LO↗

Relative computability and definability for nonregular oracles

Classically, a set is computable from an oracle if both the set and its complement are computably enumerable (c.e.) relative to that oracle. We construct a countable nonstandard model of true arithmetic with sets A and X such that both A and its complement are c.e. relative to X, yet A is not pointwise Turing reducible to X. The Turing functionals used here are single-valued at every oracle. For regular oracles, we prove that the classical equivalence holds over ISigma_1. Two further phenomena, each known from earlier work, are realized with the same oracle X that witnesses our main separation. Strong and pointwise Turing reducibility differ for this X, and some Delta_1^X set is not X-c.e.

math.LO↗