The problem of determining the existence of a spectral gap in a lattice quantum spin system was previously shown to be undecidable for one [] or more dimensions []. In these works, families of nearest-neighbor interactions are constructed whose spectral gap depends on the outcome of a Turing machine halting problem, therefore making it impossible for an algorithm to predict its existence. While these models are translationally invariant, they are not invariant under the other symmetries of the lattice, a property which is commonly found in physically relevant cases. This poses the question of whether the spectral gap problem could be decidable for Hamiltonians with stronger symmetry constraints. We give a negative answer to this question, in the case of models with four-body (plaquette) interactions on the square lattice satisfying rotation, but not reflection, symmetry: rotational symmetry is not enough to make the problem decidable.
The problem of determining the existence of a spectral gap in a lattice quantum spin system was previously shown to be undecidable for one [] or more dimensions []. In these works, families of nearest-neighbor interactions are constructed whose spectral gap depends on the outcome of a Turing machine halting problem, therefore making it impossible for an algorithm to predict its existence. While these models are translationally invariant, they are not invariant under the other symmetries of the lattice, a property which is commonly found in physically relevant cases. This poses the question of whether the spectral gap problem could be decidable for Hamiltonians with stronger symmetry constraints. We give a negative answer to this question, in the case of models with four-body (plaquette) interactions on the square lattice satisfying rotation, but not reflection, symmetry: rotational symmetry is not enough to make the problem decidable.
FINDING: The spectral gap problem is undecidable in general — no algorithm can determine whether a quantum many-body Hamiltonian has a spectral gap or is gapless, establishing a Gödel/Turing-style limit inside physics itself. | MATH: Given a translation-invariant, nearest-neighbour Hamiltonian H on a 2D spin lattice, the ground-state energy density and the question "is Δ = E₁ − E₀ > 0?" are undecidable (Cubitt, Pérez-García, Wolf, Nature 2015). The construction encodes a universal Turing machine into the low-energy spectrum; the spectral gap's presence/absence maps to halting/non-halting. | CONNECTION: No direct golden-ratio or crystallographic constant appears in the undecidability result itself. The relevant symmetry structure is the 2D lattice translation group ℤ² and the local SU(2)/finite-group gauge structure of the spin Hamiltonian — a lattice/crystallographic setting, but the undecidability is a logical (computability) property, not a geometric-harmony ratio. | DEPTH: 9 FINDIN Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
FINDING: Undecidability in the spectral gap problem for quantum many-body systems proves that determining whether a system is gapped or gapless is algorithmically impossible in general. | MATH: The spectral gap problem is mapped to the halting problem via translationally invariant Hamiltonians on a 2D lattice; the set of gapped Hamiltonians is Π₂-complete in the arithmetic hierarchy. Key constants: no specific numerical constants emerge, but the proof relies on encoding Turing machine states into local Hamiltonian terms. | CONNECTION: No direct geometric harmony ratios (0.382, 0.618, etc.) appear. However, the lattice structure (2D square lattice) and translational invariance connect to crystallographic symmetry groups (p4m wallpaper group). The undecidability result implies that spectral gaps—which determine whether a system is an insulator (gapped) or conductor (gapless)—cannot be universally predicted, breaking the dream of a complete mathematical description of matter. | DEPTH: 9/1 Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
This paper provides a self-contained conceptual overview of one of the most striking results in contemporary quantum many-body physics: the undecidability of the spectral gap problem. The spectral gap—the energy difference between a system's ground state and its first excited state—is a fundamental property that distinguishes insulating from conducting behavior and marks quantum phase transitions. In 2015, Cubitt, Pérez-García, and Wolf proved that deciding whether a translationally invariant quantum spin system with finite-range interactions is gapped or gapless is algorithmically undecidable. This result was extended to one-dimensional systems by Bausch and colleagues in 2020, overturning the intuition that lower-dimensional systems are inherently more tractable. The proof architecture rests on two main ingredients: aperiodic tilings and history-state constructions. Aperiodic tilings encode undecidable combinatorial properties into the spatial structure of the Hamiltonian, while history states embed the evolution of a Turing machine into the ground state. By combining these elements, the authors construct explicit Hamiltonians whose spectral gap depends directly on whether a simulated Turing machine halts—a problem known to be undecidable. Thus, no algorithm can classify every instance correctly. The paper also distinguishes two forms of undecidability: algorithmic undecidability, which asserts that no Turing machine can solve the problem for all instances, and axiomatic independence, which shows that for some Hamiltonians, the gap status is not determined by the standard axioms of mathematics. These results impose fundamental limits on numerical simulation and phase classification, but they do not render all systems intractable. They demarcate a boundary between decidable and undecidable behavior, revealing deep connections between physics, computation, and logic.
FINDING: The spectral gap problem — determining whether a quantum Hamiltonian's energy spectrum has a gap above the ground state — is provably undecidable in general, linking quantum many-body physics to the halting problem and Gödelian limits. | MATH: The key construction (Cubitt, Perez-Garcia, Wolf, 2015) reduces the halting problem to a family of 2D spin-lattice Hamiltonians H(n) on a fixed lattice, where the spectral gap (difference between ground state energy E0 and first excited state E1) is either Δ>0 (gapped) or Δ=0 (gapless), depending on whether a Turing machine halts. The Hamiltonian is built from translationally invariant local terms with frustration-free ground states; the gap closes as Δ∼1/poly(n) in the gapless case. No closed-form equation for Δ exists — it is algorithmically uncomputable. | CONNECTION: The construction uses a lattice structure (square lattice, 2D) with local interaction ter Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
The problem of determining the existence of a spectral gap in a lattice quantum spin system was previously shown to be undecidable for one [J. Bausch et al., "Undecidability of the spectral gap in one dimension", Physical Review X 10 (2020)] or more dimensions [T. S. Cubitt et al., "Undecidability of the spectral gap", Nature 528 (2015) and Forum of Mathematics Pi, 10 (2022)]. In this work, we focus on the 1-dimensional result, showing that the constructed family with undecidable behavior is extremely sensitive to perturbations. In particular, for any ε>0, there exists a 1-local, rank 1, perturbation with norm O(ε), such that the spectral gap problem for the family in [J. Bausch et al., "Undecidability of the spectral gap in one dimension", Physical Review X 10 (2020)] now becomes decidable.
FINDING: The spectral gap of a quantum many-body Hamiltonian is undecidable — no algorithm can determine whether a given local Hamiltonian has a gap or is gapless. | MATH: Cubitt–Perez-Garcia–Wolf (Nature 528, 207–211, 2015): constructs a family of frustration-free, translation-invariant, nearest-neighbor Hamiltonians H(φ) on a 2D lattice such that the spectral gap Δ(H(φ)) encodes the halting problem. Formally: the ground-state energy density and gap are non-computable; the "gap function" Δ: ℕ→ℝ is not Turing-computable. The construction reduces from Wang tilings / aperiodic tilings (Berger's theorem) to a quantum Hamiltonian whose ground state is a tiling configuration. | CONNECTION: The construction relies on aperiodic tilings (Wang tiles) which are governed by local matching rules — a discrete analog of crystallographic symmetry breaking. The undecidability arises from the absence of a periodic ground state, i.e., the breakdown of translational symmetry at the quantum level. No dire Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com