Work

Arithmetic Structure Under a BackgroundFree Geometry The Divisibility Graph, the Division Operator, and Prime Counting

Year: 2026
Type: article
Abstract: We take the axiom "space is generated endogenously by operators" and execute it once on the smallest arithmetic carrier available: vertices $1..N$, relation = divisibility cover. The graph has no coordinates; every structure in it is given by adjacency. Three results. First, the primes on this graph are not sieved out — they are the unit sphere: the layer that covers the root vertex, so that $\pi(N)$ is the out-degree of the root. The inverse of the graph's zeta matrix is the Möbius function, and $\mu$ factors into one inclusion–exclusion step per prime; hence "divide by a prime" is the only edge operator this graph admits. Second, the metric layer yields a dictionary: the intrinsic distance is the $\ell_1$ distance of prime-exponent vectors, $\Omega$ plays the role of variance and $\sqrt d$ the role of length; the cross coefficient of the Pythagorean formulation therefore has a closed form $\kappa=-r/\sqrt{ab}$, and "right angle" is equivalent to "the two legs share no prime direction". Third, this structure yields the count of primes but not their identity: the graph's resolution on primes is only $O(\sqrt N)$ while there are $N/\ln N$ of them; the spectrum is identically $\{0\}$, the Jordan type records only the sieve, and $\pi(N)$ lives in the support alone. 把「空间由算子内生」这条公理放到最小的算术载体上执行一次:顶点取整数 $1..N$,关系取整除覆盖。这张图上没有坐标,一切结构由邻接给出。 三个结果。其一,素数在这张图上不是筛出来的,而是单位球面——覆盖根顶点的那一层,$\pi(N)$ 就是根顶点的出度;图的 zeta 矩阵的逆是 Möbius 函数,而 $\mu$ 可以拆成每个素数一步容斥的乘积,于是「除以一个素数」是这张图上唯一的边算子。其二,度量层给出一组对应:内禀距离是素数指数向量的 $\ell_1$ 距离,$\Omega$ 扮演方差、$\sqrt d$ 扮演长度;勾股表述里的交叉系数因此有闭式 $\kappa=-r/\sqrt{ab}$,而「直角」等价于「两条腿不共享任何素数方向」。其三,这套结构给得出素数的计数,给不出素数的身份:图对素数的分辨率只有 $O(\sqrt N)$,而素数的数目是 $N/\ln N$;谱恒为 $\{0\}$,Jordan 型只记筛法,$\pi(N)$ 只住在支撑集里。
Author: Lu, Yue
Language: English
Open Access status: green
OpenAlex ID: W7225901943
FWCI:
Cites:
Cited by:
Related to: 10