Skip to content

Documentary state: EDITORIALLY_ADMITTED. The manuscript has a protected editorial admission, not a theorem certification.

OAI-26 family 011: Prime-factor statistics of prime predecessors

Editorial status: DRAFT_UNACCEPTED. Mathematical status: NO_CERTIFICATION. The three source manuscripts make ambitious claims about the factorization of \(p-1\) for primes \(p\); this page documents those claims, not independently verified proofs.

The question in plain language

For a prime such as \(p=31\), the predecessor \(p-1=30=2\cdot3\cdot5\) has three distinct prime factors. For \(p=17\), the predecessor is \(16=2^4\), with only one distinct prime factor but four factors counted with multiplicity. How do these prime factors behave when we look across increasingly many primes?

Family 011 contains three distinct questions: whether many primes have predecessors made only of relatively small prime factors; whether the sizes of all prime factors follow a limiting statistical law; and whether some predecessors are squarefree and contain an even number of prime factors. The published sources claim striking answers, but the questions should not be treated as equivalent.

A small example

A positive integer is called smooth relative to a bound \(y\) if none of its prime factors exceeds \(y\). The predecessor \(30\) is smooth relative to 5; \(16\) is smooth relative to 2. Smoothness says how large the factors can be. Parity says whether the number of factors is odd or even. It does not follow from smoothness.

The Möbius function \(\mu(n)\) equals \((-1)^r\) when \(n\) is squarefree with \(r\) distinct prime factors, and equals zero when \(n\) has a squared prime factor. Thus \(\mu(p-1)=1\) is exactly the assertion that \(p-1\) is squarefree and has an even number of prime factors. These elementary examples do not establish that infinitely many primes satisfy the condition.

What is known

Smooth shifted primes and totient fibers. The September 24 paper Weighted dilation graphs, smooth shifted primes and totient fibers, Theorem 1.2, claims that for each fixed \(0<\delta<1/4\), at least \(x^{1-o(1)}\) primes in \(2x<p\le5x\) have largest prime factor of \(p-1\) at most \(x^\delta\). By choosing a smaller exponent the source extends the conclusion to every fixed positive \(\delta\); it does not claim uniformity as \(\delta\) tends to zero. Its Theorem 1.1 claims that for every \(\varepsilon>0\), infinitely many positive integers \(n\) have more than \(n^{1-\varepsilon}\) preimages under Euler's totient function. The second assertion is linked to products of primes with smooth predecessors, but it is a separate theorem.

A distribution for all factor sizes. The September 24 paper The Poisson–Dirichlet law for prime predecessors claims that for a uniformly selected prime \(3\le p\le x\), the decreasing list of prime factors of \(p-1\), with multiplicity, has normalized logarithmic sizes converging in every finite joint distribution to the Poisson–Dirichlet law with parameter one. A limiting joint distribution of ranked sizes is more specific than merely obtaining many smooth predecessors. The source attributes the earlier conjecture to Ford, Konyagin, and Luca.

Even factor-count parity. The September 17 paper Prime Predecessors with an Even Number of Prime Factors, Theorem 1.1, claims infinitely many primes \(p\) have \(\mu(p-1)=1\). It explicitly requires squarefreeness, so the counting-with-multiplicity and distinct-factor conventions agree on the constructed predecessors. Its introduction invokes dilation-graph and weighted-sieve results from the smoothness companion but says the parity conclusion requires further signed correlations, a prime slot, and a Type II distribution argument. The source does not derive parity from smoothness alone.

The three theorems concern the same arithmetic object, \(p-1\), but impose genuinely different conditions and use different counting conventions and analytic steps.

GCL verification state

The source snapshot is pinned to `openai/math@1581d4cbdd69a0faf34b2089614fe2a814316a6a`. The three PDFs were retrieved and their title pages, abstracts and opening theorem statements directly read:

  • Smoothness and totient fibers: Git blob `3acecffeba75121b28efd194c4c2b266a9f6d77b`, 68 PDF pages.
  • Poisson–Dirichlet law: Git blob `c46ae43eabf76a9c1cc53655414567ba4e5b60ae`, 74 PDF pages.
  • Prime-factor parity: Git blob `73d9d9f5ed478e1c0ba049fa00a55fafea4b48a5`, 45 PDF pages.

This review establishes source statement fidelity, not the correctness of the papers' full proofs. In particular, it does not validate the weighted dilation-graph transference, finite-prime uniformity, two-sided marked correlations, boundary arguments for the Poisson–Dirichlet law, or the parity-sensitive Type II estimates. No exact Lean theorem binding, Comparator replay or MATHCERT certificate has been established. The article remains DRAFT_UNACCEPTED pending an independently recorded editorial disposition and protected hash-bound admission.

What remains

For smoothness, review the weighted graph/kernel estimates that produce primes with small largest factors, and separately check the product-and-pigeonhole argument generating large totient fibers. For the Poisson–Dirichlet claim, verify the passage from interior prime-factor statistics to ranked joint distributions, including multiplicity, small factors and boundary mass. For parity, check the signed-correlation extension of the companion, prime-slot estimate, negligibility of nonsquarefree predecessors and the final positive prime mass. Their quantitative limits and varying parameters must not be silently interchanged.

Editorial acceptance requires a critic matched to the exact manuscript, the mathematical Markdown source gate, deterministic compendium tests, strict MkDocs/HTML readback, and admission of the exact article SHA-256 through protected PR governance. These operations do not themselves establish any novel theorem.

Sources and claim boundaries

Boundary: NO_CERTIFICATION. The source claims are faithfully described but no mathematical proof is certified by the documentary article.


Indexed primary manuscript paths: