Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Lemma 1.1, p. 2, 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
Throughout, is the reduced Collatz map, for odd and for even , and is the linear operator with , given on the Bergman space of the open unit disc by , where and are the even and odd parts of (p. 2).
Lemma 1.1 (p. 2). If is a cycle of , then is a fixed point of . Further, a polynomial fixed point of has this form up to an element of the kernel of , which the paper computes in (2.1) (p. 3) as the span of the binomials , , there for acting on with .
For the trivial cycle the fixed point is .
Read depth. Claims checked: the statement was read clause by clause on p. 2.
Proof pointer
The paper calls the proof trivial and omits it (p. 2). The first part is the identity around the cycle.
Dependencies
None.
Bears on
- #1135: the lemma turns cycles of the problem's map (the paper's on the positive integers) into fixed points of a linear operator; it says nothing about which cycles exist.