trailEvery positive integer's Collatz orbit eventually reaches 1.
Computational verification· for
Every positive integer up to 2^71 has a Collatz orbit reaching 1, verified by computation.
atomic
Almost-all and density theorems· for
For almost all N in natural density, the Collatz orbit of N drops below N.
The map assigning to each residue class modulo 2^k its first k Collatz parities is a well-defined bijection onto the 2^k parity patterns.
For almost all N, Col_min(N) is below N^θ for any fixed θ greater than log3/log4 ≈ 0.7924.
For any function f tending to infinity, almost all N in logarithmic density have Collatz orbit minimum below f(N).
For all sufficiently large x, more than x^0.84 integers up to x have Collatz orbits reaching 1.
The 3x+1 counting functions restricted to residue classes modulo 3^k satisfy Krasikov's system of difference inequalities.
The only cycle of the Collatz map on the positive integers is the trivial cycle 1, 4, 2.
atomic
No positive integer has an unbounded Collatz trajectory.
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 ↗︎
Every positive integer's Collatz orbit eventually reaches 1.
↑SupportedEvidence favors the claim, but the chain is incomplete or the sources are secondary.constitution →credence 0.88Credence, 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 →
Nothing in the graph builds on this claim yet.
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.