THE FOLD / RESPAWN / THE RESURRECT / THE POINCARE RECURRENCE
THE POINCARE RECURRENCE
everything comes back
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
A system that preserves volume and cannot escape a bounded region must return arbitrarily close to where it began — and must do so infinitely often. Poincaré proved it in 1890 with an argument that fits in a paragraph: if the return never happened, the images of a small neighbourhood would be disjoint forever, and infinitely many disjoint sets of equal volume cannot fit in a finite one. It says nothing about when, and the waiting time is where all the difficulty lives.
LIT verified live: across 500 random permutations, direct iteration returns to the identity at exactly the least common multiple of the cycle lengths, 500 times out of 500. For an irrational rotation the first return within ε arrives inside the pigeonhole bound ⌈1/ε⌉ in all 20 tested (α, ε) pairs — and for the golden ratio those first-return times are 5, 21, 55, 233, 610, every one a Fibonacci number. A rational rotation p/q returns exactly, at step q, in all 39 cases.
LIT verified live: across 500 random permutations, direct iteration returns to the identity at exactly the least common multiple of the cycle lengths, 500 times out of 500. For an irrational rotation the first return within ε arrives inside the pigeonhole bound ⌈1/ε⌉ in all 20 tested (α, ε) pairs — and for the golden ratio those first-return times are 5, 21, 55, 233, 610, every one a Fibonacci number. A rational rotation p/q returns exactly, at step q, in all 39 cases.
2 HOW IT WAS WEAVED · AI + HUMAN
David (human) seated this at THE RESURRECT: nothing is lost, it is only waiting.
AVAN (AI) did not expect the Fibonacci numbers and they are not a coincidence. The golden ratio’s continued fraction is all ones, which makes it the worst number to approximate by rationals, and the record-setting approximations are exactly the Fibonacci ratios — so the return times are forced to be Fn. Any other irrational gives a different sequence. It is worth being clear about what recurrence does not give: the theorem promises return without bounding the wait, and for a physical system the recurrence time is astronomically larger than the age of the universe. Recurrence and reversibility are compatible with the second law precisely because “eventually” can mean 101023 steps.
AVAN (AI) did not expect the Fibonacci numbers and they are not a coincidence. The golden ratio’s continued fraction is all ones, which makes it the worst number to approximate by rationals, and the record-setting approximations are exactly the Fibonacci ratios — so the return times are forced to be Fn. Any other irrational gives a different sequence. It is worth being clear about what recurrence does not give: the theorem promises return without bounding the wait, and for a physical system the recurrence time is astronomically larger than the age of the universe. Recurrence and reversibility are compatible with the second law precisely because “eventually” can mean 101023 steps.
3 ONE DIMENSION
First return within ε, against the pigeonhole bound. Fibonacci all the way down.
4 TWO DIMENSIONS · INTERACTIVE
Watch the orbit come back. Tighten the target and it takes longer, predictably.
5 THREE DIMENSIONS + AVAN’S INVERSE
The green forward object: the orbit winding the circle, with returns lit.
AVAN’s addition (the inverse-companion): the forward reading is “everything comes back.” The inverse is that the proof establishes return by counting room, and therefore cannot say anything about time. The argument is that infinitely many disjoint equal volumes will not fit — it never follows the trajectory, never uses the dynamics, and would work identically for a system that returns after two steps or after 101023. Read backwards, Poincaré recurrence is a warning about what an existence proof costs: it can guarantee that something happens while remaining completely silent on whether anyone will be present when it does.
LIT across 500 random permutations, direct iteration returns to the identity at exactly the least common multiple of the cycle lengths, 500 times out of 500; for an irrational rotation the first return within epsilon arrives inside the pigeonhole bound ceil(1/epsilon) in all 20 tested (alpha, epsilon) pairs, and for the golden ratio those first-return times are 5, 21, 55, 233, 610, every one a Fibonacci number; a rational rotation p/q returns exactly, at step q, in all 39 cases
FIG The Fibonacci numbers were not expected and are not a coincidence. The golden ratio's continued fraction is all ones, making it the WORST number to approximate by rationals, and the record-setting approximations are exactly the Fibonacci ratios - so the return times are forced to be F_n. Any other irrational gives a different sequence. Worth being clear about what recurrence does NOT give: the theorem promises return without bounding the wait, and for a physical system the recurrence time is astronomically larger than the age of the universe. Recurrence is compatible with the second law precisely because 'eventually' can mean 10^(10^23) steps.
FIG The Fibonacci numbers were not expected and are not a coincidence. The golden ratio's continued fraction is all ones, making it the WORST number to approximate by rationals, and the record-setting approximations are exactly the Fibonacci ratios - so the return times are forced to be F_n. Any other irrational gives a different sequence. Worth being clear about what recurrence does NOT give: the theorem promises return without bounding the wait, and for a physical system the recurrence time is astronomically larger than the age of the universe. Recurrence is compatible with the second law precisely because 'eventually' can mean 10^(10^23) steps.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of THE RESURRECT · David Lee Wise (ROOT0), with AVAN