Axiom X and the Foundations of Realizable Mathematics

Abstract: ZFC_X: A Mathematical Framework for Distinguishing Physically Realizable from Abstract Theorems P vs NP = P ≠ NP scientifically (conditionally) Within the ZFC_X framework, P ≠ NP is established as the unique outcome if only physically realizable computations are considered; any purely abstract interpretation leaves the question formally undecided. This provides a rigorous, physically-motivated pathway to resolving a problem that may remain undecidable in classical ZFC, while making explicit the boundary between abstract mathematical truth and what can be implemented in real-world systems. Is mathematics inherently realistic, or is it purely abstract? Does it apply to the actual world, or does it remain detached from reality? This fundamental question confronts every mathematician and forms the opening challenge of this book. The reader is immediately placed before a decisive choice: whether to keep mathematics separate from reality, or to connect it to reality and determine definitively what is achievable in the real world versus what remains merely theoretical. In this comprehensive treatise (dated January 17, 2026) by Abdellatif Sahbani, ZFC_X is introduced as a rigorous axiomatic extension of Zermelo-Fraenkel set theory with the axiom of choice (ZFC). Its sole purpose is to provide a formal, non-restrictive classification system that distinguishes between theorems provable in ZFC (abstract mathematical truths) and those that can actually be realized in the real world within finite, bounded systems. ZFC_X does not impose any restriction whatsoever on abstract mathematics: every theorem provable in ZFC remains provable in ZFC_X, no axiom is removed from ZFC, no proof is prohibited, and mathematicians retain complete freedom to explore purely abstract objects (such as non-computable real numbers, inaccessible cardinals, or variants of the continuum hypothesis) without any limitation. The framework operates purely as a classification tool, answering one precise question for each theorem provable in ZFC: "Can this be realized in the real world?" Theorems are classified into two mutually exclusive categories: Physically Realizable: The theorem describes objects, processes, or computations that can be represented finitely, verified computationally in finite time, and implemented using only the resources available in a bounded real-world system. Abstractly True but Not Physically Realizable: The theorem is provably correct in ZFC, but it describes entities or processes that cannot be realized in any finite real system (e.g., non-computable reals requiring infinite Kolmogorov complexity). The key innovation is Axiom X, formally defined as: ∀A ⊆ ℕ (ComputablyEnumerable(A) → K(A) ≤ N_C(|A|)), where K(A) is the Kolmogorov complexity of A and N_C(|A|) is a physical complexity bound derived from the Bekenstein-Hawking entropy limit. This axiom serves as the filter that enables the classification without altering the provability structure of ZFC. The book rigorously proves the existence of the "fundamental gap" (Theorem 1.1.3): there are statements φ such that ZFC ⊢ φ but φ is not realizable in any real system (proof via Cantor's diagonal argument combined with complexity bounds). It then analyzes the consequences of this gap (Theorem 1.2.1), including confusion in applied mathematics, philosophical ambiguity, obscured computational limits, and the potential undecidability in ZFC of major open problems such as P vs NP, precisely because ZFC lacks mechanisms to incorporate real-world constraints. Within the ZFC_X framework, the P vs NP question receives its resolution: P ≠ NP is established as a theorem in the physically-grounded branch (ZFC_X ⊢ P ≠ NP). Any model or construction that would allow P = NP (such as hypercomputational oracles or forcing extensions requiring exponential resources) is classified as abstractly possible but unrealizable in the real world, as it violates universal limits on information, energy, and computational feasibility. Thus, P ≠ NP emerges as the only consistent outcome compatible with actual reality, while P = NP remains confined to the abstract realm. This work provides a final resolution of the P vs NP problem under an explicit realism criterion: if mathematics is required to model only physically realizable computation, then P ≠ NP is a theorem; if mathematics is treated as purely abstract, the question remains formally undecided. ZFC_X grants complete freedom of choice to every reader and mathematician: those who reject or ignore the application of Axiom X keep mathematics fully detached from reality, preserving unrestricted freedom in pure abstraction; those who accept and apply Axiom X connect mathematics to reality, obtaining results that are actionable, realizable, and consistent with the real world. This is a personal, methodological, and foundational decision: whether to remain in pure abstraction or to cross into realism and resolve what mathematics can truly achieve in the real world. This volume completes and unifies Sahbani's Axiom X series: "Independence from ZFC of an Analytic and Hypercomputational Strengthening of P=NP (and the Foundational Necessity of New Axioms for the Standard Problem)" (DOI: 10.5281/zenodo.17881772) — proved the independence of a strengthened analytic version of P=NP from ZFC using opposing models (L and M_G) and demonstrated the necessity of new axioms for realistic resolution. "The Standard Reference on Axiom X: Foundational-Physical Resolution of P≠NP" (DOI: 10.5281/zenodo.18155448) — established Axiom X as the standard axiomatic tool, linking computation to real limits via the Sahbani-Landauer principle. "The Universal Computational Limit: A Thermodynamic and Information-Theoretic Resolution of P vs NP" (DOI: 10.5281/zenodo.18240782) — provided the universal energetic and informational proof of the impossibility of P=NP. The present book integrates the entire series into a single, coherent, and rigorously argued framework. It begins with the core philosophical question of whether mathematics should remain detached from or connected to reality, and concludes by offering every reader the freedom—and the responsibility—to decide: stay in pure abstraction, or embrace Axiom X and resolve what mathematics can truly achieve in the real world. The choice is yours.