Wirsching's Positive-Predecessor-Density Program: Proofs of Conjectures 1 and 3
Demonstra duas das três conjecturas que Wirsching deixou em aberto em 2003 e reduz a sua cadeia de cinco condições a uma única, (⋆3). A Conjectura 2, que levaria a ela, continua em aberto, assim como a densidade positiva de predecessores.
Acesso
Resumo
Wirsching (2003) reduces uniform positive predecessor density for the 3n+1 map to a chain of five conditions, organized into three conjectures. We prove two of them. Conjecture 1 concerns his path-counting generators: in the convolution carrying them to his Elka functions the partition weights grow subexponentially while the binomial ratio decays geometrically, so a window of width O(√ℓ) dominates and its radius fits inside the hypothesis. Conjecture 3 concerns the asymptotics near 0 of an invariant density φ, a base-3 analogue of the Fabius density, against an explicit φ₀ due to Berg and Krüppel. The exact log-Laplace transform of φ splits into a smooth part, a log 3-periodic correction H, and a doubly exponentially small remainder. Berg and Krüppel represented that correction as an infinite product in 1998; their analysis did not determine whether it is constant. We give H as a Fourier series with coefficients in closed form in Γ and ζ; a classical zero-free theorem for ζ shows it is not constant, and we enclose its oscillation rigorously. Wirsching’s comparison class fixes one phase of H, and there Conjecture 3 holds with limit e^{H(0)}, certified to lie in (0.53412203666478, 0.53412203666479). Off that class the phase sweeps a full period, so the unrestricted asymptotic φ(t) ∼ κφ₀(t) fails. Condition (⋆4) follows, at every window radius, with μ = 1/3: what Wirsching’s argument needs is weaker than Conjecture 3 itself, and the same saddlepoint chain settles it directly. With Conjecture 1 the chain reduces to the single condition (⋆3). Conjecture 2 is his route to it and remains open.
Resumo no idioma original da publicação. Uma apresentação em português, com os resultados classificados por situação, está em O programa de Wirsching.
Palavras-chave
3x+1 problem, Collatz problem, predecessor density, invariant density, two-scale difference equation, log-periodic asymptotics, uniform saddlepoint method, Mellin transform, Riemann zeta function.
Como citar
Tavares, R. A. (2026). Wirsching's Positive-Predecessor-Density Program: Proofs of Conjectures 1 and 3. Preprint. arXiv:2608.27617.
@misc{Tavares2026Wirsching13,
author = {Tavares, Renato Augusto},
title = {{Wirsching's Positive-Predecessor-Density Program: Proofs of Conjectures 1 and 3}},
year = {2026},
month = aug,
eprint = {2608.27617},
archivePrefix = {arXiv},
primaryClass = {math.GM},
note = {Preprint}
}