Pith. sign in

REVIEW 3 major objections 4 minor 75 references

Emergence and Recovery of (logical) Kochen-Specker Contextuality via Hamilton Extension

T0 review · 3 major / 4 minor · reviewed 2026-08-02 · deepseek-v4-flash

Pith's one-line read This paper claims that logical Kochen-Specker contextuality can be generated, not merely revealed, by a constructive transformation called Hamilton extension, and that six is the smallest number of parent vectors that can seed such a contra

desk verdict The Hamilton-extension construction is genuinely nice and the examples are concrete, but Theorem 3's proof is internally inconsistent, so the sharp five-vs-six threshold claim is unsupported as written. read the letter →

arxiv 2607.14629 v1 pith:X22DJM6I submitted 2026-07-16 quant-ph math-phmath.MP

classification quant-phmath-phmath.MP
keywords Kochen-SpeckercontextualitylogicalHamiltonextensionquaternionalgebraemergentcontextsorthogonalitygraphsKScoloringsapexaugmentation
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The authors are trying to establish that logical Kochen-Specker contextuality can emerge from vector sets that are themselves KS-colorable, through a systematic rewriting of their compatibility structure. Their central tool is the Hamilton extension, which sends each real four-dimensional vector to an orthogonal basis and thereby creates new measurement contexts from cross-relations between different parents. They prove that this mechanism recovers contextuality destroyed by apex-vertex augmentation and produces new compact KS sets. They also claim a sharp threshold: every five-vector parent set remains colorable under extension, while some six-vector parent sets already yield logical KS contradictions. If correct, this changes the picture of contextuality from an intrinsic feature of specially built configurations to an engineered property with a quantitative minimum seed size.

What carries the argument

The Hamilton extension is a quaternion-based map associating to each ray in real projective 3-space an ordered orthonormal basis, its Hamilton context, via left multiplication by the quaternion units 1, e1, e2, e3. The machinery also classifies emergent contexts: type (2-2), built from two children of each of two Hamilton-distinct parents, and type (1-1-1-1), built from one child of each of four Hamilton-distinct parents. Structural lemmas restrict which emergent contexts can coexist, and idempotence of the extension, H[H[V]] = H[V], makes it a closure operation. These emergent contexts are what change the compatibility graph enough to destroy all KS colorings.

What would settle it

Enumerate all sets of five mutually Hamilton-distinct vectors in real projective 3-space, compute their Hamilton extensions with all Hamilton and emergent contexts, and search for a {0,1} assignment satisfying every context; a single KS-uncolorable instance refutes the claimed threshold. Equally directly, check each displayed coloring in the proof of Theorem 3 against the full list of contexts it is supposed to satisfy.

Watch

Extended reading notes

Core claim

The central claim is that logical KS contextuality can emerge from KS-colorable vector sets via Hamilton extension. For a real vector v=(a,b,c,d), the extension is the mutually orthogonal basis {v, (-b,a,-d,c), (-c,d,a,-b), (-d,-c,b,a)}; applying this basis-generation to every vector in a parent set produces new orthogonality relations among children of different parents, called emergent contexts. These emergent contexts can tip a previously colorable configuration into one with no valid {0,1} assignment on every context. The sharp quantitative claim is that five-vector parent sets never suffice — every Hamilton extension of a five-vector parent set admits a KS coloring — while suitably chos

Load-bearing premise

The sharp five-vector threshold rests on the assumption that the displayed 'valid colorings' in the proof of Theorem 3 are genuine global assignments satisfying every Hamilton and emergent context, rather than shorthand that omits cases.

Editorial extensions

