The Cohn–Elkies exponent and sign uncertainty

5.5. Positivity and the sharp upper bound🔗

Corollary 4.9 proves the required signs outside the saddle radii. To finish the construction we must also show f_+(r) > 0 for 0 \le r \le r_* = e^{v(u_*)}. Shifting the Mellin contour below O(\log\lambda) gamma poles expresses f_+(r)/f_+(0) as a truncated exponential series plus a uniformly negligible remainder.

Definition5.5.1
Statement uses 3
Statement dependency previews
Preview
Definition 5.2.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Lemma 5.5.2
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Fix 0 < \epsilon < \epsilon_0, let \lambda = d/2, set r_* = e^{v(u_*)} (Definition 5.3.2, Definition 5.3.1), and write h_1' = \int_0^\infty w(a)\,a\sinh a\,da (Definition 5.2.3), y = \pi e^{2h_1'}r^2 and N = \lceil\log\lambda\rceil. The coefficients of the residue expansion (41) are A_{\lambda,n} = e^{\lambda[h_\epsilon(\zeta_n) - h_\epsilon(i)] - 2nh_1'}\,P_+(\zeta_n)/\beta, \zeta_n = -i(1+2n/\lambda).

Lean code for Definition5.5.1●5 definitions
  • def CohnElkies.r_star (ε : ℝ) (d : ℕ) : ℝ
    def CohnElkies.r_star (ε : ℝ) (d : ℕ) : ℝ
    Report Lemma 4.10: the small radius `r_*` at which positivity of `f₊` is proved. 
  • def CohnElkies.h₁' (ε : ℝ) : ℝ
    def CohnElkies.h₁' (ε : ℝ) : ℝ
    The derivative `h₁' = h_ε'(1)` of the shell phase at the saddle height. 
  • def CohnElkies.y_r (ε r : ℝ) : ℝ
    def CohnElkies.y_r (ε r : ℝ) : ℝ
    The small-radius variable `y_r = π e^{2h₁'} r²`. 
  • def CohnElkies.A_ℓn (ε ℓ : ℝ) (n : ℕ) : ℝ
    def CohnElkies.A_ℓn (ε ℓ : ℝ) (n : ℕ) : ℝ
    The small-radius coefficients `A_{λ,n}` of the residue expansion of `f₊`. 
  • def CohnElkies.N_ℓ (ℓ : ℝ) : ℕ
    def CohnElkies.N_ℓ (ℓ : ℝ) : ℕ
    Report Lemma 4.10: the truncation order `N_λ = ⌈log λ⌉` of the residue series. 
Lemma5.5.2
Statement uses 2
Statement dependency previews
Preview
Lemma 5.2.17
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

With the notation of Definition 5.5.1, the residue expansion (41) of Lemma 5.2.17 splits, for r > 0 and every N, \dfrac{f_+(r)}{f_+(0)} = \sum_{n=0}^N\dfrac{(-y)^n}{n!}A_{\lambda,n} + \mathcal{R}_{\lambda,N}(r) (equation (78)) into the sum over the first N + 1 poles and a remainder, the integral over the contour t = s - i(\lambda + 2N + 1).

Lean code for Lemma5.5.2●1 theorem
  • complete
    theorem CohnElkies.plusSaddleProfile_div_origin_eq_small_radius_residue_series
      {ε ℓ r : ℝ} (hε : 0 < ε) (hℓ : 0 < ℓ)
      (horder : CohnElkies.a₀ε ε ≤ CohnElkies.Aε ε) (hr : 0 < r) (N : ℕ) :
      CohnElkies.fPlus ε ℓ r / ↑(CohnElkies.originValue ε ℓ) =
        ↑(∑ n ∈ Finset.range (N + 1),
              (-CohnElkies.y_r ε r) ^ n / ↑n.factorial *
                CohnElkies.A_ℓn ε ℓ n) +
          CohnElkies.plusSaddleTaylorRemainder ε ℓ N r /
            ↑(CohnElkies.originValue ε ℓ)
    theorem CohnElkies.plusSaddleProfile_div_origin_eq_small_radius_residue_series
      {ε ℓ r : ℝ} (hε : 0 < ε) (hℓ : 0 < ℓ)
      (horder :
        CohnElkies.a₀ε ε ≤ CohnElkies.Aε ε)
      (hr : 0 < r) (N : ℕ) :
      CohnElkies.fPlus ε ℓ r /
          ↑(CohnElkies.originValue ε ℓ) =
        ↑(∑ n ∈ Finset.range (N + 1),
              (-CohnElkies.y_r ε r) ^ n /
                  ↑n.factorial *
                CohnElkies.A_ℓn ε ℓ n) +
          CohnElkies.plusSaddleTaylorRemainder
              ε ℓ N r /
            ↑(CohnElkies.originValue ε ℓ)
    Report Lemma 4.4: the small-radius residue expansion of `f₊ / f₊(0)`. 
Proof for Lemma 5.5.2
Proof uses 3
Proof dependency previews
Preview
Definition 5.2.14
Loading preview
Proof dependency preview content is loaded from the rendered-fragment cache.

Shift the Mellin contour of Definition 5.2.14 downward past the poles t = -i(\lambda + 2n), 0 \le n \le N, and evaluate the residues by (41) and the origin value (42) of Lemma 5.2.19; the justification of the shift is in the proof of Lemma 5.5.3.

Lemma5.5.3
Statement uses 2
Statement dependency previews
Preview
Definition 5.5.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Theorem 5.3
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

With the notation of Definition 5.5.1 and Lemma 5.5.2, for all sufficiently large d, uniformly on 0 \le r \le r_*, e^y\Bigl|\sum_{n=0}^N\dfrac{(-y)^n}{n!}A_{\lambda,n} - e^{-y}\Bigr| < \tfrac12 and e^y|\mathcal{R}_{\lambda,N}(r)| < \tfrac12. In particular f_+(r) > 0 on [0, r_*] for all sufficiently large d (equation (82)).

Lean code for Lemma5.5.3●3 theorems
  • complete
    theorem CohnElkies.eventually_plusSaddleSmallRadius_relativeFiniteResidue_lt_half_on_star
      {ε : ℝ} (hε : 0 < ε) (horder : CohnElkies.a₀ε ε ≤ CohnElkies.Aε ε) :
      ∀ᶠ (d : ℕ) in Filter.atTop,
        ∀ (r : ℝ),
          0 ≤ r →
            r ≤ CohnElkies.r_star ε d →
              have ℓ := ↑d / 2;
              have y := CohnElkies.y_r ε r;
              Real.exp y *
                  |∑ n ∈ Finset.range (CohnElkies.N_ℓ ℓ + 1),
                        (-y) ^ n / ↑n.factorial * CohnElkies.A_ℓn ε ℓ n -
                      Real.exp (-y)| <
                1 / 2
    theorem CohnElkies.eventually_plusSaddleSmallRadius_relativeFiniteResidue_lt_half_on_star
      {ε : ℝ} (hε : 0 < ε)
      (horder :
        CohnElkies.a₀ε ε ≤ CohnElkies.Aε ε) :
      ∀ᶠ (d : ℕ) in Filter.atTop,
        ∀ (r : ℝ),
          0 ≤ r →
            r ≤ CohnElkies.r_star ε d →
              have ℓ := ↑d / 2;
              have y := CohnElkies.y_r ε r;
              Real.exp y *
                  |∑
                        n ∈
                          Finset.range
                            (CohnElkies.N_ℓ
                                ℓ +
                              1),
                        (-y) ^ n /
                            ↑n.factorial *
                          CohnElkies.A_ℓn ε ℓ
                            n -
                      Real.exp (-y)| <
                1 / 2
  • complete
    theorem CohnElkies.eventually_plusSaddleTaylorRemainder_relative_lt_half_on_star
      {ε : ℝ} (hε : 0 < ε) (hεsmall : ε ≤ 1 / 4)
      (horder : CohnElkies.a₀ε ε ≤ CohnElkies.Aε ε)
      (hmargin :
        ∀ a ∈ Set.Icc (CohnElkies.a₀ε ε) (CohnElkies.Aε ε),
          0 ≤ CohnElkies.bε ε a) :
      ∀ᶠ (d : ℕ) in Filter.atTop,
        ∀ (r : ℝ),
          0 < r →
            r ≤ CohnElkies.r_star ε d →
              have ℓ := ↑d / 2;
              have N := CohnElkies.N_ℓ ℓ;
              have y := CohnElkies.y_r ε r;
              Real.exp y *
                  ‖CohnElkies.plusSaddleTaylorRemainder ε ℓ N r /
                      ↑(CohnElkies.originValue ε ℓ)‖ <
                1 / 2
    theorem CohnElkies.eventually_plusSaddleTaylorRemainder_relative_lt_half_on_star
      {ε : ℝ} (hε : 0 < ε)
      (hεsmall : ε ≤ 1 / 4)
      (horder :
        CohnElkies.a₀ε ε ≤ CohnElkies.Aε ε)
      (hmargin :
        ∀
          a ∈
            Set.Icc (CohnElkies.a₀ε ε)
              (CohnElkies.Aε ε),
          0 ≤ CohnElkies.bε ε a) :
      ∀ᶠ (d : ℕ) in Filter.atTop,
        ∀ (r : ℝ),
          0 < r →
            r ≤ CohnElkies.r_star ε d →
              have ℓ := ↑d / 2;
              have N := CohnElkies.N_ℓ ℓ;
              have y := CohnElkies.y_r ε r;
              Real.exp y *
                  ‖CohnElkies.plusSaddleTaylorRemainder
                        ε ℓ N r /
                      ↑(CohnElkies.originValue
                          ε ℓ)‖ <
                1 / 2
  • complete
    theorem CohnElkies.eventually_plusSaddleProfile_re_pos_on_star :
      ∀ᶠ (ε : ℝ) in nhdsWithin 0 (Set.Ioi 0),
        ∀ᶠ (d : ℕ) in Filter.atTop,
          ∀ (r : ℝ),
            0 ≤ r →
              r ≤ CohnElkies.r_star ε d →
                0 < (CohnElkies.fPlus ε (↑d / 2) r).re
    theorem CohnElkies.eventually_plusSaddleProfile_re_pos_on_star :
      ∀ᶠ (ε : ℝ) in nhdsWithin 0 (Set.Ioi 0),
        ∀ᶠ (d : ℕ) in Filter.atTop,
          ∀ (r : ℝ),
            0 ≤ r →
              r ≤ CohnElkies.r_star ε d →
                0 <
                  (CohnElkies.fPlus ε (↑d / 2)
                      r).re
    Report (82): for all small `ε` and large `d`, `f₊` is positive on `[0, r_*]`. 
Proof for Lemma 5.5.3
Proof uses 4
Proof dependency previews
Preview
Lemma 3.1.3
Loading preview
Proof dependency preview content is loaded from the rendered-fragment cache.

Range of y. Put y = \pi e^{2h_1'}r^2, H(u) = \int_0^\infty w(a)a\sinh(ua)\,da (so H(1) = h_1'), and \eta_* = 1 + u_* = (\log\lambda)/(4\lambda). The height u_* tends to -1, the normalized height of the first gamma pole, while the gamma shape parameter \lambda\eta_*/2 = (\log\lambda)/8 still diverges; this makes (70) applicable and keeps y(r_*) logarithmic. Indeed H is odd with bounded derivative near -1 (for fixed \epsilon), so H(u_*) + h_1' = H(-1+\eta_*) - H(-1) = O_\epsilon(\eta_*), and by (44) y(r_*) = \exp\bigl(\psi(\lambda\eta_*/2) + 2H(u_*) + 2h_1'\bigr). The digamma asymptotic \psi(x) \le \log x (Lemma 3.1.6) gives (equation (77)) 0 \le y \le y(r_*) = \tfrac18\log\lambda + O_\epsilon(1). Since e^{-y} can be as small as a negative power of \lambda, the errors must be controlled relative to e^{-y}.

