There is a newer version of the record available.

Published March 7, 2026 | Version v39
Preprint Open

交代二進表記とコラッツ相表現によるコラッツ予想の有限帰着

Description

本稿では,コラッツ反復を数値軌道の追跡としてではなく,\textbf{有限レンジの局所書換え過程}として解析し,有限帰着の形で整理する枠組みを与える.

交代二進表記(ABN)とコラッツ相構造表現(CPE)を用い,

加速奇数写像 $F(n)=(3n+1)/2^{v_2(3n+1)}$ の1ステップ更新が

CPE列の\textbf{定数サイズ窓}に局在する書換えの合成として記述できることを示す.

この局所性に基づき,鎖個数 $\mu$,鎖長総和 $H_{CS}$,節長総和 $H_K$,

全長 $B=H_{CS}+H_K$ などの構造量の増分が普遍定数による不等式で拘束されることを導く.

その結果,高$\mu$領域(特に $\mu\ge4$)は有限回の反復で低$\mu$領域($\mu\le3$)へ移行する.

残る $\mu\le 3$ の範囲は有限状態空間への捕獲として扱われ,

決定的な有限検査により,既知の終端ループ(加速写像では $1$ のみ)への帰着が確認される(付録F).

本手法は密度論的結果や部分結果(例:\cite{Lagarias2010,Wirsching1998,Tao2019})とは異なり,

構造量の不等式評価と有限検査仕様の組合せに基づいて議論を組み立てる.

加えて,本稿には証明の依存関係を明確化するための Lean 補助付き証明構造を付しており,

全単射,局所書換え/局所性,構造量不等式,高 $\mu$ 降下,および低 $\mu$ 有限探索への還元インターフェースを,相対的形式化として整理している.

さらに,同様の局所性思想は $3n-1$ 型写像にも適用でき,

負の整数領域に対応する挙動についても有限個のループへの収束を示す.

Notes

今回の更新では,証明構造に対する Lean 対応を追加した.
具体的には,全単射(Bijection),CPE の局所キャリー/局所性,構造量不等式,高 \mu 降下,および低 \mu 有限探索への還元インターフェースを,Lean 上で相対的形式化として整理した.

Notes

有限探査プログラムなどを追加ファイルとして、公開しました。

ABN/CPE変換と構造量(paiza)
https://paiza.io/projects/DojCBMKPHNHM10zjY5-SXw

3n+1の有限探査プログラム(paiza)
https://paiza.io/projects/V-6CJEy2ev6_QzhO-tLmWw

3n-1の有限探査プログラム(paiza)
https://paiza.io/projects/mNaosdaAJoZHuWGdQpiTkg

Files

Main_CPE_Collatz_v48.pdf

Files (834.1 kB)

