Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:0911.2289 · Journal of Physics A Mathematical and Theoretical

Critical noncolorings of the 600-cell proving the Bell–Kochen–Specker theorem

Mordecai Waegell, P K Aravind

Published Feb 18, 2010• 14 citations
arXivHTMLPDF

Abstract

Aravind and Lee-Elkin (1998 J. Phys. A: Math. Gen. 31 9829–34) gave a proof of the Bell–Kochen–Specker theorem by showing that it is impossible to color the 60 directions from the center of a 600-cell to its vertices in a certain way. This paper refines that result by showing that the 60 directions contain many subsets of 36 and 30 directions that cannot be similarly colored, and so provide more economical demonstrations of the theorem. Further, these subsets are shown to be critical in the sense that deleting even a single direction from any of them causes the proof to fail. The critical sets of size 36 and 30 are shown to belong to orbits of 200 and 240 members, respectively, under the symmetries of the polytope. A comparison is made between these critical sets and other such sets in four dimensions and the significance of these results is discussed.

DOI
10.1088/1751-8113/43/10/105304

Related papers

Triacontagonal proofs of the Bell–Kochen–Specker theorem

P. K. Aravind, Justin Y. J. Burton, Guillermo Nuñez Ponasso +1 more

Abstract Coxeter pointed out that a number of polytopes can be projected orthogonally into two dimensions in such a way that their vertices lie on a number of concentric regular triacontagons (or 30-gons). Among them are the 600-cell and 120-cell in four dimensions and Gosset’s polytope 4 21 in eight dimensions. We show how these projections can be modified into Kochen–Specker diagrams from which parity proofs of the Bell–Kochen–Specker theorem are easily extracted. Our construction trivially yields parity proofs of fifteen bases for all three polytopes and also allows many other proofs of the same type to be constructed for two of them. The defining feature of these proofs is that they have a fifteen-fold symmetry about the center of the Kochen–Specker diagram and thus involve both rays and bases that are multiples of fifteen. Any proof of this type can be written as a word made up of an odd number of distinct letters, each representing an orbit of fifteen bases. Knowing the word representing a proof makes it possible to infer all its characteristics without first having to recover its bases. A comparison is made with earlier approaches that have been used to obtain parity proofs in these polytopes, and some directions in which this work can be extended are discussed.

arXiv:2510.01063•Journal of Physics A Mathematical and Theoretical•Mar 23, 2026•0 citations

Two noncolourable configurations in four dimensions illustrating the Kochen-Specker theorem

P. K. Aravind, Forest Lee-Elkin

It is demonstrated that the 60 rays corresponding to antipodal pairs of vertices of the 600-cell, and the 300 rays corresponding to antipodal pairs of vertices of the 120-cell, can both be used to give noncolouring proofs of the Bell-Kochen-Specker theorem in four dimensions.

Journal of Physics A Mathematical and General•Dec 11, 1998•23 citations

The largest noncontextual subset of the 600-cell's seventy-five bases has size sixty-five

Brent W. Jonah

The 60 rays and 75 orthonormal bases derived from the vertices of the 600-cell form the well-known Kochen-Specker system of Waegell and Aravind. This note determines exactly the largest number of the 75 bases that a single {0,1} ray assignment can satisfy (exactly one ray valued 1 per satisfied basis): the answer is 65, so at least ten bases must fail. This improves the lower bound of nine failures obtained by Waegell, Aravind, Megill and Pavicic (2011) from parity-proof coverings, answers the question they left open, and settles the corresponding open problem restated by Aravind, Burton, Nunez Ponasso and Richter (2026) for the 600-cell. The lower bound is an explicit 17-ray assignment verified in exact Q(sqrt5) arithmetic; the upper bound is certified both by two independent integer-programming solvers and by an explicit family of 150 parity proofs (ten orbits under the triacontagonal C15 symmetry) admitting no nine-element hitting set. The tight noncontextuality inequality is 65 versus the quantum value 75 (ratio 15/11 in the +/-1 normalization). A transfer proposition brackets the analogous 120-cell maximum in [600, 625]. Verification: run python3 verify.py with proofs150.txt in the same directory. It rebuilds the system from the two stated generators and re-verifies the construction anchors, the certificate count of 65, the ten failing bases, and the validity of all 150 parity proofs in seconds, without any solver.

•Jul 7, 2026•1 citation

Bell - Kochen - Specker theorem for any finite dimension

Adán Cabello, Guillermo García Alcaine

The Bell - Kochen - Specker theorem against non-contextual hidden variables can be proved by constructing a finite set of `totally non-colourable' directions, as Kochen and Specker did in a Hilbert space of dimension n = 3. We generalize Kochen and Specker's set to Hilbert spaces of any finite dimension , in a three-step process that shows the relationship between different kinds of proofs (`continuum', `probabilistic', `state-specific' and `state-independent') of the Bell - Kochen - Specker theorem. At the same time, this construction of a totally non-colourable set of directions in any dimension explicitly solves the question raised by Zimba and Penrose about the existence of such a set for n = 5.

Journal of Physics A Mathematical and General•Mar 7, 1996•45 citations

Proofs of the Kochen-Specker Theorem in 3 Dimensions