Contour shift. Set N = \lceil\log\lambda\rceil, p = N + \tfrac12, \kappa = 1 + 2p/\lambda. The contour t = s - i(\lambda + 2p) lies strictly between consecutive gamma poles, and p \asymp \log\lambda makes the exponential-series tail negligible on (77). The multiplier e^{\lambda h_\epsilon(t/\lambda)} preserves a uniform decay margin: pA/\lambda = o_\epsilon(1) , so the taper satisfies b(a)e^{2pa/\lambda} \le 1 - c\epsilon on [a_0, A] for large \lambda; for every intermediate height 0 \le q \le \kappa, the positive shell contributes nonpositively to \operatorname{Re}h_\epsilon(s/\lambda - iq) - h_\epsilon(iq), and the negative shell gives \lambda\bigl(\operatorname{Re}h_\epsilon(s/\lambda - iq) - h_\epsilon(iq)\bigr) \le \dfrac{(1-c\epsilon)\lambda}{2}\int_0^\infty\dfrac{1-\cos(as/\lambda)}{a^2}\,da, which equals (1-c\epsilon)\pi|s|/4. The gamma factor supplies the complementary e^{-\pi|s|/4} (by Lemma 3.1.3), so the integrand decays like e^{-c\epsilon|s|} on the vertical sides, permitting the shift of (38) to t = s - i(\lambda+2p), which crosses exactly the poles t = -i(\lambda+2n), 0 \le n \le N.