If this is right

  • Logical KS contextuality can be engineered: starting from KS-colorable configurations, the Hamilton extension produces configurations with no deterministic noncontextual assignment.
  • Apex-vertex augmentation, which always produces a KS-colorable graph, is systematically undone: the Hamilton extension of the augmented graph is again logically contextual for several known logical KS constructions.
  • The threshold result fixes the minimal parent-set size at six: no five-vector parent set can seed a contradiction by this route, while certain six-vector sets already do.
  • The construction yields new compact KS sets, including a 32-vector set and a 24-vector set that is not isomorphic to the previously known 24-vector set.
  • Because KS non-colorability is hereditary under supersets, any 4D complex vector configuration containing the eight-vector seed becomes logically contextual under the generalized Hamilton extension.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the threshold is correct, Hamilton extension gives a generative classification of KS sets by parent complexity rather than final size; six is the first nontrivial seed number, but analogous extensions in other algebraic settings might shift this floor.
  • The idempotence of the extension suggests that the real novelty lies entirely in the first step: the emergent contexts are determined by the parent set, so the method is a sharp probe of how compatibility relations amplify under orthogonal closure.
  • A natural testable extension is to search computationally over all five-vector Hamilton-distinct configurations: confirming universal colorability would validate the sharp threshold, while a single counterexample would disprove it.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 4 minor

Summary. The paper introduces the Hamilton extension of real four-vector sets: every parent vector generates a four-ray orthonormal basis via the quaternion algebra, and further orthogonality relations among children of distinct parents produce 'emergent contexts.' The authors claim that this transformation can turn KS-colorable parent sets into logical KS sets, recover logical contextuality lost under apex-vertex augmentation, and, most sharply, that the extension of every five-vector parent set remains KS-colorable while a suitably chosen six-vector parent set already yields a logical KS contradiction (Theorem 3 vs. Theorem 2). Theorems 1 and 2 give explicit examples, including a new 32-vector KS set and identification of H[V6] with Peres-24. The central optimality claim, however, rests on the proof of Theorem 3 in Appendix C, and that proof has serious gaps: the displayed 'valid KS colorings' are internally inconsistent, the general case of non-Hamilton-distinct parents is not reduced, and part of the case analysis refers to colorings that are not actually exhibited.

Significance. If the results are correct, the Hamilton extension provides a genuinely new generative route to logical Kochen–Specker contextuality, with a quantitative threshold: six parent vectors are necessary and sufficient. The paper's strengths include the explicit verification that H[V6] coincides with Peres-24, the explicit 32-vector construction in Theorem 1, the Construction 1 example, and the absence of fitted parameters or normalization tricks; the examples are benchmarked against known KS sets. The potential significance is high, since a constructive mechanism that produces contextuality from KS-colorable parents and recovers contextuality destroyed by apex augmentation would reorganize part of the KS-set literature. However, the claimed sharp threshold is the headline result, and it depends entirely on Theorem 3. As written, Appendix C does not prove Theorem 3: the colorability certificates it lists are not valid KS assignments. The theorem may well be true, but the provided argument does not establish it.

major comments (3)
  1. [Appendix C, Case I (all cases)] The displayed 'valid KS colorings' are internally inconsistent because of the shorthand. The preamble defines C^{0123}_X as meaning µ(X^2)=1 and µ(X^0)=µ(X^1)=µ(X^3)=0, while C^{αβ|γδ}_{UV} is defined as meaning µ(U^α)=1 and all other projectors in that context are 0. In Case 1, the list includes both C^{0123}_A and C^{01|01}_{AB}; the first forces A^2=1 and the second forces A^0=1. Since A^0 and A^2 are orthogonal, no global assignment can satisfy both. The same conflict occurs in Cases 2–4 and in Case II. Therefore the listed sets of tokens do not constitute actual KS colorings, and the case analysis never demonstrates a legitimate global assignment. This is not a stylistic problem: the entire proof of Theorem 3 rests on these certificates.
  2. [Appendix C, first sentence of proof of Theorem 3] The proof begins 'Let V5={A,B,C,D,E}⊂RP^3, with all projectors mutually Hamilton-distinct' and never reduces the general case. If some parent vectors are not Hamilton-distinct, then H[V5] has fewer than five distinct Hamilton contexts and may have a different set of emergent contexts. The colorability of the five-distinct configuration does not automatically imply colorability of these subgraphs unless they are shown to be subgraphs of the constructed configurations, which is not argued. Since Theorem 3 is a universal statement over every five-vector parent set, this missing reduction is load-bearing.
  3. [Appendix C, Case II] In both subcases of Case II the proof states that 'a valid KS-coloring is shown' or 'as a valid KS-coloring is already shown,' but no actual coloring is displayed or described. The argument therefore omits the key step for configurations that contain both type (1-1-1-1) and type (2-2) emergent contexts. The case is not closed as written.
