⚛️ quantum physics

The Algebraic Landscape of Kochen-Specker Sets in Dimension Three

This paper presents a computational survey of Kochen-Specker sets in three-dimensional Hilbert space across various quadratic, cyclotomic, and golden-ratio number fields, revealing that uncolorability arises exclusively when the coordinate alphabet's generator supports either modulus-2 or phase cancellation, thereby clustering constructions into six discrete algebraic islands and identifying new KS graph types in the Heegner-7 and golden ratio fields.

Original authors: Michael Kernaghan

Published 2026-03-19

📖 6 min read🧠 Deep dive

CC BY 4.0

Original authors: Michael Kernaghan

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are trying to build a house using a very specific set of Lego bricks. You have a rule: Every room must have exactly one "Green" brick and two "Red" bricks. Furthermore, if two bricks are touching (orthogonal), they cannot both be Green.

The Kochen-Specker (KS) Theorem is a mathematical proof that says: "No matter how many rooms you build, if you follow these rules, you will eventually get stuck. You will find a room where you simply cannot place the Green brick without breaking a rule somewhere else."

This paper by Michael Kernaghan is a massive architectural survey. Instead of just looking at one house, the author went on a global expedition to find every possible type of Lego brick that can create this "stuck" situation in a 3-dimensional space.

Here is the breakdown of the paper's discoveries, translated into everyday language:

1. The "Magic Ingredient" (Cancellation Mechanisms)

The author discovered that you can't just use any numbers for your Lego bricks. To get the house to collapse (to create the paradox), the numbers on your bricks must have a special "magic trick" built into them.

The paper finds that there are only two types of magic tricks that work:

The "Double-Up" Trick (Modulus-2 Cancellation): Imagine you have a brick labeled 1. The magic trick is that two of them add up to a 2.
- Example: 1 + 1 = 2.
- Why it works: This allows the bricks to fit together perfectly in a way that creates a tight, tangled knot. If the numbers are too "big" (like 1 + 1 = 3), the knot is too loose, and you can still color the house without getting stuck.
The "Circle Dance" Trick (Phase Cancellation): Imagine you have three special spinning bricks that, when you add them up, they cancel each other out to zero.
- Example: 1 + (a spinning brick) + (another spinning brick) = 0.
- Why it works: This creates a perfect triangular balance that forces the contradiction.

The Big Discovery: The author tested thousands of different number systems (like square roots, complex numbers, and golden ratios). Every single time a "stuck" house was built, it used one of these two magic tricks. If a number system didn't have one of these tricks, the house could always be colored successfully.

2. The Six "Algebraic Islands"

Because these magic tricks are so rare, the author found that all the possible "stuck" houses cluster into six distinct islands. Think of these as six different neighborhoods where the rules of physics allow for this paradox.

The Integer Island: Uses whole numbers (1, 2). This is the famous "Conway-Kochen" house with 31 rooms. It's the smallest, most efficient house known.
The Peres Island: Uses numbers like √2 (the square root of 2). It has 33 rooms.
The Eisenstein Island: Uses complex "spinning" numbers. It also has 33 rooms and is mathematically identical to the Peres island, just built with different materials.
The Complex Quadratic Island: Uses √-2. Also 33 rooms, identical to the Peres island.
The Heegner-7 Island (New Discovery!): A newly found neighborhood using a very specific complex number. It's a bigger, more complex house with 43 rooms.
The Golden Ratio Island (New Discovery!): Uses the Golden Ratio (φ). At first glance, this island looked like it couldn't build a stuck house. But the author found that if you let the house "grow" (by adding new rooms automatically), it reveals a hidden 52-room house that does get stuck.

3. The "Hidden Rooms" (Cross-Product Completion)

One of the coolest parts of the paper is the discovery of the Golden Ratio Island.
Imagine you have a blueprint that looks like a normal, colorable house. But, the author says, "Wait, if you follow the rules of geometry, this blueprint automatically generates new rooms you didn't see before."
When you add these "hidden rooms," the house suddenly becomes impossible to color. This teaches us that sometimes you have to look at the entire structure, not just the starting blueprint, to see the paradox.

4. Why Does This Matter? (The Quantum Connection)

You might ask, "Who cares about coloring Lego houses?"
In the real world, this is about Quantum Mechanics.

The House: Represents a quantum system (like an atom).
The Coloring: Represents trying to say the atom has a definite property (like "spin up") before we measure it.
The "Stuck" House: Proves that the atom does not have a definite property until we measure it. The property is created by the act of measurement.

The paper shows that the "mathematical soil" (the number system) determines how complex this quantum magic is.

Some islands (like the Integer one) give you the smallest proof (31 rooms).
Other islands (like the Golden Ratio one) give you a proof that is harder to build (52 rooms) but might be better for specific quantum computing tasks.

5. The "Rigidity" of the House

The author also checked if these houses are "rigid."