Residue expansion. The residue formula (41) of Lemma 5.2.17 and the origin value (42) of Lemma 5.2.19 give (equations (78)–(79)) \dfrac{f_+(r)}{f_+(0)} = \sum_{n=0}^N\dfrac{(-y)^n}{n!}A_{\lambda,n} + \mathcal{R}_{\lambda,p}(r), A_{\lambda,n} = e^{\lambda[h_\epsilon(\zeta_n) - h_\epsilon(i)] - 2nh_1'}\,\dfrac{P_+(\zeta_n)}{\beta}, with \zeta_n = -i(1+2n/\lambda) as in (41) and h_\epsilon even,, |A_{\lambda,n} - 1| \ll_\epsilon \dfrac{n(1+n)}{\lambda} for 0 \le n \le N: Taylor expansion at u = 1 gives \lambda[h_\epsilon(i(1+2n/\lambda)) - h_\epsilon(i)] = 2nh_1' + O_\epsilon(n^2/\lambda) and P_+(-i(1+2n/\lambda))/\beta = 1 - \tfrac{2n}{\lambda}(2 + \tfrac{2n}{\lambda})^2/\beta = 1 + O_\epsilon(n/\lambda), uniformly for n \le N, where N^2/\lambda = o(1). For r > 0 the remainder is the integral over the shifted contour, \mathcal{R}_{\lambda,p}(r) = \dfrac{\pi^{\lambda/2+p}r^{2p}}{2\pi f_+(0)}\int_{\mathbb{R}}\Xi(s)\,r^{is}\,ds, \Xi(s) = \pi^{is/2}\Gamma(-p - is/2)e^{\lambda h_\epsilon(s/\lambda - i\kappa)}P_+(s/\lambda - i\kappa). The gamma reflection and product estimates (Lemma 3.1.3) with p \in \mathbb{Z} + \tfrac12 give |\Gamma(-p - is/2)| \ll e^{-\pi|s|/4}/\Gamma(1+p), the shell bound above gives \lambda(\operatorname{Re}h_\epsilon(s/\lambda - i\kappa) - h_\epsilon(i\kappa)) \le (1-c\epsilon)\pi|s|/4, and P_+(s/\lambda - i\kappa)/\beta = O_\epsilon(1 + |s|^3). Integrating in s, and using \lambda[h_\epsilon(i\kappa) - h_\epsilon(i)] = 2ph_1' + O_\epsilon(p^2/\lambda) with (\pi r^2)^pe^{2ph_1'} = y^p and p^2/\lambda = o(1), gives (equation (80)) |\mathcal{R}_{\lambda,p}(r)| \ll_\epsilon y^p/\Gamma(1+p), which extends to r = 0 by continuity.