minor comments (4)
  1. [Appendix C] The notation C^{0123}_X is overloaded: it denotes both the Hamilton context and the proposed value assignment. This ambiguity appears to be the source of the inconsistent certificates. A separate notation for assignments (e.g., a tuple of values) would clarify the proof.
  2. [Figure 2] Several labels in the figure, such as C1,...,C8, C^1,...,C^6, and the context lists, are not defined in the caption. The caption should state which symbols denote Hamilton contexts and which denote emergent contexts, consistent with the definitions in the text.
  3. [Appendix B, Eq. (36)] The line '− → ×C6' and '− → ×C5' uses C6 and C5 without defining whether these are Hamilton contexts of the parent vectors u6 and u5 or something else. This makes the contradiction table harder to follow.
  4. [Main text, Construction 2] The term 'weakly irreducible' is used without definition. If it means that some but not all single-vector deletions preserve uncolorability, that should be stated explicitly.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the Hamilton extension is a constructive transformation checked against external KS benchmarks; however, Appendix C's proof of Theorem 3 appears internally inconsistent, which is a proof gap rather than circular reasoning.

full rationale

No fitted parameter is renamed as a prediction and no result is equivalent to its inputs by construction. The Hamilton extension is an explicit map (Definition 2) built from quaternion multiplication; Proposition 1 and Lemmas 1-10 are derived from that definition, not assumed. The main emergence claims are benchmarked against external KS sets: Theorem 2 identifies H[V6] with the Peres-24 construction, and Theorem 1's contradiction is a concrete case analysis on explicit vectors in Table II. The lower-bound step uses Xu et al.'s independent 18-vector KS lower bound rather than a self-citation. Self-citations occur only in the introductory application-motivation paragraphs and are not load-bearing. Therefore no significant circularity exists. A separate, non-circular correctness concern: Appendix C's proof of Theorem 3 defines C^{0123}_X as meaning µ(X^2)=1 and C^{01|01}_{UV} as meaning µ(U^0)=1, but then lists both C^{0123}_A and C^{01|01}_{AB} in a single 'valid KS coloring', forcing orthogonal A^2 and A^0 both to 1; the displayed lists are not global KS colorings. This undermines the five-vector half of the sharp threshold as written, but it is an internal proof gap, not circularity.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

The central claims rest on standard quaternion algebra, cited KS results, and set-containment facts from prior literature. The only concerning item is the unstated reduction in Theorem 3; no fitted constants or invented physical entities are introduced.

assumptions (5)
  • domain assumption Peres-24 is KS-uncolorable
    Theorem 2 obtains logical KS contextuality because H[V6]=Peres-24; non-colorability of Peres-24 is cited from [28] and not re-derived.
  • domain assumption Every logical KS set has at least 18 vectors (Xu et al.)
    Used to argue that six is the minimum parent cardinality; depends on the external theorem [45].
  • domain assumption Containment claims for P33, CK31, B33, CN18, YO14
    Corollaries 1-2 and the recovery examples rely on cited claims [42-44] that these known sets contain YO13 or V8 as subsets.
  • ad hoc to paper Hamilton-distinctness reduction in Theorem 3
    The proof assumes all five parent vectors are mutually Hamilton-distinct without explicitly reducing the non-distinct case to a smaller configuration.
  • standard math Standard quaternion algebra identities
    Definition 2 and Lemma 2 rest on standard quaternion multiplication and orthogonality relations.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Emergence and Recovery of (logical) Kochen-Specker Contextuality via Hamilton Extension." pith.science (2026). https://pith.science/paper/X22DJM6I

