A test of convergence of Fourier series with respect to multiplicative systems, analogous to the Jordan test (Q917840)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A test of convergence of Fourier series with respect to multiplicative systems, analogous to the Jordan test |
scientific article |
Statements
A test of convergence of Fourier series with respect to multiplicative systems, analogous to the Jordan test (English)
0 references
1989
0 references
Let \(p_ 0=1\) and let \((p_ n)_{n\geq 1}\) be a sequence of integers with \(p_ n\geq 2\). Write \(m_ n:=p_ 1p_ 2...p_ n\) \((n=1,2,...)\). Let G be the group of sequences \((x_ n)_{n\geq 1}\) with \(x_ n\in \{0,1,...,p_ n-1\}\) and the group operation \((x_ n)\dot +(y_ n):=((x_ n+y_ n)mod p_ n)\). Functions will consist of maps \(G\to {\mathbb{C}}\) and we can then define C(G) (functions continuous on G) and V(G) (functions of bounded variation on G), \(CV(G):=C(G)\cap V(G)\). We can generate from \((p_ n)\) a complete orthonormal system of functions and consider Fourier series with respect to this system. The author proves an analogue of the Jordan test for pointwise and uniform convergence of such a Fourier series, namely: If \(f\in V(G)\) and f is continuous at a point \(x\in G\), then \[ | S_ n(x,f)-f(x)| \leq 2c_ 2V(x\dot +(G_ k-G_{k+1}),f)\ln p_{k+1}+o(1)\quad as\quad n\to \infty, \] where \(S_ n\) are the partial sums of the corresponding Fourier series, \(c_ 2\) is a particular constant, the integers n and k satisfy \(m_ k\leq n<m_{k+1}\), and \(G_ k:=\{x\in G:\) \(0\leq x\leq \frac{1}{m_ k}-\}\); if \(f\in CV(G)\) then the inequality holds uniformly on G. The sharpness of the test is considered, and also a large number of interesting corollaries are given.
0 references
Vilenkin-Fourier series
0 references
pointwise convergence
0 references
Jordan test
0 references
uniform convergence
0 references