Comparison with e^{-y}. Equations (79), (80), (77) and \sum_{n\ge0}n(1+n)y^n/n! = (y^2+2y)e^y give (equation (81)) e^y\sum_{n=0}^N\dfrac{y^n}{n!}|A_{\lambda,n} - 1| \ll_\epsilon \dfrac{(1+y)^2e^{2y}}{\lambda} \ll_\epsilon \dfrac{(\log\lambda)^2}{\lambda^{3/4}}, e^y|\mathcal{R}_{\lambda,p}(r)| \ll_\epsilon \dfrac{e^yy^p}{\Gamma(1+p)}, e^y\sum_{n>N}\dfrac{y^n}{n!} \le \dfrac{e^yy^{N+1}}{(N+1)!}. For the two tails put L = \log\lambda. Since y \le L/8 + O_\epsilon(1) and p = L + O(1), Stirling's formula gives \log\bigl(e^yy^p/\Gamma(1+p)\bigr) \le (\tfrac18 + 1 - \log 8)L + O_\epsilon(\log L), and the same holds with p replaced by N+1. Since \tfrac18 + 1 - \log 8 < 0, both tails are smaller than the coefficient error in (81). Therefore (78) yields, uniformly on 0 \le r \le r_* (equation (82)), \dfrac{f_+(r)}{f_+(0)} = e^{-y}\Bigl(1 + O_\epsilon\Bigl(\dfrac{(\log\lambda)^2}{\lambda^{3/4}}\Bigr)\Bigr) > 0.