@misc{pith2026260714629,
  author       = {Pith},
  title        = {Pith review of: Emergence and Recovery of (logical) Kochen-Specker Contextuality via Hamilton Extension},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/X22DJM6I}},
  note         = {Machine review of arXiv:2607.14629}
}
read the original abstract

Logical Kochen-Specker (KS) contextuality is widely regarded as an intrinsic property of specially constructed measurement configurations. We show instead that it can emerge from KS-colorable vector sets through a constructive procedure we call the Hamilton extension. Defined for four-dimensional vector sets, the Hamilton extension associates each real vector with a measurement context while inducing additional measurement contexts among Hamilton-extended children of distinct parent vectors. These emergent contexts fundamentally alter the compatibility structure, transforming KS-colorable configurations into KS-uncolorable ones and recovering logical contextuality lost under apex-vertex augmentation. We establish a sharp and optimal threshold -- the Hamilton extension of every five-vector parent set remains KS-colorable, whereas suitably chosen six-vector parent sets already generate logical KS contradictions. Thus, six vectors constitute the smallest parent set capable of generating KS contradiction through this mechanism. Our results reveal a new structural route to contextuality, provide a systematic framework for constructing compact KS sets, and have implications for contextuality-based quantum information protocols and graph-theoretic approaches to nonclassicality.

Figures

Figures reproduced from arXiv: 2607.14629 by the authors.

