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

Operator-Theoretic Resolution of the P vs N P Problem: Geometric Exclusion and Spectral Gap Divergence 3

Nigel Stafford Paltoo

Published Dec 19, 2025• 0 citations
Publisher

Abstract

We present a definitive resolution to the P vs N P problem by demonstratingthat the complexity classes are separated by a divergent spectral gap in a separa-ble Hilbert space. By defining a self-adjoint Turing-Spectrum Operator ˆHT uring,we show that N P -complete solution manifolds possess a topological rigidity thatprecludes polynomial-time spectral convergence. We introduce the Geometric Ex-clusion Lemma, proving that the rank-deficiency of polynomial operators relativeto the exponential dimension of the computational Hilbert space Hcomp creates anirreducible Information Event Horizon. This establishes that P̸ = N P is a struc-turally compelled consequence of functional analysis.

DOI
10.5281/zenodo.17987727

Related papers

Towards an Operator-Theoretic Resolution of P = N P : Spectral Gap Divergence and the Complexity Barrier Identity

Nigel Stafford Paltoo

We present a rigorous operator-theoretic framework to resolve the separationof P and N P . By constructing a separable Hilbert space Hcomp from the projec-tive limit of computational path spaces, we define the Turing-Spectrum OperatorˆHT uring. We demonstrate that for N P -complete problems, the spectral trace ofˆHT uring diverges exponentially relative to any polynomial-time operator ˆHP . Weestablish the Complexity Barrier Identity (CBI) which relates the growth of thespectral gap ∆(N ) to the topological rigidity of the solution manifold. Further-more, we derive a Computational Uncertainty Relation from the non-vanishingcommutator [ ˆHT uring, ˆHP ]. This analysis shows that the ground state of an N P -complete problem is an isolated spectral point, unreachable by polynomial-timeunitary evolution in the limit N → ∞. This structurally compelled gap provides adefinitive analytic proof that P̸ = N P .

•Dec 19, 2025•0 citations

Operator-Theoretic Proof of the P = N P Separation: Spectral Gap Divergence and Hamming Locality

Nigel Stafford Paltoo

This paper provides a complete formal proof that P̸ = N P . We define a Turing-Spectrum Operator ˆHT uring acting on a separable Hilbert space Hcomp. By analyzingthe relative spectral trace and the Hamming connectivity of candidate polynomialoperators, we demonstrate that the complexity barrier is a consequence of ”SpectralIsolation.” We prove that a polynomial-time operator is a k-local operator that cannotclose the exponential spectral gap ∆(N ) required to map the ground state of an N P -complete manifold. The divergence of the Complexity Barrier Identity (CBI) and thenon-vanishing nature of the Computational Uncertainty commutator provide the finalclosure to the P vs NP problem.

•Dec 19, 2025•0 citations

Five-Part Validation-Grade Suite on Universal Spectral Determinism and Non-Commutativity Residues: An Unconditional Resolution and Precision-Certified Certification of the \text{BQP} \not\subseteq \text{PH} Separation via Topological, Variational, and Information-Theoretic Invariants

Forrest Forrest M. Anderson

