Multicomponent pseudo-periodic mappings (Q679495): Difference between revisions

A mapping \(P:\mathbb{R}^n\to\mathbb{R}^m\) is said to be periodic if \(P(x+t)=P(x)\) for all \(x\in\mathbb{R}^n\) and all \(t\in\mathbb{Z}^n\). A mapping \(F:\mathbb{R}^n\to\mathbb{R}^m\) that is the sum of a linear mapping and a periodic mapping is said to be pseudo-periodic. In the paper the structure of regular level curves for pseudo-periodic mappings \(F\) from \(\mathbb{R}^n\) into \(\mathbb{R}^{n-1}\) that map the integral lattice \(\mathbb{Z}^n\) into a dense subset of \(\mathbb{R}^{n-1}\) is studied. As usual, by a regular level curve of \(F\) is meant the preimage of a regular value of \(F\). Every regular level curve is decomposable into a family of unbounded components (diffeomorphic to a line) and a family of bounded components (diffeomorphic to a circle). It is known that all regular level curves contain the same (odd) number of unbounded components and for \(n=2\) all pseudo-periodic mappings are one-component, i.e., each regular level curve contains one unbounded component. In contrast with the case \(n=2\), for \(n>2\) the structure of regular level curves is more complicated. In the paper the following main results are obtained. Theorem 1. There are pseudo-periodic mappings from \(\mathbb{R}^3\) into \(\mathbb{R}^2\) whose regular level curves contain an arbitrarily large number of unbounded components. Theorem 2. Let \(F=(f_1,\dots,f_{n-1})\) be a pseudo-periodic mapping. Assume that for some \(a_2,\dots,a_{n-1}\) the surface \(M=f^{-1}_2(a_2)\cup\dots\cup f^{-1}_{n-1}(a_{n-1})\) is regular and is the union of a component diffeomorphic to a plane and a family of bounded surfaces. Then \(F\) is one-component. Theorem 3. The number of unbounded components of a regular level curve of a pseudo-periodic mapping cannot increase under its small perturbations. Theorem 4. Let \(F\) be a \(k\)-component pseudo-periodic mapping. Let \(\bar N\) be the closure of the union of all unbounded components of regular level curves of \(F\). The number of connected components of \(\bar N\) is at most \(k\).