Figure 1
Figure 1. (Color online) Illustration of apex augmentation and [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. (Color online) Hamilton extensions generating logical KS contextuality. Left: the extension [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. (Color online) Graphical representation of the inner-product relations between the elements of [PITH_FULL_IMAGE:figures/full_fig_p008_3.png] view at source ↗
Figures from the paper (1 more)
Figure 4
Figure 4. Figure 4: (Color online) Left: Orthogonality graph of the set [PITH_FULL_IMAGE:figures/full_fig_p014_4.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

75 extracted references

  1. [1]

    The Problem of Hidden Variables in Quantum Mechanics,

    S. Kochen and E. P. Specker, “The Problem of Hidden Variables in Quantum Mechanics,” J. Math. Mech.17, 59– 87 (1967)

  2. [2]

    On the Einstein Podolsky Rosen paradox,

    J. S. Bell, “On the Einstein Podolsky Rosen paradox,” Phys- ics Physique Fizika1, 195–200 (1964)

  3. [3]

    On the Problem of Hidden Variables in Quantum Mechanics,

    J. S. Bell, “On the Problem of Hidden Variables in Quantum Mechanics,” Rev. Mod. Phys.38, 447–452 (1966)

  4. [4]

    Experimental Test of Local Hidden-Variable Theories,

    S. J. Freedman and J. F. Clauser, “Experimental Test of Local Hidden-Variable Theories,” Phys. Rev. Lett.28, 938– 941 (1972)

  5. [5]

    Experimental Real- ization of Einstein-Podolsky-Rosen-Bohm Gedankenexper- iment: A New Violation of Bell’s Inequalities,

    A. Aspect, P. Grangier, and G. Roger, “Experimental Real- ization of Einstein-Podolsky-Rosen-Bohm Gedankenexper- iment: A New Violation of Bell’s Inequalities,” Phys. Rev. Lett.49, 91–94 (1982)

  6. [6]

    Experimental Test of Bell’s Inequalities Using Time-Varying Analyzers,

    A. Aspect, J. Dalibard, and G. Roger, “Experimental Test of Bell’s Inequalities Using Time-Varying Analyzers,” Phys. Rev. Lett.49, 1804–1807 (1982)

  7. [7]

    “Event-ready-detectors

    M. ˙Zukowski, A. Zeilinger, M. A. Horne, and A. K. Ekert, ““Event-ready-detectors” Bell experiment via entanglement swapping,” Phys. Rev. Lett.71, 4287–4290 (1993)

  8. [8]

    Experimental Test of Quantum Contextuality in Neutron Interferometry ,

    H. Bartosik, J. Klepp, C. Schmitzer, S. Sponar, A. Ca- bello, H. Rauch, and Y. Hasegawa, “Experimental Test of Quantum Contextuality in Neutron Interferometry ,” Phys. Rev. Lett.103, 040403 (2009)

Show all 75 references
  1. [9]

    State- independent experimental test of quantum contextuality ,

    G. Kirchmair, F. Zähringer, R. Gerritsma, M. Kleinmann, O. Gühne, A. Cabello, R. Blatt, and C. F. Roos, “State- independent experimental test of quantum contextuality ,” Nature460, 494–497 (2009)

  2. [10]

    State-Independent Quantum Contextuality with Single Photons,

    E. Amselem, M. Rådmark, M. Bourennane, and A. Cabello, “State-Independent Quantum Contextuality with Single Photons,” Phys. Rev. Lett.103, 160405 (2009)

  3. [11]

    Experimental non- classicality of an indivisible quantum system,

    R. Lapkiewicz, P. Li, C. Schaeff, N. K. Langford, S. Ram- elow, M. Wie´sniak, and A. Zeilinger, “Experimental non- classicality of an indivisible quantum system,” Nature474, 490–493 (2011)

  4. [12]

    Hidden variables and the two theorems of John Bell,

    N. D. Mermin, “Hidden variables and the two theorems of John Bell,” Rev. Mod. Phys.65, 803–815 (1993)

  5. [13]

    Bell nonlocality ,

    N. Brunner, D. Cavalcanti, S. Pironio, V. Scarani, and S. Wehner, “Bell nonlocality ,” Rev. Mod. Phys.86, 419–478 (2014)

  6. [14]

    Kochen-Specker contextuality ,

    C. Budroni, A. Cabello, O. Gühne, M. Kleinmann, and J-Å Larsson, “Kochen-Specker contextuality ,” Rev. Mod. Phys. 94, 045007 (2022)

  7. [15]

    Quantum Crypto- graphy with 3-State Systems,

    H. Bechmann-Pasquinucci and A. Peres, “Quantum Crypto- graphy with 3-State Systems,” Phys. Rev. Lett.85, 3313– 3316 (2000)

  8. [16]

    Im- proving Zero-Error Classical Communication with Entan- glement,

    T. S. Cubitt, D. Leung, W. Matthews, and A. Winter, “Im- proving Zero-Error Classical Communication with Entan- glement,” Phys. Rev. Lett.104, 230503 (2010)

  9. [17]

    Strong Kochen-Specker theorem and incomputability of quantum randomness,

    A. A. Abbott, C. S. Calude, J. Conder, and K. Svozil, “Strong Kochen-Specker theorem and incomputability of quantum randomness,” Phys. Rev. A86, 062109 (2012)

  10. [18]

    Con- textuality supplies the ‘magic’ for quantum computation,

    M. Howard, J. Wallman, V. Veitch, and J. Emerson, “Con- textuality supplies the ‘magic’ for quantum computation,” Nature510, 351–355 (2014)

  11. [19]

    Contextuality as a Resource for Models of Quantum Computation with Qubits,

    J. Bermejo-Vega, N. Delfosse, D. E. Browne, C. Okay , and R. Raussendorf, “Contextuality as a Resource for Models of Quantum Computation with Qubits,” Phys. Rev. Lett. 119, 120505 (2017)

  12. [20]

    Quantum advantage with shallow circuits,

    S. Bravyi, D. Gosset, and R. König, “Quantum advantage with shallow circuits,” Science362, 308–311 (2018)

  13. [21]

    Robust Self-Testing of Quantum Systems via Noncontextuality Inequalities,

    K. Bharti, M. Ray, A. Varvitsiotis, N. A. Warsi, A. Cabello, and L-C. Kwek, “Robust Self-Testing of Quantum Systems via Noncontextuality Inequalities,” Phys. Rev. Lett.122, 250403 (2019)

  14. [22]

    Ad- vantage of Hardy’s nonlocal correlation in reverse zero- error channel coding,

    M. Alimuddin, A. Chakraborty , G. L. Sidhardh, R. K. Patra, S. Sen, S. R. Chowdhury, S. G. Naik, and M. Banik, “Ad- vantage of Hardy’s nonlocal correlation in reverse zero- error channel coding,” Phys. Rev. A108, 052430 (2023)

  15. [23]

    Quantum Contextuality Provides Communication Com- plexity Advantage,

    S. Gupta, D. Saha, Z-P. Xu, A. Cabello, and A. S. Majumdar, “Quantum Contextuality Provides Communication Com- plexity Advantage,” Phys. Rev. Lett.130, 080802 (2023)

  16. [24]

    Nonlocality-assisted enhancement of error-free communication in noisy clas- sical channels,

    K. Agarwal, S. G. Naik, A. Chakraborty, S. Sen, P. Ghosal, B. Paul, M. Banik, and R. K. Patra, “Nonlocality-assisted enhancement of error-free communication in noisy clas- sical channels,” Phys. Rev. A113, 042415 (2026)

  17. [25]

    Superadditivity of Zero-Error Capacity in Noisy Classical and Perfect Quantum Channel Pairs,

    Ambuj, A. Chattopadhyay, K. Agarwal, R. Das, and 6 A. Mukherjee, “Superadditivity of Zero-Error Capacity in Noisy Classical and Perfect Quantum Channel Pairs,” (2026), arXiv:2601.08913 [quant-ph]

  18. [26]

    Conclusive Identi- fication Via Noisy Classical Channel: Superactivation and Quantum Advantage,

    A. Chattopadhyay, Ambuj, R. Das, S. Patra, C. Roychow- dhury, M. Banik, and A. Mukherjee, “Conclusive Identi- fication Via Noisy Classical Channel: Superactivation and Quantum Advantage,” (2026), arXiv:2604.00089 [quant- ph]

  19. [27]

    On a New Species of Imaginary Quantit- ies Connected with the Theory of Quaternions,

    W. R. Hamilton, “On a New Species of Imaginary Quantit- ies Connected with the Theory of Quaternions,” Proc. R. Ir. Acad.2, 424–434 (1844)

  20. [28]

    Two simple proofs of the Kochen-Specker the- orem,

    A Peres, “Two simple proofs of the Kochen-Specker the- orem,” J. Phys. A: Math. Gen.24, L175–L178 (1991)

  21. [29]

    Peres,Quantum Theory: Concepts and Methods(Kluwer Academic Publishers, 1993)

    A. Peres,Quantum Theory: Concepts and Methods(Kluwer Academic Publishers, 1993)

  22. [30]

    Schütte’s tautology and the Kochen-Specker the- orem,

    J. Bub, “Schütte’s tautology and the Kochen-Specker the- orem,” Found. Phys.26, 787–806 (1996)

  23. [31]

    On Bell non-locality without probabilities: Some curious geometry,

    R. Penrose, “On Bell non-locality without probabilities: Some curious geometry,” inQuantum Reflections, edited by J. Ellis and D. Amati (Cambridge University Press, Cam- bridge, England, 2000) pp. 1–27

  24. [32]

    Bell-Kochen-Specker theorem for 20 vec- tors,

    M Kernaghan, “Bell-Kochen-Specker theorem for 20 vec- tors,” J. Phys. A: Math. Gen.27, L829–L830 (1994)

  25. [33]

    Bell- Kochen-Specker theorem: A proof with 18 vectors,

    A. Cabello, J. Estebaranz, and G. García-Alcaine, “Bell- Kochen-Specker theorem: A proof with 18 vectors,” Phys. Lett. A212, 183–187 (1996)

  26. [34]

    State-Independent Proof of Kochen- Specker Theorem with 13 Rays,

    S. Yu and C. H. Oh, “State-Independent Proof of Kochen- Specker Theorem with 13 Rays,” Phys. Rev. Lett.108, 030402 (2012)

  27. [35]

    A Kochen–Specker inequality from a SIC,

    I. Bengtsson, K. Blanchfield, and A. Cabello, “A Kochen–Specker inequality from a SIC,” Phys. Lett. A376, 374–376 (2012)

  28. [36]

    State-independent con- textuality sets for a qutrit,

    Z-P. Xu, J-L. Chen, and H.-Y. Su, “State-independent con- textuality sets for a qutrit,” Phys. Lett. A379, 1868–1870 (2015)

  29. [37]

    Getting contextual and nonlocal elements-of- reality the easy way ,

    R. Clifton, “Getting contextual and nonlocal elements-of- reality the easy way ,” Am. J. Phys.61, 443–447 (1993)

  30. [38]

    Simple Test for Hidden Variables in Spin- 1 Systems,

    A. A. Klyachko, M. A. Can, S. Binicio ˘glu, and A. S. Shumovsky, “Simple Test for Hidden Variables in Spin- 1 Systems,” Phys. Rev. Lett.101, 020403 (2008)

  31. [39]

    Ebbinghaus, H

    H-D. Ebbinghaus, H. Hermes, F. Hirzebruch, M. Koecher, K. Mainzer, J. Neukirch, A. Prestel, and R. Remmert, Numbers [Graduate Texts in Mathematics](Springer New York, 1991)

  32. [40]

    Necessary and Sufficient Condition for Quantum State-Independent Contextuality ,

    A. Cabello, M. Kleinmann, and C. Budroni, “Necessary and Sufficient Condition for Quantum State-Independent Contextuality ,” Phys. Rev. Lett.114, 250402 (2015)

  33. [41]

    On the Quantum Chromatic Number of a Graph,

    P. J. Cameron, A. Montanaro, M. W. Newman, S. Severini, and A. Winter, “On the Quantum Chromatic Number of a Graph,” Electron. J. Combin.14, R81 (2007)

  34. [42]

    Quantum Contextuality,

    M. Pavicic, “Quantum Contextuality,” Quantum7, 953 (2023)

  35. [43]

    Simplest Kochen-Specker Set,

    A. Cabello, “Simplest Kochen-Specker Set,” Phys. Rev. Lett. 135, 190203 (2025)

  36. [44]

    On Simplest Kochen-Specker Sets,

    M. Pavicic, “On Simplest Kochen-Specker Sets,” (2025), arXiv:2512.10483 [quant-ph]

  37. [45]

    Proof of the Peres Conjecture for Contextuality ,

    Z-P. Xu, J-L. Chen, and O. Gühne, “Proof of the Peres Conjecture for Contextuality ,” Phys. Rev. Lett.124, 230401 (2020)

  38. [46]

    What’s Wrong with These Observables?

    Asher Peres, “What’s Wrong with These Observables?” Found. Phys.33, 1543–1547 (2003)

  39. [47]

    Oddities of Quantum Colorings,

    L. Manˇcinska and D. E. Roberson, “Oddities of Quantum Colorings,” Balt. J. Mod. Comput.4, 846–859 (2016). APPENDIX A: HAMILTON EXTENSION—MATHEMATICAL STRUCTURES AND MEASUREMENT CONTEXTS Before presenting our proofs, in this section, we will first analyze several mathematical ...

  40. [48]

    Consequently , we have µ(u0

    = 1in contextC 1. Consequently , we have µ(u0

  41. [49]

    = 0.(32) Completeness requirement then demands exactly one of the projectors {u1 4,u 2 4} to be assigned value 1 in context C 12|12 14 . Similarly , exactly one of{u0 3,u 2 3} in context C 02|02 13 and exactly one of the vectors {u0 2,u 1 2} in context C 01|01 12 to be assigne...

  42. [50]

    = 1;    .(33) Consider the assignmentµ(u 1

  43. [51]

    As can be checked from Table II, we have u1 4 ⊥u 1 8,u 0 3 ⊥u 2 6,u 0 2 ⊥u 0 7,u 3 1 ⊥u 3 5.(34) The exclusivity condition thus demands µ(u1

    = 1. As can be checked from Table II, we have u1 4 ⊥u 1 8,u 0 3 ⊥u 2 6,u 0 2 ⊥u 0 7,u 3 1 ⊥u 3 5.(34) The exclusivity condition thus demands µ(u1

  44. [52]

    = 0.(35) However, this violates the completeness condition when considering the emergent contextC 3|2|0|1 5678 . Similar contradiction 14 u0 1 u3 1 u0 4 u3 4 u0 7 u0 5 u1 2 u0 8 u0 3 u1 1 u0 2 u0 6 u2 3 u2 1 u3 2 u0 2 u0 4 u2 4 u3 7 u3 1 u1 5 u1 1 u2 6 u2 1 u0 8 u0 1 u1 3 u0 3...

  45. [53]

    = 1 o − → ×C3|2|0|1 5678 ; n µ(u1

  46. [54]

    = 1 o − → ×C6; n µ(u1

  47. [55]

    = 1 o − → ×C1|0|2|3 5678 ; n µ(u1

  48. [56]

    = 1 o − → ×C0|1|3|2 5678 ; n µ(u2

  49. [58]

    = 1 o − → ×C8; n µ(u2

  50. [59]

    = 1 o − → ×C2|3|1|0 5678 ; n µ(u2

  51. [60]

    This completes the proof

    = 1 o − → ×C5;    ,(36) thereby excluding all possible valid KS colorings. This completes the proof. Remark 1.At this point, we note that an analogous argument applies when the parent set is chosen as the seven-vector set V8 \ {⃗ u}with ⃗ u∈ {⃗ v2, ⃗ v3, ⃗ v...

  52. [61]

    = 0,fromC 0123 1 ,(44a) µ(u0

  53. [62]

    = 0,fromC 0|0|0|0 1234 ,(44b) µ(u1

  54. [63]

    = 0,fromC 0|1|0|0 1256 .(44c) Since C 0123 2 must contain exactly one projector assigned value 1, the relations µ(u0

  55. [64]

    By symmetry , we may chooseµ(u 2

    = 0 force exactly one of u2 2 andu 3 2 to receive value1. By symmetry , we may chooseµ(u 2

  56. [65]

    = 0,fromC 0123 2 ,(45a) µ(u2

  57. [66]

    = 0,fromC 2|2|2|2 1234 ,(45b) µ(u3

  58. [67]

    = 0,fromC 3|2|3|3 1256 .(45c) Likewise, the context C 0123 3 together with µ(u0

  59. [68]

    By symmetry , chooseµ(u1

    = 0 forces exactly one of u1 3 and u3 3 to receive value 1. By symmetry , chooseµ(u1

  60. [69]

    Consequently , µ(u3

    = 1. Consequently , µ(u3

  61. [70]

    = 0,fromC 0123 3 ,(46a) µ(u1

  62. [71]

    = 0,fromC 1|1|1|1 1234 ,(46b) µ(u2

  63. [72]

    = 0,fromC 1|0|2|3 3456 .(46c) Sinceµ(u 0

  64. [73]

    = 0, the completeness condition onC 0123 4 forcesµ(u 3

  65. [74]

    = 1, which in turn implies µ(u1

  66. [75]

    = 0,fromC 2|3|1|0 3456 .(47) Finally , µ(u0

  67. [76]

    (44), (47), (46), and (45), respectively

    = 0,(48) where the first, second, third, and fourth equalities follow from Eqs. (44), (47), (46), and (45), respectively. This contradicts the completeness condition for the Hamilton context C 0123 5 , which requires exactly one projector to be assigned value 1. Therefore no K...

Pith tools

Reviewed August 2, 2026 · model on record in the stance chip above.