{"id":"30ad8385-8a06-4b50-ace3-62dd6c91b14e","arxiv_id":"2411.18146","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Finite-dimensional quantum systems are determined up to isomorphism by the compatibility graph of their atomic projectors.","lead":"This paper proves that finite-dimensional quantum systems, viewed as collections of compatible measurement contexts, are completely determined by a graph connecting their atomic propositions. The result gives a combinatorial handle on quantum contextuality and explains why earlier exclusivity-graph methods depend on which subset of events is chosen.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 12 rests on an unproved atomic-context representation: an atomless maximal Boolean subalgebra of P(H) shows the step b = join A1 with A1 ⊆ A(C) can fail.","rationale":"The reader's weakest assumption identifies exactly the same soft spot: Theorem 12 silently assumes a strong atomic-generation property for maximal contexts inside an atomic complete epBA. The paper gives no proof that every element lies in a maximal Boolean subalgebra generated by its atoms, and Lemma A.1's 'identical' proof cannot be adapted to atomless contexts. The continuous masa example shows the premise can fail in the most natural infinite-dimensional acepBA, P(H), so the proof gap is real and load-bearing for the paper's infinite-dimensional claims. At the same time, the finite-dimensional graph-structure theorems are internally coherent and do not depend on this faulty premise; they use finite maximal contexts, where Lemma A.1 and the join representation are justified. Therefore the appropriate disposition remains CONDITIONAL, as the reader already concluded: the finite-dimensional contribution stands, but the infinite-dimensional generalization must either be supplied with a missing lemma or explicitly restricted. No change to the reader's verdict is needed.","tokens_in":12603,"tokens_out":18596,"duration_ms":184854,"concrete_test":"Let B = P(L^2([0,1])) and let C be the maximal Boolean subalgebra of projections onto multiplication by characteristic functions of measurable sets, which is atomless. Verify that A(C) = ∅ and choose any nonzero projection P_E ∈ C; since A(C) is empty, P_E cannot be written as W A1 with A1 ⊆ A(C), directly refuting the representation used in Theorem A.4 and Lemma A.2. To test whether the theorem itself, rather than only its proof, is false, additionally check whether P_E can be the join of a pairwise compatible set of rank-1 atoms below it: those atoms are not pairwise compatible, so atomicity plus completeness alone does not supply the required atomic maximal context.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The finite-dimensional graph-structure theorems (Props 9–10, Thms 7–8) appear well supported: Lemma A.1 and the representation b = W A with A ⊆ A(C) are valid when maximal contexts are finite Boolean algebras. The load-bearing weakness is the infinite-dimensional generalization, Theorem 12. Its proof in Appendix A silently assumes that every element b of an atomic complete epBA can be written as b = W A1 with A1 ⊆ A(C1) for some maximal Boolean subalgebra C1, and that Lemma A.1 extends verbatim to arbitrary acepBA. This is not established. In B = P(H) for infinite-dimensional H, maximal Boolean subalgebras include atomless continuous masas, e.g., multiplication operators on L^2[0,1]. For such C, A(C) = ∅, so no nonzero b ∈ C can be represented as a join of atoms of C. Atomicity of B only gives some atom below b, not a pairwise compatible set of atoms whose join is b; in P(H), the rank-1 projectors below a fixed projector need not commute. Thus the proof of Theorem A.4, and consequently the 'measurable epBA' construction in Section 5, lacks a necessary premise. The finite-dimensional claims are not affected.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper develops a partial-Boolean-algebra framework for quantum contextuality. It defines exclusive partial Boolean algebras (epBA), their atoms, and atom graphs, and claims that finite epBAs are determined up to isomorphism by their atom graphs (Theorem 3), that their states coincide with states on the atom graph (Theorem 4), and that analogous statements hold for finite-dimensional epBAs (Theorems 7 and 8) and for atomic complete epBAs (Theorem 12). For quantum systems, it concludes that finite-dimensional quantum systems are determined by the compatibility graph of their atomic projectors, with states determined by probabilities on atoms (Propositions 9 and 10), and it proposes an infinite-dimensional extension via 'measurable epBA'. The main proofs are collected in Appendix A.","tokens_in":12848,"tokens_out":26004,"duration_ms":252098,"significance":"The finite-dimensional quantum-system statements are a potentially valuable contribution: they give a precise sense in which the algebra and states of a finite measurement scenario are encoded in the compatibility graph of its atoms, and the comparison with the exclusivity-graph approach in Section 6 is illuminating. The paper is largely a derivation from the definitions, using Stone's theorem, the Abramsky-Barbosa LEP theorem, and Gleason's theorem as external tools; there are no fitted parameters, and the finite-dimensional proofs are traceable. However, the current formulations overreach: the 'finite-dimensional epBA' statement is false as stated, and the infinite-dimensional theorem rests on an unproved atomic-context representation. The finite-dimensional results for quantum systems are likely salvageable with corrected assumptions.","major_comments":[{"comment":"As stated, 'finite dimensional epBA' includes atomless Boolean algebras. Let B be an atomless Boolean algebra. With the total compatibility relation, B is an epBA (LEP is trivial), and its only maximal Boolean subalgebra is B itself, with A(B)=∅; hence d(B)=0 by Definition 9. Its atom graph AG(B) is the empty graph, so any two atomless Boolean algebras have isomorphic atom graphs although they need not be isomorphic (e.g., the countable atomless Boolean algebra and the free atomless Boolean algebra on uncountably many generators). This contradicts Theorem 7. It also contradicts Theorem 8: s(AG(B)) has at most one element (the empty assignment), while s(B) contains many nonprincipal ultrafilter states. The sentence in Section 5 that every finite-dimensional epBA is 'obviously atomic and complete' is therefore false under the given definition; the statements need an atomicity or finite-generation assumption.","section":"Definition 9; Theorems 7–8"},{"comment":"The proof of Lemma A.2 uses the identity W A′1 = ¬(W A1) for A′1 = A(C1)\\A1. This identity is valid only when the maximal Boolean subalgebra C1 is atomic and generated by its atoms. In an infinite-dimensional acepBA this need not hold: a continuous maximal Boolean subalgebra of P(H) (e.g., a masa of multiplication operators on L^2[0,1]) has no atoms, and even a masa with both atomic and continuous parts contains elements that are not joins of its atoms. Thus the first line of the necessity proof, 'If W A1 = W A2 = b, then W A′1 = W A′2 = ¬b', is unjustified. Since Lemma A.2 is used in the proof of Theorem A.4, the infinite-dimensional argument is not supported at this point.","section":"Appendix A, Lemma A.2"},{"comment":"The definition of f(b) = W g(A1) presupposes that every b∈B1 can be written as b = W A1 with A1 a pairwise compatible set of atoms of B1, and that A1 is contained in A(C1) for a maximal context C1 for which Lemma A.2 applies. Definition 10 only guarantees that every nonzero b has some atom below it; it does not guarantee the existence of such a pairwise compatible spanning set of atoms. Atoms below b may be mutually incompatible, and a maximal context containing b may be atomless even when B is atomic and complete (as in P(H) for infinite-dimensional H). The proof needs a separate lemma establishing the representation b = W A1 with A1⊆A(C1) and with C1 atomic and generated by its atoms. Without it, f is not defined on all of B1, and the well-definedness and injectivity arguments in Theorem A.4 do not go through. Consequently, the uniqueness of P(G) in Definition 11 and the 'measurable epBA' construction in Section 5 lack proof.","section":"Appendix A, proof of Theorem A.4"}],"minor_comments":[{"comment":"In the first paragraph of the Conclusion, 'Proportions 9 and 10' should be 'Propositions 9 and 10'.","section":"Section 7"},{"comment":"There are several typographical artifacts, including 'Cabbelo' for 'Cabello' and the spacing in 'f or any weight f unction w'; the manuscript should be proofread carefully.","section":"Section 6"},{"comment":"The phrase 'We will generate these conclusions' should read 'We will generalize these conclusions'.","section":"Section 5"},{"comment":"The witness element for exclusivity is denoted c, which collides with the use of c as an atom in the examples; a different symbol would improve readability.","section":"Definition 3"},{"comment":"The treatment of empty graphs and the convention for maximal cliques should be specified explicitly, since the counterexample in Major Comment 1 depends on the status of the empty assignment as a state.","section":"Definition 7"}],"recommendation":"major_revision","confidential_remarks":"The paper has a good finite-dimensional core, but the advertised infinite-dimensional generalization is not supported and the definition of finite-dimensional epBA is flawed. The authors should be asked to restrict Theorems 7 and 8 to atomic (or finitely generated) epBAs and to supply the missing atomic-context representation lemma for acepBA, or to remove the infinite-dimensional claims. I do not see a circularity problem, but the overclaim is substantial and should be addressed before publication."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The finite-dimensional results are the real substance here. The paper proves that finite epBAs and their states are determined by atom graphs (Theorems 7–8), and applies this to finite-dimensional quantum systems (Propositions 9–10). That is new and useful: it gives a compact combinatorial invariant for finite quantum measurement scenarios, and the KCBS example nicely illustrates why exclusivity-graph witnesses depend on vertex selection. The finite proofs are traceable — the representation b = join A with A ⊆ A(C) is valid when maximal contexts are finite Boolean algebras, and the state correspondence in Theorem A.3 checks out. No fitted parameters, no self-citation problem, honest engagement with Abramsky–Barbosa and Kochen–Specker. Credit where due: this is a genuine contribution to the pBA and contextuality literature.\n\nThe soft spot is exactly where the stress test points: Theorem 12 and the 'measurable epBA' construction assume that every element of an atomic complete epBA can be written as a join of atoms from a single maximal Boolean subalgebra, and that Lemma A.1 extends verbatim. That is not established. In P(H) for infinite-dimensional H, maximal Boolean subalgebras can be atomless (continuous masas), so A(C)=∅ and no nonzero element of C is a join of atoms of C. Atomicity of B only gives atoms below an element, not a pairwise compatible set whose join is the element. The proof of Theorem A.4 and the Section 5 construction lack a necessary premise. This is a load-bearing gap in the infinite-dimensional claims, but it does not touch the finite-dimensional theorems.\n\nThere are also smaller presentation issues: the definitions of P(G) and 'measurable epBA' are only meaningful after Theorem 12, so the section reads as conditional; and the paper could be clearer about which claims are finite-only. None of that changes my overall read.\n\nWho is this for? Anyone working on contextuality, exclusivity graphs, or Kochen–Specker-type reconstruction. The finite-dimensional graph-structure theorems deserve attention. The infinite claims need proof or a clear restriction. I'd send it to a serious referee — a good referee can help the authors fix or scope the infinite part — but I would not accept it as is.\n\nRecommendation: peer review, conditional on the infinite-dimensional atomicity premise being addressed.","headline":"Finite-dimensional atom-graph reconstruction is a real contribution, but Theorem 12's infinite-dimensional generalization rests on an unproved atomic-context assumption and should be fixed or restricted before publication.","tokens_in":13361,"tokens_out":877,"would_cite":true,"duration_ms":9871,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["81P10","81P13"],"pacs":[],"model":"deepseek-v4-flash","headline":"Finite-dimensional quantum systems are determined by their atom graphs, and their probability assignments match graph states on those graphs.","keywords":["quantum contextuality","partial Boolean algebra","atom graph","exclusivity principle","local consistency","noncontextuality inequalities","measurement compatibility","hidden-variable theory"],"falsifier":"Find two atomic, complete, exclusive partial Boolean algebras with isomorphic atom graphs but non-isomorphic algebra structures; the most direct candidate is an algebra containing a maximal Boolean subalgebra that is not generated by its atoms, which would break the step in Theorem 12 where every element is written as a join of atoms. In the finite-dimensional case the same test can be run computationally: search two finite families of rank-one projections in finite-dimensional Hilbert spaces whose compatibility graphs are isomorphic while the generated quantum systems are not.","tokens_in":12392,"feed_emoji":"⚛️","tokens_out":14291,"duration_ms":119541,"temperature":0.7,"pith_summary":"The paper sets out to prove that a finite-dimensional quantum system—a set of projection-valued events on a finite-dimensional Hilbert space—is completely determined by its atoms, the minimal events out of which all measurement outcomes are built. It develops an algebraic framework, exclusive partial Boolean algebras (epBAs), by adding a logical exclusivity axiom to partial Boolean algebras, and proves two graph-structure theorems: isomorphic finite-dimensional systems have isomorphic atom graphs, and states on a system correspond to states on its atom graph. The conclusion is that the compatibility structure of quantum measurements is a graph whose maximal cliques are the measurement contexts, so quantum mechanics can be understood as a graph-structured combination of classical single-context theories. The paper extends the isomorphism theorem to atomic and complete epBAs, covering infinite-dimensional cases, and proposes a generalized probability space of the form (graph, algebra, state).","feed_headline":"Atom graphs determine finite quantum systems","feed_subtitle":"Once you know which atomic events are compatible, the entire measurable algebra and its state probabilities follow.","key_machinery":"The load-bearing object is the atom graph $\\mathrm{AG}(B)$: the simple graph whose vertices are the atoms of $B$—nonzero elements with no smaller nonzero element below them—and whose edges join distinct compatible atoms. In a quantum system the atoms are rank-one projectors and compatibility coincides with orthogonality. The proof mechanism is the exclusivity axiom, which forces the atoms of every maximal Boolean subalgebra to be atoms of the whole algebra, so every element of a finite-dimensional epBA can be written as a join of atoms inside any maximal context containing it. This yields a precise dictionary: maximal cliques of the atom graph are the maximal contexts; joins of atom sets are well-defined elements; and a graph state, meaning a weighting that sums to 1 on every maximal clique, lifts to a unique state on the algebra. The reconstruction theorems are then proved by pushing an isomorphism of atom graphs forward to a map on joins of atoms and checking that it preserves complement, join, and meet.","core_discovery":"On the paper's own terms, the central discovery is that atoms carry all the structural information of a finite-dimensional quantum system. A quantum system is a partial Boolean subalgebra of the projection lattice of a Hilbert space, and its atoms are the rank-one projectors it contains; the atom graph $\\mathrm{AG}(Q)$ has these atoms as vertices and connects two distinct atoms when they are compatible. The paper proves (Propositions 9 and 10) that $Q_1\\cong Q_2$ iff $\\mathrm{AG}(Q_1)\\cong \\mathrm{AG}(Q_2)$, and that $s(Q)\\cong s(\\mathrm{AG}(Q))$, where $s(\\cdot)$ denotes the state space; the quantum states $\\mathrm{qs}(Q)$ appear as a distinguished subset of that state space. Thus the hidden-variable space of classical probability is replaced, for finite-dimensional quantum mechanics, by a graph whose maximal cliques are the contexts. For atomic and complete epBAs the same isomorphism theorem is proved in the infinite-dimensional setting, with the state correspondence handled through the generalized triple $(G,B,p)$.","pith_inferences":["Editorial inference: because the full atom graph, not a chosen subgraph, carries the compatibility structure, the known dependence of graph-based contextuality witnesses on vertex choice is explained as a subgraph selection effect rather than a flaw in the graph method.","Editorial inference: the graph formulation suggests a finite combinatorial search for state-independent contextuality: look for atom graphs with a weight function whose independence bound is violated by every graph state, and then check which such graphs are realizable by projections.","Editorial inference: a computational next step is to enumerate small graphs and test which ones are atom graphs of projection-generated quantum systems, thereby mapping the boundary between graphical and Hilbert-space-realizable contextuality.","Editorial inference: if the infinite-dimensional theorem holds, the triple $(G,B,p)$ provides an algebraic probability theory in which graph morphisms become contextuality-preserving maps, giving a natural notion of simulation between contextual systems."],"forward_implications":["Any finite-dimensional quantum measurement scenario can be specified, up to isomorphism, by a simple graph, and the maximal cliques of that graph are exactly the measurement contexts.","Every quantum state on a finite-dimensional system is fixed by its probabilities on the atomic events, and every graph state on the atom graph determines a state on the algebra, so the probabilistic content of the system is fully encoded in the graph.","Noncontextuality inequalities for a finite quantum system have the form $\\sum_v w(v)p(v) \\le \\alpha(\\mathrm{AG}(Q),w)$, so contextuality witnesses are weighted independence-bound violations on the full atom graph rather than on an arbitrary subgraph.","In Hilbert space dimension at least 3, the classical measure-theoretic characterization of quantum states becomes the statement that all states on the full projection algebra are exactly the states on its atom graph.","Atomic and complete epBAs are in one-to-one correspondence with their atom graphs, and a measurable epBA on a graph gives a generalized probability space $(G,B,p)$ for contextual systems with local consistency and exclusivity."],"supporting_citations":[{"why":"It gives the partial Boolean algebra treatment of quantum events that the paper builds on.","marker":"[3]"},{"why":"It supplies the reconstruction programme that the paper extends to exclusivity and atom graphs.","marker":"[17]"},{"why":"It introduces the logical exclusivity principle and the state definitions used in the graph-structure theorems.","marker":"[20]"},{"why":"It provides the definition of partial Boolean algebra used in Definition 1.","marker":"[21]"},{"why":"It supplies the local consistency conditions that justify treating an event as one element across different contexts.","marker":"[14, 15]"},{"why":"It gives the classical measure characterization of quantum states that the paper restates in atom-graph language.","marker":"[24]"},{"why":"It defines the exclusivity graph approach that the atom graph formalizes and contrasts with.","marker":"[13]"},{"why":"It provides the five-ray contextuality scenario used to show why subgraphs of the atom graph give inconsistent witnesses.","marker":"[23]"}],"fun_headline_variants":["Quantum systems pinned down by atom graphs","Atoms govern all finite quantum structure","Graphs of atoms complete quantum picture","Atom compatibility graphs fix quantum mechanics"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The infinite-dimensional generalization assumes that every maximal context is generated by its minimal events, so every event can be rebuilt as a join of atoms; if some maximal context has no atomic generators, the reconstruction proof stops working, although the finite-dimensional results may still stand.","fun_headline_variants_meta":{"raw":{"variants":["Quantum systems pinned down by atom graphs","Atoms govern all finite quantum structure","Graphs of atoms complete quantum picture","Atom compatibility graphs fix quantum mechanics"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000278,"raw_usage":{"total_tokens":1605,"prompt_tokens":845,"completion_tokens":760,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":461,"completion_tokens_details":{"reasoning_tokens":710}},"tokens_in":461,"tokens_out":760,"duration_ms":5556,"temperature":1.0,"reasoning_tokens":710,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T11:30:49.348356+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Find two atomic, complete, exclusive partial Boolean algebras with isomorphic atom graphs but non-isomorphic algebra structures; the most direct candidate is an algebra containing a maximal Boolean subalgebra that is not generated by its atoms, which would break the step in Theorem 12 where every element is written as a join of atoms. In the finite-dimensional case the same test can be run computationally: search two finite families of rank-one projections in finite-dimensional Hilbert spaces whose compatibility graphs are isomorphic while the generated quantum systems are not.","supporting_citations":[{"cited_title":"(eds.) The Problem of Hidden Variables in Quantum Mechanics, pp","cited_arxiv_id":null,"evidence_quote":"It gives the partial Boolean algebra treatment of quantum events that the paper builds on."},{"cited_title":"Foundations of Physics 45, 557–590 (2015)","cited_arxiv_id":null,"evidence_quote":"It supplies the reconstruction programme that the paper extends to exclusivity and atom graphs."},{"cited_title":"Applied categor- ical structures 20(4), 393–414 (2012)","cited_arxiv_id":null,"evidence_quote":"It provides the definition of partial Boolean algebra used in Definition 1."},{"cited_title":"Indiana Univ","cited_arxiv_id":null,"evidence_quote":"It gives the classical measure characterization of quantum states that the paper restates in atom-graph language."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"It defines the exclusivity graph approach that the atom graph formalizes and contrasts with."}],"review_version":1}