OpenFrontiers
← Back to the index
OP-6066OpenNumber theory

Local Prime-Exchange Balancing and Möbius Cancellation

TheoremDB P11562 · number theory

Inferred from the community field; finer classification has not been reviewed.

Source catalogue assessmentAs of 2026-09-08Source & evidence ↓

Problem statement

For x≥1x\ge 1, let

Sx={n≤x:n is squarefree}. \mathcal S_x=\{n\le x:n\text{ is squarefree}\}.

For n∈Sxn\in\mathcal S_x, write P(n)P(n) for its set of prime divisors, so

μ(n)=(−1)∣P(n)∣. \mu(n)=(-1)^{|P(n)|}.

Let

Sx+={n∈Sx:μ(n)=+1},Sx−={n∈Sx:μ(n)=−1}. \mathcal S_x^+=\{n\in\mathcal S_x:\mu(n)=+1\},\qquad \mathcal S_x^-=\{n\in\mathcal S_x:\mu(n)=-1\}.

Define a bipartite graph GxG_x on Sx\mathcal S_x by joining mm and nn exactly when

∣P(m)△P(n)∣∈{1,3}. |P(m)\triangle P(n)|\in\{1,3\}.

Thus every edge joins opposite Möbius signs. Set K0(m,n)=1K_0(m,n)=1 on edges and 00 otherwise. Given a nonnegative symmetric edge kernel KjK_j, define

rj(n)=∑m∼nKj(n,m), r_j(n)=\sum_{m\sim n}K_j(n,m),

and, whenever all relevant row masses are positive, define

Kj+1(m,n)=Kj(m,n)rj(m)rj(n) K_{j+1}(m,n)=\frac{K_j(m,n)}{\sqrt{r_j(m)r_j(n)}}

on edges.

Prove that for every ε>0\varepsilon>0 there exist explicit constants Cε,Aε>0C_\varepsilon,A_\varepsilon>0 and an explicit integer-valued function J(x)J(x) satisfying

J(x)≤Cε(log⁡x)Aε J(x)\le C_\varepsilon(\log x)^{A_\varepsilon}

such that, for all sufficiently large xx,

∑n∈Sx∣rJ(x)(n)−1∣≤Cεx1/2+ε. \sum_{n\in\mathcal S_x}|r_{J(x)}(n)-1| \le C_\varepsilon x^{1/2+\varepsilon}.

The proof must derive this bound from the local arithmetic geometry of GxG_x and the stated balancing dynamics, without using estimates for the Mertens function M(x)M(x), locations of zeros of ζ\zeta, or a separately optimized global matching.

Since KjK_j is symmetric and every edge joins opposite signs,

∑n∈Sx+rj(n)=∑n∈Sx−rj(n). \sum_{n\in\mathcal S_x^+}r_j(n)=\sum_{n\in\mathcal S_x^-}r_j(n).

Hence

∣M(x)∣≤∑n∈Sx∣1−rj(n)∣. |M(x)|\le \sum_{n\in\mathcal S_x}|1-r_j(n)|.

Therefore the target estimate implies

M(x)=Oε(x1/2+ε), M(x)=O_\varepsilon(x^{1/2+\varepsilon}),

and hence the Riemann Hypothesis.

As an intermediate structural target, prove or refute that GxG_x has a matching saturating the smaller of Sx+\mathcal S_x^+ and Sx−\mathcal S_x^- for every xx, equivalently that its matching defect is exactly ∣M(x)∣|M(x)|. More generally, determine the least fixed odd exchange radius rr for which an analogous local balancing mechanism can achieve square-root-scale defect.

Lean 4

Not yet attached

No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.

Progress & source assessment

Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.

Open. Not Lean-verified

References
  1. [1]TheoremDB P11562 link

Recorded progress

Add yours →

Nothing recorded yet. A pointer to a paper the entry is missing counts.

Machine attempts

0 recorded

Attempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.

No machine attempts recorded.

Sign in to run an attempt. New accounts start with enough credits for ten.

Discussion

0 notes

Notes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.

No notes yet.

Sign in to add a note.