A D V E R T |
I S E M E N T |
| Math Sites: lean ages 13-∞ readme referees parents | >>> MAITH GAMES <<< | all 372 compute stand |
|
LEVEL 1 OF 1 · Banach's simple Lebesgue-spectrum problem
A smooth three-torus diffeomorphism with simple Lebesgue spectrum
expertly designed by an internal OpenAI model · released 2026-09-23
· original PDF
IntroductionLet \(\mathbb T=\mathbb R/\mathbb Z\), let \(\mu\) be normalized Lebesgue measure on \(\mathbb T^3\), and put \(\mathop{\mathrm{e}}(t)=\exp(2\pi i t)\). For an invertible measure-preserving transformation \(T\), we use the convention \(U_Tg=g\circ T\). The closed subspace of complex square-integrable functions of integral zero is denoted by \(L^2_0(\mathbb T^3,\mu)\). On a probability space the constants form an invariant subspace, so the probability-preserving form of Banach’s simple Lebesgue-spectrum problem asks for an invertible transformation whose Koopman operator on the entire orthogonal complement of the constants is unitarily equivalent to multiplication by \(w\) on \(L^2(S^1,m)\), where \(m\) is normalized Haar measure. Equivalently, that restriction has a bilateral orthonormal orbit which is complete. We realize this spectral model with the standard smooth volume on a compact manifold. Theorem 1. There exist a \(C^\infty\) volume-preserving diffeomorphism \(T\colon\mathbb T^3\to\mathbb T^3\) and a real function \(f\in L^2_0(\mathbb T^3,\mu)\) such that \[\{f\circ T^n:n\in\mathbb Z\}\] is an orthonormal basis of \(L^2_0(\mathbb T^3,\mu)\). Consequently \(T\) is ergodic, and \(U_T\) on this space is unitarily equivalent to multiplication by the coordinate \(w\) on \(L^2(S^1,m)\). The invariant measure in Theorem 1 is the standard smooth volume itself. The generator \(f\) is only required to belong to \(L^2\). In particular, the assertion concerns the whole mean-zero space, including both its spectral type and its multiplicity. Section 6 derives mixing, zero entropy, and vanishing Lyapunov exponents. Mixing of every order uses, in addition, the separate multiple-mixing theorem of (OpenAI 2026). The formulation above is distinct from the historical real-line question recorded by Ulam and attributed to Banach (Ulam 1960, sec. 6, p. 76). Rokhlin asked for ergodic automorphisms with simple, or at least finite-multiplicity, Lebesgue spectrum (Rokhlin 1949, sec. 4, no. 7, p. 107). Helson and Parry constructed cocycles over aperiodic probability-preserving transformations whose associated unitary operators have Lebesgue spectrum (Helson and Parry 1978, 196, Theorem (a)). Mathew and Nadkarni constructed a probability-preserving transformation with a Lebesgue component of multiplicity two (Mathew and Nadkarni 1984). Guenais connected the Morse-cocycle question with flat polynomials and constructed a countable abelian group action with simple spectrum of mixed discrete and Haar type (Guenais 1999). These results distinguish a Lebesgue component, or a related group action, from one bilateral Lebesgue orbit spanning the whole centered space. Simple spectrum in smooth dynamics was already achieved by Fayad, who constructed \(C^\infty\) volume-preserving torus diffeomorphisms with simple spectrum (Fayad 2001); that result did not assert Lebesgue spectral type. In another setting, an infinite-measure conservative transformation with simple Lebesgue spectrum is presented in (Abdalaoui 2023, Theorem 2.2); the probability-space conclusion does not follow from it. Theorem 1 gives that conclusion for the full mean-zero space of a smooth probability-preserving map. Related existence results in continuous time have different spectral consequences. Prikhod’ko constructs a finite-measure flow with simple Lebesgue spectrum (Prikhod’ko 2020, Theorem 3). In the smooth category, Fayad, Forni and Kanigowski obtain a real analytic conservative flow on \(\mathbb T^2\) with one singularity and countably infinite Lebesgue multiplicity (Fayad et al. 2021, Theorem 1); Abdedou, Fayad and Kessi obtain real analytic reparametrizations of minimal translation flows on \(\mathbb T^5\) with the same multiplicity (Abdedou et al. 2023, Theorem 1.1). Taking a nonzero time map of a simple Lebesgue flow yields countably infinite multiplicity: its spectral model is multiplication by \(\mathop{\mathrm{e}}(t\xi)\) on \(L^2(\mathbb R,\,\mathrm d\xi)\), and the substitution \(\xi=(x+k)/|t|\), with \(x\in[0,1)\) and \(k\in\mathbb Z\), gives one Lebesgue copy for each \(k\). Thus these continuous-time results do not supply Theorem 1. Successive smooth changes of coordinates have a substantial history in smooth dynamics, including the approximation-by-conjugacy constructions of Anosov and Katok (Anosov and Katok 1970). We use explicit volume-preserving passages between integrable twists rather than an external conjugacy theorem. Their quantitative spectral-density transport, and the finite Fourier signals built on it, are proved below. The constructionThe approximating maps are integrable twists. In a volume-preserving coordinate system on the torus, they have the form \[S(\theta,u,a)=(\theta+\phi(u),u,a),\] where \(\phi\) is a smooth real circle function that is strictly increasing on an arc whose complement can be made arbitrarily short. A finite angular Fourier expansion supported on that arc has an explicit absolutely continuous spectral measure. We refer to its individual harmonics as packets, and keep a finite label, or color, on disjoint groups of packets. The colors carry the coefficients of an observable that we want to approximate by translates of a single vector. There are three steps. A slow passage in the coordinate \(u\) replaces the twist by an arbitrarily close twist whose angular coordinate is the old \(u\). Stationary phase locates the new angular indices and determines the spectral density at a much finer scale. The spare coordinate \(a\) supplies a small adjustable variation in the speed (the jitter). A large integer added to the lift of \(\phi\) separates the angular indices of different packets without changing the old map. This separation is what allows later perturbations to distinguish colors even when their temporal spectra overlap. Next, a positive Fourier construction and a finite prime sieve produce a small sinusoidal bias in each color density. Its coefficient depends on the normalized angular index. A neutral passage between successive biased passages makes residue classes carry equal shares of each color. The bias strength can be chosen before the angular scale grows; the passage parameter is then free to enforce any required smooth or spectral accuracy. Finally, many small biases are grouped into blocks. If color \(r\) has spectral density \(p_r\) and target coefficient \(b_r\), the center at a temporal frequency \(z\) is the density-weighted mean \[p(z)=\sum_r p_r(z),\qquad \beta(z)=\frac{\sum_r b_rp_r(z)}{p(z)}\quad(p(z)>0).\] Centering each block at a smooth approximation to this current mean makes the loss in \(\int\sqrt p\) quadratic in the block’s strength budget, while the same block provides an estimator of the color label. Repetition makes prediction arbitrarily accurate with arbitrarily little loss in \(\int\sqrt p\). This separation of the two estimates is the central finite construction. When the vector’s norm is close to one, keeping \(\int\sqrt p\) close to one makes whitening a small change in physical \(L^2\), while restoring the spectral density exactly to one. A diagonal limit preserves the orthonormal orbit and makes its span contain every member of a dense family of observables. Order of the proofSection 2 proves the analytic passage rules, including the comparison of jitter laws along a rapidly oscillating phase. Section 3 constructs the positive laws that transmit the small biases. Section 4 proves the finite prediction result, and Section 5 prepares arbitrary observables and takes the smooth limit. Section 6 derives the dynamical consequences. Every passage acts on finite data. Its integer parameter is chosen last, after the current coordinate chart, cutoffs, jitter, and all desired error bounds have been fixed. No uniform bound on the number of packets or on the derivatives of successive coordinate charts is assumed. Smooth passages and spectral densitiesA volume-preserving coordinate system, also called a chart below, means a smooth volume-preserving identification of the physical torus with \(\mathbb T^3\). All coordinate systems in the construction preserve normalized volume. An intermediate transformation has the form \[ S(\theta,u,a)=(\theta+\phi(u),u,a), \qquad (\theta,u,a)\in\mathbb T^3, \tag{1}\] where \(\phi\in C^\infty(\mathbb T;\mathbb R)\) has \(\phi'>0\) on an open arc \(I\). We call \(I\) a good arc. Derivatives on an arc are understood in an increasing real lift of that arc. A packet is a function \(A(u,a)\mathop{\mathrm{e}}(m\theta)\), where \(m\in\mathbb Z\setminus\{0\}\) and \(A\) is smooth with compact support in \(I\times\mathbb T\). A finite packet list is disjoint if, for any two entries with the same \(m\), their coefficient supports are disjoint. Entries with different \(m\) need no support restriction. Packets may be grouped into colors; we write \(F_r\) for the sum of color \(r\). Disjointness implies \[ \langle U_S^n F_r,U_S^k F_l\rangle=0 \quad(r\ne l,\ n,k\in\mathbb Z). \tag{2}\] Indeed \(U_S^n(A\mathop{\mathrm{e}}(m\theta))=\mathop{\mathrm{e}}(nm\phi(u))A\mathop{\mathrm{e}}(m\theta)\), and either angular orthogonality or disjoint coefficient supports applies. The spectral measure of one packet is \[ (m\phi\bmod1)_*\bigl(|A(u,a)|^2\,\mathrm du\,\mathrm da\bigr). \tag{3}\] It has a smooth density because its coefficient support is compactly inside the good arc. We use the inner product linear in its first variable, so a vector of density \(p\) has \(\langle U_S^nF,F\rangle=\int_\mathbb T\mathop{\mathrm{e}}(nz)p(z)\,\mathrm dz\). A measurable spectral multiplier \(v(z)\) acts on its coefficient by multiplication by \(v(m\phi(u)\bmod1)\), whenever the result belongs to \(L^2\). These statements follow directly from the displayed formula for \(U_S^n\), first for trigonometric polynomials and then by \(L^2\) approximation. The pushforward formula, absolute continuity, and multiplier rule also apply to nonsmooth coefficients in \(L^2\) supported in the good arc; their densities need not be smooth. For later comparisons, if two vectors have spectral densities \(p_F,p_G\) for the same transformation, then \[ \|p_F-p_G\|_1 \le (\|F\|_2+\|G\|_2)\|F-G\|_2. \tag{4}\] To see this, test their spectral measures against an arbitrary function of absolute value at most one and use the contraction property of its spectral multiplier. The total variation norm here and below is the \(L^1\) norm of densities, without a factor \(1/2\). Lemma 2 (Passage). Fix (1), its physical volume-preserving coordinate chart, and a finite disjoint packet list. Choose a positive integer \(c\) so large that the compact ranges \(m(c+\phi(\mathbb T))\), for the distinct old indices \(m\), are pairwise disjoint and avoid zero. Set \(V=c+\phi\). Fix \(J\in C^\infty(\mathbb T;\mathbb R)\) with \(J'>0\) on an open arc \(I'\) and fix \(0\le\psi\le1\) in \(C_c^\infty(I')\). For integers \(N\to\infty\), choose \(\Delta_N\) so that \[ |\Delta_N|\le N^{-1},\qquad k_N:=N\left(\int_\mathbb TV(u)\,\mathrm du+\Delta_N\right)\in\mathbb Z, \qquad H_N'=N(V+\Delta_N). \tag{5}\] Put \(\sigma_N(a)=N^{-1}+N^{-2}J(a)\). Then \[ T_N(\theta,u,a)= \bigl(\theta+H_N(u+\sigma_N(a))-H_N(u),\, u+\sigma_N(a),\,a\bigr) \tag{6}\] is a volume-preserving smooth torus diffeomorphism, and both \(T_N\) and \(T_N^{-1}\) converge smoothly to \(S\) and \(S^{-1}\), also in the fixed physical coordinates. In the new coordinates \[ (\theta',u',a')=C_N(\theta,u,a) =(u,a,\theta-H_N(u)), \tag{7}\] it is the twist of speed \(\sigma_N\) and good arc \(I'\). Here are its packet and density properties. For an old packet indexed by \(\alpha\), with index \(m_\alpha\) and amplitude \(A_\alpha\), define \[ E_\alpha=\{(m_\alpha V(u),a):(u,a)\in\mathop{\mathrm{supp}}A_\alpha\}. \tag{8}\] One may choose pairwise disjoint, arbitrarily small fixed neighborhoods of these compact sets, and smooth cutoffs \(\chi_\alpha(s,a)\) supported in those neighborhoods and equal to one near \(E_\alpha\). Retain the finitely many new packets \[\begin{align*} G_{\alpha,j}(\theta',u',a') &=\mathop{\mathrm{e}}(j\theta')\mathop{\mathrm{e}}(m_\alpha a') \psi(u')\chi_\alpha(j/N,u')C_{\alpha,j}(u'), \tag{9}\\ C_{\alpha,j}(a) &=\int_\mathbb TA_\alpha(u,a)\mathop{\mathrm{e}}(m_\alpha H_N(u)-ju)\,\mathrm du. \tag{10}\end{align*}\] All their angular indices are nonzero for sufficiently large \(N\). For each \(\alpha\), \[ \left\|\sum_jG_{\alpha,j}\circ C_N -\psi(a)A_\alpha(u,a)\mathop{\mathrm{e}}(m_\alpha\theta)\right\|_2=o(1). \tag{11}\] They are disjoint as packets, and their moduli are independent of the new spare coordinate \(a'\). Every constant attached to an old packet is preserved by this linear transport and these cutoffs. For a single old packet write, with zero extension outside its branch, \[ W(s,a)=\frac{|A(u,a)|^2}{|m\phi'(u)|},\qquad s=mV(u). \tag{12}\] Let \(K(s,y)\) be the density of the pushforward of \(W(s,a)\psi(a)^2\,\mathrm da\) under \(a\mapsto sJ(a)\). It is continuous and compactly supported in \((s,y)\), with its \(s\) support away from zero. For any fixed positive integer \(P\) and residue \(h\pmod P\), the unfolded temporal density of the retained packets with \(j\equiv h\pmod P\) differs in \(L^1(\mathbb R)\) by \(o(1)\) from \[ Q_{N,h}(t)=\sum_{k\in\mathbb Z}K(t,Nt-h-kP). \tag{13}\] Consequently their density on \(\mathbb T\) differs in \(L^1(\mathbb T)\) by \(o(1)\) from \(\sum_{l\in\mathbb Z}Q_{N,h}(z+l)\). The assertions hold after summing over any of the finitely many colors. All \(o(1)\) terms refer to the old data, \(c,J,\psi,P\), and support neighborhoods fixed before \(N\) tends to infinity. In particular, \(N\) may be required to exceed any prescribed bound. Proof. Geometry and smooth convergence. Choose \(k_N\) by rounding \(N\int V\) to an integer and integrate (5). Then \(H_N(u+1)-H_N(u)=k_N\), so the map \(u\mapsto H_N(u)\bmod1\) is globally defined. The map \(C_N\) is a smooth torus diffeomorphism of Jacobian one, with inverse \((\theta',u',a')\mapsto(a'+H_N(\theta'),\theta',u')\). Direct substitution gives \[C_NT_NC_N^{-1}(\theta',u',a') =(\theta'+\sigma_N(u'),u',a').\] This proves the global assertions, except convergence. The integral identity \[H_N(u+\sigma_N(a))-H_N(u) =N\int_0^{\sigma_N(a)}(V(u+t)+\Delta_N)\,\mathrm dt =V(u)+O_{C^k}(N^{-1})\] holds for each fixed \(k\), with constants depending on the fixed \(c,J\) and \(\phi\). Since \(c\) is an integer, addition of \(V\) and of \(\phi\) agree on \(\mathbb T\). The inverse of (6) is \[(\theta,u,a)\longmapsto (\theta-H_N(u)+H_N(u-\sigma_N(a)),u-\sigma_N(a),a),\] and the same estimate proves inverse convergence. Composing with a fixed physical chart and its inverse preserves convergence in every fixed smooth norm. No bound uniform over future coordinate charts is being asserted. Fourier coefficients. Work on a compact subarc of \(I\) containing all old coefficient supports in its interior. For \(s=j/N\) the phase in (10), divided by \(N\), has critical equation \[ m(V(u)+\Delta_N)=s \tag{14}\] and second derivative \(m\phi'(u)\). It has at most one critical point on this arc. With \(u_*=u_*(s-m\Delta_N)\) on that branch, set \[L_{m,j}(a)= \frac{A(u_*,a)}{\sqrt{N|m\phi'(u_*)|}} \mathop{\mathrm{e}}\left(mH_N(u_*)-ju_*+\frac{\operatorname{sgn}(m)}8\right),\] and set this to zero wherever the amplitude at the critical point is zero or there is no point on the branch. Uniformly for \(j/N\) in any fixed compact interval and \(a\in\mathbb T\), \[ C_{m,j}(a)-L_{m,j}(a)=o(N^{-1/2}). \tag{15}\] For general stationary-phase background see (Hörmander 2003); we give the compact-support one-dimensional argument needed here. Enlarge the support arc twice inside \(I\). Critical points near the original support then range over a fixed compact interval on which the absolute second derivative is bounded below. A smooth change of variable, depending smoothly on the critical point, reduces the divided phase to its critical value plus \(\operatorname{sgn}(m)y^2/2\); its Jacobian at zero is \(|m\phi'(u_*)|^{-1/2}\). After putting \(v=\sqrt N y\), the integral on \(|v|\le D\) converges uniformly to the constant amplitude times the quadratic exponential integral there. The remaining local tails are \(O(N^{-1/2}/D)\), uniformly in the parameters, by integrating against \(\mathop{\mathrm{e}}(\operatorname{sgn}(m)v^2/2)\): the rescaled amplitudes have uniformly bounded suprema and total variation. The part away from the critical point is \(O(N^{-1})\) by integration by parts. Finally \[\lim_{D\to\infty}\int_{-D}^D\mathop{\mathrm{e}}(\pm v^2/2)\,\mathrm dv =\exp(\pm i\pi/4);\] this follows by inserting a Gaussian factor, evaluating the Gaussian integral, and removing the factor using the same tail bound. Taking first \(N\to\infty\), then \(D\to\infty\), proves (15). When the potential critical point is outside the enlarged support interval, the integral is uniformly nonstationary. This also covers zero amplitudes and the ends of the branch. There are \(O(N)\) indices in a fixed bounded \(j/N\) range. Outside a sufficiently large such range, repeated integration by parts gives, for any fixed positive integer \(q\), \(|C_{m,j}(a)|\le C_q|j|^{-q}\) uniformly in \(a\) and \(N\). Indeed the phase derivative has size comparable to \(|j|\), and its higher derivatives are \(O(N)\) with \(N=O(|j|)\) there. Thus (15) implies \[\sum_j\int_\mathbb T|C_{m,j}-L_{m,j}|^2\,\mathrm da=o(1).\] The \(L^2\) norm of the leading array is bounded by a Riemann sum. Cauchy–Schwarz therefore gives the useful mass estimate \[ \sum_j\int_\mathbb T \left||C_{m,j}(a)|^2 -\frac1N W(j/N-m\Delta_N,a)\right|\,\mathrm da=o(1). \tag{16}\] Cutoffs and transport. The map \((u,a)\mapsto(mV(u),a)\) is injective on \(I\times\mathbb T\). It takes disjoint compact supports with the same \(m\) to disjoint compact sets. Our choice of \(c\) separates the images for different \(m\). The stated cutoffs \(\chi_\alpha\) therefore exist. For large \(N\) they equal one on the support of the corresponding leading array, since its \(s\) coordinate is shifted by only \(m_\alpha\Delta_N\). Because each cutoff is one on the shifted leading-array support, the deleted exact coefficient mass is bounded by the summed squared \(C_{m,j}-L_{m,j}\) error, which tends to zero by the preceding estimate and Parseval’s identity. The same argument is valid after multiplication by \(\psi\), proving (11) and (16) for the retained arrays with the factor \(\psi^2\) on the right. The cutoffs make separation exact, not merely asymptotic. Different old \(m\) never contribute to the same retained \(j\), and at a shared \(j\) the remaining supports in \(u'=a\) are disjoint. The factor \(\mathop{\mathrm{e}}(ma')\) in (9) proves the asserted independence of the new spare-coordinate modulus, also after combining packets at one index. Linearity proves the statement about attached constants. Fine temporal density. We first remove rounding before any fine-scale sampling. Smoothness and compact support of the fixed \(W\) give \[ \frac1N\sum_j\int_\mathbb T |W(j/N-m\Delta_N,a)-W(j/N,a)|\,\mathrm da=o(1). \tag{17}\] For example, a uniform bound on \(\partial_s W\) and \(O(N)\) nonzero summands give an \(O(|m|/N)\) bound. The same holds with \(\psi^2\) and for any residue subset. Pushforward contracts total variation, so (16) and (17) allow us to replace the retained squared coefficient measures by \(N^{-1}W(j/N,a)\psi(a)^2\,\mathrm da\), at total error \(o(1)\), before pushing to temporal frequency. In particular, the actual lattice \(j/N\) is never translated by \(m\Delta_N\). On the retained arc, the change of variable \(y=sJ(a)\) gives \[ K(s,y)=\frac{W(s,a)\psi(a)^2}{|s|J'(a)}, \qquad a=J|_{I'}^{-1}(y/s), \tag{18}\] with zero extension. The compact support of \(\psi\) inside \(I'\) makes this extension continuous (in fact smooth away from \(s=0\)). The real temporal frequency of a new angular index \(j\) is \[ t=j\sigma_N(a)=j/N+(j/N)J(a)/N. \tag{19}\] The density of the pushforward of \(N^{-1}W(j/N,a)\psi(a)^2\,\mathrm da\) under this map is exactly \(K(j/N,Nt-j)\). The factor \(N\) in the density change of variable cancels the coefficient mass \(N^{-1}\). Choose \(Y\) so that \(K(s,y)=0\) for \(|y|>Y\). For fixed \(t\), at most \(2Y+2\) integers contribute to either \(\sum_j K(j/N,Nt-j)\) or \(\sum_jK(t,Nt-j)\); on every contributing term \(|j/N-t|\le Y/N\). Uniform continuity of \(K\), and a fixed bounded interval containing the \(t\) supports for large \(N\), prove that replacing \(j/N\) by \(t\) costs \(o(1)\) in \(L^1(\mathbb R)\). The same proof works after restriction to \(j\equiv h\pmod P\). This is (13). Folding modulo one contracts the \(L^1\) norm and finishes the proof. ◻ It is useful to emphasize the normalization in (13). The periodization \(\sum_k K(t,y-kP)\) is a density relative to length on the circle of length \(P\), so its mean value is \[ \frac1P\int_\mathbb TW(t,a)\psi(a)^2\,\mathrm da. \tag{20}\] For \(P=1\), folding \(t=z+l\) leaves the fast phase \(Nz\) unchanged, since \(N\) is an integer. For general \(P\), the folded expression has phase \(N(z+l)-h\) modulo \(P\); no divisibility condition on \(N\) is imposed. Lemma 3 (Fast-variable averaging). Let \(P>0\), and let \(G(t,y)\) be continuous, compactly supported in \(t\), and \(P\)-periodic in \(y\). Then, uniformly in real offsets \(\beta_N\), \[ \int_\mathbb RG(t,Nt+\beta_N)\,\mathrm dt \longrightarrow \frac1P\int_\mathbb R\int_0^P G(t,y)\,\mathrm dy\,\mathrm dt. \tag{21}\] In particular, suppose \(w\ge0\) is continuous and compactly supported in a compact set \(K\subset\mathbb R\setminus\{0\}\). For continuous integrable densities \(\rho,\widetilde\rho\) define \[\mathcal P_{s,P}\rho(y) =\sum_{k\in\mathbb Z}|s|^{-1}\rho((y+kP)/s).\] Assume these periodizations are jointly continuous for \(s\in K\). Then \[\begin{align*} &\lim_{N\to\infty} \int_\mathbb Rw(s) |\mathcal P_{s,P}\rho(Ns+\beta_N) -\mathcal P_{s,P}\widetilde\rho(Ns+\beta_N)|\,\mathrm ds\tag{22}\\ &\hspace{12mm}= \frac1P\int_\mathbb Rw(s)\int_0^P |\mathcal P_{s,P}\rho(y)-\mathcal P_{s,P}\widetilde\rho(y)| \,\mathrm dy\,\mathrm ds \le\frac{\|w\|_1}{P}\|\rho-\widetilde\rho\|_1. \end{align*}\] Joint continuity is automatic, for example, if the densities are continuous with bounds \(C/(1+y^2)\), or are continuous and compactly supported. Neither density need have mass one. Proof. Partition the \(t\) axis into intervals of length \(P/N\) on each of which \(Nt+\beta_N\) traverses one period. On each interval replace the slow argument \(t\) of \(G\) by an endpoint. Uniform continuity on the fixed compact support bounds the integrated error by a constant times its modulus of continuity at \(P/N\), with an additional \(O(N^{-1})\) boundary error. The resulting averages are Riemann sums for the right side of (21). This proves the first assertion, uniformly in the offset. Apply it to the continuous absolute difference in (22). The integral over one period of that difference is bounded by \[\sum_k\int_0^P |s|^{-1} |\rho((y+kP)/s)-\widetilde\rho((y+kP)/s)|\,\mathrm dy =\|\rho-\widetilde\rho\|_1.\] Finally, on a compact set of nonzero \(s\), quadratic tail bounds give a uniform summable bound \(C'/(1+k^2)\) on the periodizing summands, for \(0\le y\le P\). Uniform convergence proves joint continuity. Compactly supported densities are handled in the same way with only finitely many nonzero summands on that compact set. ◻ In the special case \(|A(u,a)|\) is independent of \(a\), (12) has the form \(W(s,a)=w(s)\). If \(\widetilde\rho\,\mathrm dy=J_*(\psi^2\,\mathrm da)\), then \(K(s,y)=w(s)|s|^{-1}\widetilde\rho(y/s)\). Thus replacing the realized jitter law by a regular target law \(\rho\) in the fine-density prescription costs, after taking \(N\) sufficiently large, at most \(\|w\|_1\|\rho-\widetilde\rho\|_1+o(1)\) for the full density. One sums this estimate over the fixed packet list and folds modulo one. This is an averaged estimate along the fast variable, not a pointwise estimate of periodized densities from total variation. It is applied only after (17), so the family being averaged is fixed. Lemma 4 (Realization of jitter laws). For any strictly positive smooth probability density \(\rho\) on \(\mathbb R\) and any \(\varepsilon>0\), there are a smooth real circle function \(J\), an open arc \(I'\) with \(|\mathbb T\setminus I'|<\varepsilon\) and \(J'>0\) on \(I'\), and \(0\le\psi\le1\) in \(C_c^\infty(I')\), such that \[J_*(\psi^2\,\mathrm da)=\widetilde\rho(y)\,\mathrm dy, \qquad \widetilde\rho\in C_c^\infty(\mathbb R), \qquad \|\rho-\widetilde\rho\|_1<\varepsilon.\] Here the cutoff law is a subprobability measure; no renormalization is made. Also \(\int_\mathbb T(1-\psi^2)\,\mathrm da<\varepsilon\). Proof. Let \(F(y)=\int_{-\infty}^y\rho(v)\,\mathrm dv\). Strict positivity makes \(F\) a smooth diffeomorphism from \(\mathbb R\) to \((0,1)\). Choose \(0<\delta<\min(1/8,\varepsilon/4)\) and a smooth function \(\xi\) compactly supported in \((\delta/2,1-\delta/2)\) and equal to one on \([\delta,1-\delta]\). In the circle coordinate \(0<a<1\), set \(J(a)=\xi(a)F^{-1}(a)\) and extend it by zero near the identified endpoints. It is a smooth bounded circle function, and on \(I'=(\delta,1-\delta)\) it has derivative \(1/\rho(F^{-1}(a))>0\). Choose \(\psi\in C_c^\infty(I')\) with \(0\le\psi\le1\) and \(\psi=1\) on \([2\delta,1-2\delta]\). Change of variables gives \[\widetilde\rho(y)=\rho(y)\psi(F(y))^2\le\rho(y),\qquad \|\rho-\widetilde\rho\|_1 =1-\int_\mathbb T\psi^2\,\mathrm da\le4\delta<\varepsilon.\] Its support is compact because that of \(\psi\) is compactly inside \((0,1)\). All the claims follow. ◻ Lemma 5 (Weighted neutral refresh). Given a twist, its fixed physical chart, a finite disjoint smooth packet list with color densities \(p_r\), a positive integer \(P\), and a positive tolerance, one can perform a passage with the following simultaneous properties. Its physical map and inverse lie in any prescribed smooth neighborhood of the old ones. Its new good-arc complement is arbitrarily small. Every color vector is transported within the prescribed \(L^2\) tolerance, retaining constant tags and disjointness. The new packet moduli are independent of the new spare coordinate. The output densities \(p'_r\) and the densities \(p'_{r,h}\) contributed by output indices \(j\equiv h\pmod P\) satisfy \[ \|p'_r-p_r\|_1<\varepsilon, \qquad \|p'_{r,h}-p_r/P\|_1<\varepsilon \quad(0\le h<P), \tag{23}\] where \(\varepsilon>0\) may be prescribed arbitrarily. The integer \(c\) may first be required to exceed any fixed bound, and the retained supports may use any sufficiently small fixed enlargements of (8). If colors were disjoint in their old angular indices alone, their output angular index sets are still disjoint. The final passage integer \(N\) may exceed any prescribed bound. Proof. Fix the old finite data and choose \(c\) as in Lemma 2, also satisfying its prescribed lower bound. Identify all but a small interval of the \(a\) circle with an interval in \(\mathbb R\). Choose an open arc \(I'\) whose complement is as small as requested, and \(0\le\psi\le1\) compactly supported there and equal to one except on a set of sufficiently small length. The boundedness of the finitely many old amplitudes allows us to make both their \(L^2\) cutoff errors and the removed squared masses arbitrarily small. Fix this cutoff before proceeding. For a positive parameter \(L\), take a smooth periodic function \(J_L\) equal to \(La+\beta\) on \(I'\), extending it smoothly across the complementary interval. Such an extension exists by taking a smooth cutoff equal to one on the closure of \(I'\) in a slightly larger real coordinate interval. In particular \(J_L'=L\) on \(I'\). Put \(f_s(a)=W(s,a)\psi(a)^2\), extended by zero in this real coordinate. The periodization of its pushforward by \(sJ_L\) is \[ \sum_{k\in\mathbb Z}\frac1{|s|L} f_s\left(\frac{(y+kP)/s-\beta}{L}\right). \tag{24}\] This is \(1/P\) times a Riemann sum for \(\int f_s(a)\,\mathrm da\), of mesh \(P/(|s|L)\), with an arbitrary lattice offset and possibly reversed orientation. The error is bounded by \[ \frac{\|\partial_a f_s\|_{L^1(\mathbb R)}}{|s|L}. \tag{25}\] Indeed compare each lattice value times the mesh with the integral on its cell, using the fundamental theorem of calculus and summing the absolute derivative. Since \(s\) ranges over a fixed compact set away from zero, this bound tends to zero uniformly in \(s\) and \(y\). It remains valid for arbitrary fixed dependence of the original amplitude on \(a\). Choose \(L\) large enough for these uniform errors to be as small as needed for the finite packet list. Now \(J_L\) and all its norms are fixed. Choose the support cutoffs in Lemma 2, and then take \(N\) sufficiently large. Its fine-density rule, together with (24), approximates each unfolded residue density by \(P^{-1}\int W(s,a)\psi(a)^2\,\mathrm da\) in \(L^1\). Folding modulo one gives \(p_r/P\), up to the small cutoff loss; the integer \(mc\) in \(mV\) has no effect on this folding. The estimate is uniform in the periodic phase, so the folding offsets \(Nl\) cause no difficulty. Summing the residue estimates gives the total density estimate, upon initially making each error smaller by the fixed factor \(P\) if necessary. Norm transport, exact support properties, and smooth proximity follow from the same passage lemma. All constraints on \(N\) are lower bounds imposed after the physical chart, the amplitudes, \(c\), the cutoff, \(L\), and the support neighborhoods have been fixed. ◻ Remark 6. A common passage can handle finitely many packet lists, requiring disjointness only within each list. Choose \(c\) using the union of their old indices, choose the neutral cutoff and slope to meet all their finitely many mass and density bounds, and choose \(N\) above all the resulting lower bounds. Support cutoffs are chosen separately for each list, disjoint within that list. The norm and density conclusions then hold for every list; no orthogonality between different lists is asserted. All these operations preserve real data. Include together the packets \((m,A)\) and \((-m,\overline A)\), attach conjugate tags, and choose \(\chi_{-m}(s,a)=\chi_m(-s,a)\). The exact coefficients obey \(C_{-m,-j}=\overline{C_{m,j}}\), and all other cutoffs are real. Thus conjugate packets and conjugate colors can be retained at every passage. Small Fourier signalsThe purpose of this section is to modulate a packet’s spectral density according to its angular index. The size of the modulation will depend on a fixed band of normalized indices, but not on the scale of those indices. The integer added to the old speed is allowed to depend on the actual, finite set of indices. Fix numbers \(0<b<D_0\) and a function \[ d\in C_c^\infty(\mathbb R\setminus\{0\};\mathbb C), \qquad d(-x)=\overline{d(x)}. \tag{26}\] A scale is a positive real number \(B\), and the normalized index of a packet at angular index \(m\) is \(x=m/B\). Lemma 7 (Transmission of an index signal). For the fixed data \(b,D_0,d\) there are an integer \(P\ge2\) and a number \(\gamma_0>0\) with the following property. Any fixed \(0<\gamma\le\gamma_0\) can be used, independently of \(B\). Let \(S\) be an intermediate map, and let \[F_r=\sum_{m\in\mathcal M_r} A_{r,m}(u,a)\mathop{\mathrm{e}}(m\theta)\] be finite smooth packet data in its good arc. Suppose that the finite sets \(\mathcal M_r\subset\mathbb Z\setminus\{0\}\) are mutually disjoint, \(|A_{r,m}(u,a)|\) is independent of \(a\), and \(b\le |m|/B\le D_0\). Write \(p_{r,m}\) for the spectral density of the indicated packet. Given any \(\varepsilon,\delta_x,\delta_z>0\) and prescribed positive bounds for the physical \(L^2\) transport errors, a passage produces finite output packet sums \(F_{r,m}^+\), approximating the corresponding input packets in physical \(L^2\), whose spectral densities satisfy \[ \sum_{r,m}\left\|p_{r,m}^+ -p_{r,m}(z)\left[1+2\gamma\mathbf 1_{\gcd(m,P)=1} \mathop{\mathrm{Re}}\{d(m/B)\mathop{\mathrm{e}}(-Nz)\}\right]\right\|_{L^1(\mathbb T)} <\varepsilon. \tag{27}\] The new scale is \(B^+=NcB\), and the new speed is \(\sigma_N\) from Lemma 2. For every point \((u',a')\) in the coefficient support of a retained output packet of index \(j\) descending from \((r,m)\), there is \((u,a)\in\mathop{\mathrm{supp}}A_{r,m}\) such that \[ \left|\frac{j}{B^+}-\frac mB\right|<\delta_x, \qquad \mathop{\mathrm{dist}}_\mathbb T\bigl(j\sigma_N(u'),m\phi(u)\bigr)<\delta_z. \tag{28}\] Its modulus is independent of the new spare coordinate. Distinct old angular indices have disjoint output angular-index supports. Conjugate symmetry is preserved when present. The passage and its inverse can lie in any prescribed smooth neighborhood of \(S\) and \(S^{-1}\) in physical coordinates, and the new good arc can have arbitrarily small complement. The choices can be made in the order \(c\), a bounded smooth jitter and cutoffs, and finally the integer \(N\). After the preceding choices, every sufficiently large integer \(N\) works. In particular an arbitrary lower bound on \(N\) can be imposed. Proof. A positive law. We first construct a positive law without using \(B\). We use the positive-exponent Fourier convention \[\widehat q(v)=\int_\mathbb Rq(R)\mathop{\mathrm{e}}(vR)\,\,\mathrm dR.\] Choose \(0<\alpha<b/2\), put \(a_0=(2\alpha)^{-1}\), and define \[ s_\alpha(R)=\alpha\left(\frac{\sin(\pi\alpha R)} {\pi\alpha R}\right)^2, \qquad q_0(R)=\frac1{2a_0}\int_{-a_0}^{a_0}s_\alpha(R-t)\,\,\mathrm dt, \tag{29}\] with the removable value at the origin understood. Fourier inversion for an interval, followed by convolution, gives \[\widehat{s_\alpha}(v)=(1-|v|/\alpha)_+.\] Consequently \(q_0\) is a smooth probability density with Fourier support in \([-\alpha,\alpha]\). It is strictly positive: the interval of translations in (29) cannot be contained in the discrete zero set of \(s_\alpha\). Here a quantitative lower tail is useful. Since the averaging interval has length \(1/\alpha\), it contains exactly one period of \(\sin^2(\pi\alpha(R-t))\) as a function of \(t\). For \(|R|\ge2a_0+1\) this gives \[\frac1{2\pi^2\alpha(|R|+a_0)^2} \le q_0(R) \le\frac1{\pi^2\alpha(|R|-a_0)^2}.\] Positivity and continuity on the remaining compact interval therefore give constants \(c_0,C_0>0\) such that \[ \frac{c_0}{1+R^2}\le q_0(R)\le\frac{C_0}{1+R^2} \qquad(R\in\mathbb R). \tag{30}\] Choose \(D>b\) such that \(\mathop{\mathrm{supp}}d\subset[-D,D]\), and then an integer \(L>\max(2,D/b)\). Let \(P\) be the product of all primes at most \(L\). The strict inequality in this choice will allow a small dilation of the Fourier arguments. Define \[g(R)=\int_\mathbb Rd(v)\mathop{\mathrm{e}}(-vR)\,\,\mathrm dv, \qquad C_P(h)=\sum_{k\in(\mathbb Z/P\mathbb Z)^\times}\mathop{\mathrm{e}}(-kh/P) \quad(0\le h<P).\] The function \(g\) is Schwartz by repeated integration by parts. The symmetry in (26) makes it real, and \(\int g=d(0)=0\). The number \(C_P(h)\) is real because the set of units is invariant under negation. Set \[ Q_h(R)=\frac1P\bigl[q_0(R)+\gamma C_P(h)g(R)\bigr]. \tag{31}\] For \(G=\sup_R(1+R^2)|g(R)|\) and \(C_* =\max_h|C_P(h)|\), choose \(\gamma_0>0\) so small that \[\gamma_0 C_*G\le c_0/2, \qquad 2\gamma_0\|d\|_\infty\le1/2;\] a zero factor imposes no restriction. Then, for every permitted \(\gamma\), \[ \frac{q_0(R)}{2P}\le Q_h(R)\le\frac{3q_0(R)}{2P}, \qquad \int_\mathbb RQ_h(R)\,\,\mathrm dR=\frac1P. \tag{32}\] Thus \(Q_h(R)\,\,\mathrm dR\) defines a probability law on \(\mathbb R\times\{0,\ldots,P-1\}\). Finite Fourier inversion gives, for every \(v\in\mathbb R\) and \(k\in\mathbb Z\), \[ \sum_{h=0}^{P-1}\int_\mathbb RQ_h(R)\mathop{\mathrm{e}}(vR+kh/P)\,\,\mathrm dR =\widehat q_0(v)\mathbf 1_{k\equiv0\ (P)} +\gamma d(v)\mathbf 1_{\gcd(k,P)=1}. \tag{33}\] Indeed the sum over \(h\) pairs \(C_P(h)\) with the character at \(k\), leaving precisely the indicator that \(k\) is a unit. All choices up to this point are independent of \(B\), the map, and its finite packet list. Moments and the finite sieve. For fixed \(B\) and an integer \(c>0\), consider the random variable \[ J_*=(R/B+h/P)/c \tag{34}\] under this law. Its density is \[\rho_{B,c}(y)=cB\sum_{h=0}^{P-1}Q_h\bigl(B(cy-h/P)\bigr).\] It is a strictly positive smooth probability density. The bounds (32) imply quadratic upper and lower tails, with constants now allowed to depend on \(B,c\). We calculate the periodized density of \(sJ_*\). Write \(x=m/B\) and \(s=mct\). For its positive integer Fourier moments, the exact formula is \[ M_\ell(t)=\frac1P\sum_{h=0}^{P-1}\mathop{\mathrm{e}}(\ell mt h/P) \bigl[\widehat q_0(\ell xt) +\gamma C_P(h)d(\ell xt)\bigr],\qquad \ell\ge1. \tag{35}\] At \(t=1\), (33) applies. Its baseline term vanishes since \(|\ell x|\ge b>\alpha\). If \(\ell\ge2\) and \(d(\ell x)\ne0\), then \(\ell\le D/b<L\). Some prime divisor of \(\ell\) therefore divides \(P\), so \(\gcd(\ell m,P)>1\). It follows that \[ M_1(1)=\gamma d(x)\mathbf 1_{\gcd(m,P)=1}, \qquad M_\ell(1)=0\quad(\ell\ge2). \tag{36}\] For finite \(c\) the discrete phases in (35) need not be residue characters. We estimate their errors before using the sieve. Choose \(\tau\in(1/2,1)\) so that \(D/(\tau b)<L\), and take \(c\) large enough that \[t_N(u)=1+\frac{\phi(u)+\Delta_N}{c}\ge\tau, \qquad |\Delta_N|\le1/N,\] on the old supports, uniformly for \(N\ge1\). The baseline term in (35) then vanishes for every \(\ell\ge1\), since \(|\ell xt_N|\ge\tau b>\alpha\). The perturbation also vanishes identically when \(\ell>D/(\tau b)\). Hence nonintegral discrete phases cannot introduce an unbounded collection of harmonics. For the fixed remaining finite set, put \(C_1=P^{-1}\sum_h|C_P(h)|\). The elementary bound \(|\mathop{\mathrm{e}}(v)-\mathop{\mathrm{e}}(w)|\le2\pi|v-w|\) gives \[ |M_\ell(t)-M_\ell(1)| \le\gamma C_1\ell \bigl[D_0\|d'\|_\infty+2\pi|m|\|d\|_\infty\bigr]|t-1|. \tag{37}\] We may thus make the sum of all moment errors arbitrarily small by choosing \(c\) after the actual finite set of old indices. In particular \(c\) is allowed to grow with \(\max|m|\); \(\gamma\) does not need to decrease. The same choice can make the ranges \(m(c+\phi(\mathbb T))\) for distinct old indices disjoint and bounded away from zero. To pass from moments to densities, let \[\mathcal P_s\rho(y) =\sum_{k\in\mathbb Z}\frac1{|s|}\rho((y+k)/s),\qquad y\in\mathbb T.\] Once \(c\) has been chosen, all the relevant \(s\) ranges are fixed compact sets away from zero. No bound on these sets uniform over future passages is needed. For \(s\) in a fixed compact subset of \(\mathbb R\setminus\{0\}\), the quadratic upper tail of \(\rho_{B,c}\) makes this a jointly continuous function of \((s,y)\), with uniformly summable tails. Its Fourier coefficients in the positive-exponent convention are the moments just computed. The compact bandwidth shows that its Fourier series is a finite sum on the relevant branches. Fourier uniqueness and (36)–(37) therefore give, uniformly on those branches and in \(y\), \[ \mathcal P_s\rho_{B,c}(y) =1+2\gamma\mathbf 1_{\gcd(m,P)=1}\mathop{\mathrm{Re}}\{d(m/B)\mathop{\mathrm{e}}(-y)\} +o_{c\to\infty}(1). \tag{38}\] The error here is for the fixed old list and scale \(B\). The negative exponent follows directly from our convention: \(\int\mathcal P_s\rho(y)\mathop{\mathrm{e}}(\ell y)\,\,\mathrm dy=M_\ell\). Realization and support. We now realize this law by a passage. Lemma 4 provides a bounded smooth circle function \(J\), strictly increasing on a good arc, and a smooth cutoff \(\psi\) compactly supported in that arc, such that the subprobability law \[\widetilde\rho=J_*(\psi(a)^2\,\,\mathrm da)\] is arbitrarily close to \(\rho_{B,c}\) in total variation. Its missing mass is included in this error. The good arc has as small a complement as requested. Since \(|A_{r,m}|\) is independent of \(a\), its stationary weight is a function of \(s\) alone: \[w_{r,m}(s)=\frac{|A_{r,m}(u,a)|^2}{|m\phi'(u)|}, \qquad m(c+\phi(u))=s,\] extended by zero. For such a nonnegative compactly supported weight, Lemma 3 and contraction of total variation under pushforward and periodization give \[\begin{align*} &\lim_{N\to\infty}\int_\mathbb Rw_{r,m}(s) |\mathcal P_s\widetilde\rho(Ns) -\mathcal P_s\rho_{B,c}(Ns)|\,\,\mathrm ds \\ &\qquad=\int_\mathbb Rw_{r,m}(s)\int_\mathbb T |\mathcal P_s\widetilde\rho(y) -\mathcal P_s\rho_{B,c}(y)|\,\,\mathrm dy\,\,\mathrm ds \\ &\qquad\le\|w_{r,m}\|_1\|\widetilde\rho-\rho_{B,c}\|_{L^1(\mathbb R)}. \tag{39}\end{align*}\] Here densities of subprobabilities are used in the \(L^1\) norm. The realized law has a continuous compactly supported density; the ideal law has the uniform tail bound established above. These facts supply the continuity and domination required for fast averaging. The independence of the weight from \(a\) is essential in this step. Lemma 2 identifies the output density, up to an arbitrarily small \(L^1\) error, as the folding to \(\mathbb T\) of \(w_{r,m}(s)\mathcal P_s\widetilde\rho(Ns)\). In using that lemma the rounding correction is removed at the coefficient-mass level: its replacement of \(w_{r,m}(s)\) by \(w_{r,m}(s-m\Delta_N)\) costs \(o(1)\) in the summed masses. It does not translate the fast argument \(Ns\). Alternatively, (37) also holds uniformly with \(t=t_N\). Since \(cm\) and \(N\) are integers, \[p_{r,m}(z)=\sum_{k\in\mathbb Z}w_{r,m}(z+k), \qquad \mathop{\mathrm{e}}(-N(z+k))=\mathop{\mathrm{e}}(-Nz).\] Now (38), (39), and the passage density formula prove (27). Choose \(c\) first to make its error sufficiently small, then the law approximation, and then \(N\). The finite packet list allows all errors to be summed. For completeness we give the simultaneous support estimates, which will also apply to neutral passages. Put \(M=\max_{r,m}|m|\), with \(M=0\) for an empty packet list. By the support cutoff in Lemma 2, at each retained point of an output packet at index \(j\) there is a point \(u\) in its old support for which \[ j/N=m(c+\phi(u)+\Delta_N)+\eta, \qquad |\eta|\le\eta_0, \tag{40}\] where the image enlargement \(\eta_0\) can be as small as desired. If \(x'=j/(NcB)\) and \(z'=j/N+(j/N)J(a)/N\) is the new temporal frequency, then \[\begin{align*} |x'-m/B| &\le\frac{D_0(\|\phi\|_\infty+1)}c+\frac{\eta_0}{cB}, \tag{41}\\ \mathop{\mathrm{dist}}_\mathbb T(z',m\phi(u)) &\le\frac MN+\eta_0 +\frac{[M(c+\|\phi\|_\infty+1)+\eta_0]\|J\|_\infty}{N}. \tag{42}\end{align*}\] Choose \(c\) for the first bound and index separation, then \(\eta_0\) and the bounded \(J\), and finally \(N\) for the second bound. A large bound on \(J\) only increases the eventual requirement on \(N\). These choices also give physical smooth closeness of the passage and its inverse and the required \(L^2\) approximations, by Lemma 2. Every new coefficient descending from old index \(m\) has the form \(\mathop{\mathrm{e}}(ma_{\rm new})\) times a scalar function of the new speed coordinate. Because different old indices have disjoint retained new index ranges, their spare-coordinate phases are never added at one new index. Thus the resulting packet moduli are independent of the new spare coordinate. All cutoffs can be chosen in conjugate pairs, so conjugation is retained as well. ◻ We next remove the coprimality restriction by placing a neutral passage before transmission. The output residue classes of the neutral passage, rather than the input residue classes, are the ones tested in the transmission. Lemma 8 (Refresh and transmission). Fix \(b,D_0,d,P,\gamma\) as in Lemma 7, and put \[ \lambda=\gamma\frac{|(\mathbb Z/P\mathbb Z)^\times|}{P}>0. \tag{43}\] Suppose finite colored packet data have mutually disjoint angular-index sets and moduli independent of the spare coordinate. Suppose their normalized indices lie in a fixed compact subset of \(\{x:b<|x|<D_0\}\). Let \(p_r\) be the color densities, and let \(d_r:\mathbb T\to\mathbb C\) be continuous functions such that on the support of every input packet of color \(r\), \[ |d(m/B)-d_r(m\phi(u)\bmod1)|\le\omega. \tag{44}\] Then a neutral passage followed by a transmission gives output colors with \[ \sum_r\left\|p_r^+ -p_r(z)\bigl[1+2\lambda\mathop{\mathrm{Re}}\{d_r(z)\mathop{\mathrm{e}}(-Nz)\}\bigr] \right\|_1 \le 2\gamma\omega\sum_r\|p_r\|_1+\varepsilon, \tag{45}\] where \(\varepsilon>0\) is arbitrary and \(N\) is the second passage integer. The physical map and inverse, the physical packet vectors, and the normalized-index and temporal-frequency displacements can all be controlled with arbitrary prescribed positive error bounds. Output packet moduli remain independent of the spare coordinate, and colors remain disjoint in angular indices. The final \(N\) can exceed any prescribed bound. Conjugate-symmetric data can be treated conjugate-symmetrically. If different colors start in separated compact normalized-index sets, any fixed sufficiently small enlargements of those sets can contain their outputs. The same conclusion holds through any fixed finite number of such pairs, with positive margins around the band \(b<|x|<D_0\). If the input supports satisfy \(\mathop{\mathrm{dist}}_\mathbb T(m/B,m\phi(u))\le\kappa\), the output supports satisfy the same inequality with \(\kappa\) increased by an arbitrarily small amount. Proof. Use Lemma 5 with residue modulus \(P\). Denote the refreshed scale by \(\widetilde B\), its packet densities by \(\widetilde p_{r,m}\), and its color-residue densities by \[\widetilde p_{r,h}=\sum_{m\equiv h\ (P)}\widetilde p_{r,m}.\] That lemma makes \[ E_r=\sum_{h=0}^{P-1} \|\widetilde p_{r,h}-p_r/P\|_1 \tag{46}\] arbitrarily small. It also retains disjoint output angular-index sets and gives moduli independent of the new spare coordinate. To control its support, first choose its \(c\) as large as necessary for (41); next choose its cutoff and broad linear jitter for the residue equalization; finally choose its passage integer for (42). Thus equalizing residues does not prevent either displacement from being arbitrarily small. For a continuous function \(f\) on its relevant compact domain, denote its modulus of continuity by \(\nu_f(t)=\sup_{\mathop{\mathrm{dist}}(v,w)\le t}|f(v)-f(w)|\). If the refresh changes normalized indices by at most \(\delta_x\) and temporal frequencies by at most \(\delta_z\), its retained color supports satisfy \[ |d(m/\widetilde B)-d_r(z)| \le\rho_r:=\omega+\nu_d(\delta_x)+\nu_{d_r}(\delta_z). \tag{47}\] This follows pointwise by linking an output support point to an old one and using (44). In particular the extra terms tend to zero. The compact margin in the normalized band lets us apply Lemma 7 with the same \(P,\gamma\) after this refresh, although its actual indices and scale may be very large. By that lemma the transmission density, with an arbitrarily small summed error \(T_r\) for color \(r\), is \[\widetilde p_r(z)+2\gamma\mathop{\mathrm{Re}}\left\{\mathop{\mathrm{e}}(-Nz) \sum_{\gcd(m,P)=1}d(m/\widetilde B) \widetilde p_{r,m}(z)\right\}.\] Replacing the coefficient in this sum by \(d_r(z)\) costs at most \(2\gamma\rho_r\|\widetilde p_r\|_1\) in \(L^1\). Also, \[\|\widetilde p_r-p_r\|_1\le E_r, \qquad \left\|\sum_{h\in(\mathbb Z/P\mathbb Z)^\times}\widetilde p_{r,h} -\frac{|(\mathbb Z/P\mathbb Z)^\times|}{P}p_r\right\|_1\le E_r.\] Consequently the color’s total error against the target in (45) is bounded by \[ T_r+(1+2\gamma\|d_r\|_\infty)E_r +2\gamma\rho_r(\|p_r\|_1+E_r). \tag{48}\] Choose the refresh errors, displacements, and transmission errors small enough and sum this bound over the finite list. This proves (45), including the exact value of \(\lambda\). Only residue balancing after summing over a color was needed, because (47) holds pointwise before the sum. The remaining assertions follow from the two passage lemmas and (41)–(42). Specifically, the triangle inequality gives \[\mathop{\mathrm{dist}}_\mathbb T(x',z')\le\mathop{\mathrm{dist}}_\mathbb T(x,z)+|x'-x|+\mathop{\mathrm{dist}}_\mathbb T(z',z).\] Positive separation distances and the fixed finite number of passages allow displacement budgets smaller than all band margins and color gaps. Constants such as \(\lambda\) are fixed before these error budgets are imposed. The required \(c\) and passage integers may then be chosen afresh after each actual finite packet list is known. ◻ Finite blocks and predictionThe signal from Lemma 8 can be arbitrarily weak. We use many such signals, holding one centering function fixed throughout each block. For a block with \(n\lambda^2\) comparable to \(\delta\), the square-root integral loses \(O(\delta^2)\), while the estimator has mean-square error \(O(1/\delta)\). Averaging the estimators from \(K\) blocks gives mean-square error \(O((K\delta)^{-1})\) with total loss \(O(K\delta^2)\). Thus \(K\delta\) can grow while \(K\delta^2\) tends to zero. Proposition 9 (Prediction of a tagged packet sum). Let \(S\) be an intermediate map, expressed in a fixed physical volume-preserving coordinate chart. Let \[F_r=\sum_{m\in\mathcal M_r} A_{r,m}(u,a)\mathop{\mathrm{e}}(m\theta), \qquad F=\sum_r F_r,\] be a finite list of colors of smooth packets supported compactly in the good arc. Suppose that the finite sets \(\mathcal M_r\subset\mathbb Z\setminus\{0\}\) are pairwise disjoint, that \(|A_{r,m}(u,a)|\) is independent of \(a\), and that the list is invariant under complex conjugation: \(F_{r^*}=\overline{F_r}\). In particular, \(F\) is real. Let \(p_r\) be the corresponding spectral densities, put \(p=\sum_r p_r\), and suppose that \[\int_\mathbb Tp(z)\,\,\mathrm dz\le \frac32.\] Assign constants \(b_r\in\mathbb C\) satisfying \(b_{r^*}=\overline{b_r}\). Given \(\varepsilon,\tau,\kappa>0\) and any neighborhood of the physical map and its inverse in the smooth topology, there are a finite sequence of passages, a final intermediate map \(S'\), final packets \(F'_r\), and a smooth function \(\Psi:\mathbb T\to\mathbb C\), such that \[\begin{align*} \sum_r\|F'_r-F_r\|_2&<\varepsilon, \tag{49}\\ \int_\mathbb T\sqrt{p'(z)}\,\,\mathrm dz &\ge \int_\mathbb T\sqrt{p(z)}\,\,\mathrm dz-\tau, \qquad p'=\sum_r p'_r, \tag{50}\\ \left\|\sum_r b_rF'_r- \Psi(U_{S'})\sum_r F'_r\right\|_2&<\varepsilon. \tag{51}\end{align*}\] Here the differences in (49) are measured in the original physical \(L^2\) space. All the physical maps and their inverses can be kept in the prescribed neighborhood. The final good arc \(I'\) satisfies \(|\mathbb T\setminus I'|<\kappa\). The output colors again have disjoint nonzero angular-index sets, moduli independent of the spare coordinate, and conjugation symmetry. The multiplier can be chosen with \(\Psi(-z)=\overline{\Psi(z)}\). We first record the precise averaging assertion needed in the proof. In the following lemma, a Laurent polynomial in \(w_1,\ldots,w_n\) means a finite linear combination of the monomials \(w^\nu=\prod_i w_i^{\nu_i}\), with \(\nu\in\mathbb Z^n\). Lemma 10 (Finite phase tests). Fix finitely many expressions \[P_j(z,w)=\sum_{\nu\in\mathcal E_j}c_{j,\nu}(z)w^\nu, \qquad c_{j,\nu}\in L^1(\mathbb T),\] where each \(\mathcal E_j\) is finite. For every \(\eta>0\), successively large positive integers \(L_1,\ldots,L_n\) can be chosen so that, simultaneously for all \(j\), \[ \left|\int_\mathbb TP_j\bigl(z,\mathop{\mathrm{e}}(L_1z),\ldots,\mathop{\mathrm{e}}(L_nz)\bigr)\,\,\mathrm dz -\int_\mathbb T\int_{\mathbb T^n}P_j\bigl(z,\mathop{\mathrm{e}}(y_1),\ldots,\mathop{\mathrm{e}}(y_n)\bigr) \,\,\mathrm dy\,\,\mathrm dz\right|<\eta. \tag{52}\] At each selection, \(L_i\) may additionally be required to exceed any finite lower bound determined by the preceding choices and the then-current construction data. Proof. Let \(D\) bound the absolute values of all the exponents in all the \(\mathcal E_j\). The integral of a nonconstant monomial on the product torus is zero. On the one-dimensional diagonal its contribution is a Fourier coefficient of \(c_{j,\nu}\) at \(-\sum_i\nu_iL_i\). The Fourier coefficients of an \(L^1\) function tend to zero: this follows by approximation in \(L^1\) by trigonometric polynomials, whose sufficiently high Fourier coefficients vanish. Since the coefficient list is finite, choose \(R\) so that the sum of the bounds for all these nonconstant contributions is less than \(\eta\) whenever their frequencies have absolute value greater than \(R\). Choose successively \[L_j>R+D\sum_{i<j}L_i,\] as well as the additional finite lower bounds. If \(j\) is the last nonzero position of \(\nu\), then \[\left|\sum_i\nu_iL_i\right| \ge L_j-D\sum_{i<j}L_i>R.\] This proves the assertion. No independence assertion about the distribution of the entire diagonal is made or needed. ◻ Proof of Proposition 9. Zero colors may be omitted. If all colors vanish, a neutral passage with zero output packets and \(\Psi=0\) proves the assertion, including the requested new good arc. Hence assume that a nonzero color is present. Dividing all tags by \(\max(1,\max_r|b_r|)\) and reducing the requested prediction tolerance reduces the proof to \(|b_r|\le1\). The transport and square-root tolerances remain independently adjustable. We work under this normalization until the end. The data fixed at the beginning of a block.For the moment suppose that the current packet mass is at most \(2\). Write its actual densities as \(p_r\), put \(p=\sum_rp_r\), and on \(\{p>0\}\) set \[t_r=\frac{p_r}{p},\qquad \beta=\sum_r t_rb_r.\] Set \(\beta=0\) on \(\{p=0\}\). Then \(|\beta|\le1\) and \(\beta(-z)=\overline{\beta(z)}\). Fix \(0<\delta\le1/100\). There is a smooth circle function \(q\) such that \[ |q|\le2,\qquad q(-z)=\overline{q(z)},\qquad \int_\mathbb T\sqrt p\,|\beta-q|^2\,\,\mathrm dz<\delta. \tag{53}\] Indeed, convolve \(\beta\) with an even nonnegative smooth approximate identity. The convolutions have absolute value at most \(1\), have the required symmetry, and converge almost everywhere to \(\beta\). Since \(\sqrt p\in L^1\), dominated convergence gives (53). In particular this choice does not require any uniform bound on derivatives of \(q\). Let \(A\) be any fixed bounded function on the temporal circle. In the iteration, \(A\) will be the sum of the estimators from \(k\) already completed blocks. Both \(q\) and \(A\) are fixed before any frequencies for the present block are chosen. The densities \(p_r\) in every model below are these actual pre-block densities. Anchoring, with the number of passages fixed first.Choose an integer \(c_0\) large enough that the full compact ranges \(m(c_0+\phi(\mathbb T))\) for distinct old indices are separated and avoid zero, as required by Lemma 2. In particular this separates the compact packet images \[m(c_0+\phi(u)),\qquad u\in\operatorname{proj}_u\mathop{\mathrm{supp}}A_{r,m},\] for all distinct old indices \(m\). Let \(K_r\) be the union of the images belonging to color \(r\). The \(K_r\) are disjoint compact sets and \(K_{r^*}=-K_r\). Choose slightly larger compact neighborhoods of them, still disjoint and off zero, and then disjoint open neighborhoods with compact closures. We will retain enough room between these two families of neighborhoods for all the support movements in the block. There is a smooth compactly supported function on \(\mathbb R\setminus\{0\}\) such that \[ d(-x)=\overline{d(x)},\qquad d(x)=b_r-q(x\bmod1) \quad\hbox{on a neighborhood of the enlarged }K_r. \tag{54}\] For example, use disjoint smooth cutoffs equal to one near these sets, chosen compatibly with reflection, and multiply the \(r\)th cutoff by \(b_r-q(x\bmod1)\). Fix \(0<b_0<D_0\) such that all the retained neighborhoods lie strictly inside \(\{b_0<|x|<D_0\}\). Apply Lemma 7 to this fixed \(d\) and these band bounds. It gives a modulus \(P\) and an arbitrarily small positive strength \(\gamma\), independently of the future angular scale. Put \[\lambda=\gamma\frac{|(\mathbb Z/P\mathbb Z)^\times|}{P}.\] Take \(\gamma\) so small that \(6\lambda<1\) and \(\lambda^2\le\delta/2\), and choose an integer \(n\ge1\) with \[ \frac\delta2\le n\lambda^2\le\delta. \tag{55}\] One may take \(n=\lfloor\delta/\lambda^2\rfloor\). At this point \(q,c_0,K_r,d,P,\gamma,\lambda,n\) are all fixed. In particular they have been chosen before the integer of the anchor passage. The error targets used below depend only on these data, the already fixed \(A,k\), and the requested tolerance \(\nu\). They can therefore be fixed now, before executing the anchor. Now make a neutral passage with the already fixed \(c_0\), choosing its jitter and its integer \(N_0\) for the required accuracy. Use \(B=N_0\) as the output angular scale. Lemmas 2 and 5 give color densities as close to \(p_r\) in \(L^1\) as desired. On their retained supports the normalized indices \(x=j/N_0\) lie in arbitrarily small enlargements of \(K_r\). If \(J_0\) is the bounded jitter chosen for this passage, their actual temporal frequencies satisfy \[z=x+xJ_0(a)/N_0\pmod1.\] Thus \(\mathop{\mathrm{dist}}_{\mathbb T}(x\bmod1,z)\) can be made arbitrarily small after \(J_0\) is fixed, by increasing \(N_0\). We follow this anchor by \(n\) refresh–transmit pairs from Lemma 8. At every passage the scale changes by \(B'=NcB\). The support estimates (41)–(42), which apply to neutral as well as transmitting passages, control normalized-index and temporal-frequency movement separately. Choose \(c\) and sufficiently small support enlargements to meet the movement budgets; in particular, the enlargement is smaller than the temporal tolerance because its contribution there is not divided by \(N\). Fix the bounded jitter \(J\) next, and choose \(N\) last for the remaining terms. Thus an arbitrarily broad neutral jitter remains compatible with temporal tracking. There are only \(2n+1\) passages in this block. Apportion small enough movement budgets among them so that all normalized indices remain in the neighborhoods on which (54) holds, and so that \(\mathop{\mathrm{dist}}_{\mathbb T}(x\bmod1,z)\) remains below any prescribed positive tolerance. Uniform continuity of the fixed \(q\) then makes \[ |d(x)-(b_r-q(z))| \tag{56}\] uniformly as small as needed on every retained support of color \(r\). The positive gaps preserve disjoint angular-index supports. Each passage preserves the independent-of-spare-coordinate modulus property and conjugation symmetry. The product model and its approximation.Put \(a_r(z)=b_r-q(z)\), so \(|a_r|\le3\). Denote the integer of the \(i\)th transmission by \(L_i\). The model after \(i\) transmissions is \[ h_r^{(i)}(z)=p_r(z)\prod_{j=1}^i f_{r,j}(z),\qquad f_{r,j}(z)=1+2\lambda\mathop{\mathrm{Re}}\{a_r(z)\mathop{\mathrm{e}}(-L_jz)\}. \tag{57}\] All factors are positive, and \(f_{r,j}\le M=1+6\lambda<2\). Let \(g_r^{(i)}\) be the actual densities after these pairs, with \(g_r^{(0)}\) the anchor densities. The refresh–transmit lemma, including the substitution (56), allows \[\sum_r\|g_r^{(i)}-g_r^{(i-1)}f_{r,i}\|_1<\eta_i, \qquad \sum_r\|g_r^{(0)}-p_r\|_1<\eta_0.\] Indeed the substitution costs at most \(2\gamma\omega\sum_r\int g_r^{(i-1)}\) if its uniform error is \(\omega\); the remaining error is freely adjustable. We may first choose the movement tolerance small enough for all the finitely many \(\eta_i\), and then implement each pair on its actual finite input. Consequently \[ E_i:=\sum_r\|g_r^{(i)}-h_r^{(i)}\|_1 \le ME_{i-1}+\eta_i, \qquad E_n\le M^n\eta_0+\sum_{i=1}^nM^{n-i}\eta_i. \tag{58}\] For any prescribed \(e_0>0\), it suffices to choose every \(\eta_i<e_0/((n+1)M^n)\) to obtain \(E_n<e_0\). All quantities in this accuracy requirement were fixed before the anchor. Even if \(\lambda\) is extremely small and \(n\) and \(M^n\) are extremely large, they are finite known numbers. The frequencies \(L_i\) remain free to exceed arbitrary successive lower bounds. In particular, Lemma 10 can be applied to any finite list of Laurent polynomials whose coefficient functions depend only on the pre-block data \[ p_r,\ t_r,\ q,\ A,\ b_r,\ n,\ \lambda. \tag{59}\] The actual packets depend on previous choices, but appear only in (58), not in this fixed coefficient list. At the \(i\)th pair, first choose its refresh and all its transmission data preceding the passage integer; then choose \(L_i\) large enough for both the physical construction and the phase-test lower bound. Thus the averaging and the construction impose compatible lower bounds on the same integer. The square-root integral.Introduce independent Haar phases \(Z_1,\ldots,Z_n\) solely for computing the product-torus averages in Lemma 10. At each fixed \(z\) put \[H_r=\prod_{i=1}^n [1+\lambda(a_r\overline{Z_i}+\overline{a_r}Z_i)], \qquad R=\sum_r t_rH_r.\] The following pointwise calculations are on \(\{p>0\}\); all their integrands are multiplied by \(p_r\) or \(\sqrt p\) and are extended by zero on its complement. We have \[ \mathbb E H_r=1, \qquad \mathbb E(H_rH_s) =(1+2\lambda^2\mathop{\mathrm{Re}}(a_r\overline{a_s}))^n, \qquad \mathbb E R=1. \tag{60}\] For real \(y\) and integer \(n\ge1\), the binomial expansion gives \[|(1+y)^n-1-ny| \le\sum_{j=2}^n\frac{(n|y|)^j}{j!} \le\frac{(n|y|)^2}{2}\exp(n|y|).\] Apply this with \(y=2\lambda^2\mathop{\mathrm{Re}}(a_r\overline{a_s})\); then \(n|y|\le18\delta\). Since \(\sum_rt_r=1\), the sum of the linear terms in (60) is \(2n\lambda^2|\sum_rt_ra_r|^2\). Therefore \[ \mathbb E(R-1)^2 \le2\delta|\beta-q|^2+162e^{18\delta}\delta^2. \tag{61}\] This bound is uniform in the number of colors and in all the later geometric parameters. For every \(x\ge0\), \[ \sqrt x\ge1+\frac{x-1}{2}-(x-1)^2. \tag{62}\] In fact, on setting \(t=\sqrt x\), the difference between the two sides equals \((t-1)^2(t^2+2t+1/2)\). Multiplying (62) by \(\sqrt p\), taking the independent-phase expectation, and using (53) and (61) shows that the averaged polynomial lower bound is at least \[\int_\mathbb T\sqrt p\,\,\mathrm dz -2\delta^2-162e^{18\delta}\delta^2\int_\mathbb T\sqrt p\,\,\mathrm dz \ge \int_\mathbb T\sqrt p\,\,\mathrm dz-300\delta^2.\] Here \(\int\sqrt p\le\sqrt2\) and \(\delta\le1/100\) were used. The expression \[\sqrt p\,[1+(R-1)/2-(R-1)^2]\] is a Laurent polynomial in the phases with fixed integrable coefficients. Lemma 10 therefore transfers this lower bound, up to any prescribed error, to the diagonal phases \(Z_i=\mathop{\mathrm{e}}(L_i z)\). On that diagonal \(pR=\sum_r h_r^{(n)}\). There is no need to apply the lemma to \(\sqrt R\) itself. Finally, for nonnegative densities \(g,h\) on the unit circle, \[ \left|\int_\mathbb T\sqrt g-\int_\mathbb T\sqrt h\right| \le\left(\int_\mathbb T|g-h|\right)^{1/2}, \tag{63}\] by \((\sqrt g-\sqrt h)^2\le|g-h|\) and Cauchy–Schwarz. Thus the actual output density \(p^{\rm out}=\sum_rg_r^{(n)}\) satisfies, for any chosen \(\nu>0\) and sufficiently accurate construction, \[ \int_\mathbb T\sqrt{p^{\rm out}}\,\,\mathrm dz \ge\int_\mathbb T\sqrt p\,\,\mathrm dz-300\delta^2-\nu. \tag{64}\] Prediction and a previous estimator.With the same formal phases, put \[D=q+\frac1{n\lambda}\sum_{i=1}^n Z_i.\] For a fixed color \(r\) and fixed \(z\), \(H_r\) is a positive probability density on the product phase torus, and under this density the phases remain independent. Direct integration of one factor gives \[\mathbb E_{H_r}Z_i=\lambda a_r, \qquad \mathbb E_{H_r}|Z_i-\lambda a_r|^2 =1-\lambda^2|a_r|^2.\] Consequently \[ \mathbb E_{H_r}D=b_r, \qquad \mathbb E_{H_r}|D-b_r|^2 =\frac{1-\lambda^2|a_r|^2}{n\lambda^2} \le\frac2\delta. \tag{65}\] For the arbitrary fixed bounded previous estimator \(A\), this means that the cross term against \(A-kb_r\) vanishes at each \(z\): \[\mathbb E_{H_r}|A+D-(k+1)b_r|^2 =|A-kb_r|^2+\mathbb E_{H_r}|D-b_r|^2.\] After multiplying by \(p_r\), summing, and integrating, the increase in this mean square is at most \(4/\delta\). The expression \[\sum_r p_rH_r|A+q+(n\lambda)^{-1}\textstyle\sum_iZ_i-(k+1)b_r|^2\] is another finite Laurent polynomial with the fixed integrable coefficients in (59). Apply Lemma 10 to it simultaneously with the preceding square-root lower-bound test. Write \[ D(z)=q(z)+\frac1{n\lambda}\sum_{i=1}^n\mathop{\mathrm{e}}(L_i z) \tag{66}\] for the resulting actual multiplier. Its norm is bounded by \(2+1/\lambda\), independently of the choices of \(L_i\). In passing from model to actual color densities, the error in the prediction integral is at most \(W E_n\), where \[ W=(\|A\|_\infty+2+1/\lambda+k+1)^2. \tag{67}\] This finite number is known before choosing the anchor accuracy or any transmission frequencies. For example, choose \[e_0<\min\{(\nu/4)^2,\nu/(4W)\},\] and make the two phase-test errors less than \(\nu/2\). Together with (58) this proves \[ \sum_r\int_\mathbb Tp_r^{\rm out}|A+D-(k+1)b_r|^2\,\,\mathrm dz \le\sum_r\int_\mathbb Tp_r|A-kb_r|^2\,\,\mathrm dz +\frac4\delta+\nu, \tag{68}\] simultaneously with (64). The same \(e_0\) and support accuracies can be imposed before the anchor. Thus a small strength entails a more demanding finite accuracy requirement, without a circular parameter choice. Iteration of blocks.All color vectors can be transported with an arbitrarily small sum of physical norm errors at every passage. Reserve a total such budget smaller than \[\min\{\varepsilon,\sqrt2-\sqrt{3/2}\}.\] Since the sum of the color errors bounds the error of their sum, all intermediate packet sums then have squared norm less than \(2\). This supplies the mass bound used above at every step, with room to spare. Smooth map and inverse errors can likewise be apportioned among the finitely many blocks and, after \(n\) is chosen in a block, among its \(2n+1\) passages. Choosing a basic neighborhood specified by finitely many smooth norms inside the requested neighborhood makes this allocation explicit. Every passage may also make the new excluded arc arbitrarily small; apply this in particular at the last passage. Set \(\nu\le\delta^2\) in each block. Start with \(A_0=0\), and let \(A_{k+1}=A_k+D_{k+1}\) after block \(k+1\). At the beginning of each new block choose a new \(q\) from that block’s actual input densities. That \(q\) is then held fixed throughout its block. The band function, sieve modulus, strength, and length may all change from block to block. The estimates depend only on \(|b_r|\le1\), \(|q|\le2\), the mass bound \(2\), and (55); they require no uniform lower bound for the strengths and no uniform derivative bound for the successive centering functions. After \(K\) blocks, telescoping (64) and (68) gives \[\begin{align*} \int_\mathbb T\sqrt{p^{(K)}}\,\,\mathrm dz &\ge\int_\mathbb T\sqrt{p^{(0)}}\,\,\mathrm dz-400K\delta^2, \tag{69}\\ \sum_r\int_\mathbb Tp_r^{(K)} |A_K/K-b_r|^2\,\,\mathrm dz &\le\frac5{K\delta}. \tag{70}\end{align*}\] For the second estimate the initial error is zero, and \(4/\delta+\delta^2\le5/\delta\). Given the desired prediction tolerance \(\varepsilon\), first choose \(\delta>0\) sufficiently small and then put \[K=\left\lceil\frac{10}{\varepsilon^2\delta}\right\rceil.\] We can require simultaneously \(\delta\le1/100\) and \[400\left(\frac{10\delta}{\varepsilon^2}+\delta^2\right)<\tau.\] Then \(K\delta\) is large enough for (70), and \(K\delta^2\) is small enough for (69). These choices precede all blocks and do not depend on their future strengths or lengths. Set \(\Psi=A_K/K\). Disjoint angular-index supports make all different color cyclic subspaces orthogonal, so the spectral density formula gives exactly \[\left\|\sum_r b_rF_r^{(K)}- \Psi(U_{S^{(K)}})\sum_rF_r^{(K)}\right\|_2^2 =\sum_r\int_\mathbb Tp_r^{(K)}|b_r-\Psi|^2\,\,\mathrm dz.\] This proves the required norm estimate. Every \(D\) in (66) is smooth and has conjugation symmetry, hence so does \(\Psi\). Restoring the original scale of the tags proves the proposition in its stated form. ◻ Preparation, whitening, and the smooth limitThe finite prediction result encodes a target observable in a packet sum while retaining nearly flat total spectral density. We prepare arbitrary observables for that result, whiten the resulting vector to exactly flat density, and diagonalize the stages to obtain a smooth map whose one orbit is complete. All vector comparisons in this section take place in the fixed physical space \(L^2(\mathbb T^3)\), even when intermediate coordinates change. A neighborhood of a diffeomorphism will mean a neighborhood of the pair consisting of the map and its inverse in the \(C^\infty\) topology. For a unitary \(U\), write \[\mathcal C(U,f)=\overline{\operatorname{span}\{U^nf:n\in\mathbb Z\}}.\] We use the packet spectral calculus from Section 2: for a measurable function \(\alpha\) of the additive spectral variable \(z\), the coefficient of \(\alpha(U_S)F\) at angular index \(m\) is \(\alpha(m\phi(u)\bmod1)A_m(u,a)\). The notation is used only when the resulting vector has finite \(L^2\) norm. Lemma 11 (A flat vector). For every intermediate twist and every good arc \(I\), there is a real centered vector \(v\) of spectral density \(1\), using two nonzero angular indices and coefficients supported in a compact subinterval of \(I\). Proof. Choose a positive integer \(m\) and \(u_0<u_1\) in \(I\) such that \(m(\phi(u_1)-\phi(u_0))=1\). This is possible by first choosing a compact interval on which \(\phi\) increases and then making \(m\) large. Put \[A(u)=\mathbf 1_{[u_0,u_1]}(u) \sqrt{\frac{|m\phi'(u)|}{2}}, \qquad v(\theta,u,a)=A(u)\mathop{\mathrm{e}}(m\theta)+A(u)\mathop{\mathrm{e}}(-m\theta).\] The pushforward of \(|A(u)|^2\,\mathrm du\,\,\mathrm da\) by each of \(\pm m\phi(u)\) modulo one is \(\tfrac12\,\mathrm dz\). The two angular modes are orthogonal, so the spectral density of \(v\) is \(1\). The vector is real and centered. Its endpoint discontinuities are harmless: no smoothness is required of the vector. ◻ We call a pair \((S,f)\) admissible if \(S\) is an intermediate twist in smooth volume-preserving coordinates, with good arc \(I\), and \(f\) is real, has spectral density \(1\), and has finitely many nonzero angular modes with \(L^2\) coefficients supported in a compact subset of \(I\times\mathbb T\). In particular, \(f\) is centered and has norm one. Proposition 12 (One stage). Let \((S,f)\) be admissible, let \(h\) be a real smooth function in physical coordinates with \(\int h=0\) and \(\|h\|_\infty\le1\), and let \(\eta,\rho,\tau>0\). In every prescribed neighborhood of \(S\) there is an admissible pair \((S',f')\), with good arc \(I'\), and a finite Laurent polynomial \(P\) such that \[ \|f'-f\|_2<\tau,\qquad |\mathbb T\setminus I'|<\rho,\qquad \|h-P(U_{S'})f'\|_2 <|\mathbb T\setminus I|^{1/2}+\eta. \tag{71}\] Proof. We first prepare smooth packets for \(f\) and \(h\), then put constant tags on disjoint packets, and finally use Proposition 9. Every accuracy appearing below may be made arbitrarily small after the finite data on which it depends have been fixed. At a fixed map we use the density estimate (4), which also applies to the nonsmooth \(L^2\) coefficients of an admissible vector. Across a passage, density preservation instead comes from Lemma 5. Converting the angular averages.In the current coordinates write \[h=h_\perp+g(u,a),\qquad g_0(a)=\int_\mathbb Tg(u,a)\,\mathrm du,\qquad r(u,a)=g(u,a)-g_0(a).\] Here \(h_\perp\) has zero \(\theta\)-average, \(r\) has zero \(u\)-average for each \(a\), and \(\int g_0=0\). Fourier truncation and smoothing on the good arc give a real smooth packet sum \(F\) arbitrarily close to \(f\). By (4), its density is arbitrarily close to \(1\) in \(L^1\). Let \(\beta=|\mathbb T\setminus I|\). Fiberwise Parseval gives \[\int_\mathbb T|h_\perp(\theta,u,a)|^2\,\mathrm d\theta \le \int_\mathbb T|h(\theta,u,a)|^2\,\mathrm d\theta\le1.\] Thus cutting \(h_\perp\) off smoothly inside \(I\), and then retaining finitely many of its nonzero angular modes, loses at most \(\sqrt\beta+\varepsilon\) in norm, for arbitrary \(\varepsilon>0\). For example, the cutoff may be chosen with \(\int_\mathbb T(1-\chi)^2\,\mathrm du<\beta+\varepsilon^2\). Denote the resulting packet sum by \(H_\perp\). The simultaneous-list version of Lemma 5, stated in Remark 6, transports the \(F\) and \(H_\perp\) lists through a common passage even when their supports overlap. We require density preservation only for the \(F\) list; no orthogonality between the two lists is asserted. The next passage turns variation in the old \(u\) coordinate into nonzero angular modes; the passage after it does the same for the old \(a\) coordinate. There are two remaining terms, and neither will be discarded. Before the first passage integer \(N_1\) is chosen, fix a finite nonzero \(u\)-Fourier truncation \(r_K\) of \(r\). Choose the new good arc in the \(a\) variable and its smooth cutoff \(\chi_1(a)\) so that replacing \(r_K\) by \(\chi_1r_K\) costs arbitrarily little. These are fixed functions of the old slow variables. The cutoff can simultaneously lose arbitrarily little mass from the finitely many existing packets. Choose the broad neutral jitter and then \(N_1\), as in Lemma 5. In the new coordinates \[(u,a,b),\qquad b=\theta-H_1(u),\] the function \(\chi_1(a)r_K(u,a)\) is already a finite sum of nonzero angular modes supported in the new good arc. The former packets are transported with arbitrarily small norm error, and the density of the \(F\) packets changes by arbitrarily little in \(L^1\). Choose \(N_1\) also so that every retained transported old index lies outside \([-K,K]\): its quotient by \(N_1\) stays in a fixed compact set away from zero. This keeps the added modes of \(r_K\) disjoint in angular index from the transported test packets. The function \(g_0(a)\) has been left entirely untouched. Now fix a finite nonzero \(a\)-Fourier truncation \((g_0)_L\) of \(g_0\). It has no constant term because \(\int g_0=0\). Apply a second neutral passage to all existing packets. Its new coordinates are \[(a,b,d),\qquad d=u-H_2(a).\] Choose its good arc and cutoff \(\chi_2(b)\) before its final integer \(N_2\). The term \(\chi_2(b)(g_0)_L(a)\) is now a smooth packet sum in nonzero angular modes. Its cutoff loses arbitrarily little norm and cannot introduce an angular constant. Choose \(N_2\) also so that the transported indices lie outside \([-L,L]\), keeping the newly added modes disjoint from them. The existing packets are transported with arbitrarily small norm and density errors. Relabel the coordinates of the resulting twist as \((\theta,u,a)\). For every \(\varepsilon>0\) the above choices therefore give real smooth packet sums \(F,H\) such that \[ \|F-f\|_2<\varepsilon,\qquad \|H-h\|_2<\sqrt\beta+\varepsilon,\qquad \|p_F-1\|_1<\varepsilon. \tag{72}\] The functions that needed new cutoffs were fixed before the relevant passage integer was chosen. In particular, this argument has not assumed uniform control of coefficients arising only after that choice. Constant ratios on rectangles.Enlarge the finite angular index list so that it contains the modes of both \(F\) and \(H\), and write their coefficients as \(F_m,H_m\). For almost every sufficiently small real \(t\), \[ \int_{\{F_m+tH_m=0\}}|H_m|^2\,\mathrm du\,\,\mathrm da=0 \quad\hbox{for every }m. \tag{73}\] To see this, at a point where \(H_m\ne0\) at most one real \(t\) solves \(F_m+tH_m=0\); Fubini applied to \(|H_m|^2\,\mathrm du\,\,\mathrm da\,\,\mathrm dt\) proves the assertion. There are only finitely many indices. Replace \(F\) by \(F+tH\) with such a sufficiently small real \(t\). Its norm and density changes are arbitrarily small by (4), and reality is preserved. Define \(R_m=H_m/F_m\) where \(F_m\ne0\), and zero otherwise. In view of (73), \(H_m=R_mF_m\) almost everywhere. With \(\,\mathrm d\nu_m=|F_m|^2\,\mathrm du\,\,\mathrm da\), one has \(\int|R_m|^2\,\mathrm d\nu_m=\|H_m\|_2^2\). Truncating \(R_m\) to a bounded function therefore changes \(R_mF_m\) arbitrarily little in \(L^2\). Finite rectangular step functions are dense in \(L^2(\nu_m)\): continuous functions are dense for this finite measure, and uniform continuity approximates a continuous function by a fine rectangular grid. Grid boundaries have \(\nu_m\)-measure zero, since \(\nu_m\) is absolutely continuous. Approximate each bounded ratio by such a step function, and replace the indicators of the finitely many grid rectangles by smooth interior cutoffs. Trim enough to obtain positive gaps between distinct retained rectangles, but lose arbitrarily little in both the \(F\) norm and the tagged norm. This is possible after the finitely many step values are known. Where a ratio has been truncated, a zero step value is allowed; we do not need to remove the corresponding \(F\) mass. Performing the construction at positive indices and reflecting it at negative indices gives packets \(F_r\) and constants \(b_r\) with conjugate symmetry, such that \[F^{\mathrm{tag}}=\sum_r F_r\quad\hbox{approximates }f, \qquad H^{\mathrm{tag}}=\sum_r b_rF_r\quad\hbox{approximates }h\] with the errors in (72), up to arbitrarily small additions. Different rectangles in \((m,u,a)\) are disjoint with gaps; each is its own color. The density of \(F^{\mathrm{tag}}\) remains arbitrarily close to \(1\) in \(L^1\). The number \[M=\max\bigl(1,\max_r|b_r|\bigr)\] is finite. All subsequent approximation errors for tagged vectors are chosen after \(M\) is known. Separation by angular index alone.Two further neutral passages supply exactly the hypotheses of Proposition 9. Here are the support details. Write the single old angular index of rectangle \(r\) as \(m_r\), and its compact coefficient support as \(K_r\). Choose \(c\) so that different \(m_r\) have separated ranges, and form \[E_r=\{(m_r(c+\phi(u)),a):(u,a)\in K_r\}.\] The compact sets \(E_r\) are pairwise disjoint: for a fixed \(m_r\) the map \((u,a)\mapsto(m_r(c+\phi(u)),a)\) is injective, and different indices were separated by \(c\). Choose smooth cutoffs \(\xi_r(s,a)\) supported in disjoint neighborhoods of these sets and equal to one near them. On the first passage retain the exact coefficients \[ C_{j,r}(a)=\chi(a)\xi_r(j/N,a) \int_\mathbb TA_r(u,a)\mathop{\mathrm{e}}(m_rH(u)-ju)\,\mathrm du. \tag{74}\] Here \(\chi\) is the new good-arc cutoff; its loss was made small before choosing the broad neutral jitter and \(N\). Lemma 2 shows that the support restrictions delete arbitrarily little norm as \(N\) increases. There are finitely many retained \(j\), all nonzero. In coordinates \((u,a,b)\) the resulting packets are \[C_{j,r}(a)\mathop{\mathrm{e}}(ju)\mathop{\mathrm{e}}(m_rb).\] Their moduli are independent of the new spare coordinate \(b\). Different old indices cannot share \(j\); at a shared \(j\), distinct colors have disjoint compact \(a\) supports with positive gaps. Fix this finite output before making the second passage. Choose its \(c_2\) to separate the ranges belonging to distinct \(j\). For each fixed \(j\), strict monotonicity of the current speed \(\sigma\) on its good arc makes the compact sets \[Q_{j,r}=\{j(c_2+\sigma(a)):a\in\mathop{\mathrm{supp}}C_{j,r}\}\] disjoint as \(r\) varies. Thus all nonempty \(Q_{j,r}\) have disjoint open neighborhoods. Restrict the second-passage coefficient at new index \(k\) by a smooth cutoff of \(k/N_2\) supported in its designated neighborhood and equal to one near \(Q_{j,r}\). Taking \(N_2\) last makes the deleted norm arbitrarily small, while the retained finite \(k\)-index sets are exactly disjoint for distinct pairs \((j,r)\). An individual output term has the form \[B_{k,j,r}(b)\mathop{\mathrm{e}}(ka)\mathop{\mathrm{e}}(jd),\qquad d=u-H_2(a),\] so its modulus is independent of the final spare coordinate \(d\). No interference can spoil this property, because different pairs have disjoint final index sets. Every integral and cutoff used here commutes with the constant tag \(b_r\). Consequently, if the sum of the individual color transport errors is less than \(\varepsilon/(1+M)\), both the untagged and the tagged physical errors are less than \(\varepsilon\). Neutral density preservation and (4) keep the total density arbitrarily close to \(1\). At this point the packet colors are disjoint in angular indices, their moduli are independent of the spare coordinate, and their mass can be required to be at most \(3/2\). Prediction and whitening.Apply Proposition 9 to the tags \(b_r/M\), with prediction tolerance divided by \(M\). Its physical transport errors are likewise chosen with the factor \(M\) included. Write \(G\) for the final real packet sum, \(p\) for its density, and \(D(U)G\) for the resulting approximation to the tagged vector, with the factor \(M\) restored. Here \(U\) is the Koopman operator of the final intermediate map. We can ensure \[ \|G-f\|_2\longrightarrow0, \qquad \|h-D(U)G\|_2<\sqrt\beta+\eta/2, \qquad \int_\mathbb T\sqrt p\,\,\mathrm dz\longrightarrow1 \tag{75}\] as the preparation and prediction tolerances tend to zero. For the last assertion, if the input density is \(p_0\), then \[\left|\int\sqrt{p_0}-1\right| \le\|\sqrt{p_0}-1\|_2 \le\|p_0-1\|_1^{1/2},\] and Proposition 9 gives an arbitrarily small loss in \(\int\sqrt p\). Its upper limit is at most one by \(\int\sqrt p\le\|G\|_2\) and \(\|G-f\|_2\to0\). Reality implies \(p(-z)=p(z)\) almost everywhere. Set \(E=\{p=0\}\), choose the flat real vector \(v\) of Lemma 11 for this last map, and define \[ f'=\left(\frac{\mathbf 1_{E^c}}{\sqrt p}\right)(U)G+\mathbf 1_E(U)v. \tag{76}\] The first term is well defined in \(L^2\), with squared norm \(|E^c|\). The terms have disjoint spectral supports and densities \(\mathbf 1_{E^c}\) and \(\mathbf 1_E\), respectively. Indeed, \(\mathbf 1_E(U)G=0\), even if \(v\) uses some of the same angular modes. The total density of \(f'\) is exactly one. Both multipliers preserve reality, nonzero angular indices, and compact support in the good arc. Hence the resulting pair is admissible. Directly, including the contribution from \(E\), \[ \|f'-G\|_2^2 =\int_\mathbb T(\sqrt p-1)^2\,\mathrm dz =\|G\|_2^2+1-2\int_\mathbb T\sqrt p\,\,\mathrm dz. \tag{77}\] This tends to zero by (75), and therefore \(\|f'-f\|_2\) can be made less than the independently specified \(\tau\). Whitening also preserves the prediction. In the measurable spectral calculus, \[G=(\sqrt p)(U)f',\qquad D(U)G=(D\sqrt p)(U)f'.\] Since \(f'\) has density one and \(D(U)G\in L^2\), the function \(D\sqrt p\) belongs to \(L^2(\mathbb T,\,\mathrm dz)\). Trigonometric polynomials are dense in this space, so \(D(U)G\) belongs to \(\mathcal C(U,f')\) and is approximated by a finite Laurent polynomial in \(U\) applied to \(f'\). Choose that approximation with error less than \(\eta/2\). This proves the last inequality in (71); it asserts an approximation to \(h\), not exact membership of \(h\) at this finite stage. Finally, each neutral passage and Proposition 9 allows an arbitrarily small physical perturbation of both map and inverse. There are finitely many such operations here, so they can all be kept in the prescribed neighborhood. The last new good arc may have complement less than \(\rho\). All choices of small physical errors are made after the finite tags, cutoffs, and coordinate changes that affect their bounds have been fixed. Thus neither large tags nor large derivatives of an earlier coordinate change obstruct the arbitrary closeness claimed in the proposition. ◻ Proof of Theorem 1. Choose a smooth periodic speed \(\phi_0\) which agrees with an increasing affine function on a nonempty closed interval inside \((0,1)\), and let \(I_0\) be an open subinterval where \(\phi_0'>0\). Start with the twist \(S_0\) and its flat vector \(f_0\) from Lemma 11. Choose a countable family of real smooth centered functions, bounded by one, whose real linear span is dense in real \(L^2_0(\mathbb T^3)\); the physical torus sines and cosines will do. List them as \((h_n)_{n\ge1}\) so that each occurs infinitely often. We record the continuity needed to retain approximations. If volume-preserving maps \(T_i\) and their inverses converge uniformly to \(T\) and \(T^{-1}\), then for every fixed \(k\in\mathbb Z\), \[ U_{T_i}^kg\longrightarrow U_T^kg\quad\hbox{in }L^2 \quad(g\in L^2). \tag{78}\] Uniform convergence of the corresponding fixed iterates follows by composition on the compact torus. For continuous \(g\) this proves uniform convergence of the compositions; for general \(g\), approximation by continuous functions and unitarity prove (78). Consequently, for every fixed Laurent polynomial \(P\) the map \[(T,g)\longmapsto P(U_T)g\] is continuous into physical \(L^2\) when maps and inverses have the \(C^\infty\) topology and vectors have the \(L^2\) topology. Explicitly, if \(P(w)=\sum_k c_kw^k\), its difference is bounded by \[\sum_k|c_k|\|g_i-g\|_2+ \sum_k|c_k|\|U_{T_i}^kg-U_T^kg\|_2.\] Inductively apply Proposition 12 with \(h=h_n\) and \(\eta=2^{-n}\), obtaining \((S_n,f_n)\), a good arc \(I_n\), and a finite Laurent polynomial \(P_n\), such that \[ |\mathbb T\setminus I_n|<4^{-n},\qquad \|h_n-P_n(U_{S_n})f_n\|_2 <|\mathbb T\setminus I_{n-1}|^{1/2}+2^{-n}. \tag{79}\] Use the arbitrary closeness in that proposition also to impose \[\|f_n-f_{n-1}\|_2<2^{-n}, \qquad d_k(S_n,S_{n-1})+d_k(S_n^{-1},S_{n-1}^{-1})<2^{-n} \quad(0\le k\le n),\] where \(d_k\) are ambient \(C^k\) sup-norm distances induced by a fixed smooth embedding of the torus. At the same time impose the finitely many open conditions \[ \|P_j(U_{S_n})f_n-P_j(U_{S_{n-1}})f_{n-1}\|_2<2^{-n} \qquad(1\le j<n). \tag{80}\] Their compatibility follows from the continuity just proved. No bound uniform in \(j\) on the degrees or coefficients of \(P_j\) is required. For each fixed \(k\), the map and inverse sequences have summable tails in \(C^k\). They therefore converge smoothly to maps \(T\) and \(R\). Uniform convergence, compactness, and \(S_nS_n^{-1}=S_n^{-1}S_n=\operatorname{id}\) give \(TR=RT=\operatorname{id}\), so \(T\) is a smooth diffeomorphism with smooth inverse. For every continuous \(g\), \[\int g\circ T=\lim_n\int g\circ S_n=\int g,\] so normalized volume is invariant. The vectors \(f_n\) converge in \(L^2\) to a real centered vector \(f\). Every completed stage has density exactly one. Combining (78) with \(f_n\to f\), for all \(r,s\in\mathbb Z\) we obtain \[ \langle U_T^rf,U_T^sf\rangle =\lim_n\langle U_{S_n}^rf_n,U_{S_n}^sf_n\rangle =\delta_{rs}. \tag{81}\] The retained finite polynomials give, for every \(j\), \[\|h_j-P_j(U_T)f\|_2 \le |\mathbb T\setminus I_{j-1}|^{1/2}+2^{-j} +\sum_{n>j}2^{-n} =|\mathbb T\setminus I_{j-1}|^{1/2}+2^{1-j}.\] Along the infinitely many occurrences of any fixed test the right side tends to zero. Hence every test belongs to \(\mathcal C(U_T,f)\). Their complex linear span is dense in complex \(L^2_0(\mathbb T^3)\), whereas every orbit vector is centered. Thus \[\mathcal C(U_T,f)=L^2_0(\mathbb T^3).\] Together with (81), this says that the bilateral orbit of \(f\) is an orthonormal basis of the entire centered space. With \(w=\mathop{\mathrm{e}}(z)\), the assignment \(U_T^nf\mapsto w^n\) extends to a unitary map onto \(L^2(S^1,m)\) intertwining \(U_T\) with multiplication by \(w\). Multiplication by \(w\) has no nonzero invariant vector, since \((w-1)g(w)=0\) forces \(g=0\) almost everywhere. Consequently every \(T\)-invariant \(L^2\) function is constant, which proves ergodicity. The manifold \(\mathbb T^3\) is compact, connected, smooth, and without boundary, and its normalized flat volume has strictly positive smooth density. These are all the properties required in Theorem 1. ◻ Dynamical consequencesThe spectral model gives ordinary mixing directly. The passage to higher orders uses the separate multiple-mixing theorem; the entropy and Lyapunov conclusions do not depend on that additional input. Corollary 13. For the diffeomorphism \(T\) and normalized standard volume \(\mu\) of Theorem 1, every integer \(k\ge2\) and every fixed choice of measurable sets \(A_1,\ldots,A_k\subseteq\mathbb T^3\) satisfy \[\mu\left(\bigcap_{i=1}^k T^{-t_i}A_i\right) \longrightarrow\prod_{i=1}^k\mu(A_i)\] whenever \(t_1<\cdots<t_k\) are integers and \(\min_{1\le i<k}(t_{i+1}-t_i)\to\infty\). Moreover, the Kolmogorov–Sinai entropy satisfies \(h_\mu(T)=0\), and all three Lyapunov exponents of \(T\), counted with multiplicity, vanish at \(\mu\)-almost every point. Proof. Let \(V:L^2_0(\mathbb T^3,\mu)\to L^2(S^1,m)\) be the unitary spectral model in Theorem 1. For \(a,b\in L^2_0(\mathbb T^3,\mu)\), \[\int_{\mathbb T^3}(a\circ T^n)\overline b\,\mathrm d\mu =\int_{S^1}w^n(Va)(w)\overline{(Vb)(w)}\,\mathrm dm(w) \longrightarrow0\qquad(|n|\to\infty).\] Indeed, \((Va)\overline{Vb}\in L^1(m)\) by Cauchy–Schwarz, so the limit is the Riemann–Lebesgue lemma. Taking centered indicators gives ordinary mixing. The map \(T\) is an invertible probability-preserving transformation with measurable inverse, so the multiple-mixing theorem (OpenAI 2026, Theorem 1.1) gives every order \(k\ge3\). Invariance shifts \(t_1\) to zero and identifies its positive time gaps with \(t_{i+1}-t_i\); the case \(k=2\) is ordinary mixing. The full Koopman operator is the direct sum of the one-dimensional constants and the simple Lebesgue model on all of \(L^2_0\), and hence has finite spectral multiplicity. Normalized torus volume is a Lebesgue probability space, and \(T\) is a measure-preserving automorphism. Rokhlin’s finite-multiplicity entropy theorem (Rokhlin 1960, sec. 7, p. 13) therefore gives \(h_\mu(T)=0\). The derivative and inverse derivative are bounded on the compact torus, so the invertible Oseledets integrability conditions hold. Write \(\lambda_1(x),\lambda_2(x),\lambda_3(x)\) for the exponents repeated according to multiplicity at regular points. Pesin’s entropy formula, as stated and reproved by Mañé (Mañé 1981, 95, equation (2)), applies to the \(C^\infty\) diffeomorphism and its absolutely continuous invariant probability \(\mu\). Thus \[0=h_\mu(T)=\int_{\mathbb T^3}\sum_{i=1}^3\max\{\lambda_i(x),0\}\,\mathrm d\mu(x).\] The nonnegative integrand vanishes almost everywhere, so every exponent is nonpositive there. Preservation of standard volume gives \(|\det DT_x|=1\), and at every Oseledets-regular point \[\sum_{i=1}^3\lambda_i(x) =\lim_{n\to\infty}\frac1n\log|\det D(T^n)_x|=0.\] The three nonpositive exponents must therefore all be zero at \(\mu\)-almost every point. ◻
Abdalaoui, el Houcein el. 2023. Spectral Ergodic Banach Problem and Flat Polynomials. arXiv:1508.06439v8. https://arxiv.org/abs/1508.06439v8.
Abdedou, Fatna, Bassam Fayad, and Arezki Kessi. 2023. “Analytic Reparametrizations of Translation Toral Flows with Countable Lebesgue Spectrum.” Discrete and Continuous Dynamical Systems 43 (10): 3706–27. https://doi.org/10.3934/dcds.2023063.
Anosov, D. V., and A. B. Katok. 1970. “New Examples in Smooth Ergodic Theory. Ergodic Diffeomorphisms.” Trudy Moskovskogo Matematicheskogo Obshchestva 23: 3–36. https://www.mathnet.ru/eng/mmo237.
Fayad, Bassam R. 2001. “Partially Mixing and Locally Rank One Smooth Transformations and Flows on the Torus \(\mathbb T^d\), \(d\ge3\).” Journal of the London Mathematical Society 64 (3): 637–54. https://doi.org/10.1112/S0024610701002447.
Fayad, Bassam, Giovanni Forni, and Adam Kanigowski. 2021. “Lebesgue Spectrum of Countable Multiplicity for Conservative Flows on the Torus.” Journal of the American Mathematical Society 34 (3): 747–813. https://doi.org/10.1090/jams/970.
Guenais, Mélanie. 1999. “Morse Cocycles and Simple Lebesgue Spectrum.” Ergodic Theory and Dynamical Systems 19 (2): 437–46. https://doi.org/10.1017/S0143385799126579.
Helson, Henry, and William Parry. 1978. “Cocycles and Spectra.” Arkiv för Matematik 16: 195–206. https://doi.org/10.1007/BF02385994.
Hörmander, Lars. 2003. The Analysis of Linear Partial Differential Operators I: Distribution Theory and Fourier Analysis. Second. Classics in Mathematics. Springer. https://doi.org/10.1007/978-3-642-61497-2.
Mañé, Ricardo. 1981. “A Proof of Pesin’s Formula.” Ergodic Theory and Dynamical Systems 1: 95–102. https://doi.org/10.1017/S0143385700001188.
Mathew, J., and M. G. Nadkarni. 1984. “A Measure Preserving Transformation Whose Spectrum Has Lebesgue Component of Multiplicity Two.” Bulletin of the London Mathematical Society 16 (4): 402–6. https://doi.org/10.1112/blms/16.4.402.
OpenAI. 2026. Rokhlin’s multiple-mixing problem for one transformation. OpenAI Math Release preprint OAI:Rokhlins-multiple-mixing-problem-for-one-transformation-September-23-2026.
Prikhod’ko, A. A. 2020. “On Ergodic Flows with Simple Lebesgue Spectrum.” Sbornik: Mathematics 211 (4): 594–615. https://doi.org/10.1070/SM8147.
Rokhlin, V. A. 1949. “Selected Topics from the Metric Theory of Dynamical Systems.” Uspekhi Matematicheskikh Nauk 4 (2(30)): 57–128. https://www.mathnet.ru/eng/rm8607.
Rokhlin, V. A. 1960. “New Progress in the Theory of Transformations with Invariant Measure.” Russian Mathematical Surveys 15 (4): 1–22. https://www.mathnet.ru/eng/rm6735.
Ulam, S. M. 1960. A Collection of Mathematical Problems. Vol. 8. Interscience Tracts in Pure and Applied Mathematics. Interscience Publishers.
|
| ||||||||
|