Elizabeth Gould

This project examines two sets of rays in three dimensions that prove the Bell-Kochen-Specker theorem, the 33 rays of Peres and the 33 rays of Penrose. It is shown that these rays possess identical orthogonality tables and thus lead to identical proofs of the theorem. It is also shown that these sets of rays are particular members of a three parameter family of 33 rays that prove the theorem.

•May 15, 2009•0 citations

On Critical Kochen-Specker Sets

Mladen Pavičić, Norman D. Megill, P. K. Aravind

We find a new highly symmetrical and very numerous class (millions of non-isomorphic sets) of 4-dim Kochen-Specker (KS) vector sets. Due to the nature of their geometrical symmetries, they cannot be obtained from previously known ones. We generate the sets from a single set of 60 orthogonal spin vectors and 75 of their tetrads (which we obtained from the 600-cell) by means of our newly developed stripping technique. We also consider critical KS subsets and analyze their geometry. The algorithms and programs for the generation of our KS sets are presented.

•Apr 8, 2010•0 citations
Aravind and Lee-Elkin (1998 J. Phys. A: Math. Gen. 31 9829–34) gave a proof of the Bell–Kochen–Specker theorem by showing that it is impossible to color the 60 directions from the center of a 600-cell to its vertices in a certain way. This paper refines that result by showing that the 60 directions contain many subsets of 36 and 30 directions that cannot be similarly colored, and so provide more economical demonstrations of the theorem. Further, these subsets are shown to be critical in the sense that deleting even a single direction from any of them causes the proof to fail. The critical sets of size 36 and 30 are shown to belong to orbits of 200 and 240 members, respectively, under the symmetries of the polytope. A comparison is made between these critical sets and other such sets in four dimensions and the significance of these results is discussed.
Abstract Coxeter pointed out that a number of polytopes can be projected orthogonally into two dimensions in such a way that their vertices lie on a number of concentric regular triacontagons (or 30-gons). Among them are the 600-cell and 120-cell in four dimensions and Gosset’s polytope 4 21 in eight dimensions. We show how these projections can be modified into Kochen–Specker diagrams from which parity proofs of the Bell–Kochen–Specker theorem are easily extracted. Our construction trivially yields parity proofs of fifteen bases for all three polytopes and also allows many other proofs of the same type to be constructed for two of them. The defining feature of these proofs is that they have a fifteen-fold symmetry about the center of the Kochen–Specker diagram and thus involve both rays and bases that are multiples of fifteen. Any proof of this type can be written as a word made up of an odd number of distinct letters, each representing an orbit of fifteen bases. Knowing the word representing a proof makes it possible to infer all its characteristics without first having to recover its bases. A comparison is made with earlier approaches that have been used to obtain parity proofs in these polytopes, and some directions in which this work can be extended are discussed.
The 60 rays and 75 orthonormal bases derived from the vertices of the 600-cell form the well-known Kochen-Specker system of Waegell and Aravind. This note determines exactly the largest number of the 75 bases that a single {0,1} ray assignment can satisfy (exactly one ray valued 1 per satisfied basis): the answer is 65, so at least ten bases must fail. This improves the lower bound of nine failures obtained by Waegell, Aravind, Megill and Pavicic (2011) from parity-proof coverings, answers the question they left open, and settles the corresponding open problem restated by Aravind, Burton, Nunez Ponasso and Richter (2026) for the 600-cell. The lower bound is an explicit 17-ray assignment verified in exact Q(sqrt5) arithmetic; the upper bound is certified both by two independent integer-programming solvers and by an explicit family of 150 parity proofs (ten orbits under the triacontagonal C15 symmetry) admitting no nine-element hitting set. The tight noncontextuality inequality is 65 versus the quantum value 75 (ratio 15/11 in the +/-1 normalization). A transfer proposition brackets the analogous 120-cell maximum in [600, 625]. Verification: run python3 verify.py with proofs150.txt in the same directory. It rebuilds the system from the two stated generators and re-verifies the construction anchors, the certificate count of 65, the ten failing bases, and the validity of all 150 parity proofs in seconds, without any solver.
The Bell - Kochen - Specker theorem against non-contextual hidden variables can be proved by constructing a finite set of `totally non-colourable' directions, as Kochen and Specker did in a Hilbert space of dimension n = 3. We generalize Kochen and Specker's set to Hilbert spaces of any finite dimension , in a three-step process that shows the relationship between different kinds of proofs (`continuum', `probabilistic', `state-specific' and `state-independent') of the Bell - Kochen - Specker theorem. At the same time, this construction of a totally non-colourable set of directions in any dimension explicitly solves the question raised by Zimba and Penrose about the existence of such a set for n = 5.
We find a new highly symmetrical and very numerous class (millions of non-isomorphic sets) of 4-dim Kochen-Specker (KS) vector sets. Due to the nature of their geometrical symmetries, they cannot be obtained from previously known ones. We generate the sets from a single set of 60 orthogonal spin vectors and 75 of their tetrads (which we obtained from the 600-cell) by means of our newly developed stripping technique. We also consider critical KS subsets and analyze their geometry. The algorithms and programs for the generation of our KS sets are presented.