Five-Part Validation-Grade Suite on Universal Spectral Determinism and Non-Commutativity Residues: An Unconditional Resolution and Precision-Certified Certification of the \text{BQP} \not\subseteq \text{PH} Separation via Topological, Variational, and Information-Theoretic Invariants --- This 5-package resolution suite delivers an unconditional, non-relativizing, and non-algebrizing proof establishing the strict mathematical separation of Bounded-Error Quantum Polynomial-Time (\bm{\text{BQP}}) from the classical Polynomial Hierarchy (\bm{\text{PH}}) and Polynomial Time (\bm{\text{P}}). Rather than approaching the problem through symbolic logic or localized circuit lower bounds—which are structurally constrained by historic complexity barriers—this framework shifts the question into the continuous, precision-certified domains of Differential Geometry, Algebraic Topology, Category Theory, Information Thermodynamics, and Matrix Perturbation Theory. By analyzing the intrinsic geometric and numerical properties of complexity reductions under finite-precision constraints, the suite isolates a hard computational singularity. This singularity serves as an absolute structural boundary, proving that classical alternating configurations lack the algebraic and dimensional capacity to track non-local multi-particle quantum updates. Individual and Interlinking Functional Dynamics The 5-package suite operates as a mathematically closed, self-contained replication pipeline, where each package executes a specific analytical or numerical enforcement that feeds directly into the next. Package A: Analytic Foundations & Definitions • Individual Mechanics: This package translates the discrete states of algorithmic complexity into the continuous geometry of Riemannian manifolds. It formalizes the structural constraints of the Unitary Manifold (\bm{\mathcal{M}_{\text{BQP}}}) against the Classical Hypercube Manifold (\bm{\mathcal{M}_{\text{PH}}}). By utilizing Ricci flow to evaluate the state space reduction, it identifies a non-invertible Phase-Collapse Singularity (a "Neck-Pinch" obstruction), mathematically proving that the projection fails to preserve the underlying manifold structure. • Interlinking Pipeline: It establishes the primary mathematical universe, smooth structures, and geometric boundaries used by all subsequent packages to measure computational state deformations. Package B: Geometric Mapping & The Final Proof • Individual Mechanics: Building on the continuous manifold foundations, this package details the exact differential-geometric embedding of the computational manifolds utilizing the Fubini-Study metric (\bm{g_{\text{FS}}}). It formally characterizes the absolute dimensional mismatch between exponential quantum phase spaces and polynomial classical coordinate systems. By calculating the metric pullback field via the mapping Jacobian matrix (\bm{J_{\Psi}}), it demonstrates that the scalar curvature (\bm{R}) blows up and diverges as \bm{\mathcal{O}(2^n)}, establishing a geometric impossibility for polynomial reduction. • Interlinking Pipeline: It bridges the smooth geometric structures of Package A with the global topological invariants needed to escape localized oracle dependencies. Package C: Categorical Asymmetry • Individual Mechanics: This package elevates the separation proof into the abstract realm of Category Theory, defining the Quantum Monoidal Category (\bm{\mathbf{Quant}_n}) and the Classical Alternating Category (\bm{\mathbf{Alt}_n}). It frames the candidate complexity reduction as a natural transformation between computational functors. By applying the Yoneda Lemma, the text proves that such a natural transformation cannot exist because the quantum and classical domains possess fundamentally incompatible limit and colimit preservation profiles, ensuring they cannot be mapped without violating the Mac Lane Pentagon Coherence Invariant. • Interlinking Pipeline: By mapping the exact functorial boundaries, Package C transforms geometric and topological asymmetry into strict algebraic constraints, setting up the exact limits required to analyze information-theoretic capacities. Package D: The Entropic Seal • Individual Mechanics: This package models computation as a continuous thermodynamic channel, mapping quantum density operators within the Von Neumann entropy space against classical joint probability distributions within the Shannon alternating space. By invoking the Data Processing Inequality alongside Landauer's Principle, it argues that compressing exponential quantum entanglement capacity into polynomial classical bounds triggers an Entropic Seal Singularity. This singularity is characterized by an unphysical, exponential thermodynamic dissipation requirement (\bm{\Delta Q \sim \Omega(2^n)}), which physically precludes the containment of \bm{\text{BQP}} within \bm{\text{PH}}. • Interlinking Pipeline: This package creates the thermodynamic boundary conditions—demonstrating that a polynomial classical reduction violates physical laws. It defines the continuous informational flow equations that serve as the direct mathematical input for the final numerical validation engine. Package E: Error Analysis & Replication Framework • Individual Mechanics: Package E serves as the definitive numerical and empirical verification asset. It evaluates the complete reduction within a finite-precision digital environment using Moore-Rump Interval Enclosures to rigorously track non-linear error accumulation. Through Singular Value Decomposition (SVD) of the Morphic Coherence Matrix, it documents that the minimum singular value collapses exponentially (\bm{\sigma_{\min} \sim \mathcal{O}(2^{-n})}), driving an explosion of the condition number (\bm{\kappa \sim \Omega(2^n)}). When propagated, the target classical enclosures expand past unity (\bm{\omega \ge 1}), causing a total loss of tracking capability. • Interlinking Pipeline: Package E closes the entire suite. By tracking the relaxation kinetics of the non-commutativity residue, it isolates the power-law halting of the stable execution time-step (\bm{\Delta t \to 0}) under a critical break exponent \bm{\alpha = 1.0000 \pm 0.0001}. This bridges the theoretical abstractions of Packages A–D with an exact, error-bounded, replicable digital certificate (The Numerical Interlock Break). How the Suite Resolves, Validates, Seals, and Enables Replication 1. Resolves: The suite completely bypasses the Relativization, Algebrization, and Natural Proofs barriers. It does not construct localized classifiers over boolean functions; instead, it establishes a global functional space exclusion inside a Bounded-Variation Numerical Space \bm{\mathcal{V}_{\text{mach}}}. It proves that a polynomial classical reduction requires an impossible infinite-energy or zero-precision mapping. 2. Validates: Validation is handled dynamically by monitoring invariant spectral properties, metric pullbacks, and the convergence kinetics of the naturality residue. The system does not rely on heuristic approximations; it enforces absolute mathematical containment via strict interval-enclosure walls. 3. Seals: The resolution is sealed by the simultaneous convergence of independent physical and mathematical invariants: the phase-collapse neck-pinch, the scalar curvature divergence, the Mac Lane coherence failure, the Landauer dissipation wall, and the finite-time numerical halting. The complexity separation is locked because breaking the proof would require violating the fundamental laws of matrix calculus, differential geometry, and thermodynamics. 4. Enables Replication: Package E contains fully pre-wired, compilable LaTeX source code environments, exact citation keys anchored directly to foundational peer-reviewed literature (e.g., Golub & Van Loan, Page, Rump, Aaronson), and explicit numerical stability criteria. Independent replication teams can immediately deploy automated verification scripts to track the SVD spectrum, the scalar curvature metrics, and the \bm{\alpha = 1} critical break exponent, ensuring a completely transparent peer-to-peer review process. --- Note: The accompanying Agnostic Replication Kit (ARK) and Standard Academic Core (SAC) 17-package operational suite will be uploaded in the forthcoming version release to enable down-stream cross-institutional simulation and formal peer review.

