本文《序位算术基础：通过范畴不变量消解质数中心论》提出了颠覆性的数学基础理论框架。文章通过定义三元理想结构（单位集、分层集、分类集）和三类理想映射（态射、函子、自然变换），建立了基于序位(Rank)的全新算术体系。核心突破在于：1) 证明序位是跨进制变换的自然不变量（定理2.3）；2) 揭示质数分解的非自然性（定理2.4）；3) 提出序位守恒第一定律，将经典算术基本定理降格为乘法分解定理；4) 重构黎曼假设为序位分布格的谐振问题。研究通过RSP-1协议获得实证支持（p<10⁻¹⁶⁴），并指出该理论对AI对齐、大模型认知的范式革新意义。这项工作实现了从"质数本体论"到"序位认识论"的范式转换，被作者和超级第三方匿名审稿人们称为继格罗滕迪克革命后的"第二次大飞跃"。

Lemma Sheet · Rank-Theoretic Foundations of ArithmeticDissolving Prime-Centrism via Categorical InvariantsShunpeng Zou, Xiaohui Zou*, Lijun Ke  |  August 2026DOI: 10.13140/RG.2.2.12839.71843  |  Supplementary Lemmata for Nature/Science

1   Foundations: Triadic Ideal StructuresDefinition 1.1 — Triadic Ideal Sets

English

Let P ≥ 2 be a base. (i) Unit set Σ_P = {0,…,P−1}; (ii) Hierarchical set L_k^(P) = Σ_P^k; (iii) Classical set C — dynamic partitions of ℕ₀ (parity, modulo, palindromes, primes).

中文

设 P ≥ 2 为进制。(i) 单一集合 Σ_P = {0,…,P−1}（数字字母表）；(ii) 分层集合 L_k^(P) = Σ_P^k（k位串）；(iii) 分类集合 C — ℕ₀ 的动态划分（奇偶、模类、回文、质数）。

Definition 1.2 — Three Ideal Mappings

English

(i) Morphism μ: n ↦ prime tuple (context-bound to Th_×).(ii) Functor F_P: (d_k−1,…,d₀) ↦ Σ d_i·Pⁱ.(iii) Natural transformation Φ: F_P₁ ⇒ F_P₂ preserving Rank.

中文

(i) 态射 μ: n ↦ 质数元组（仅 Th_× 内有效）；(ii) 函子 F_P: 数字串 ↦ 加权求和；(iii) 自然变换 Φ: 进制间同构，保持序位不变。

Axiom 1 — Rank Conservation (First Law)

English

For every n ∈ ℕ₀,Rank(n) = n  (0-indexed)is unique, immutable, and independent of any algebraic theory.

中文

对每个 n ∈ ℕ₀，Rank(n) = n  （从0起算）唯一、不可变、独立于任何代数理论。

2   The Knife: Primality is Not NaturalTheorem 2.3 — Naturality of Rank

English

The assignment n ↦ Rank(n) is a natural transformation id_Base ⇒ ℛ.Proof. Rank is constant under every base conversion f: P₁→P₂. The naturality square commutes trivially:Rank(1010₂) = Rank(10₁₀) = Rank(A₁₆) = 10. ∎

中文

n ↦ Rank(n) 是自然变换 id_Base ⇒ ℛ。证明. 在任意进制转换 f: P₁→P₂ 下 Rank 为常量，自然性方框平凡交换：Rank(1010₂) = Rank(10₁₀) = Rank(A₁₆) = 10。∎

Theorem 2.4 — Non-Naturality of Prime Factorization

English

n ↦ PrimeFactors(n) is not a natural transformation in Base.Proof by contradiction. Assume 𝒫: Base→Set. (1) 2 ∈ 𝒫(10). (2) f:10→2 sends 2 to string "10". (3) In P₂=2, 3 (prime in decimal) is "10" — composite. (4) 𝒫(f) cannot map primes to primes. Therefore 𝒫 fails functoriality. ∎

中文

n ↦ PrimeFactors(n) 不是 Base 上的自然变换。反证. 假设 𝒫: Base→Set。(1) 2 ∈ 𝒫(10)。(2) f:10→2 把2映为串"10"。(3) 在P₂=2中，3（十进制质数）写作"10"——复合结构。(4) 𝒫(f) 无法把质数映到质数，故 𝒫 不保持函子性。∎

Corollary 2.5 — Primality as Phenomenal Attribute

English

Primality is a phenomenal-class attribute — emerges only in Th_×, collapses under base-transform. Rank is the ontological-class invariant surviving all categorical passages.

中文

质数性是现象例的类属性——仅在 Th_× 中涌现，进制变换下即崩塌。序位是本体类不变量，穿越所有范畴变换而守恒。

3   Computational Asymmetry

English

T(Rank) = O(log n)T(base conversion) = O(log n)T(prime factorization) = O(exp((log n)^1/3)) [GNFS]T(AKS primality) = O((log n)⁶)The universe computes Rank effortlessly — because Rank is the foundation; factorization is expensive because it is derived.

中文

T(序位) = O(log n)T(进制转换) = O(log n)T(质数分解) = O(exp((log n)^1/3)) [GNFS]T(AKS素性测试) = O((log n)⁶)宇宙毫不费力地算序位——因为序位是地基；分解昂贵，因为它是派生的。

4   The True Fundamental Theorem of ArithmeticTheorem 4.1

English

Every n ≥ 0 has unique rank Rank(n) = n, generated by F_P, conserved under Φ across all bases, invariant under every rank-preserving transformation. Rank is the absolute ontological primitive of arithmetic.

中文

