Asymptotics of the Sum of a Sine Series with a Convex Slowly Varying Sequence of Coefﬁcients

: We study the asymptotic behavior in a neighborhood of zero of the sum of a sine series g ( b , x ) = ∑ ∞ k = 1 b k sin kx whose coefﬁcients constitute a convex slowly varying sequence b . The main term of the asymptotics of the sum of such a series was obtained by Aljanˇci´c, Bojani´c, and Tomi´c. To estimate the deviation of g ( b , x ) from the main term of its asymptotics b m ( x ) / x , m ( x ) = [ π / x ] , Telyakovski˘ı used the piecewise-continuous function σ ( b , x ) = x ∑ m ( x ) − 1 k = 1 k 2 ( b k − b k + 1 ) . He showed that the difference g ( b , x ) − b m ( x ) / x in some neighborhood of zero admits a two-sided estimate in terms of the function σ ( b , x ) with absolute constants independent of b . Earlier, the author found the sharp values of these constants. In the present paper, the asymptotics of the function g ( b , x ) on the class of convex slowly varying sequences in the regular case is obtained.


Introduction
In this paper, we refine the asymptotics of the sum of a sine series with convex slowly varying coefficients, obtained by Aljančić, Bojanić, and Tomić [1] and strengthened by Telyakovskiȋ [2,3].
The result of Aljančić, Bojanić, and Tomić was generalized for more extensive classes of trigonometric series. In [4,5], results reducing the asymptotic behavior of trigonometric series with general monotone coefficients to ones with monotone coefficients were obtained. The asymptotics of trigonometric series with quasimonotone coefficients was studied in [6][7][8][9]. In the context of the indicated problem, in [10,11], quasimonotonicity and extensions of regularly varying and slowly varying coefficients were considered. Note that it is possible to improve the asymptotics for the last case using the results of the present paper. Along with the asymptotics of a trigonometric series with a slowly varying sequence of coefficients, it is interesting to study the asymptotics of the Fourier transform and the Laplace transform of a slowly varying function. The latter finds applications in the theory of entire functions (see, for example, [12]).
Consider a nonincreasing null sequence of positive numbers b = {b k } ∞ k=1 and the function: The series ∑ ∞ k=1 b k sin kx is well known to converge everywhere. Its sum g(b, x) is continuous on (0, 2π). We shall be concerned with the behavior of the function g(b, x) in a right-hand neighborhood of zero. The most principal is the situation when a sequence of the coefficients b is slowly varying. In this case, the sequence of partial sums of the sine series converges very slowly and its sum g(b, x) may not even be Lebesgue integrable.
Throughout this paper, we use [x] to denote the integer part of a number x.
The main term of the asymptotics of the function g(b, x) for the case in which a sequence of coefficients is slowly varying under the additional convexity condition (b k − 2b k+1 + b k+2 0, ∀k ∈ N) was obtained by Aljančić, Bojanić, and Tomić [1].
Telyakovskiȋ [2,3] strengthened the result of Aljančić, Bojanić, and Tomić. He showed that it is convenient to compare the difference between the sum of a sine series and the main term of its asymptotics with the function: As usual, we define ∆b k = b k − b k+1 . Telyakovskiȋ proved the following result.
Theorem 2 ([2,16]). There are positive absolute constants C 1 and C 2 such that: for any convex null sequence b.
If a sequence b is slowly varying, then the order relation: holds (see Ch. II, §2, Theorem 2.4 in [14]), from which, in view of (3), the asymptotic formula is immediate (see Lemma 1): x .
Thus, Theorem 2 is an enhancement of Theorem 1 and gives the remainder term in the asymptotic (2).
In [17], the sharp values of the constants in Theorem 2 were found. Namely, the following results were obtained. Theorem 3 ([17]). For any convex null sequence b, There exists a convex slowly varying null sequence b and a sequence of points {x l } ∞ l=1 , x l → +0, such that: Theorem 4 ([17]). For any convex null sequence b, There exists a convex slowly varying null sequence b and a sequence of points {x l } ∞ l=1 , x l → +0, such that: We remark that the last two terms in (6) are negative and do not exceed O xb m(x) = o(x), x → +0.
Thus, for the class of all convex sequences b, the following extreme problems are solved: Note that in the examples verifying the accuracy of the limit relations (5) and (7), the sequence b is slowly varying. Thus, the validity of the relations (8) and (9) is preserved if the maximum and minimum are taken on the class of all convex slowly varying sequences b.
In [18,19], the sharp two-sided estimate of the sum of a sine series with convex coefficients was obtained. In the examples verifying the accuracy of this estimate, the sequence of the coefficients is slowly varying. In the present paper, we supplement the two-sided estimate of the sum of a sine series with a convex sequence of coefficients (see (4) and (6)) with an asymptotic relation that refines Theorem 1 for the case in which the sequence {k∆b k } ∞ k=1 is slowly varying. Note (see Lemma 3) that the latter condition is slightly stronger than the condition that the sequence b is slowly varying, under which the relation (2) is true.