Name Size Download all
md5:076199dab49c9c3ed532a2fab0b3d843
2.7 kB Download
md5:bd01db14aad3e4faae21de6479b891ee
1.9 kB Download
md5:ba2802477cdaca8df797087d48a4bbd9
1.2 kB Download
md5:d5d3a778a197ef96a9ef1ca6fdc4919f
3.7 kB Download
md5:7dc5d1005020bfa3bb1b0fe8cf789e9d
3.5 kB Download
md5:33373bb40d84e44249e56b2ac157e4c3
2.2 kB Download
md5:db5205250347593313a8a444db461866
2.0 kB Download
md5:82000653ec989cd5d553c61658fc0b69
843 Bytes Download
md5:1143e171989e04ff78eaaf4b2eb8fe41
4.5 kB Download
md5:3f2999d11305af579c6ea2ae710d693a
1.0 kB Download
md5:69a9b4dc034767694777b558e3ff0014
5.2 kB Download
md5:d5d02d0fc5311510aa944ad8bb7e92ad
4.2 kB Download
md5:aa3ab24e11b9c613005bc12a7372e93f
1.0 kB Download
md5:296ce2b81dc603e38aee9a536a97d9c6
4.3 kB Download
md5:4da8769933f5000fa1b63da7bc81ed62
1.8 kB Download
md5:606401dcc8dfc848e5d6f5af3cd94570
2.7 kB Download
md5:a7d5326cfad05628ce06734dd639f29e
1.5 kB Download
md5:f3b4f1b803386cea142f7a738c016bdb
3.0 kB Download
md5:1cfb35e88920b2a32b4384ed9a3ae96c
1.5 kB Download
md5:d0182f76c529e24e45195868f78aa2ec
5.6 kB Download
md5:be2576489710d64ccb68ddcc9f87cf06
1.7 kB Download
md5:6b612d1a787a8c974dee28194a8c9c13
1.9 kB Download
md5:b2267274b84bec26b24d4acce23eae4e
1.9 kB Download
md5:818874fc4a283da95c019e8e3fee5ea1
2.3 kB Download
md5:ae42251dc42e8b65bcb48dcdb6428b1f
1.7 kB Download
md5:fb6981650ca9cc64c27b37f13b1b7f66
2.0 kB Download
md5:7125167edf89b26729831166bf572438
6.2 kB Download
md5:21931fe7ff04d8275dfdd4f150a7b974
5.9 kB Download
md5:b6165792121835f31758f8a675bd6f4a
9.9 kB Download
md5:6a041db866dacd48878ad645a5cc0eeb
673 Bytes Download
md5:3ef3ffc8992ba2261c6f377373f595af
759 Bytes Download
md5:f2c53884f2815686c167715bb7fab2ef
2.0 kB Download
md5:0f805ca88578f94d8452003798946f14
1.1 kB Download
md5:8eb313f3e2332c0c640113540e9d4ebf
1.1 kB Download
md5:a56f6e1da4d32128cdc8caa935a14472
822 Bytes Download
md5:410cc28a0ff42ab816641fc9b7196399
1.3 kB Download
md5:0e15c2233ecdebd8bfabcffd9a33cdda
1.6 kB Download
md5:4ca28ed3dd8169821e2b612215190f81
931 Bytes Download
md5:179e2562e4dfaab9396d39f5fd975b0b
931 Bytes Download
md5:a43b1b69722ddd2b9e51d891a77af9ad
770 Bytes Download
md5:d1b58ad7ce7ddbf9b0bc463d8b25c28f
2.2 kB Download
md5:9d13ddd643e907146e7d1601e95221b4
897 Bytes Download
md5:4b9a547a51f6304fde4ae91d34ccb94c
897 Bytes Download
md5:1a72597758a079c113dc06440f8ea059
850 Bytes Download
md5:f5e9c7abc8bca4e24b6ed6d1c02314f1
850 Bytes Download
md5:139ef013f47daeff0e16cbf0172927f1
1.8 kB Download
md5:98b74473cd8c4a62b7c03c86825584a9
649.5 kB Preview Download
md5:15333c422d4aa1fc99f854230e9d79bc
242 Bytes Download
md5:5ef477ccb5617090779d80879f329857
228 Bytes Download
md5:fccc59f21f9424d56a17957a7c72ccb3
2.4 kB Download
md5:1eb921c7dba09ee72f06987607f9a1f6
2.6 kB Download
md5:02bf3a593f10f35863bca4929d5140d6
4.7 kB Download
md5:0440e8b46bfa4b580528a8a1ad6e79ea
2.1 kB Download
md5:faf7642ec60696f02da8ba30617906e1
2.5 kB Download
md5:dac1dfe5dd46b85ad6c2347685d23fc9
3.2 kB Preview Download
md5:0f86dd80e756dbf337cd1c899bc8dc14
3.0 kB Download
md5:0ba76bc8f427327e9d33f38539e207b3
5.6 kB Download
md5:368226a38284abc002bd0eee327df300
1.2 kB Download
md5:040aa35ca575a0a947441605bf29e53c
5.8 kB Download
md5:beff2f4bb193a21879d3e8fe20c1e5d6
1.5 kB Download
md5:a7137efdbe37925d13d4a128c7f45240
1.4 kB Download
md5:ce460121dd8a4b703c00bfcf15d794fb
1.4 kB Download
md5:a0f4ea373bae625c538cb2190e624de1
339 Bytes Download
md5:4269d306f79f5b9b96066c13e58362ef
5.8 kB Download
md5:84e0794e9c33fcf65ffe58180e2daebc
2.0 kB Download
md5:98e9ae44fe5a9c150f8dd9440a13e667
2.6 kB Download
md5:397e92defcc8f18128c96dfbb0993eaa
4.6 kB Download
md5:71ff88ba83975973c5aa135b7dd9ddab
3.6 kB Download
md5:828dac682ce4c7ef33560422e0a079f8
1.4 kB Download
md5:7793265eb47e6e2b874564f77c50a6c8
2.8 kB Download
md5:1585e9eb579bd7aba948b2d939476259
3.8 kB Download
md5:9ecf9e937da7e54d79288c7b2ecd4795
1.4 kB Download
md5:90e9369d73465ac6f0ccdb439a4c2b70
943 Bytes Download
md5:42b1b6cfc97146102113797b706beae7
2.6 kB Download
md5:6ef3a9c42657f2127dde47f905870fea
4.7 kB Download
md5:18f69ecbe06c5f1d92dcf897607d6a3c
318 Bytes Download
md5:2c26209e683208732297e5d60fc81081
2.4 kB Download

