Polynomial extension of Collatz graph... does it converge finitely?

148 Views Asked by At

Let $\Bbb Z[2^{-1},2^{-1/2},2^{-1/4,\ldots}]$ be the ring of dyadic rationals extended to include dyadic powers of $2$.

Then let $2^{\nu_2(x)}$ extend the 2-adic valuation to dyadic powers of $2$ (using the rule given below).

Let $f(x)=\dfrac{3x+2^{\nu_2(x)}}{2\cdot\sqrt{2^{\nu_2(3x+2^{\nu_2(x)})}}}$

This looks like a bit of a handful, but it is easily explained:

Ignore multiples of $3$.

Apply the usual Collatz function $3x+1$ to any odd integer

Then instead of dividing out all of the factors of $2$, square root the power of $2$ and divide by $2$ again. Use this power of $2$ to extend the padic valuation.

The thinking behind this is that it has the same fixed point $f(1)=1$ as the conventional graph, and it also converges to $1$ under infinite iteration if the Collatz conjecture converges.

Is there an argument to show it converges finitely?

There's a quick upper bound on its long-term growth of $\frac{3}{2\sqrt2}$ per iteration (not sure how to convert this to big O notation), and in fact a better estimate limit looks to be something like:

$\dfrac{3x}{2\sqrt{2\sqrt{2\sqrt{\ldots}}}}\to3x/4$ for all values that don't converge (i.e. the odd factors dominate), and approaches $1$ when the even factors dominate.

1

There are 1 best solutions below

2
On BEST ANSWER

To expand on comments by users reuns and Servaes, this seems rather pointless.

One can define, on any additive subgroup of a field that has a well-defined $2$-adic valuation, a variant of the Collatz function,

$$f(x) = 3x+2^{v_2(x)}$$

which by definition commutes with powers of $2$. We can be generous and look e.g. at the field $K:= \mathbb Q (2^r : r\in \mathbb{Q}$) (viewed as a subfield of $\mathbb R$; if we want to see that as a truly $2$-adic field i.e. contained in something like $\mathbb C_2$, one has to choose a compatible set of $n$-th roots of $2$, but all that's beside the point).

The Collatz conjecture is equivalent to stating that for every positive integer $x$, there is $k\in \mathbb N$ such that $f^{\circ k}(x) \in 2^\mathbb{Q}$. (Notation $^{\circ k}$ meaning $k$-fold composition.) It is well-known that in bigger subsets of our $K$ than just the positive integers, there are non-trivial cycles (already in $\mathbb Z$, namely starting at $-5$ or $-17$), and even though research into the behaviour of $f$ on such bigger rings shows some interesting results (Lagarias!), it seems that these are of rather limited use for the original Collatz problem. But even if we believe they might be, let me now explain why I'm quite sure your adaptation of that map is not, and you might as well stick to the above $f$.

Namely, let $a(x)$ be any (!) map on $K^\times$, or some suitable subset thereof, with range $\subseteq \mathbb Q$. Then the map

$$f_a(x) := f(x) \cdot 2^{a(x)}$$

carries not more or less information than the original $f$ about the Collatz problem. To see this, generalising what reuns writes, $f$ induces a well-defined map $\overline{f}$ on the multiplicative quotient $K^\times/2^{\mathbb Q}$, and $f^{\circ k} (x) \in 2^{\mathbb Q} \Leftrightarrow \overline f^{\circ k} (\overline{x})=\overline 1$. But, punchline, $f$ and $f_a$ induce the same quotient map on $K^\times/2^{\mathbb Q}$, so $$f^{\circ k} (x) \in 2^{\mathbb Q} \Leftrightarrow f_a^{\circ k} (x) \in 2^{\mathbb Q}$$ (this can also be seen directly, without the quotient machinery, just by noting that $f$ commutes with powers of $2$).

Your proposed map is (this is what Servaes was alluding to, but got wrong in a first comment) $f_a(x)$ with $a(x) = \dfrac12 v_2(f(x))-1$. A more standard approach, as noted by reuns, and used in previous questions of yours, is just $a(x) = v_2(f(x))$. And here you tried $a(x) = v_2(f(x))-r$ for $r=0,1,2$ already.

If next time you choose $a \equiv 5000$, you can of course argue heuristically that the real absolute value of iterations of $f_a$ goes to infinity which heuristically might preclude cycles. Or you choose $a(x) := \min(v_2(f(x)), -317, v_2(x+99))$ to argue heuristically that iterations of $f_a$ become smaller, i.e. converge, which heuristically prevents Collatz sequences from going to infinity. The problem would be that in each case, the heuristic is nonsense, and real absolute values of $f_a(x)$, as well as everything else that distinguishes $f_a$ from $f$, say nothing, nothing about the Collatz problem.