Preliminaries
In this section, we prove the necessary auxiliary results.
is called regularly varying with parameter p (see [13,14]) if: Lemma 1. Let b be a positive nonincreasing slowly varying sequence. If a positive sequence {a n } ∞ n=1 is such that the sequence {∑ n k=1 a k } ∞ n=1 is regularly varying with parameter p > 0, then the following limit ratio holds: Proof. It is sufficient to show that: For each ε > 0, we select δ > 0 so that: The sequence {∑ n k=1 a k } ∞ n=1 is regularly varying, so we have: In view of (11) and (12), there is N 1 such that, for all n N 1 , Since the sequence b is slowly varying, there is N 2 such that, for all n > N 2 , Using the monotonicity of the sequence b for all n > max{N 1 , N 2 } from (14) and (13), we have: This proves the limit relation (10), and therefore the lemma.

Lemma 2.
Let b(t) be a positive decreasing slowly varying function. Then, for any A > 0, Proof. By the monotonicity and positivity of the function b(t), we have: Now, the required limit relation follows from (15) and (16).

Lemma 3.
Let b be a positive nonincreasing sequence. If the sequence {k∆b k } ∞ k=1 is slowly varying, then the sequence b is also slowly varying.
Proof. The sequence b is monotone, and so, it is sufficient to show (see [14]) that: Since the sequence k∆b k is slowly varying, we have: In view of (18) and (19) and since the sequence b is monotone, From (18) and (20), we have: Now, (17) follows from this limit relation in view of Stolz's theorem. Proof. To prove the lemma, it is sufficient to apply L'Hôpital's rule for an arbitrary A > 0:

Lemma 5.
Let ψ(t) be a function continuous on [0, π], and let {β k } ∞ k=0 be a positive nonincreasing slowly varying sequence. Then: Proof. Let us first prove the limit relation (21) in the case when ψ(t) is a piecewise constant function. Since both sides of the relation (21) depend linearly on ψ(t), it suffices to verify (21) for the functions χ c (t) of the form: where c is some fixed number from the interval (0, π). For such functions, the limit relation (21) has the form: The sequence {β k } ∞ k=0 is a nonincreasing slowly varying sequence; hence: (see Ch. I, §1.8, Lemma 1.15 in [14]). Now, the limit relation (22) follows from (23) and Lemma 1 with a n = 1, b n = β n . This proves the limit relation (21) for piecewise constant functions ψ(t). Now, let ψ(t) be a continuous function on [0, π]. For any ε > 0, there is a piecewise constant function ϕ(t) with the property: for all t ∈ [0, π]. As already proven, there exists δ 1 > 0 such that for all x, 0 < x < δ 1 , Again, taking into account Lemma 1, where a n = 1, b n = β n , one can find δ 2 > 0 such that for all x, 0 < We set δ = min{δ 1 , δ 2 }. For all x, 0 < x < δ, from the inequalities (24)-(26), we have: Lemma 6. Let {β k } ∞ k=1 be a positive slowly varying sequence. Furthermore, let the sequence {β k /k} ∞ k=1 be nonincreasing. Then: Proof. For any ε > 0, we take the number N so that: Then: For this N, we take η 1 so that, for all x, 0 < x < η 1 , the following inequalities are satisfied: Since the sequence {β k } ∞ k=1 varies slowly, the limit relation lim n→∞ β [λn] /β n = 1 holds uniformly over λ ∈ [1, N] (see Ch. I, § 1.2, Theorem 1.1 in [14]). Therefore, for some We set η = min{η 1 , η 2 }. For any x, 0 < x < η, we split the required sum into three sums: We estimate each term in (32). In view of (28) and (29), for the first term, we have: To estimate the second term on the right of (32), we use the inequalities (31) and (30) to obtain: For the third term, we use the standard estimation of the remainder of a trigonometric series with monotone coefficients, as well as the inequalities (31) and (27) and the inequality sin x > (2/π)x, x ∈ (0, π/2), Combining (32)-(35), we arrive at the following estimate: The proof of the lemma is complete.

