Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Theorem 4.9, p. 9, of Mikhail Neklyudov, Functional analysis approach to the Collatz conjecture, arXiv:2106.11859v9 (2022), published in Results Math. 79 (2024), no. 4, Paper No. 140, in the edition identified on the source card.
Statement
is the reduced Collatz map and the Berg--Meinardus operator, as on the Theorem 4.4 page. The total stopping time gives, for , the least with , and if there is none; (p. 6). With the convention for , the reduced characteristic function of Definition 4.6 (p. 8) with parameters is
Theorem 4.9 (p. 9). For ,
The statement also writes , with the letter as subscript, for the characteristic function of Definition 4.6 (p. 8); the equality holds for .
Read depth. Claims checked: the identity (4.7) and its hypothesis were read on p. 9; the derivation from Example 4.8 was read through, not checked step by step.
Proof pointer
Page 9: it is Example 4.8, the case of Theorem 4.5, for which , the factor coming from the trivial cycle.
Dependencies
Bears on
No Erdős problem page cites it. It is the identity behind Corollary 4.14 and Corollary 4.17.