Additional details

Related works

Is supplement to
Preprint: 10.17605/OSF.IO/TXZYA (DOI)

Dates

Issued
2025-08-28

References

  • L. Collatz, "On the motivation and origin of the (3n+1)-conjecture," J. Graph Theory, 10 (1986), 585-585.
  • J. C. Lagarias, "The 3x+1 problem and its generalizations," Amer. Math. Monthly, 92 (1985), 3-23.
  • R. K. Guy, Unsolved problems in number theory, Springer Science & Business Media, 2004.
  • M. Chamberland, "A guide to the Collatz conjecture," Math. Intelligencer, 28 (2006), 26-32.
  • D. Barina, "The 3x+1 Problem: A Computational Verification up to 268," arXiv preprint arXiv:2009.08353, 2020.
  • A. Altassan and M. Alan, "Mersenne Numbers in Generalized Lucas Sequences," C. R. Acad. Bulg. Sci., 77 (2024), 3-10.
  • Y. Soykan, "A Study on Generalized Mersenne Numbers," J. Progr. Res. Math., 18 (2021), 90-108.
  • R. Chergui, "Ge ̀ne ̀ralisation du The ́ore ̀me de Zeckendorf," arXiv:2403.17292 [math.NT], 2024.
  • A.~Avizienis, \newblock Signed-digit number representations for fast parallel arithmetic, \newblock \emph{IRE Transactions on Electronic Computers} \textbf{EC--10} (1961), 389--400.
  • G.~W.~Reitwiesner, \newblock Binary arithmetic, \newblock \emph{Advances in Computers}, Vol.~1, Academic Press, 1960, pp.~231--308.
  • G.~J.~Wirsching, \newblock \emph{The Dynamical System Generated by the $3n+1$ Function}, \newblock Lecture Notes in Mathematics, Vol.~1681, Springer, 1998.
  • Y.~Ueoka,T.~Hyuga~,H.Y~amadori, \emph{A Resolution of the Collatz Conjecture via Collatz Phase Expression (CPE)}, Zenodo, 2025. DOI: \href{https://doi.org/10.5281/zenodo.18025034}{10.5281/zenodo.18025034}.
  • E.~Zeckendorf, \newblock Repr\'esentation des nombres naturels par une somme de nombres de Fibonacci ou de nombres de Lucas, \newblock \emph{Bull.\ Soc.\ Roy.\ Sci.\ Li\`ege} \textbf{41} (1972), 179--182.
  • T.~Koshy, \newblock \emph{Fibonacci and Lucas Numbers with Applications}, \newblock Wiley-Interscience, 2001.
  • T.~Tao, \newblock Almost all orbits of the Collatz map attain almost bounded values, \newblock \emph{Forum of Mathematics, Pi} \textbf{10} (2022), e12.
  • A.~Avizienis, \newblock Signed-digit number representations for fast parallel arithmetic, \newblock \emph{IRE Trans.\ Electronic Computers} \textbf{EC-10} (1961), 389--400.
  • J.~A.~Solinas, \newblock An Improved Algorithm for Arithmetic on a Family of Elliptic Curves, \newblock Technical Report CORR 97-18, University of Waterloo, 1997.