Asymptotics of the Sum of a Sine Series in the Regular Case
In this section, we investigate the case when the sequence b is not only convex and slowly varying, but more or less regular. More precisely, we require that the sequence {k∆b k } ∞ k=1 be slowly varying. By Lemma 3, this condition implies that the sequence b is also slowly varying. It turns out that, with this additional requirement, for the sum of a sine series, the first two terms of the asymptotic expansion can be written down.
Theorem 5. Let b be a non-negative convex null sequence. If the sequence {k∆b k } ∞ k=1 varies slowly, then: Here and in the sequel, the Euler constant is denoted by γ.
Proof. Denote by: the conjugate Dirichlet kernel. Applying the Abel transform to the sum of a sine series g(b, x) and taking into account (37), we obtain: Applying Lemma 5 to the function ψ(t) = (1 − cos t)/t and the sequence β k = k∆b k , we obtain: On the other hand, Let us show that the second term on the right of (40) divided by m(x)∆b m(x) tends to zero. Indeed, since 1 − cos x < x 2 /2, x > 0, we have: At the same time, according to Lemma 1, we have: From (39) and (40), the equality follows: Now, we apply Lemma 6 to the sequence β k = k∆b k . Note that the sequence β k /k = ∆b k is not increasing, since the sequence b is convex. We have: Finally, combining (38), (41), and (42), we conclude that: The proof of the theorem is complete.
This theorem can be reformulated in terms of a comparison with the function σ(b, x), which allows us to compare the asymptotics obtained above with the results of Theorems 3 and 4. Corollary 1. Let b be a non-negative convex null sequence. If the sequence {k∆b k } ∞ k=1 varies slowly, then: Proof. We apply Lemma 1 with a k = k(k + 1)/2 (see also (3)). The following ordinal relations hold: x , x → +0.
It remains to substitute the above asymptotics in the ordinal relation (36).
Finally, a reformulation of the above result in the spirit of Theorem 1 allows us to write the second term of the asymptotic expansion of the sum of a sine series in a compact form.

Corollary 2.
Let b(t) be a non-negative convex differentiable function that tends to zero as t → +∞. If the function −tb (t) varies slowly, then: Proof. Since the function −tb (t) is slowly varying, the following ordinal relation takes place: On the other hand, by Lemma 2, we have: Substituting (43) and (44) in Theorem 5, we obtain the required asymptotics.

Remark 1.
According to Lemma 4, the condition that the function −tb (t) is slowly varying implies that the function b(t) is slowly varying. Thus, Corollary 2 is a refinement of Theorem 1 with an additional restriction on the sequence of the coefficients of a sine series.
Corollary 3. Let b(t) be a non-negative convex differentiable function that tends to zero as t → +∞. If the function −tb (t) varies slowly, then: Proof. The arguments are similar to those carried out in the proof of Corollary 2 and are based on the following asymptotic equalities: The last result shows that in Theorem 1, we can simply replace the argument of the function b(t) with π/x by e −γ /x to obtain a more accurate approximation of the sum of a sine series.