Lemma5.5.4
uses 1
Used by 4
Reverse dependency previews
Preview
Theorem 5.3
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Set R_{\epsilon,d} = e^{v(u_0)} with v from Definition 5.3.2. For fixed \epsilon (equation (84)), \lim_{d\to\infty}\dfrac{R_{\epsilon,d}}{\sqrt d} = \sqrt{\frac{1+u_0}{4\pi}}\exp\bigl(\int_0^\infty w(a)a\sinh(u_0a)\,da\bigr) =: \alpha_\epsilon.

Lean code for Lemma5.5.4●3 declarations
  • def CohnElkies.R_ε (ε : ℝ) (d : ℕ) : ℝ
    def CohnElkies.R_ε (ε : ℝ) (d : ℕ) : ℝ
    The saddle radius `R_{ε,d} = r(1 + ε/4)` of report (84). 
  • def CohnElkies.α_ε (ε : ℝ) : ℝ
    def CohnElkies.α_ε (ε : ℝ) : ℝ
    The saddle radius `α_ε = √((2 + ε/4) / (4π)) · exp (shell contributions)`, report (32). 
  • complete
    theorem CohnElkies.tendsto_saddleSourceRadius_normalized {ε : ℝ} (hε : 0 < ε) :
      Filter.Tendsto (fun d ↦ CohnElkies.R_ε ε d / √↑d) Filter.atTop
        (nhds (CohnElkies.α_ε ε))
    theorem CohnElkies.tendsto_saddleSourceRadius_normalized
      {ε : ℝ} (hε : 0 < ε) :
      Filter.Tendsto
        (fun d ↦ CohnElkies.R_ε ε d / √↑d)
        Filter.atTop (nhds (CohnElkies.α_ε ε))
    Report (84): `R_{ε,d}/√d → α_ε` as `d → ∞`. 
Proof for Lemma 5.5.4

The saddle equation (44) and the digamma asymptotic \psi(\lambda(1+u_0)/2) = \log(d(1+u_0)/4) + o(1) (Lemma 3.1.6).

Lemma5.5.5
uses 1
Used by 3
Reverse dependency previews
Preview
Theorem 5.3
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

With \alpha_\epsilon from Lemma 5.5.4 (equation (85)), \lim_{\epsilon\downarrow0}\lim_{d\to\infty}R_{\epsilon,d}/\sqrt d = \lim_{\epsilon\downarrow0}\alpha_\epsilon = 1/\pi.

Lean code for Lemma5.5.5●2 theorems
  • complete
    theorem CohnElkies.tendsto_limitingSaddleRadius :
      Filter.Tendsto CohnElkies.α_ε (nhdsWithin 0 (Set.Ioi 0))
        (nhds CohnElkies.criticalRadius)
    theorem CohnElkies.tendsto_limitingSaddleRadius :
      Filter.Tendsto CohnElkies.α_ε
        (nhdsWithin 0 (Set.Ioi 0))
        (nhds CohnElkies.criticalRadius)
    Report (32)–(33): the saddle radius tends to the critical radius `1 / π` as `ε → 0⁺`. 
  • complete
    theorem CohnElkies.tendsto_limitingSaddleRadius_wallisIntegral :
      Filter.Tendsto CohnElkies.α_ε (nhdsWithin 0 (Set.Ioi 0))
        (nhds
          (√(1 / (2 * Real.pi)) *
            Real.exp
              (∫ (a : ℝ) in Set.Ioi 0, CohnElkies.wallisRadiusIntegrand a)))
    theorem CohnElkies.tendsto_limitingSaddleRadius_wallisIntegral :
      Filter.Tendsto CohnElkies.α_ε
        (nhdsWithin 0 (Set.Ioi 0))
        (nhds
          (√(1 / (2 * Real.pi)) *
            Real.exp
              (∫ (a : ℝ) in Set.Ioi 0,
                CohnElkies.wallisRadiusIntegrand
                  a)))
Proof for Lemma 5.5.5
Proof uses 3
Proof dependency previews
Preview
Lemma 5.1.3
Loading preview
Proof dependency preview content is loaded from the rendered-fragment cache.

