Depth, Breadth, and Valuation: A Unified Ontology of the Physical Continuum

In the paper's words

Three-axis framework: Depth (computable reals), Breadth (non-computable reals — physically vacuous), Valuation (p-adic completions as information carriers). Falsifiable predications for QEC, gauge structure.

The abstract, verbatim, and its opening sentence is the claim. Every line below is quoted from the text.

Numbers it reports

1. Systems exploiting p-adic intrinsic protection (adelic QEC) should beat surface-code-based quantum computers on JPCUB by avoiding the $10^{2}-10^{3}$ error-correction overhead.

   from 6.3 Predictions from the Unified Framework (this paper)

How it is done

1. Physical Role Ordered field PASS Basic arithmetic of physical quantities Computable completeness PASS All measurement sequences with computable error bounds converge Connectedness PASS Causality, topology, intermediate value theorem Real closure PASS Algebraic closure of physically real numbers Uncountability FAIL Not required — $\mathbb{R}_c$| = $\aleph_0$ but this is meta-theoretic

   from 2.1 What It Is

2. Its key features — connectedness and computable completeness — are necessary for physics: Without connectedness, there is no intermediate value theorem, no guarantee that a continuous quantity passes through all intermediate values, no basis for classical dynamics.

   from 2.2 What It Does

3. Depth does not require: Uncountability (|$\mathbb{R}_c$| = $\aleph_0$) The Continuum Hypothesis (distinction between $\aleph_1$ and $\aleph_2$ is physically inert) Non-computable reals (they are pairwise physically indistinguishable — Paper I, Theorem 4.3) Dedekind completeness (computable Cauchy completeness suffices for all measurement sequences) Chaitin's $\Omega$ (its binary expansion can never be measured; it is a proof-theoretic artifact)

   from 2.3 What It Does NOT Require

4. Paper I, Theorem 4.3 (Unfalsifiability of Non-Computable Reals) establishes: For any two non-computable reals x, y that agree on all rational approximations with computable error bounds, no finite measurement protocol can produce distinct predictions parameterized by x versus y.

   from 3.2 Why It Is Physically Vacuous

What would falsify it

1. But the computable p-adic numbers make falsifiable physical predictions — Gromov $\delta = 0$ for ZBW transitions, $\mathbb{Z}_2$ invariant distinguishing Dirac from Majorana, p-adic valuation gaps between optimal and random codes.

   from 4.3 Why Valuation Is NOT Breadth

2. An entity is physically real iff there exists a finite D/R (description/realization) procedure — a Turing machine — that: Approximates the entity with a computable modulus of convergence, and Generates measurement-distinguishable predictions that differ from the predictions of at least one alternative (i.e., the entity is falsifiable).

   from 5.1 The OC Criterion, Unified

3. Physical Status Depth ($\mathbb{R}_c$) PASS — all x ∈ $\mathbb{R}_c$ are computable by definition PASS — different computable reals produce different measurement sequences Physically real Breadth ($\mathbb{R} \setminus \mathbb{R}_c$) FAIL — no finite procedure approximates them FAIL — they are unfalsifiable (Theorem 4.3, Paper I) Physically vacuous Valuation ($\mathbb{Q}_p^c$) PASS — computable p-adic numbers are Turing-approximable PASS — falsifiable predictions (Gromov $\delta$, $\mathbb{Z}_2$ invariant, valuation gaps) Physically real Valuation breadth ($\mathbb{Q}_p \setminus \mathbb{Q}_p^c$) FAIL — same as breadth above FAIL — same as breadth above Physically vacuous

   from 5.2 Application to Each Axis

Where the claim stops

1. Physical Role Ordered field PASS Basic arithmetic of physical quantities Computable completeness PASS All measurement sequences with computable error bounds converge Connectedness PASS Causality, topology, intermediate value theorem Real closure PASS Algebraic closure of physically real numbers Uncountability FAIL Not required — $\mathbb{R}_c$| = $\aleph_0$ but this is meta-theoretic

   from 2.1 What It Is

2. Depth does not require: Uncountability (|$\mathbb{R}_c$| = $\aleph_0$) The Continuum Hypothesis (distinction between $\aleph_1$ and $\aleph_2$ is physically inert) Non-computable reals (they are pairwise physically indistinguishable — Paper I, Theorem 4.3) Dedekind completeness (computable Cauchy completeness suffices for all measurement sequences) Chaitin's $\Omega$ (its binary expansion can never be measured; it is a proof-theoretic artifact)

   from 2.3 What It Does NOT Require

3. The complement $\mathbb{R} \setminus \mathbb{R}_c$ consists of all non-computable real numbers — reals for which there is no Turing machine that approximates them with a computable modulus of convergence.

   from 3.1 What It Is

Where to read

1. 1. Introduction: The 2D Continuum Model Decomposed224 words · 1 min
2. 2. Depth: The Archimedean Completion $\mathbb{R}_c$231 words · 1 min
3. 3. Breadth: The Dark Continuum $\mathbb{R} \setminus \mathbb{R}_c$235 words · 1 min
4. 4. Valuation: The Ultrametric Completions $\mathbb{Q}_p$310 words · 1 min
5. 5. The Complete Ontological Criterion256 words · 1 min
6. 6. Beyond the 2D Model: Falsifiable Predictions283 words · 1 min
7. 7. Implications302 words · 1 min
8. 8. Conclusion205 words · 1 min