Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Statement

Setting (p. 1). Φ\Phi is the permutation of the 2-adic integers Z2\mathbb Z_2 matching the expansions Q=2d0+2d1+⋯Q=2^{d_0}+2^{d_1}+\cdots and N=−132d0+−192d1+−1272d2+⋯N=\frac{-1}{3}2^{d_0}+\frac{-1}{9}2^{d_1}+\frac{-1}{27}2^{d_2}+\cdots over a common increasing sequence 0≤d0<d1<⋯0\le d_0<d_1<\cdots, with N=Φ(Q)N=\Phi(Q); see the conjecture's page for the full definition.

Maps (p. 2). H(Q)=Q/2H(Q)=Q/2 if QQ is even and H(Q)=Q−1H(Q)=Q-1 otherwise; C(N)=N/2C(N)=N/2 if NN is even and C(N)=3N+1C(N)=3N+1 otherwise. Both act on Z2\mathbb Z_2, parity being that of the 2-adic integer.

Theorem 1 (p. 2): "C(Φ(Q))=Φ(H(Q))C(\Phi(Q)) = \Phi(H(Q))."

The print states the identity with no quantifier; its proof treats an arbitrary Q∈Z2Q\in\mathbb Z_2, so the identity holds for every 2-adic integer QQ. The paper notes (p. 2) that this conjugacy is equivalent to Theorem 1 of Akin's unpublished manuscript 3x+13x+1, and that Φ\Phi is exactly the inverse of the map Q∞Q_\infty of Lagarias's 1985 survey.

Proof pointer

Direct computation from the expansions (p. 2). If QQ is even, every exponent in dd is positive (or dd is empty), and halving the expansion (2) of Φ(Q)\Phi(Q) lowers every exponent by one, which is the expansion of Φ(Q/2)\Phi(Q/2). If QQ is odd, d0=0d_0=0, and 3Φ(Q)+13\Phi(Q)+1 cancels the leading term and shifts the coefficients −1/3i+1-1/3^{i+1} down one place, giving the expansion of Φ(Q−1)\Phi(Q-1).

Read depth

Claims checked: the statement and the definitions of HH and CC were read on the page images of the print, and the proof was followed. A second reader checked the statement, hypotheses, label and page against the print; the proof was not independently reviewed.

Dependencies

The definition of Φ\Phi (p. 1).

Source. Daniel J. Bernstein, A non-iterative 2-adic statement of the 3N+13N+1 conjecture, Proceedings of the American Mathematical Society 121 (1994), 405--408. Pages are those of the author's typescript named on the source card, numbered 1--4 rather than by the journal's pagination.

Bears on

  • Problem 1135: the identity turns iteration of the Collatz map CC into iteration of HH under the change of variable Φ\Phi, and is the step behind Theorem 2 and Theorem 3. It says nothing by itself about whether orbits reach 11.