The two shell contributions in Lemma 5.2.8 and Lemma 5.2.9 give \int_0^\infty w(a)a\sinh(u_0a)\,da \to -\tfrac12\log\tfrac\pi2. Since u_0 \to 1, Lemma 5.1.3 gives the limit 1/\pi.

Proof for Theorem 5.3
Proof uses 6
Proof dependency previews
Preview
Lemma 5.2.18
Loading preview
Proof dependency preview content is loaded from the rendered-fragment cache.

Set R_{\epsilon,d} = e^{v(u_0)} (Lemma 5.5.4). The Fourier identities and origin values are (40) and (42) of Lemma 5.2.18 and Lemma 5.2.19. Theorem 5.4.2 gives the required exterior signs, and (82) of Lemma 5.5.3 supplies positivity of f_+ on the remaining interval [0, r_*]. Thus (equation (83)) \widehat{f_-} = f_+ > 0, f_-(0) = f_+(0) > 0, \widehat{f_0} = f_0, f_0(0) = 0, f_-(r) < 0 < f_0(r) for r \ge R_{\epsilon,d}. The limits (84) and (85) are Lemma 5.5.4 and Lemma 5.5.5.

Theorem5.5.6
uses 1
Used by 2
Reverse dependency previews
Preview
Theorem 1.1.10
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

There are \epsilon_0 > 0 and, for every 0 < \epsilon < \epsilon_0, radii R_{\epsilon,d} > 0 with R_{\epsilon,d}/\sqrt d \to \alpha_\epsilon as d \to \infty and \alpha_\epsilon \to 1/\pi as \epsilon \downarrow 0, such that for every 0 < \epsilon < \epsilon_0 and all sufficiently large d there is F \in \mathcal{A}_d with (F(0)/\widehat F(0))^{1/d} \le R_{\epsilon,d}. Consequently \limsup_{d\to\infty}\mathrm{LP}_d^{1/d} \le \sqrt{e/(2\pi)}, with \mathrm{LP}_d from Definition 1.1.6 (in the formalization the upper bound enters the sandwich argument Theorem 7.6.1 directly, without a separate \limsup statement).

Lean code for Theorem5.5.6●1 definition
  • complete
    def CohnElkies.saddleOrderedUpperConstruction
      (hschwartz : CohnElkies.SaddleSourceSchwartzRealization)
      (hsigns : CohnElkies.SaddleSourceEventualSigns) :
      CohnElkies.OrderedEpsilonUpperConstruction
    def CohnElkies.saddleOrderedUpperConstruction
      (hschwartz :
        CohnElkies.SaddleSourceSchwartzRealization)
      (hsigns :
        CohnElkies.SaddleSourceEventualSigns) :
      CohnElkies.OrderedEpsilonUpperConstruction
    The ordered `ε`-construction built from the saddle-point pair, with normalized radius
    `R_ε ε d / √d` and limiting radius `α_ε`. 
Proof for Theorem 5.5.6
Proof uses 5
Proof dependency previews
Preview
Lemma 3.1.8
Loading preview
Proof dependency preview content is loaded from the rendered-fragment cache.

Fix 0 < \epsilon < \epsilon_0 and let d be large. By (83) of Theorem 5.3 and Lemma 5.1, the dilation F_{\epsilon,d}(x) = f_-(R_{\epsilon,d}x) is admissible with F_{\epsilon,d}(0)/\widehat{F_{\epsilon,d}}(0) = R_{\epsilon,d}^d, so (equation (86)) \mathrm{LP}_d \le \dfrac{v_d}{2^d}R_{\epsilon,d}^d, i.e. \mathrm{LP}_d^{1/d} \le \dfrac{v_d^{1/d}\sqrt d}{2}\cdot\dfrac{R_{\epsilon,d}}{\sqrt d}. By Lemma 3.1.8 and (84) of Lemma 5.5.4, the right side tends to \tfrac12\sqrt{2\pi e}\,\alpha_\epsilon as d \to \infty. Hence \limsup_d\mathrm{LP}_d^{1/d} \le \tfrac12\sqrt{2\pi e}\,\alpha_\epsilon for every \epsilon, and letting \epsilon \downarrow 0 with (85) of Lemma 5.5.5 gives \tfrac12\sqrt{2\pi e}/\pi = \sqrt{e/(2\pi)}.

