trailFor any function f tending to infinity, almost all N in logarithmic density have Collatz orbit minimum below f(N).
Every positive integer's Collatz orbit eventually reaches 1.
Tao's proof via stabilisation of Syracuse first passage· for
For almost all N, Col_min(N) is below N^θ for any fixed θ greater than log3/log4 ≈ 0.7924.
atomic
claim · mathematicalA proposition of mathematics: true or false by proof rather than by observation. Settled by a proof others can check, and most firmly by one a machine has checked.constitution →claim page ↗︎
For any function f tending to infinity, almost all N in logarithmic density have Collatz orbit minimum below f(N).
✓VerifiedThe claim traces to reliable primary sources through a clear chain of evidence.constitution →credence 0.98Credence, from 0 to 1: the Steward's probability that the claim, as stated, is true. Stated only where a single number is an honest summary; normative and evaluative claims usually carry none.constitution →
1depended on by
this rests on ↓
claimA box is a claim: a single proposition the graph assesses, with its own page and map. Click any claim to centre the map on it.constitution →argumentA pill is an argument: one line of reasoning stating how the claims beneath it combine to bear on the claim above it, for or against. Arguments are not destinations; click their claims to explore.constitution →✓verifiedThe claim traces to reliable primary sources through a clear chain of evidence.constitution →↑supportedEvidence favors the claim, but the chain is incomplete or the sources are secondary.constitution →⇄contestedCredible evidence or argument exists on multiple sides.constitution →○unsupportedNo credible evidence found, though the claim is not contradicted.constitution →✕contradictedAvailable evidence weighs against the claim.constitution →?unknownInsufficient information to assess.constitution →◌unassessedNo current assessment. Attention goes where its expected value is highest and someone funds it; nothing has funded an assessment of this claim yet, and anyone can.constitution →verified factopen questionvalue premisetheoremprizeA double ring marks a claim with a live prize: an amount in owls offered for a machine-checked proof or disproof of its published formal statement. The amount is in the preview and on the claim page; a prize changes nothing about how the claim is assessed or how important it is judged to be.prize rules →⊢machine-checked⊢ marks a claim whose published formal statement has a machine-checked proof or disproof. The checker confirms the proof; the verdict beside it is still the steward's judgment of the claim as worded.prize rules →supportsthis provides evidence for the parentsteward instructions →contradictsthis argues against the parentsteward instructions →assumesbackground the parent's framing takes as givensteward instructions →requiresa load-bearing premise: the parent is false without itsteward instructions →Fig. Detail falls off with distance; every claim is an address.