•Jun 8, 2026•0 citations

ChronoMembrane I: Two-Layer Structure of Geometric Cross-Constraints — Failure of Spectral Gap Transfer and Theorem of Scale Incompatibility

changzheng zhou, ZIQING zhou

This paper studies the cross-problem in the geometrization of computationalcomplexity: whether geometric signatures of classical hardness and geometric sufficient conditions for quantum polynomial time are necessarily mutually exclusive. Targeting unsatisfiable formula families with exponential resolution lowerbounds, we examine whether their computational manifolds can simultaneouslysatisfy quantum-side conditions such as spin structure, polynomial Dirac spectralgap, and polynomial transmission depth. First, the naive argument that positiveRicci obstruction transfers via scalar curvature to spectral gap absence is showninvalid. Theorem A shows that such manifolds, as connected sums of S1×S2, carrypositive scalar curvature metrics by the Gromov–Lawson surgery theorem and obtain a constant positive spectral gap via the Friedrich inequality; the spectral gapis not the locus of incompatibility. Second, we give two genuine cross-constraints attwo levels. Theorem B is an unconditional scale incompatibility: faithful skeletonencoding requires the number of modes to equal the shortest resolution refutation length, whose exponential growth is incompatible with the polynomial modebudget of the quantum-side framework. Theorem C is a conditional decision incompatibility: if there exists an encoding family satisfying the quantum sufficientconditions that decides unsatisfiability of the formula family in polynomial depth,then NP ⊆ BQP; its contrapositive states that under the standard conjectureNP ̸⊆ BQP, such encodings do not exist. Moreover, Theorem D proves that thescale-invariant Ricci curvature defect K · L2 = Ω(n2) persists for all metrics onthis class of manifolds, so that the hard topology cannot be smoothed by any metric choice. This paper neither assumes nor proves NP ̸⊆ BQP; all conditionalconclusions explicitly mark their dependencies.