Theorem5.5.7
Statement uses 2
Statement dependency previews
Preview
Definition 1.2.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

For each \varsigma \in \{-1,+1\}, \mathsf{A}_\varsigma(d) \le R_{\epsilon,d} (Definition 1.2.3, Lemma 5.5.4) for every 0 < \epsilon < \epsilon_0 and all sufficiently large d; in particular \mathsf{A}_\varsigma(d) is finite for all sufficiently large d, and \limsup_{d\to\infty}\mathsf{A}_\varsigma(d)/\sqrt d \le 1/\pi.

Lean code for Theorem5.5.7●3 theorems
  • complete
    theorem CohnElkies.eventually_signUncertaintyConstant_le (ς : ℤˣ) :
      ∀ᶠ (ε : ℝ) in nhdsWithin 0 (Set.Ioi 0),
        ∀ᶠ (d : ℕ) in Filter.atTop,
          CohnElkies.signUncertaintyConstant ς d ≤
            ENNReal.ofReal (CohnElkies.R_ε ε d)
    theorem CohnElkies.eventually_signUncertaintyConstant_le
      (ς : ℤˣ) :
      ∀ᶠ (ε : ℝ) in nhdsWithin 0 (Set.Ioi 0),
        ∀ᶠ (d : ℕ) in Filter.atTop,
          CohnElkies.signUncertaintyConstant ς
              d ≤
            ENNReal.ofReal
              (CohnElkies.R_ε ε d)
    Report, proof of Theorem 1.2: `A_ς(d) ≤ R_{ε,d}` for both signs, for small `ε` and large
    `d`. 
  • complete
    theorem CohnElkies.eventually_signUncertaintyConstant_lt_top (ς : ℤˣ) :
      ∀ᶠ (d : ℕ) in Filter.atTop, CohnElkies.signUncertaintyConstant ς d < ⊤
    theorem CohnElkies.eventually_signUncertaintyConstant_lt_top
      (ς : ℤˣ) :
      ∀ᶠ (d : ℕ) in Filter.atTop,
        CohnElkies.signUncertaintyConstant ς
            d <
          ⊤
    The infimum `A_ς(d)` of report (6) is finite for all large `d` (report, proof of Theorem 1.2:
    `A_ς(d) ≤ R_{ε,d}`). 
  • complete
    theorem CohnElkies.limsup_signUncertaintyConstant_div_sqrt_le (ς : ℤˣ) :
      Filter.limsup
          (fun d ↦
            CohnElkies.signUncertaintyConstant ς d / ENNReal.ofReal √↑d)
          Filter.atTop ≤
        ENNReal.ofReal Real.pi⁻¹
    theorem CohnElkies.limsup_signUncertaintyConstant_div_sqrt_le
      (ς : ℤˣ) :
      Filter.limsup
          (fun d ↦
            CohnElkies.signUncertaintyConstant
                ς d /
              ENNReal.ofReal √↑d)
          Filter.atTop ≤
        ENNReal.ofReal Real.pi⁻¹
    The upper bound of Theorem 1.2 in `limsup` form: `limsup_{d → ∞} A_ς(d)/√d ≤ 1/π`
    (in `ℝ≥0∞`), letting `ε → 0⁺` in the previous bound, by `α_ε → 1/π` (report (85)). 
Proof for Theorem 5.5.7
Proof uses 3
Proof dependency previews
Preview
Lemma 5.2
Loading preview
Proof dependency preview content is loaded from the rendered-fragment cache.

Fix 0 < \epsilon < \epsilon_0 and let d be large. Define g_{\epsilon,d,-} = f_+ - f_- and g_{\epsilon,d,+} = f_0 with f_\pm, f_0 from Theorem 5.3. Equation (40) and Fourier inversion give \widehat{g_{\epsilon,d,-}} = -g_{\epsilon,d,-} and \widehat{g_{\epsilon,d,+}} = g_{\epsilon,d,+}. By (83) both vanish at the origin and are strictly positive outside B(0,R_{\epsilon,d}); in particular neither is zero. By Lemma 5.2, \mathsf{A}_\varsigma(d) \le R_{\epsilon,d} < \infty for both signs. Hence \limsup_d\mathsf{A}_\varsigma(d)/\sqrt d \le \lim_d R_{\epsilon,d}/\sqrt d = \alpha_\epsilon by (84), and letting \epsilon \downarrow 0 with (85) of Lemma 5.5.5 gives 1/\pi.