The Universe Category: A Single Functor Encoding Quantization, Stability, and Factorization

In the paper's words

This paper proposes a single categorical object — a functor from the divisibility category of the positive integers to the category of smooth compact manifolds — and investigates whether its image simultaneously encodes three structures that have historically been treated as separate: quantization (integer-valued topological invariants), stability (ultrametric hierarchy), and prime factorization (homology rank). The functor F: P → M sends an integer n to the product of spheres ∏_p mid rad(n) S^p-1, where rad(n) is the square-free kernel. By the Künneth formula the total homology rank of the image is 2^ω(n), where ω(n) is the number of distinct prime factors.

The abstract, verbatim; every line below is quoted from the text.

What it claims

that quantization, stability, and factorization are three faces of one

Numbers it reports

No sentence of this paper reports a figure with a unit or a quantity word, so none is shown.

How it is done

1. The geometric approach to integer factorization [5] and the helical-coordinate program [6] treat factorization hardness as a representational artifact of coordinate choice.

   from 2. Background

2. The three legs have independent support: Factorization leg: the homology-rank property is verified computationally (Section 4) and is a theorem of the construction.

   from 5.1 The Evidence Available

3. D3: If the ultrametric-error-suppression bound $|x + y|_p \leq \max(|x|_p, |y|_p)$ is violated by a realized Bruhat-Tits-tree quantum state space, the stability leg is falsified.

   from 6. Pre-Registered Disconfirmation Conditions

4. The construction is offered as a falsifiable hypothesis about the unity of mathematical structure, not as a demonstrated theorem.

   from 8. Conclusion

What would falsify it

1. The synthesis claim — that quantization, stability, and factorization are three faces of one categorical structure — is stated as a pre-registered conjecture with explicit disconfirmation conditions.

   from Abstract

2. The disconfirmation conditions are stated in Section 6 before any observational or computational results are presented, and the computational verification in Section 4 is a test of the conjecture's most concrete leg.

   from 1. Introduction

3. The D1 disconfirmation condition — the most concrete leg of the conjecture — was tested directly.

   from 4. Computational Verification

Where the claim stops

1. Second, it isolates precisely where the harder claims lie — the synthesis conjecture, the multiplicity obstruction, and the dynamical gap — so that future work can target them directly rather than gesturing at the correspondence.

   from 7. Discussion

2. The paper does not claim that the universe is a category in any literal or decorative sense.

   from 7. Discussion

3. We verify this property computationally for all $n \leq 100{,}000$ and verify the associated prime-power criterion: $n$ is a prime power if and only if the homology rank of its image is exactly 2.

   from Abstract

Where to read

1. Abstract208 words · 1 min
2. 1. Introduction215 words · 1 min
3. 2. Background282 words · 1 min
4. 3. The Construction265 words · 1 min
5. 4. Computational Verification146 words · 1 min
6. 5. The Synthesis Conjecture356 words · 2 min
7. 6. Pre-Registered Disconfirmation Conditions124 words · 1 min
8. 7. Discussion118 words · 1 min
9. 8. Conclusion96 words · 1 min
10. Declarations101 words · 1 min