Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Statement

Setting (pp. 39--41). An entire function f(z)=∑cnznf(z)=\sum c_nz^n has Fejér gaps if S(f)={n≥1; cn≠0}S(f)=\{n\ge1;\ c_n\ne0\}, listed increasingly as (nk)(n_k), has ∑1/nk<∞\sum1/n_k<\infty (p. 39). M(r,f)M(r,f) is the maximum modulus on ∣z∣=r|z|=r and m(r,f)=(1/2π)∫02πlog⁡+∣f(reit)∣ dtm(r,f)=(1/2\pi)\int_0^{2\pi}\log^+|f(re^{it})|\,dt (p. 40). A set E⊂(0,∞)E\subset(0,\infty) has finite logarithmic measure if ∫Edr/(1+r)<∞\int_E dr/(1+r)<\infty, and A(r)≤B(r)A(r)\le B(r) holds log-finely (l.f.) if it holds outside such a set (p. 41).

Proposition (Section 3.1, p. 46). Let ff be an entire function with Fejér gaps and let ϵ>0\epsilon>0. Then

m(r,f)≥(1−ϵ)log⁡M(r,f)(l.f.),m(r,f)\ge(1-\epsilon)\log M(r,f)\qquad\text{(l.f.)},

the paper's inequality (11). The paper calls it "interesting in itself" (p. 46).

Source. The Proposition of Section 3, p. 46, of Takafumi Murai, The deficiency of entire functions with Fejér gaps, Ann. Inst. Fourier (Grenoble) 33 (1983), no. 3, 39--58, doi:10.5802/aif.930, as identified on the source card.

Read depth. Claims checked: the statement and the definitions it uses were read clause by clause on the printed pages. The proof (pp. 46--48) was read for its mechanism and not checked step by step; nothing here is independently reviewed.

Proof pointer

Section 3 (pp. 46--48). Lemma 9 (p. 45) lets one assume the exponent set SS satisfies r≤ω(r,S)\sqrt r\le\omega(r,S) and ω(r,S)≤CΩ(r,S)\omega(r,S)\le C\Omega(r,S) for r≥2r\ge2, where ω(r,S)\omega(r,S) counts the nk<rn_k<r and Ω(r,S)=∫0rω(x,S) dx/x\Omega(r,S)=\int_0^r\omega(x,S)\,dx/x; normalize a0=1a_0=1. Lemma 10 (p. 47) shows that the tail of the series beyond a cut-off uru_r, chosen so that a majorant of Ω\Omega at uru_r equals 5log⁡μ(r,f)5\log\mu(r,f), is at most 11 log-finely. The truncated polynomial has at most about ω(ur)\omega(u_r) terms, so Lemma 8 (p. 44), m(P)≥log⁡+max⁡∣P^(k)∣−Cnm(P)\ge\log^+\max|\hat P(k)|-Cn for a trigonometric polynomial with nn nonzero coefficients, together with Wiman's Lemma 3 (p. 42) on the maximum term, gives m(Pr)≥(1−o(1))log⁡M(r)m(P_r)\ge(1-o(1))\log M(r) log-finely (15). A measure count of the set where log⁡+∣Pr∣\log^+|P_r| is large then transfers the bound to ff (p. 48).

Dependencies

Lemmas 3, 5, 8, 9 and 10 of the paper (pp. 42--47); Lemma 3 is Wiman's theorem (the paper's [15]) and Lemma 8 rests on Lemma 7 (p. 43).

Bears on

  • Problem 517: indirect. It is the main analytic input to the Theorem and to the sector assertion, which settle the instances with ∑1/nk<∞\sum1/n_k<\infty; it says nothing about value distribution by itself.