On the boundedness of the \(L^{1}\)-norm of Walsh-Fejér kernels (Q2405364)

In this interesting paper, the author obtains properties of the \(L^1\)-norm of Walsh-Fejér kernels. If \(\{K_n\}\) is the Walsh-Fejér kernel, with respect to the Walsh-Paley system, then the author proves that \(\| K_n\|_1\geq 1\) for all non-negative integers \(n\) and also proves the very surprising fact that \[ \sup\{\| K_n\|_1: n=0,1,2,\dots\}=\frac{17}{15}. \] The proofs are quite calculative and involved. Up to the proof of Theorem 1, of course, the properties of Walsh functions are used and most of the remaining proofs are given using number theoretic techniques. In view of the calculative proofs, some typos or errors, make it difficult to understand certain steps in the proofs. For, the readers' convenience, I will provide some crucial comments as follows. {\parindent=0.7cm \begin{itemize}\item[{\(\bullet\)}] p. 156, line 9 from above, the inequality ``\(0\leq m\leq 2^k\)'' must read as ``\(0\leq m< 2^k\)''. \item[{\(\bullet\)}] p. 165, line 6 from above, the left hand side of (18) must be \[ \int\limits_{\bar A}\left|nK_n(x)\right|dx. \] \item[{\(\bullet\)}] p. 166, line 8 from above, the first factor in the second sum must be \((k_{i+1}-k_i-2)\) and not \((k_{i+1}-k_i-1)\). \item[{\(\bullet\)}] p. 167, line 8 from above, the last factor in the first sum must be \((n'_{k_i}+1)\) and not \((2n'_{k_i}+1)\). \item[{\(\bullet\)}] p. 169, line 11 from above, bracket missing, the intermediate expression ``\(-2^k-1\)'' must read as ``\(-(2^k-1)\)''. \item[{\(\bullet\)}] p. 170, lines 3 and 9 from above, it must be ``\(n+m=3\cdot 2^k-1\)'' and not ``\(n+m=3\cdot 2^k\)''. \item[{\(\bullet\)}] p. 170, line 4 from above, it must be ``\(N+M=3\cdot 2^{k+1}-1\)'' and not ``\(N+M=3\cdot 2^{k+1}\)''. \item[{\(\bullet\)}] p. 170, line 15 from above, the term ``\(-m||K_n||_1\)'' must read as ``\(-m||K_m||_1\)''. \item[{\(\bullet\)}] p. 172, line 7 from above, the statement ``where \(n=2^{k_0}+2^{k_1}+\dots 2^{k_s}\)'' must be read as ``where \(n=2^{k_0}+2^{k_1}+\dots +2^{k_s}\) in which \(k_s=k\)''. (It is mentioned in the proof of Lemma 7, that \(k_s=k\), and in this line, it is its first appearance.) \item[{\(\bullet\)}] p. 172 and p. 174, line 2 from below, the term ``\(-M||K_N||_1\)'' must read as ``\(-M||K_M||_1\)''. \item[{\(\bullet\)}] p. 174, line 8 from above, the term ``\(+m'_{k_{s-1}}(m'_{k_{s-1}}+1)\)'' must read as ``\(-m'_{k_{s-1}}(m'_{k_{s-1}}+1)\)''. \item[{\(\bullet\)}] p. 174, line 11 from above, the content ``since \(N-M=n-m=n'_{k_{s-1}}-m'_{k_{s-1}}\)'' must be deleted from this line. (It seems that it is a copy paste from p. 172, line 14 from above, but not required in the simplification preceding it.) \item[{\(\bullet\)}] p. 175, line 12 from above, the content ``\(n_{k_i}=0\), \(m_{k_i}=1\)'' must read as ``\(n_{k_i}=1\), \(m_{k_i}=0\)''. \item[{\(\bullet\)}] p. 176, lines 1 and 3 from below, the constant ``\(\frac{5}{4}\)'' must read as ``\(\frac{4}{3}\)''. This is because \(\sum_{i=0}^{r+1}\frac{1}{4^i}\) increases to \(\sum_{i=0}^{\infty}\frac{1}{4^i}=\frac{1}{1-1/4}=\frac{4}{3}\), and as \(\frac{4}{3}>\frac{5}{4}\), for sufficiently large values of \(r\), the sum \(\sum_{i=0}^{r+1}\frac{1}{4^i}>\frac{5}{4}\). \item[{\(\bullet\)}] p. 177, line 2 from above, the constant ``\(\frac{5}{4}\)'' must read as ``\(\frac{4}{3}\)''. \item[{\(\bullet\)}] p. 177, line 3 from above, the content ``\(||K_M||_1<\frac{5}{4}\)'' must read as ``\(||K_M||_1<\frac{5}{4}<\frac{4}{3}\)''. \item[{\(\bullet\)}] p. 177, line 4 from above, the content ``\(||K_N||_1\leq||K_M||_1\)'' must read as ``\(||K_N||_1<||K_M||_1\)''. \item[{\(\bullet\)}] p. 177, line 13 from above, the content ``\(||K_n||_1<||K_m||_1\)'' must read as ``\(||K_N||_1<||K_M||_1\)''. \item[{\(\bullet\)}] p. 177, line 16 from above, the content ``\(||K_n||_1\geq||K_m||_1\)'' must read as ``\(||K_N||_1\geq||K_M||_1\)''. \item[{\(\bullet\)}] p. 165 (line 1 from above), p. 178 (lines 3 and 12 from above), the word``form'' must read as ``from''. \end{itemize}}