Rigid House: If you build it, there is only one way to arrange the bricks. It's a unique, perfect structure.
Flexible House: You can wiggle the bricks slightly, and it still works.

The paper found that the smallest house (31 rooms) is rigid. It's the only way to build it. This is a huge deal because it suggests that nature might be "pinned" to this specific mathematical structure.

Summary

This paper is a map of the quantum landscape.

The Rule: To break the laws of "pre-existing reality" (the KS theorem), you need a specific mathematical "glue" (cancellation).
The Map: There are only six islands where this glue exists in 3D space.
The Treasure: We found two new islands (Heegner-7 and Golden Ratio) that were previously hidden.
The Lesson: The universe seems to prefer specific, rare mathematical structures to create its most mysterious quantum effects. If you want to build a quantum computer or understand the universe, you need to know which "island" you are standing on, because each one offers different advantages and challenges.

1. Problem Statement

The Kochen–Specker (KS) theorem demonstrates that quantum mechanics cannot be explained by non-contextual hidden variable theories. In a 3-dimensional Hilbert space ( $\mathbb{C}^3$ or $\mathbb{R}^3$ ), a KS set is a finite collection of rays (vectors) that cannot be consistently assigned binary values $\{0, 1\}$ such that exactly one vector in every orthogonal triad is assigned "1".

Despite decades of research, the search for the minimal KS set (the smallest number of vectors required) remains an open problem. The current best-known construction is the Conway–Kochen 31-vector set (CK-31), while the theoretical lower bound is 24. Previous computational searches have largely focused on fixed coordinate alphabets or random hypergraphs, often lacking a systematic understanding of the algebraic properties that enable KS-uncolorability.

This paper addresses the structural question: What algebraic properties of a coordinate alphabet determine whether it can support a KS set in dimension 3?

2. Methodology

The author employs a systematic computational survey combined with algebraic number theory and SAT-based verification:

Alphabet Generation: The study tests coordinate alphabets of the form $A = \{0, \pm 1, \pm x\}$ $A = {0, \pm 1, \pm x}$ drawn from various number fields:
- Real quadratic fields $\mathbb{Q}(\sqrt{d})$ for $d=2, \dots, 30$ .
- All nine imaginary quadratic fields with class number 1 (Heegner numbers).
- Cyclotomic fields (roots of unity).
- The golden ratio field $\mathbb{Q}(\phi)$ .
Cross-Product Completion: A crucial step involves generating the cross-product completion of a ray set. For every orthogonal pair of rays, the third vector completing the basis (via cross product or Hermitian orthogonal complement) is added. This process is iterated until the set stabilizes. This is necessary because raw alphabets may be colorable, but their completions may generate the dense orthogonality networks required for KS-uncolorability.
KS-Coloring Verification: The coloring problem is encoded as a Boolean Satisfiability (SAT) instance. The solver (Glucose4 via PySAT) determines if a valid $\{0, 1\}$ assignment exists. UNSAT indicates a KS set.
Minimization and Certification:
- Randomized Greedy Minimization: To find the smallest KS subset within a pool.
- OCUS (Optimal Constrained Unsatisfiable Subset): A rigorous procedure used to prove that no smaller KS subset exists within a specific finite ray pool, certifying the exact minimum for each "island."
- Jacobian Analysis: Used to test the rigidity of KS sets (whether they admit continuous deformations).
Operational Metrics: The paper evaluates the "cost" of these sets in terms of Bipartite Perfect Quantum Strategies (BPQS) and Cabello–Severini–Winter (CSW) graph invariants (contextual advantage).

3. Key Contributions

A. The Two-Mechanism Hypothesis

The central empirical finding is that KS-uncolorability in dimension 3 arises only when the coordinate alphabet supports one of two specific algebraic cancellation mechanisms:

Modulus-2 Cancellation: The generator $x$ satisfies $|x|^2 = 2$ (Hermitian squared modulus). Examples include $1+1=2$ (integers), $|\sqrt{2}|^2=2$ , $|\sqrt{-2}|^2=2$ , and $|\alpha|^2=2$ for $\alpha = (1+\sqrt{-7})/2$ . This allows three-term dot products to vanish (e.g., $1\cdot1 + 1\cdot1 - \sqrt{2}\cdot\sqrt{2} = 0$ ).
Phase Cancellation: The generator is a root of unity satisfying a vanishing sum of unit-modulus terms, specifically $1 + \omega + \omega^2 = 0$ (where $\omega = e^{2\pi i/3}$ ).

Alphabets where the generator has $|x|^2 \geq 3$ (and is not a root of unity) produce orthogonal pairs and triples but fail to generate the dense, interlocking triad networks necessary for uncolorability.

B. Discovery of Six "Algebraic Islands"

The study identifies six discrete algebraic "islands" (isolated regions in parameter space) that support KS sets. These are classified by their minimal KS subset size:

