The Coherence-Point Principle
Geometry of Number-Theoretic Structures
GhostDrift Mathematical Institute
This note proposes the "Coherence-Point Principle" as a unified framework for understanding multiplicative number-theoretic inequalities, particularly those sharing the structure of the ABC conjecture.
When three distinct number-theoretic lenses—expected value, typical value, and arithmetic weight—align in the same direction for "almost all $n$", we define their intersection as a coherence point.
From this perspective, the validity of complex inequalities emerges as a form of statistical necessity.
The "Coherence-Point Principle" discussed here serves as the number-theoretic model for the "Principle of Coherence" employed throughout the GhostDrift theory.
It describes the mechanism by which the synchronization of different phases (expectation, typicality, arithmetic structure) at a single point generates strong constraints (inequalities) on the entire system.
1. The Coherence Template and Definitions
To structure multiplicative inequalities, we introduce the following "Coherence Template".
Definition 1.1 (Coherence Template).
Let $\Total(n)$ be a quantity dependent on an integer $n$. If $\Total(n)$ can be decomposed into a main term $\MainMass(n)$ and an excess term $\ExcessMass(n)$ such that
$$ \Total(n) = \MainMass(n) + \ExcessMass(n), $$
we call this structure a Coherence Template.
Example in the context of the ABC inequality:
$$
\begin{align}
\Total(n) &= \log n \\
\MainMass(n) &= R(n) = \log \rad(n) \\
\ExcessMass(n) &= \delta(n) = \sum_{p|n} (\nu_p(n)-1)_+ \log p
\end{align}
$$
Here, $\delta(n)$ represents the excess logarithmic weight derived from the squarefull part (where the exponent is 2 or more).
Such formulations based on $\rad(n)$ and $abc$-triples are well-organized in classical texts like Hardy–Wright [HW08, Ch. II], standard introductions to analytic and probabilistic number theory [Ten15, §I.1], and surveys on the ABC conjecture [Wal15].
In this decomposition, we define a point where the balance between the main term and the excess term is statistically "coherent".
Definition 1.2 (Coherence Point).
For a parameter $X$, an increasing function $f(X)$ with respect to $X$, and constants $c, \varepsilon > 0$, an integer $n \le X$ is a Coherence Point if it simultaneously satisfies the following two conditions:
$$
\begin{cases}
\ExcessMass(n) \le \frac{\varepsilon}{2} \cdot f(X) & (\text{Suppression of Excess}) \\
\MainMass(n) \ge c \cdot f(X) & (\text{Dominance of Main Mass})
\end{cases}
$$
In the case of ABC, it is natural to adopt $f(X) = \log \log X$ as the scaling function.
2. The Coherence-Point Principle
Under this setting, the following general principle holds. This abstracts number-theoretic phenomena from the viewpoint of "coherence".
Theorem 2.1 (Coherence-Point Principle).
Consider the asymptotic limit $X \to \infty$. Let $f(X)$ be an increasing function of $X$ such that $f(X)\to\infty$ as $X\to\infty$.
Assume that $\ExcessMass, \MainMass:\mathbb{N}\to[0,\infty)$ constitute a coherence template
$$ \Total(n)=\MainMass(n)+\ExcessMass(n). $$
Suppose the following two conditions hold:
-
(A) ExcessMass Axis (Uniform Boundedness of Expectation):
There exist constants $C_0>0$ and $X_0\ge 1$ such that
$$
\E_{n\le X}\bigl[\ExcessMass(n)\bigr]
\le C_0
$$
holds for all $X\ge X_0$.
-
(B) MainMass Axis (Lower Bound with Density 1):
There exist constants $c>0$ and $X_1\ge 1$ such that
$$
\MainMass(n)\ \ge\ c\,f(X)
$$
holds on a subset of $n\le X$ of density 1 for all sufficiently large $X$.
(That is, the density of the exceptional set is 0.)
Then, for any $\varepsilon>0$, the density of the set of $n\le X$ that are not "coherence points" is 0.
That is, there exists a set $S_\varepsilon\subset\mathbb{N}$ of density 1 such that for all $n\in S_\varepsilon$,
$$
\ExcessMass(n) \le \frac{\varepsilon}{2}\,f(n),\qquad
\MainMass(n) \ge c\,f(n)
$$
hold simultaneously.
In particular, on the same set $S_\varepsilon$,
$$
\Total(n)
\le \Bigl(1+\varepsilon'\Bigr)\MainMass(n)
$$
holds, where $\varepsilon' = \varepsilon/(2c)$.
The structure of extracting "typical points" from uniform boundedness of expectation and a density-1 lower bound follows a pattern very similar to standard frameworks in probabilistic number theory [Ten15, Kow21, Sch07], such as Erdős–Kac type results and Turán–Kubilius type inequalities.
3. Three Axes of Coherence
This principle is supported by the intersection of three independent number-theoretic phenomena (axes). We unravel this structure using the ABC inequality as an example.
Axis I: Finite Expectation of ExcessMass (Probabilistic Axis).
The excess term $\delta(n)$ is very small on average. As $X\to\infty$,
$$ \E_{n\le X}\bigl[\delta(n)\bigr] = \sum_{p}\frac{\log p}{p(p-1)}\ +\ o(1) < \infty. $$
This suggests that numbers containing squarefull parts are statistically rare.
Regarding the average distribution of squarefull (powerful) numbers and their distribution along arithmetic progressions, the series of studies by Chan [Chan14 et al.] and applications to powerful numbers assuming the ABC conjecture [Cro20] provide detailed insights. Furthermore, recent results giving ergodic theorems along squarefree and squarefull numbers [LiYi25] complement the $\ExcessMass$ axis of this paper from a measure-theoretic perspective.
Additionally, recent results on the distribution of $\omega(n)$ over $h$-free / $h$-full numbers [DKL24] provide a technical foundation for more precisely measuring "rare deviations" of $\ExcessMass$.
Axis II: Typical Lower Bound of MainMass (Normal Order Axis).
The main term $R(n)$ is sufficiently large for almost all $n$.
By the Hardy–Ramanujan theorem, for almost all $n$,
$$ R(n) \ge \frac{1}{2}\log\log n $$
holds. This is a manifestation of the "Normal Order" phenomenon on the MainMass side.
The classical theorem by Hardy–Ramanujan [HR17, HW08, Ch. XXII] stating that the normal order of $\omega(n)$ is $\log\log n$ is the very skeleton of this lemma. For more modern introductions, one can refer to variants by Murty [Mur20] and recent results showing that the normal order of $\omega(n)$ remains $\log\log n$ even when restricted to $h$-free / $h$-full numbers [DKL24]. We also cite [Kow21] as a systematic introduction to probabilistic number theory as a whole.
Axis III: Arithmetic Lifting (Arithmetic Axis).
Consider a property $\mathcal{P}(c)$ concerning an integer $c$.
Let
$$
\mathbf{1}_{\mathcal{P}}(c)
:=
\begin{cases}
1 & (\text{if }\mathcal{P}(c)\text{ holds})\\
0 & (\text{otherwise})
\end{cases}.
$$
On the set of coprime triples
$$
\mathcal{T}(X)
:= \bigl\{(a,b,c)\in\mathbb{N}^3 :
a+b=c,\ (a,b,c)=1,\ c\le X
\bigr\},
$$
we introduce the following $\varphi$-weighted probability measure:
$$
\mu_X(A)
:= \frac{1}{\sum_{c\le X}\varphi(c)}
\sum_{\substack{c\le X\\(a,b,c)=1\\a+b=c}}
\mathbf{1}_A(a,b,c),
$$
where $A\subset\mathcal{T}(X)$.
Then $\mu_X$ can be essentially identified with the $\varphi$-weighted average regarding $c$:
$$
\nu_X(B)
:= \frac{1}{\sum_{c\le X}\varphi(c)}
\sum_{c\le X}\varphi(c)\,\mathbf{1}_B(c).
$$
If
$$
\lim_{X\to\infty}
\nu_X\bigl(\{c\le X : \mathcal{P}(c)\}\bigr) = 1
$$
holds (i.e., $\mathcal{P}(c)$ holds with $\varphi$-weighted density 1), then
$$
\lim_{X\to\infty}
\mu_X\bigl(\{(a,b,c)\in\mathcal{T}(X) : \mathcal{P}(c)\}\bigr) = 1
$$
also holds.
Therefore, if coherence for a single $c$ (e.g., coherence conditions regarding $\MainMass(c)$ or $\ExcessMass(c)$) holds with $\varphi$-weighted density 1, it naturally lifts to a set of $\varphi$-weighted density 1 of coprime triples $(a,b,c)$.
The typical distribution behavior regarding $abc$-triples and $\rad(abc)$ (e.g., questions of how small/large $\rad(abc)$ is for most $c$) is organized in detail in surveys on the ABC conjecture [Wal15] and applications based on explicit versions [KNS19]. Applications to powerful numbers [Cro20] serve as examples emphasizing the role of the "excess term" derived from squarefull parts.
On the other hand, viewing the framework of probability measures based on $\varphi$-weighted averages more logically/model-theoretically aligns well with recent research connecting natural density and spectral properties [ToZ25].
The proof follows by observing that the sum over $\mathcal{T}(X)$ contains $\varphi(c)$ terms for each $c$, making the two averages identically equal.
4. Incoherent Regions as Exceptional Sets
From the perspective of this principle, the "exceptional set $E(X)$" which could potentially contain counterexamples to the conjecture is redefined as the region where coherence conditions break down.
Details: Structure of Incoherent Regions
The exceptional set $E(X)$ decomposes as follows:
$$ E(X) \subseteq \{ n : \delta(n) \text{ is excessive} \} \cup \{ n : R(n) \text{ is deficient} \}. $$
Candidates for counterexamples to the conjecture are reinterpreted as "Incoherent Regions" (where coherence conditions are broken).
The path to a complete theoretical construction (e.g., a full proof of the ABC conjecture) reduces to the problem of reducing the size of this incoherent region from merely "density 0" to a truly exceptional scale (e.g., $O(X/\log^A X)$ or smaller).
Future prospects include strengthening evaluations of exceptional sets for the normal order of $\log\rad(n)$ and refining sieve method evaluations for large squarefull parts. These are all attempts to quantify "how few points fall outside the coherence sphere".
Attempts to precisely evaluate the "natural density of integers satisfying specific arithmetic conditions" have been actively progressing in recent years, such as density evaluations for inequalities of the form $\sigma(kn+r_1)\ge\sigma(kn+r_2)$ [LR23] and research dealing with the proportion of non-representable integers related to generalized Fibonacci sequences [Tro21].
References
- [HW08] G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 6th ed., Oxford University Press, 2008.
- [Ten15] G. Tenenbaum, Introduction to Analytic and Probabilistic Number Theory, 3rd ed., Graduate Studies in Mathematics 163, AMS, 2015.
- [Kow21] E. Kowalski, An Introduction to Probabilistic Number Theory, Cambridge Studies in Advanced Mathematics 196, Cambridge University Press, 2021.
- [Wal15] M. Waldschmidt, "On the abc conjecture and some of its consequences", in Mathematics without Boundaries, Springer, 2014, pp. 567–604.
- [KNS19] C. C. Kwok, M. Nair, and T. N. Shorey, "Explicit abc-conjecture and its applications", Hardy-Ramanujan Journal 41 (2019), 1-13.
- [Chan14] T. H. Chan, "Squarefull numbers in arithmetic progression II", Journal of Number Theory 137 (2014), 79-102.
- [Cro20] CrowdMath, "Applications of the abc conjecture to powerful numbers", arXiv:2005.07321, 2020.
- [LiYi25] H. Li, B. Wang, C. Wang, and S. Yi, "Some ergodic theorems over squarefree numbers and squarefull numbers", Acta Arithmetica 221 (2025), 1-28.
- [DKL24] L. Das, Y. Kuo, and Y.-R. Liu, "Distribution of $\omega(n)$ over $h$-free and $h$-full numbers", arXiv:2409.10430, 2024.
- [HR17] G. H. Hardy and S. Ramanujan, "The normal number of prime factors of a number $n$", Quarterly Journal of Mathematics 48 (1917), 76-92.
- [Mur20] M. R. Murty, "The normal number of prime factors of a number $n$ (after Hardy and Ramanujan)", in The Hardy-Ramanujan Journal, 2020.
- [Dro89] V. Drobot, "On the natural density of the set of positive integers $n$ for which $2^n + k$ is a prime", International Journal of Mathematics and Mathematical Sciences 12 (1989), 797-800.
- [ToZ25] G. V. Toledo and Y. Zohar, "Number Theory Combination: Natural Density and SMT", in FroCoS 2025, LNCS, Springer.
- [LR23] Y. Luo and Z. Ren, "The estimate on the natural density of integers $n$ for which $\sigma(kn+r_1) \ge \sigma(kn+r_2)$", arXiv:2311.00295, 2023.
- [Tro21] P. Trojovský, "On the Natural Density of Sets Related to Generalized Fibonacci Numbers of Order $r$", Axioms 10 (2021), 266.
- [Sch07] W. Schwarz, "Some highlights from the history of probabilistic number theory", in Probabilistic Number Theory and Limit Theorems, Advanced Studies in Pure Mathematics 49, 2007.