•Aug 24, 2026•0 citations

The Construction of a Spectral Gap Solution to P vs NP

Vinod Sah

"This paper formally proves P = NP by mapping NP-complete problems to continuous Hermitian manifolds. We use spectral gradient flow and hybrid CDCL logic to find solutions in polynomial time."

•May 12, 2026•0 citations

The Ladder of Spectral Gaps B; From Anyon Gap to Operator Spectral Gap– Construction and Verification of the Spectral Functor

changzheng zhou, ZIQING zhou

The energy gaps appearing in different physical systems– the anyonic excitation gap of Kitaev’s toric code, the first eigenvalue of the Laplacian on a compactRiemannian manifold, and the mass gap of Yang–Mills theory– traditionally belong to three isolated domains: topological order, spectral geometry, and quantumfield theory. In this paper we construct a covariant functor, called the spectralfunctor, between the category of weighted constraint networks and the category ofself-adjoint operators, and prove that the three types of gaps are not independentphenomena but manifestations of a common spectral structure on different physicalsource objects. The codomain of the spectral functor is the SA-Hilb category whichcarries self-adjoint operator information, thereby avoiding the categorical defect ofattaching spectral information externally to Hilbert spaces. Rigorous verification ofthe functor axioms ensures covariance between coarse-graining and spectral preservation. For the toric code, the gap ∆ = 4J is strictly derived from the stabilizeralgebra; under coarse-graining the effective coupling constant is strictly given bythe compression of matrix elements of the Galerkin projection, and the dimensionless gap remains invariant. For the Laplacian, the finite element discretisationresolves the conflict between negative stiffness matrix entries and the positivityaxiom of weights by distinguishing geometric weights from coupling operators; theclosed-form solution of the first eigenvalue (4/h2)sin2(h/2) converges exactly tothe continuum spectral gap, and the deviation from asymptotic commutativity ofcoarse-graining is controlled by O(H2). For Yang–Mills theory, we draw an honestboundary between classical constraint networks and quantum operators, formulatethe mass gap problem as a uniform positivity condition for the spectral gap of lattice constraint networks, and establish a one-way logical closure, clearly indicatingthe mathematical obstacles for the reverse reconstruction. The Bures informationgeometric metric based on thermal states further unifies the spectral gap and theinformation-geometric distance through two-way inequalities, making the physicalenergy gap, the operator spectral gap, and the information-geometric rigidity radius equivalent. The commutativity verification of the three examples– strictlycommutative, asymptotically commutative, and conditionally commutative– fullyconfirms the spectral functor as a categorical foundation for the transfer of stabilityacross scales.