Integer Island ( $\mathbb{Z}$ ): Alphabet $\{0, \pm 1, \pm 2\}$ . Min size: 31 (CK-31).
Peres Island ( $\mathbb{Z}[\sqrt{2}]$ ): Alphabet $\{0, \pm 1, \pm \sqrt{2}\}$ . Min size: 33.
Eisenstein Island ( $\mathbb{Z}[\omega]$ ): Alphabet $\{0, \pm 1, \pm \omega, \pm \bar{\omega}\}$ . Min size: 33.
Complex Quadratic Island ( $\mathbb{Z}[\sqrt{-2}]$ ): Alphabet $\{0, \pm 1, \pm \sqrt{-2}\}$ . Min size: 33.
Heegner-7 Island ( $\mathbb{Z}[(1+\sqrt{-7})/2]$ ): Alphabet $\{0, \pm 1, \pm \alpha, \pm \bar{\alpha}\}$ . Min size: 43 (Newly discovered).
Golden Ratio Island ( $\mathbb{Z}[\phi]$ ): Alphabet $\{0, \pm 1, \pm \phi\}$ . Min size: 52 (Newly discovered; only becomes uncolorable after cross-product completion introduces $1/\phi$ ).

C. New Constructions

Heegner-7 (43 vectors): A new KS configuration with a unique orthogonality graph, richer in structure than the 33-vector sets.
Golden Ratio (52 vectors): A set revealed only through cross-product completion, demonstrating that raw alphabets can be colorable while their algebraic closures are not.
Complex Realization: $\mathbb{Z}[\sqrt{-2}]$ is shown to be graph-isomorphic to the Peres set, confirming that the "modulus-2" mechanism is robust across real and imaginary quadratic rings.

D. Theoretical Proofs and Certifications

Theorem 11: Proved that for cyclotomic fields, KS-uncolorability occurs if and only if $6 \mid n$ (where $n$ is the order of the root of unity). This connects to the necessity of both 2 (real axis orthogonality) and 3 (phase cancellation) in the algebraic structure.
31-Optimality: Using OCUS, the paper certifies that no KS subset of size $\leq 30$ exists within the full 49-ray integer pool. This strengthens the conjecture that 31 is the global minimum for $\mathbb{R}^3$ .
Rigidity Analysis: Four of the six minimal sets (including CK-31) are proven to be infinitesimally rigid in $\mathbb{C}^3$ . The Peres and $\mathbb{Z}[\sqrt{-2}]$ sets admit an infinitesimal flex but are finitely rigid.

4. Key Results and Observations

Efficiency Hierarchy: There is an inverse correlation between the algebraic complexity of the cancellation identity and the size of the minimal KS set. The simplest identity ( $1+1=2$ ) yields the smallest set (31), while more complex identities (Golden ratio) yield larger sets (52).
Bipartite Quantum Strategies (BPQS): The algebraic substrate dictates the efficiency of quantum strategies. The Eisenstein island (33 vectors, 14 bases) yields the simplest Bell scenario ( $5 \times 9$ inputs), outperforming the CK-31 set ( $8 \times 9$ inputs) despite CK-31 having fewer rays. This highlights a trade-off between ray economy and context economy.
CSW Contextual Advantage: The study distinguishes between "basis-participating" rays and "auxiliary" rays.
- The Heegner-7 full pool (145 rays) shows the strongest contextual advantage ( $\vartheta/\alpha = 1.118$ ) due to a high fraction of auxiliary rays.
- However, minimization destroys this advantage. The minimized Heegner-7 set (43 rays) becomes $\vartheta$ -perfect ( $\vartheta = \alpha$ ), losing its CSW advantage. This implies that for quantum advantage tasks, one should not necessarily minimize the ray count.
Graph Universality: All tested constructions achieving the 31-ray minimum (integer, rational, mixed alphabets) produce the same orthogonality graph (CK-31), supporting the conjecture that this graph is unique.

5. Significance

Unification of Constructions: The paper unifies disparate KS constructions under a single algebraic framework, explaining why they cluster into specific "islands" rather than being randomly distributed.
Operational Relevance: It bridges the gap between abstract KS sets and practical quantum information tasks (Bell nonlocality, contextuality), showing that the choice of algebraic field directly impacts the resource cost (number of measurement settings) of quantum protocols.
Guidance for Future Searches: By identifying the "two-mechanism" constraint, the paper provides a filter for future searches. Researchers can now focus on number fields supporting modulus-2 or phase cancellation identities, rather than brute-forcing random alphabets.
New Lower Bound Constraints: While the global lower bound of 24 is not improved, the paper provides strong evidence that any sub-31 construction must come from an untested algebraic structure (e.g., higher-degree extensions or non-UFD rings), effectively narrowing the search space for the optimal KS set.

In conclusion, Kernaghan's work establishes that the algebraic structure of the coordinate ring is the fundamental determinant of KS-uncolorability in dimension 3, governed strictly by low-norm cancellation identities. This insight has led to the discovery of new KS sets and a deeper understanding of the trade-offs between mathematical minimality and operational efficiency in quantum foundations.