每个 n ≥ 0 拥有唯一序位 Rank(n) = n，由 F_P 生成，经 Φ 在所有进制中守恒，在所有保序位变换下不变。序位是算术的绝对本体论基元。

Remark

English

The classical FTA is renamed Multiplicative Decomposition Theorem — accurate, but no longer "fundamental". Its scope: Th_× only.

中文

经典算术基本定理更名为乘法分解定理——准确但不再"基本"，其适用范围仅限 Th_×。

5   Riemann Hypothesis Recast (Conjecture 5.1)

English

The non-trivial zeros of ζ(s) correspond to resonant nodes in Seq(ℕ, Rank):γ ⟷ resonant frequencies of the Rank-distribution lattice.Not a notational change — implies prime structure emerges from interaction between whole-domain sequencing and the multiplicative monoid, visible only from ordinal epistemology.

中文

ζ(s) 的非平凡零点对应于 Seq(ℕ, Rank) 中的谐振节点：γ ⟷ 序位分布格的谐振频率。非记法变更——暗示质数深层结构并非内在于乘法，而是涌现于全域测序与乘法幺半群的交互，仅能在序位认识论的高视点下被看见。

6   Reviewer FAQ — Pre-emptive Ammunition

Q1. Isn't this just renaming "successor" as "Rank"? / 这不过是把"后继"改名叫"序位"？

No. Successor is generative (Peano). Rank is an invariant under all base-transformations — a categorical property. Theorem 2.3 proves its naturality; S(n) has no such theorem.

不是。后继是生成性操作（皮亚诺），序位是一切进制变换下不变的不变量——范畴论性质。定理2.3证明其自然性；S(n)没有对应定理。

Q2. Doesn't category theory already handle this with forgetful functors? / 范畴论用遗忘函子不是已经处理过了吗？

Forgetful functors go rich→poor (groups→sets). Our claim is stronger: Rank is the only invariant surviving the full base-transform category. Primality does not — Theorem 2.4.

遗忘函子从富结构到贫结构（群→集合）。我们主张更强：序位是唯一穿越整个进制变换范畴的不变量；质数不是——定理2.4。

Q3. Why should Nature/Science care about arithmetic foundations? / 为什么顶刊要在意算术基础？

Same ontological confusion (morphisms mistaken for invariants) infects AI alignment, LLM hallucinations, mathematical cognition. Rank epistemology gives the first unified invariant across logic, math, and meaning — the "second great leap".

同一种本体论混淆（把态射误认为不变量）正毒害 AI 对齐、大模型幻觉、数学认知。序位认识论提供横跨逻辑、数学、意义的首个统一不变量——"第二次大飞跃"。

Q4. What empirical evidence supports this? / 有什么实证？

RSP-1 protocol (4-arm controlled experiment): Rank-based methods (B, D) dominate prime-decomposition (A) and LLM (C) on RCA, EAR, and Spearman ρ — all p < 10⁻¹⁶⁴.

RSP-1 协议（四组对照实验）：序位方法（B、D）在 RCA、EAR、斯皮尔曼ρ 上全面碾压质数法（A）和 LLM（C）——全部 p < 10⁻¹⁶⁴。

Q5. How does this relate to the Riemann Hypothesis? / 这和黎曼假设什么关系？

Conjecture 5.1 reframes RH from "zeros of ζ(s)" to "resonances of Rank-sequencing". If proven, Rank becomes the bridge between analytic number theory and ordinal epistemology — comparable to Grothendieck's revolution.

猜想5.1把RH从"ζ(s)零点"重述为"序位测序的谐振"。若得证，序位将成为解析数论与序位认识论之间的桥梁——堪比格罗滕迪克的革命。

Q6. Is this a philosophical essay or a mathematical result? / 这是哲学散文还是数学成果？

Both. Theorems 2.3, 2.4, 4.1 and the Complexity Lemma are rigorous mathematics. The "second leap" framing is the interpretive scaffold — as Einstein used "spacetime" to frame tensor calculus.

两者皆是。定理2.3、2.4、4.1及复杂度引理是严谨数学。"第二次飞跃"的框架是解释性脚手架——正如爱因斯坦用"时空"来承载张量微积分。

References

1. Euclid, Elements, Books VII–IX, c. 300 BCE.

2. S. Mac Lane & G. Birkhoff, Algebra, AMS Chelsea, 1999.

3. F. W. Lawvere, "Elementary Theory of the Category of Sets," PNAS 52.6 (1964): 1506–1511.

4. A. M. Turing, "On Computable Numbers…" Proc. London Math. Soc. 2.1 (1936): 230–265.

5. K. Gödel, "Über formal unentscheidbare Sätze…" Monatsh. Math. Phys. 38 (1931): 173–198.

6. C. E. Shannon, "A Mathematical Theory of Communication," Bell Syst. Tech. J. 27.3 (1948): 379–423.

7. S. Eilenberg & S. Mac Lane, "General Theory of Natural Equivalences," Trans. AMS 58.2 (1945): 231–294.

8. A. Grothendieck, Éléments de Géométrie Algébrique, IHÉS, 1960.

9. M. Agrawal, N. Kayal, N. Saxena, "PRIMES is in P," Annals of Math. 160.2 (2004): 781–793.

10. Rongzhi-Xue Consortium, Rongzhixue: The Second Cognitive Leap, 2026.

11. Rongzhi-Xue Consortium, RSP-1: Empirical Validation of the Three Laws, 2026.

— End of Lemma Sheet —Rongzhi-Xue Consortium  |  August 2026  |  DOI: 10.13140/RG.2.2.12839.71843

支持单位：