Uloženo v:
| Hlavní autor: | |
|---|---|
| Médium: | Recurso digital |
| Jazyk: | angličtina |
| Vydáno: |
Zenodo
2025
|
| Témata: | |
| On-line přístup: | https://doi.org/10.5281/zenodo.17060799 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
Obsah:
- <p>I published different aspects of the problem earlier, analyzed from different perspectives. This article consolidates those approaches into a single structural framework, yielding a complete proof of the Collatz conjecture. The proof is based on the inverse Collatz map. Instead of analyzing forward trajectories under the map C(n), we study the inverse expansion P, which has the same edges as the standard function graph G but with reversed interpretation. The analysis establishes four structural pillars: unique parenthood—every node in P has exactly one parent. Unicyclicity: the only directed cycle is the root cycle {1,2,4}, identified via the unique back edge (1,4). Root component: This cycle is inward closed and serves as the unique root component of P. Completeness: By closure of components and uniqueness of the back edge, no other component can exist; thus, P spans all of N⁺. Together these results prove that P is a unicyclic digraph whose root component contracts to a rooted tree covering all positive integers. Reinterpreted from end to start, all paths in P correspond exactly to orbits in G. Thus every Collatz orbit reaches 1 and then enters the cycle {1,2,4}.</p>