Almost Periodic Functions and Sequences
[27/93%]Prove that if is an irrational number, then for any and there exists such that . Verify that the set of such is relatively dense on the line (compare with problem I.3.2).
a) Prove that if and the ratio is irrational, then for any and there exists such that
Conversely, if system (1) is solvable for for any , , then the ratio is irrational. b) Prove that if and are independent over modulo 1, then there exists a relatively dense set of integer solutions of system (1) on the line.
What condition must the real numbers satisfy so that for any the system of equations
has a solution satisfying for some ?
What condition must the real numbers satisfy so that for any and the system of equations
has
a real solution ;
a relatively dense set of solutions?
What condition must the real numbers satisfy so that for any and the system of equations
has
an integer solution ;
a relatively dense set of integer solutions?
Let , where . Prove that if the function is not identically zero, then it takes values of different signs.
Prove that every quasi-trigonometric polynomial
possesses the property of uniform almost periodicity. Verify that the polynomial is periodic if and only if the factors are pairwise commensurable (i.e. their ratios are rational).
A complex-valued function defined on is called uniformly almost periodic (u.a.p.) if for any there exists a number such that every interval of length contains at least one number (an -almost period) for which
Let be a function having period 1 in each argument, numbers linearly independent over , . Prove that the function
is uniformly almost periodic.
A complex-valued function defined on is called uniformly almost periodic (u.a.p.) if for any there exists a number such that every interval of length contains at least one number (an -almost period) for which
Prove that if is a continuous u.a.p. function and its -almost periods are bounded for small , then is periodic.
A complex-valued function defined on is called uniformly almost periodic (u.a.p.) if for any there exists a number such that every interval of length contains at least one number (an -almost period) for which
Prove that a u.a.p.function continuous on is uniformly continuous on the line and bounded. Do unbounded nonperiodic u.a.p.functions exist? Does continuity follow from boundedness?
A complex-valued function defined on is called uniformly almost periodic (u.a.p.) if for any there exists a number such that every interval of length contains at least one number (an -almost period) for which
Prove that the limit of a uniformly convergent (on ) sequence of u.a.p.functions is a u.a.p.function.
A complex-valued function defined on is called uniformly almost periodic (u.a.p.) if for any there exists a number such that every interval of length contains at least one number (an -almost period) for which
Prove that if a u.a.p.function has a derivative that exists and is uniformly continuous, then it is also a u.a.p.function.
A complex-valued function defined on is called uniformly almost periodic (u.a.p.) if for any there exists a number such that every interval of length contains at least one number (an -almost period) for which
Prove that if the antiderivative of a continuous u.a.p.function is bounded, then it is also a u.a.p.function.
A complex-valued function defined on is called uniformly almost periodic (u.a.p.) if for any there exists a number such that every interval of length contains at least one number (an -almost period) for which
Let . Prove that the function has the u.a.p.property if and only if, for every numerical sequence , one can choose from the sequence a subsequence that converges uniformly on (compactness of the family of shifts).
A complex-valued function defined on is called uniformly almost periodic (u.a.p.) if for any there exists a number such that every interval of length contains at least one number (an -almost period) for which
Prove that the sum and product of continuous u.a.p.functions are again a u.a.p.function.
A complex-valued function defined on is called uniformly almost periodic (u.a.p.) if for any there exists a number such that every interval of length contains at least one number (an -almost period) for which
Prove that for every u.a.p.function there exists a mean value
A complex-valued function defined on is called uniformly almost periodic (u.a.p.) if for any there exists a number such that every interval of length contains at least one number (an -almost period) for which
Let , where are continuous u.a.p.functions, and the functional is defined in the previous problem. Prove that
has the properties of an inner product (in particular, if and only if );
the functions , form an uncountable family orthogonal with respect to this inner product;
the quantities , for pairwise distinct real numbers , satisfy the inequality
(Bessel's inequality for the system ). Deduce from this that only for an at most countable set of values of . Can this set be an arbitrary countable subset of ?
A complex-valued function defined on is called uniformly almost periodic (u.a.p.) if for any there exists a number such that every interval of length contains at least one number (an -almost period) for which
Let , be a nonperiodic sequence. Define the sequences and as follows:
Prove that at least one of the sequences is nonperiodic.
Let be an almost periodic sequence, the integer part of the number . Is a u.a.p.function?
Let us call a binary sequence almost periodic if, for every "word" () contained in it — we shall also write — there exists a number such that the set
intersects every segment of the natural sequence of length . Almost periodicity for two-sided sequences is defined analogously.
A complex-valued function defined on is called uniformly almost periodic (u.a.p.) if for any there exists a number such that every interval of length contains at least one number (an -almost period) for which
Is it true that for every almost periodic sequence there exists a limit of the Cesàro means
Let us call a binary sequence almost periodic if, for every "word" () contained in it — we shall also write — there exists a number such that the set
intersects every segment of the natural sequence of length . Almost periodicity for two-sided sequences is defined analogously.
Let be an irrational number, a strip in , and the set of integer points in . Verify that the orthogonal projections of the points of onto the side of the strip (Fig. 10) divide it into segments whose lengths take only two values: and . Numbering the segments by integers in the order of their location on the line, set if the -th segment has length , and otherwise. Prove that the sequence is almost periodic.
Fig. 10
Let us call a binary sequence almost periodic if, for every "word" () contained in it — we shall also write — there exists a number such that the set
intersects every segment of the natural sequence of length . Almost periodicity for two-sided sequences is defined analogously.
Consider the Morse sequence
defined by the equalities for . Prove that it is almost periodic.
Let us call a binary sequence almost periodic if, for every "word" () contained in it — we shall also write — there exists a number such that the set
intersects every segment of the natural sequence of length . Almost periodicity for two-sided sequences is defined analogously.
For a finite sequence ("word")
of zeros and ones, let denote , and , where . Define a sequence by specifying its initial segments , which are defined recursively: is any word, ,
where is some word of zeros and ones,
and so on. Thus serves as the beginning of , as the beginning of , and so on. The infinite sequence defines a certain sequence . Prove that it is periodic or almost periodic.
Let us call a binary sequence almost periodic if, for every "word" () contained in it — we shall also write — there exists a number such that the set
intersects every segment of the natural sequence of length . Almost periodicity for two-sided sequences is defined analogously.
A folding sequence is a sequence of zeros and ones whose initial segments of length have the form
The name of the sequence is explained by the fact that the word can be associated with the sequence of folds of a paper strip formed on it as a result of folding it times (first in half, then in half again, and so on). If, moving along the strip, we assign a one to each fold resulting in a turn to the left, and a zero to a "turn right" fold, we obtain (Fig. 11). The sequence is uniquely determined by specifying the numbers
Fig. 11
Prove that every folding sequence is almost periodic but not periodic, even if we restrict to terms with arbitrarily large indices.
Let us call a binary sequence almost periodic if, for every "word" () contained in it — we shall also write — there exists a number such that the set
intersects every segment of the natural sequence of length . Almost periodicity for two-sided sequences is defined analogously.
Prove that fold sequences (see Problem 4.24) have the following property (Besicovitch almost periodicity): for every there exist a number and numbers such that
-
if is the number of those that fall into the interval , then for all intervals of length ;
-
for every ;
-
.
Prove that if , where is a fold sequence, then for any the limit
exists (the "Fourier coefficient"), and moreover
and otherwise. Verify that the "Parseval equality" holds:
Consider the binary sequence
(the Rudin-Shapiro sequence), whose initial segments of length have the form , where and are words of length , with , and for the words are defined recursively:
( is obtained from by swapping ). Prove the almost periodicity of this sequence.
Note that the sequence is the sequence of coefficients of the Rudin-Shapiro polynomials (see Problem IX.4.25).
Let us call a binary sequence almost periodic if, for every "word" () contained in it — we shall also write — there exists a number such that the set
intersects every segment of the natural sequence of length . Almost periodicity for two-sided sequences is defined analogously.