•May 29, 2026•0 citations
We present a definitive resolution to the P vs N P problem by demonstratingthat the complexity classes are separated by a divergent spectral gap in a separa-ble Hilbert space. By defining a self-adjoint Turing-Spectrum Operator ˆHT uring,we show that N P -complete solution manifolds possess a topological rigidity thatprecludes polynomial-time spectral convergence. We introduce the Geometric Ex-clusion Lemma, proving that the rank-deficiency of polynomial operators relativeto the exponential dimension of the computational Hilbert space Hcomp creates anirreducible Information Event Horizon. This establishes that P̸ = N P is a struc-turally compelled consequence of functional analysis.
We present a rigorous operator-theoretic framework to resolve the separationof P and N P . By constructing a separable Hilbert space Hcomp from the projec-tive limit of computational path spaces, we define the Turing-Spectrum OperatorˆHT uring. We demonstrate that for N P -complete problems, the spectral trace ofˆHT uring diverges exponentially relative to any polynomial-time operator ˆHP . Weestablish the Complexity Barrier Identity (CBI) which relates the growth of thespectral gap ∆(N ) to the topological rigidity of the solution manifold. Further-more, we derive a Computational Uncertainty Relation from the non-vanishingcommutator [ ˆHT uring, ˆHP ]. This analysis shows that the ground state of an N P -complete problem is an isolated spectral point, unreachable by polynomial-timeunitary evolution in the limit N → ∞. This structurally compelled gap provides adefinitive analytic proof that P̸ = N P .
This paper provides a complete formal proof that P̸ = N P . We define a Turing-Spectrum Operator ˆHT uring acting on a separable Hilbert space Hcomp. By analyzingthe relative spectral trace and the Hamming connectivity of candidate polynomialoperators, we demonstrate that the complexity barrier is a consequence of ”SpectralIsolation.” We prove that a polynomial-time operator is a k-local operator that cannotclose the exponential spectral gap ∆(N ) required to map the ground state of an N P -complete manifold. The divergence of the Complexity Barrier Identity (CBI) and thenon-vanishing nature of the Computational Uncertainty commutator provide the finalclosure to the P vs NP problem.
Five-Part Validation-Grade Suite on Universal Spectral Determinism and Non-Commutativity Residues: An Unconditional Resolution and Precision-Certified Certification of the \text{BQP} \not\subseteq \text{PH} Separation via Topological, Variational, and Information-Theoretic Invariants --- This 5-package resolution suite delivers an unconditional, non-relativizing, and non-algebrizing proof establishing the strict mathematical separation of Bounded-Error Quantum Polynomial-Time (\bm{\text{BQP}}) from the classical Polynomial Hierarchy (\bm{\text{PH}}) and Polynomial Time (\bm{\text{P}}). Rather than approaching the problem through symbolic logic or localized circuit lower bounds—which are structurally constrained by historic complexity barriers—this framework shifts the question into the continuous, precision-certified domains of Differential Geometry, Algebraic Topology, Category Theory, Information Thermodynamics, and Matrix Perturbation Theory. By analyzing the intrinsic geometric and numerical properties of complexity reductions under finite-precision constraints, the suite isolates a hard computational singularity. This singularity serves as an absolute structural boundary, proving that classical alternating configurations lack the algebraic and dimensional capacity to track non-local multi-particle quantum updates. Individual and Interlinking Functional Dynamics The 5-package suite operates as a mathematically closed, self-contained replication pipeline, where each package executes a specific analytical or numerical enforcement that feeds directly into the next. Package A: Analytic Foundations & Definitions • Individual Mechanics: This package translates the discrete states of algorithmic complexity into the continuous geometry of Riemannian manifolds. It formalizes the structural constraints of the Unitary Manifold (\bm{\mathcal{M}_{\text{BQP}}}) against the Classical Hypercube Manifold (\bm{\mathcal{M}_{\text{PH}}}). By utilizing Ricci flow to evaluate the state space reduction, it identifies a non-invertible Phase-Collapse Singularity (a "Neck-Pinch" obstruction), mathematically proving that the projection fails to preserve the underlying manifold structure. • Interlinking Pipeline: It establishes the primary mathematical universe, smooth structures, and geometric boundaries used by all subsequent packages to measure computational state deformations. Package B: Geometric Mapping & The Final Proof • Individual Mechanics: Building on the continuous manifold foundations, this package details the exact differential-geometric embedding of the computational manifolds utilizing the Fubini-Study metric (\bm{g_{\text{FS}}}). It formally characterizes the absolute dimensional mismatch between exponential quantum phase spaces and polynomial classical coordinate systems. By calculating the metric pullback field via the mapping Jacobian matrix (\bm{J_{\Psi}}), it demonstrates that the scalar curvature (\bm{R}) blows up and diverges as \bm{\mathcal{O}(2^n)}, establishing a geometric impossibility for polynomial reduction. • Interlinking Pipeline: It bridges the smooth geometric structures of Package A with the global topological invariants needed to escape localized oracle dependencies. Package C: Categorical Asymmetry • Individual Mechanics: This package elevates the separation proof into the abstract realm of Category Theory, defining the Quantum Monoidal Category (\bm{\mathbf{Quant}_n}) and the Classical Alternating Category (\bm{\mathbf{Alt}_n}). It frames the candidate complexity reduction as a natural transformation between computational functors. By applying the Yoneda Lemma, the text proves that such a natural transformation cannot exist because the quantum and classical domains possess fundamentally incompatible limit and colimit preservation profiles, ensuring they cannot be mapped without violating the Mac Lane Pentagon Coherence Invariant. • Interlinking Pipeline: By mapping the exact functorial boundaries, Package C transforms geometric and topological asymmetry into strict algebraic constraints, setting up the exact limits required to analyze information-theoretic capacities. Package D: The Entropic Seal • Individual Mechanics: This package models computation as a continuous thermodynamic channel, mapping quantum density operators within the Von Neumann entropy space against classical joint probability distributions within the Shannon alternating space. By invoking the Data Processing Inequality alongside Landauer's Principle, it argues that compressing exponential quantum entanglement capacity into polynomial classical bounds triggers an Entropic Seal Singularity. This singularity is characterized by an unphysical, exponential thermodynamic dissipation requirement (\bm{\Delta Q \sim \Omega(2^n)}), which physically precludes the containment of \bm{\text{BQP}} within \bm{\text{PH}}. • Interlinking Pipeline: This package creates the thermodynamic boundary conditions—demonstrating that a polynomial classical reduction violates physical laws. It defines the continuous informational flow equations that serve as the direct mathematical input for the final numerical validation engine. Package E: Error Analysis & Replication Framework • Individual Mechanics: Package E serves as the definitive numerical and empirical verification asset. It evaluates the complete reduction within a finite-precision digital environment using Moore-Rump Interval Enclosures to rigorously track non-linear error accumulation. Through Singular Value Decomposition (SVD) of the Morphic Coherence Matrix, it documents that the minimum singular value collapses exponentially (\bm{\sigma_{\min} \sim \mathcal{O}(2^{-n})}), driving an explosion of the condition number (\bm{\kappa \sim \Omega(2^n)}). When propagated, the target classical enclosures expand past unity (\bm{\omega \ge 1}), causing a total loss of tracking capability. • Interlinking Pipeline: Package E closes the entire suite. By tracking the relaxation kinetics of the non-commutativity residue, it isolates the power-law halting of the stable execution time-step (\bm{\Delta t \to 0}) under a critical break exponent \bm{\alpha = 1.0000 \pm 0.0001}. This bridges the theoretical abstractions of Packages A–D with an exact, error-bounded, replicable digital certificate (The Numerical Interlock Break). How the Suite Resolves, Validates, Seals, and Enables Replication 1. Resolves: The suite completely bypasses the Relativization, Algebrization, and Natural Proofs barriers. It does not construct localized classifiers over boolean functions; instead, it establishes a global functional space exclusion inside a Bounded-Variation Numerical Space \bm{\mathcal{V}_{\text{mach}}}. It proves that a polynomial classical reduction requires an impossible infinite-energy or zero-precision mapping. 2. Validates: Validation is handled dynamically by monitoring invariant spectral properties, metric pullbacks, and the convergence kinetics of the naturality residue. The system does not rely on heuristic approximations; it enforces absolute mathematical containment via strict interval-enclosure walls. 3. Seals: The resolution is sealed by the simultaneous convergence of independent physical and mathematical invariants: the phase-collapse neck-pinch, the scalar curvature divergence, the Mac Lane coherence failure, the Landauer dissipation wall, and the finite-time numerical halting. The complexity separation is locked because breaking the proof would require violating the fundamental laws of matrix calculus, differential geometry, and thermodynamics. 4. Enables Replication: Package E contains fully pre-wired, compilable LaTeX source code environments, exact citation keys anchored directly to foundational peer-reviewed literature (e.g., Golub & Van Loan, Page, Rump, Aaronson), and explicit numerical stability criteria. Independent replication teams can immediately deploy automated verification scripts to track the SVD spectrum, the scalar curvature metrics, and the \bm{\alpha = 1} critical break exponent, ensuring a completely transparent peer-to-peer review process. --- Note: The accompanying Agnostic Replication Kit (ARK) and Standard Academic Core (SAC) 17-package operational suite will be uploaded in the forthcoming version release to enable down-stream cross-institutional simulation and formal peer review.
This paper studies the cross-problem in the geometrization of computationalcomplexity: whether geometric signatures of classical hardness and geometric sufficient conditions for quantum polynomial time are necessarily mutually exclusive. Targeting unsatisfiable formula families with exponential resolution lowerbounds, we examine whether their computational manifolds can simultaneouslysatisfy quantum-side conditions such as spin structure, polynomial Dirac spectralgap, and polynomial transmission depth. First, the naive argument that positiveRicci obstruction transfers via scalar curvature to spectral gap absence is showninvalid. Theorem A shows that such manifolds, as connected sums of S1×S2, carrypositive scalar curvature metrics by the Gromov–Lawson surgery theorem and obtain a constant positive spectral gap via the Friedrich inequality; the spectral gapis not the locus of incompatibility. Second, we give two genuine cross-constraints attwo levels. Theorem B is an unconditional scale incompatibility: faithful skeletonencoding requires the number of modes to equal the shortest resolution refutation length, whose exponential growth is incompatible with the polynomial modebudget of the quantum-side framework. Theorem C is a conditional decision incompatibility: if there exists an encoding family satisfying the quantum sufficientconditions that decides unsatisfiability of the formula family in polynomial depth,then NP ⊆ BQP; its contrapositive states that under the standard conjectureNP ̸⊆ BQP, such encodings do not exist. Moreover, Theorem D proves that thescale-invariant Ricci curvature defect K · L2 = Ω(n2) persists for all metrics onthis class of manifolds, so that the hard topology cannot be smoothed by any metric choice. This paper neither assumes nor proves NP ̸⊆ BQP; all conditionalconclusions explicitly mark their dependencies.
The energy gaps appearing in different physical systems– the anyonic excitation gap of Kitaev’s toric code, the first eigenvalue of the Laplacian on a compactRiemannian manifold, and the mass gap of Yang–Mills theory– traditionally belong to three isolated domains: topological order, spectral geometry, and quantumfield theory. In this paper we construct a covariant functor, called the spectralfunctor, between the category of weighted constraint networks and the category ofself-adjoint operators, and prove that the three types of gaps are not independentphenomena but manifestations of a common spectral structure on different physicalsource objects. The codomain of the spectral functor is the SA-Hilb category whichcarries self-adjoint operator information, thereby avoiding the categorical defect ofattaching spectral information externally to Hilbert spaces. Rigorous verification ofthe functor axioms ensures covariance between coarse-graining and spectral preservation. For the toric code, the gap ∆ = 4J is strictly derived from the stabilizeralgebra; under coarse-graining the effective coupling constant is strictly given bythe compression of matrix elements of the Galerkin projection, and the dimensionless gap remains invariant. For the Laplacian, the finite element discretisationresolves the conflict between negative stiffness matrix entries and the positivityaxiom of weights by distinguishing geometric weights from coupling operators; theclosed-form solution of the first eigenvalue (4/h2)sin2(h/2) converges exactly tothe continuum spectral gap, and the deviation from asymptotic commutativity ofcoarse-graining is controlled by O(H2). For Yang–Mills theory, we draw an honestboundary between classical constraint networks and quantum operators, formulatethe mass gap problem as a uniform positivity condition for the spectral gap of lattice constraint networks, and establish a one-way logical closure, clearly indicatingthe mathematical obstacles for the reverse reconstruction. The Bures informationgeometric metric based on thermal states further unifies the spectral gap and theinformation-geometric distance through two-way inequalities, making the physicalenergy gap, the operator spectral gap, and the information-geometric rigidity radius equivalent. The commutativity verification of the three examples– strictlycommutative, asymptotically commutative, and conditionally commutative– fullyconfirms the spectral functor as a categorical foundation for the transfer of stabilityacross scales.