diff 56bc728..f6bf760 universal_triangular_lattice_optimality_v2.txt
diff --git a/universal_triangular_lattice_optimality_v2.txt b/universal_triangular_lattice_optimality_v2.txt
index cccbbf0..21cead8 100644
--- a/universal_triangular_lattice_optimality_v2.txt
+++ b/universal_triangular_lattice_optimality_v2.txt
@@ -52,7 +52,7 @@ The word "universal" means: one configuration minimizes the whole family at once
Let b = sqrt 3 / 2. The triangular lattice A of unit covolume is
-A = b^{-1/2}bigl{ j,(1,0) + k,(1/2, b) : j, k in mathbb ZbbZ bigr}.
+A = b^{-1/2}bigl{ j,(1,0) + k,(1/2, b) : j, k in Z bigr}.
The prefactor b^{-1/2} normalizes area: the parallelogram spanned by b^{-1/2}(1,0) and b^{-1/2}(1/2, b) has area exactly one. So A is the triangular lattice at density one.
@@ -62,11 +62,11 @@ b = (sqrt 3)/(2) = 0.8660254..., B = frac{1}{b^{2}} = (4)/(3).
B is the "area scale" that will reappear in every Gaussians Fourier-transform computation.
-The **dual lattice** A^{*} is the set of all w in mathbb R^bbR^{2} such that w cdot a in mathbb ZbbZ for every a in A. Since the basis of A has determinant one, a quarter-turn J gives A^{*} = JA. Because A is rotation-invariant, A and A^{*} have the same set of lvert a rvert^{2} values -- this will let us make contacts on the direct and dual side simultaneously.
+The **dual lattice** A^{*} is the set of all w in R^{2} such that w · a in Z for every a in A. Since the basis of A has determinant one, a quarter-turn J gives A^{*} = JA. Because A is rotation-invariant, A and A^{*} have the same set of lvert a rvert^{2} values -- this will let us make contacts on the direct and dual side simultaneously.
### 1.2 Configurations, density, and disks
-A **configuration** is a locally finite subset C subset mathbb R^bbR^{2}: infinite, but with only finitely many points in any bounded region.
+A **configuration** is a locally finite subset C subset R^{2}: infinite, but with only finitely many points in any bounded region.
For R > 0, let B_{R} be the closed disk of radius R centered at the origin, C_{R} = C cap B_{R}, and N_{R} = # C_{R}.
@@ -125,7 +125,7 @@ For g = t^{-p} with p ge 1 this sum is infinite, which is fine: the theorem's co
## 2. The main theorem: universal energy minimality
-**Theorem (Universal energy minimality).** *Let g : (0, ∞) to [0, ∞) be smooth and completely monotone. For every locally finite configuration C subset mathbb R^bbR^{2} of centered disk density one,*
+**Theorem (Universal energy minimality).** *Let g : (0, ∞) to [0, ∞) be smooth and completely monotone. For every locally finite configuration C subset R^{2} of centered disk density one,*
E_{g}(C) ;ge; E_{g}(A) ;=; sum_{a in A ∖ {0}} g(lvert a rvert^{2}),
@@ -139,25 +139,6 @@ Three things stand out.
The theorem immediately covers every inverse power g(t) = t^{-p}, p>0, and every Gaussian g(t) = e^{-alpha t}, alpha > 0. It covers each positive mixture of these by linearity of the representing measure.
-### 2.1 What is new, and what is not
-
-Lattice-versus-lattice comparisons go back decades:
-
-- **Rankin (1953)** and **Cassels (1959)** proved that A minimizes the Epstein zeta sum sum_{a ne 0} lvert a rvert^{-2p} over all unit-covolume planar lattices for p > 1. Cassels's proof had a gap that Ennola (1964) and Diananda (1964) closed.
-- **Montgomery (1988)** proved that A minimizes sum_{a ne 0} e^{-pi alpha lvert a rvert^{2}} over all unit-covolume lattices, for every alpha > 0.
-
-The **Cohn-Kumar conjecture (2007)** asked for something strictly stronger: comparison not just against other lattices, but against every configuration, and one universal auxiliary proof technique that works for the whole completely monotone family.
-
-**Cohn, Kumar, Miller, Radchenko, and Viazovska (2022)** proved the Cohn-Kumar conjecture for the E_{8} and Leech lattices, constructing sharp Fourier interpolation formulas. Their methods inspired the present paper.
-
-Previous planar work covered restricted competitor classes:
-
-- Faulhuber-Shafkulovska-Zlotnikov (2023): A vs. the honeycomb configuration, and vs. products / unions of translates of rectangular or triangular lattices.
-- Hardin-Tenpas (2025): local optimality among configurations that are four or six points per fixed triangular lattice.
-- Leblé (2025): A cannot be lowered by sufficiently small bounded displacements, with the allowed displacement size depending on the kernel.
-
-None of these reaches the full "all locally finite configurations of centered disk density one" conclusion proved in Theorem 2.
-
### 2.2 The subtlety about quantifiers
The Cohn-Kumar conjecture asked for a single auxiliary function f, allowed to depend on the kernel g, with certain properties (see Section 3.3). This is strictly stronger than what the present paper establishes.
@@ -172,14 +153,14 @@ For 0 < s < 2, the raw sum sum_{a ne 0} lvert a rvert^{-s} diverges. So the "ene
Two renormalizations are standard.
-- **Periodic.** Fix a torus T = mathbb R^bbR^{2} / L. Neutralize the points against a uniform background of opposite total charge on T. Remove each point's self-energy. The result is a finite periodic energy W_{s, L}.
+- **Periodic.** Fix a torus T = R^{2} / L. Neutralize the points against a uniform background of opposite total charge on T. Remove each point's self-energy. The result is a finite periodic energy W_{s, L}.
- **Field.** Build the infinite "jellium" configuration: point charges plus uniform background. Introduce a self-energy cutoff eta > 0, remove it, and take the field-energy per unit area. Minimize over compatible gradient fields. The result is the infinite-system energy W_{s}.
The paper proves the following corollary (Section 10.4).
**Corollary (planar renormalized and jellium energies).** *Let 0 le s < 2, with interaction g(x) = -log lvert x rvert at s = 0 and g(x) = lvert x rvert^{-s} for 0 < s < 2.*
-*(i) For each n ge 1, the configuration A/nA (i.e. the n^{2} distinct classes of the triangular lattice in the torus mathbb R^bbR^{2}/(nA)) minimizes W_{s, nA} among all configurations of n^{2} distinct points in that torus.*
+*(i) For each n ge 1, the configuration A/nA (i.e. the n^{2} distinct classes of the triangular lattice in the torus R^{2}/(nA)) minimizes W_{s, nA} among all configurations of n^{2} distinct points in that torus.*
*(ii) The infinite-system energy W_{s}(A) minimizes W_{s} over all density-one planar configurations. In addition, the ordered-pair thermodynamic jellium minimum equals W_{s}(A)/kappa_{s}, where kappa_{0} = 2pi and kappa_{s} = 4pi for 0 < s < 2.*
@@ -193,21 +174,21 @@ The theorem has a simple shape after Fourier transformation. We describe the sha
### 3.1 Fourier transform and nonnegativity
-For a Schwartz function f : mathbb R^bbR^{2} to mathbb RbbR (smooth, rapidly decaying, and so is every derivative), define
+For a Schwartz function f : R^{2} to R (smooth, rapidly decaying, and so is every derivative), define
-widehatwidehat f(f(xi) ;=; int_{mathbb R^bbR^{2}} f(x), e^{-2pi i, x cdot xi}, dx.
+widehatwidehat f(f(xi) ;=; int_{R^{2}} f(x), e^{-2pi i, x · xi}, dx.
-For finite signed measures mu, nu on mathbb R^bbR^{2} set
+For finite signed measures mu, nu on R^{2} set
Q_{f}(mu, nu) = iint f(x - y), dmu(x), dnu(y).
Fourier inversion and Fubini give
-Q_{f}(mu, nu) = int_{mathbb R^bbR^{2}} widehatwidehat f(f(xi), widehatmu(xi)bar, widehatnu(xi), dxi.
+Q_{f}(mu, nu) = int_{R^{2}} widehatwidehat f(f(xi), widehatmu(xi)bar, widehatnu(xi), dxi.
If widehatwidehat ff ge 0 pointwise, then Q_{f} is positive semi-definite: Q_{f}(mu, mu) ge 0 for every finite measure mu. So Cauchy-Schwarz applies to Q_{f}.
-For a configuration C let mu_{R} = sum_{x in C_{R}} delta_{x}. Then Q_{f}(mu_{R}, mu_{R}) = sum_{x, y in C_{R}} f(x - y). The diagonal terms contribute N_{R} cdot f(0), and the off-diagonal terms are the pairwise energy. Hence
+For a configuration C let mu_{R} = sum_{x in C_{R}} delta_{x}. Then Q_{f}(mu_{R}, mu_{R}) = sum_{x, y in C_{R}} f(x - y). The diagonal terms contribute N_{R} · f(0), and the off-diagonal terms are the pairwise energy. Hence
sum_{substack{x, y in C_{R} x ne y}} f(x - y) = Q_{f}(mu_{R}, mu_{R}) - N_{R}, f(0).
@@ -227,13 +208,13 @@ Density one enters by comparing mu_{R} to the area measure nu_{R} = mathbf 1_bf1
Fix ε > 0. For every x in B_{R} the disk B_{(1+ε)R} - x contains B_{ε R}. So
-Q_{f}(mu_{R}, nu_{R}) = N_{R}, widehatwidehat f(0)f(0) + O!(N_{R} cdot int_{lvert z rvert ge ε R} lvert f(z) rvert, dz),
+Q_{f}(mu_{R}, nu_{R}) = N_{R}, widehatwidehat f(0)f(0) + O!(N_{R} · int_{lvert z rvert ge ε R} lvert f(z) rvert, dz),
and the error term is *uniform* in the positions of the points of C_{R}: clustering does not help or hurt. Simultaneously Q_{f}(nu_{R}, nu_{R}) / V_{R} to widehatwidehat f(0).f(0).
Cauchy-Schwarz gives Q_{f}(mu_{R}, mu_{R}), Q_{f}(nu_{R}, nu_{R}) ge lvert Q_{f}(mu_{R}, nu_{R}) rvert^{2}. Divide by N_{R}^{2}:
-frac{Q_{f}(mu_{R}, mu_{R})}{N_{R}} cdot frac{V_{R}}{N_{R}} cdot frac{Q_{f}(nu_{R}, nu_{R})}{V_{R}} ge ( frac{Q_{f}(mu_{R}, nu_{R})}{N_{R}} )^{2}.
+frac{Q_{f}(mu_{R}, mu_{R})}{N_{R}} · frac{V_{R}}{N_{R}} · frac{Q_{f}(nu_{R}, nu_{R})}{V_{R}} ge ( frac{Q_{f}(mu_{R}, nu_{R})}{N_{R}} )^{2}.
As R to ∞: V_{R} / N_{R} to (1+ε)^{2}, and the two ends converge to widehatwidehat f(0)^f(0)^{2} each. Taking lower limits in R then ε ↓ 0 yields
@@ -285,7 +266,7 @@ E_{e^{-pialpha t}}(C) ge widehatwidehat{f_f_{alpha}}(0) - f_{alpha}(0) = sum_{a
That is the Gaussian case of the main theorem. The remaining sections construct the pair (f_{alpha}, widehatwidehat f_f_{alpha}) for every alpha > 0.
-### 3.4 What is hard about the construction
+### 3.4 The interpolation obstruction
The two sign conditions and the two contact conditions must hold *simultaneously*, *at every scale* alpha, and at every radius.
@@ -294,7 +275,7 @@ The two sign conditions and the two contact conditions must hold *simultaneously
Neither condition alone is hard. Simultaneously, they multiply the difficulty.
-A further subtlety: values and first derivatives of f and widehatwidehat ff on the actual shells of A do *not* suffice to determine a radial Schwartz function. Sardari (2021) proved that infinitely many linearly independent radial Schwartz functions have all those data zero. So the interpolation problem must be enlarged: we work with a superset of shells (the periodic node set mathcal NcalN of Section 4.1), and impose contacts at every node of the superset. In a summable coefficient space this *does* determine the function uniquely (Section 6).
+A further subtlety: values and first derivatives of f and widehatwidehat ff on the actual shells of A do *not* suffice to determine a radial Schwartz function. Sardari (2021) proved that infinitely many linearly independent radial Schwartz functions have all those data zero. So the interpolation problem must be enlarged: we work with a superset of shells (the periodic node set N of Section 4.1), and impose contacts at every node of the superset. In a summable coefficient space this *does* determine the function uniquely (Section 6).
### 3.5 The three-stage strategy
@@ -318,9 +299,9 @@ The next sections build Stage A concretely.
## 4. Stage A: building entire candidate functions
-We now construct the entire infinite family of "candidate" functions that the interpolation problem of Sections 5-6 will pin down to a specific pair. These candidates are of the shape "sine product times a rational sum." Their point is: each candidate has control over value and first derivative at every node of the periodic set mathcal N,calN, and the map from "dataset" to "function" is *linear* and *summable*.
+We now construct the entire infinite family of "candidate" functions that the interpolation problem of Sections 5-6 will pin down to a specific pair. These candidates are of the shape "sine product times a rational sum." Their point is: each candidate has control over value and first derivative at every node of the periodic set N, and the map from "dataset" to "function" is *linear* and *summable*.
-### 4.1 Shells, nodes, and the periodic set mathcal NcalN
+### 4.1 Shells, nodes, and the periodic set N
The construction uses four numerical parameters:
@@ -334,7 +315,7 @@ u = sqrt{2/√(3)};(1, 0), v = sqrt{2/√(3)};(1/2, ,b).
The determinant of (u, v) is one, so this is a unit-covolume lattice -- exactly the triangular lattice A from Section 1.1.
-For any j, ell in mathbb Z:bbZ:
+For any j, ell in Z:bbZ:
b lvert j u + ell v rvert^{2} = j^{2} + j ell + ell^{2}.
@@ -351,15 +332,15 @@ j^{2} + j ell + ell^{2} in {,0, 1, 3, 4, 7, 9,} pmod{12}.
Define
-L = {0, 1, 3, 4, 7, 9}, mathcal ZcalZ = 12mathbb ZbbZ + L, mathcal NcalN = mathcal ZcalZ cap (0, ∞), mathcal N_calN_{0} = {0} cup mathcal N.calN.
+L = {0, 1, 3, 4, 7, 9}, Z = 12Z + L, N = Z cap (0, ∞), N_{0} = {0} cup N.
-**Claim.** Every nonzero shell of A lies in mathcal N.calN.
+**Claim.** Every nonzero shell of A lies in N.
-**Claim (strictness).** The inclusion is proper: for example 24 in mathcal N,calN, but 24 is not a shell of A. Indeed, if j^{2} + jell + ell^{2} = 24, parity forces j, ell even, so (j/2)^{2} + (j/2)(ell/2) + (ell/2)^{2} = 6; parities force j/2, ell/2 even too, so the original value would be divisible by 16, contradicting 16 nmid 24.
+**Claim (strictness).** The inclusion is proper: for example 24 in N, but 24 is not a shell of A. Indeed, if j^{2} + jell + ell^{2} = 24, parity forces j, ell even, so (j/2)^{2} + (j/2)(ell/2) + (ell/2)^{2} = 6; parities force j/2, ell/2 even too, so the original value would be divisible by 16, contradicting 16 nmid 24.
The extra nodes (like 24) are *artificial*: they are not shell radii of A. But they will also carry interpolation data. This is exactly the enlargement that the Sardari non-uniqueness theorem requires (Section 3.4).
-Finally, recall the dual lattice A^{*} = JA from Section 1.1 --- the same shells. So contacts at the nodes of mathcal NcalN serve *both* the direct (A) side and the dual (A^{*}) side simultaneously.
+Finally, recall the dual lattice A^{*} = JA from Section 1.1 --- the same shells. So contacts at the nodes of N serve *both* the direct (A) side and the dual (A^{*}) side simultaneously.
### 4.2 The normalized Gaussian pair
@@ -371,7 +352,7 @@ T_{k}(s) = k^{-1} e^{-k(s - 1)}.
T_{k} is a stretched exponential "reference profile," scaled so T_{k}(1) = 1/k and decaying away from s = 1.
-**Theorem (Normalized Gaussian Fourier pair).** *For every finite real k ge 2.36, there exist entire functions H_{1}, H_{2} real on the real axis, and a real radial Schwartz function f on mathbb R^bbR^{2}, with*
+**Theorem (Normalized Gaussian Fourier pair).** *For every finite real k ge 2.36, there exist entire functions H_{1}, H_{2} real on the real axis, and a real radial Schwartz function f on R^{2}, with*
f(x) = e^{-pi h b lvert x rvert^{2}}, H_{1}(b lvert x rvert^{2}), widehatwidehat f(f(xi) = e^{-pi h b lvert xi rvert^{2}}, H_{2}(b lvert xi rvert^{2}),
@@ -379,7 +360,7 @@ f(x) = e^{-pi h b lvert x rvert^{2}}, H_{1}(b lvert x rvert^{2}), widehatwideha
H_{1}(s) le T_{k}(s), H_{2}(s) ge 0, (two signs)
-*and at every node n in mathcal N:*calN:*
+*and at every node n in N:*calN:*
H_{1}(n) = T_{k}(n), H_{1}'(n) = T_{k}'(n) = -e^{-k(n-1)}, H_{2}(n) = H_{2}'(n) = 0. (four contacts per node)
@@ -391,7 +372,7 @@ This is the technical heart of the paper. Everything else unfolds from it.
k e^{-k} e^{-pi h s} T_{k}(s) = e^{-(pi h + k) s} = e^{-pi alpha lvert x rvert^{2}} = G_{alpha}(x).
-So k e^{-k} cdot f is a minorant of G_{alpha} (with f le e^{-pi h s} T_{k} from the theorem), its Fourier is nonnegative (multiplied by k e^{-k} > 0, retains nonnegativity), and its direct and dual contacts at mathcal NcalN ⊇ A ∖ {0} match G_{alpha} and zero respectively. This is the Gaussian pair of Section 3.3, for every alpha ge 1.
+So k e^{-k} · f is a minorant of G_{alpha} (with f le e^{-pi h s} T_{k} from the theorem), its Fourier is nonnegative (multiplied by k e^{-k} > 0, retains nonnegativity), and its direct and dual contacts at N ⊇ A ∖ {0} match G_{alpha} and zero respectively. This is the Gaussian pair of Section 3.3, for every alpha ge 1.
For 0 < alpha < 1 (i.e. k too small), a Fourier-complement trick handles it (Section 8.2). We focus on alpha ge 1 for the construction.
@@ -403,7 +384,7 @@ The first ingredient is a *periodic* function with a double zero at every node a
P(s) = prod_{a in L} ( 2 sin(pi(s - a))/(12) )^{2}.
-Six squared sine factors, one for each residue class of mathcal N.calN. Each factor is 2-periodic in the appropriate variable (period 12 in s); the product is nonnegative, periodic with period 12, has a double zero at every point of the periodic set mathcal Z,calZ, and no other real zeros.
+Six squared sine factors, one for each residue class of N. Each factor is 2-periodic in the appropriate variable (period 12 in s); the product is nonnegative, periodic with period 12, has a double zero at every point of the periodic set Z, and no other real zeros.
P has a short complex-exponential expansion:
@@ -417,7 +398,7 @@ The absolute values that matter later:
( lvert P_{1} rvert, ..., lvert P_{6} rvert ) = (2, 2, 2, 1, 2, 1), sum_{ell = 1}^{6} lvert P_{ell} rvert = 10, sum_{ell = 1}^{6} t_{ell} lvert P_{ell} rvert = (16)/(3).
-**Node constants Q_{n}, D_{n}.** At any node n in mathcal N_calN_{0}, write
+**Node constants Q_{n}, D_{n}.** At any node n in N_{0}, write
P(n + u) = Q_{n} u^{2} ( 1 + D_{n} u + O(u^{2}) ).
@@ -448,17 +429,17 @@ Now we turn "specify a value and a slope at every node" into a single entire fun
**Definition (coefficient list).** A coefficient list is data of the form
-a = ( C ; ; {(c_{n}, d_{n})}_{n in mathcal N_calN_{0}} ),
+a = ( C ; ; {(c_{n}, d_{n})}_{n in N_{0}} ),
-where C in mathbb RbbR is a constant, and c_{n}, d_{n} in mathbb RbbR for each node n. Its *unweighted* norm is
+where C in R is a constant, and c_{n}, d_{n} in R for each node n. Its *unweighted* norm is
-lVert a rVert_{1} = lvert C rvert + sum_{n in mathcal N_calN_{0}} ( lvert c_{n} rvert + lvert d_{n} rvert ).
+lVert a rVert_{1} = lvert C rvert + sum_{n in N_{0}} ( lvert c_{n} rvert + lvert d_{n} rvert ).
Summability (lVert a rVert_{1} < ∞) is the fixed admissibility criterion.
Define
-p_{a}(s) = P(s) ( C + sum_{n in mathcal N_calN_{0}} ( frac{c_{n}}{(s - n)^{2}} + frac{d_{n}}{s - n} ) ), s in mathbb CbbC ∖ mathcal N_calN_{0}.
+p_{a}(s) = P(s) ( C + sum_{n in N_{0}} ( frac{c_{n}}{(s - n)^{2}} + frac{d_{n}}{s - n} ) ), s in C ∖ N_{0}.
The double poles c_{n}/(s-n)^{2} interact with the double zero of P at n to give a *finite* value Q_{n} c_{n} at n. The simple poles give a finite derivative. Away from nodes, p_{a} is analytic.
@@ -466,23 +447,23 @@ The double poles c_{n}/(s-n)^{2} interact with the double zero of P at n to give
*(a) p_{a} extends to an entire function, real on the real axis, with jets*
-p_{a}(n) = Q_{n} c_{n}, p_{a}'(n) = Q_{n}( d_{n} + D_{n} c_{n} ) (n in mathcal N_calN_{0}).
+p_{a}(n) = Q_{n} c_{n}, p_{a}'(n) = Q_{n}( d_{n} + D_{n} c_{n} ) (n in N_{0}).
*(b) There is a finite complex measure mu_{a} on [-1, 1] such that*
-p_{a}(s) = int_{-1}^{1} e^{i pi t s} , dmu_{a}(t) (s in mathbb C),bbC),
+p_{a}(s) = int_{-1}^{1} e^{i pi t s} , dmu_{a}(t) (s in C),
*and mu_{a}(- E) = overline{mu_{a}(E)} for every Borel set E, plus the TV bound*
-lVert mu_{a} rVert_{TV} le 25 lvert C rvert + 36 sum_{n in mathcal N_calN_{0}} ( lvert c_{n} rvert + lvert d_{n} rvert ).
+lVert mu_{a} rVert_{TV} le 25 lvert C rvert + 36 sum_{n in N_{0}} ( lvert c_{n} rvert + lvert d_{n} rvert ).
*(c) The same p_{a} has a "folded" evaluation on real s:*
-p_{a}(s) = Re int_{0}^{1} e^{i pi t s} , dnu_{a}(t) (s in mathbb R),bbR),
+p_{a}(s) = Re int_{0}^{1} e^{i pi t s} , dnu_{a}(t) (s in R),
*where nu_{a} is a finite complex measure supported on [0, 1], with atoms C e_{j} P_{j} at t_{j} = j/6 (with e_{0} = 1, e_{j} = 2 for 1 le j le 6) and a density on each open interval ((j-1)/6, j/6) given by*
-d_{j}(t) = 2pi sum_{n in mathcal N_calN_{0}} e^{-i pi t n} sum_{ell = j}^{6} [ -pi c_{n}(t_{ell} - t) + i d_{n} ] P_{ell}, e^{i pi t_{ell} n}.
+d_{j}(t) = 2pi sum_{n in N_{0}} e^{-i pi t n} sum_{ell = j}^{6} [ -pi c_{n}(t_{ell} - t) + i d_{n} ] P_{ell}, e^{i pi t_{ell} n}.
**Proof sketch.** For one node n, use u = s - n and the elementary integral identities
@@ -490,7 +471,7 @@ frac{e^{i pi t_{ell} u} - 1}{u} = i pi int_{0}^{t_{ell}} e^{i pi t u}, dt, frac
Multiply the first by P_{ell} e^{i pi t_{ell} n} and sum over ell; the subtracted constant and linear terms cancel because P(n) = P'(n) = 0. The result is an integral representation of c_{n}/(s-n)^{2} and d_{n}/(s-n) as spectral measures. The negative-frequency parts are conjugate reflections, so the "folding" gives item (c). Summability over n gives (b). QED
-**Why these particular constants 25 and 36.** The constant column C P has variation lvert P_{0} rvert + 2 sum_{ell = 1}^{6} lvert P_{ell} rvert = 5 + 2 cdot 10 = 25. The c_{n} column has variation pi^{2} sum_{ell=1}^{6} t_{ell}^{2} lvert P_{ell} rvert = 65 pi^{2}/18 < 36. The d_{n} column has variation 2pi sum_{ell = 1}^{6} t_{ell} lvert P_{ell} rvert = 32pi/3 < 36. So 25 and 36 are just convenient upper bounds.
+**Why these particular constants 25 and 36.** The constant column C P has variation lvert P_{0} rvert + 2 sum_{ell = 1}^{6} lvert P_{ell} rvert = 5 + 2 · 10 = 25. The c_{n} column has variation pi^{2} sum_{ell=1}^{6} t_{ell}^{2} lvert P_{ell} rvert = 65 pi^{2}/18 < 36. The d_{n} column has variation 2pi sum_{ell = 1}^{6} t_{ell} lvert P_{ell} rvert = 32pi/3 < 36. So 25 and 36 are just convenient upper bounds.
### 4.5 The Gaussian transform of a cardinal function
@@ -502,15 +483,15 @@ Both are holomorphic in t except at t = -ih (which is not on [-1, 1]; h = 2/5, s
K_{p_{a}}(s) = int_{-1}^{1} lambda(t), e^{i pi z(t) s}, dmu_{a}(t)
is entire, and satisfies the reality condition K_{p_{a}}(sbar) = overlineoverline{K_K_{p_{a}}(s)} for all complex s. In particular it is real on the real axis.
-**Why the formula works.** The complex Gaussian transform in dimension two, with our convention fhat(xi) = int f(x) e^{-2pi i x cdot xi} dx, is
+**Why the formula works.** The complex Gaussian transform in dimension two, with our convention fhat(xi) = int f(x) e^{-2pi i x · xi} dx, is
widehatwidehat{e^e^{-pi gamma lvert x rvert^{2}}}(xi) = gamma^{-1}, e^{-pi lvert xi rvert^{2}/gamma} (Re gamma > 0).
-Apply it to the Gaussian e^{-pi h b lvert x rvert^{2}} cdot e^{i pi t s} with s = b lvert x rvert^{2}. The result is another Gaussian with parameter gamma = b(h - it), whose transform is another Gaussian with parameter 1/gamma. Writing gamma = b(h - it) = -ib(t+ih) and simplifying, the transform of e^{-pi h b lvert x rvert^{2}} e^{i pi t s} equals
+Apply it to the Gaussian e^{-pi h b lvert x rvert^{2}} · e^{i pi t s} with s = b lvert x rvert^{2}. The result is another Gaussian with parameter gamma = b(h - it), whose transform is another Gaussian with parameter 1/gamma. Writing gamma = b(h - it) = -ib(t+ih) and simplifying, the transform of e^{-pi h b lvert x rvert^{2}} e^{i pi t s} equals
e^{-pi h s}, lambda(t), e^{i pi z(t) s}.
Integrating against dmu_{a}(t) and swapping integrals gives the claimed K_{p_{a}}.
**Pointwise frequency consistency.** z is an involution on the upper half-plane: z(z(t)) = t. And lambda(t) lambda(z(t)) = 1. These identities hold pointwise; they do not define a composition of the folded integral because z does not preserve the integration contour [-1, 1]. They are also not needed for anything in the argument except as sanity checks; the Fourier-pair conclusion below is proved from the actual complex Gaussian formula, not from these.
-**Lemma (Fourier pairs).** For every summable a, the radial functions e^{-pi h s} p_{a}(s) and e^{-pi h s} K_{p_{a}}(s), viewed as functions on mathbb R^bbR^{2} via s = b lvert x rvert^{2}, are real Schwartz functions, and are Fourier transforms of one another:
+**Lemma (Fourier pairs).** For every summable a, the radial functions e^{-pi h s} p_{a}(s) and e^{-pi h s} K_{p_{a}}(s), viewed as functions on R^{2} via s = b lvert x rvert^{2}, are real Schwartz functions, and are Fourier transforms of one another:
widehatwidehat{(e^(e^{-pi h s}, p_{a})} = e^{-pi h s}, K_{p_{a}}, widehatwidehat{(e^(e^{-pi h s}, K_{p_{a}})} = e^{-pi h s}, p_{a}.
**Lemma (Coupled pair).** Suppose a_{1}, a_{2} are summable. Define
@@ -524,10 +505,10 @@ Both lemmas are proved in the paper by direct use of the complex Gaussian transf
### 4.6 The jet operator and the distant-output bound
Everything we care about is *local data at nodes*: value and first derivative. Define the **jet projection**
-(J u)_{c, n} = frac{u(n)}{Q_{n}}, (J u)_{d, n} = frac{u'(n) - D_{n} u(n)}{Q_{n}} (n in mathcal N).calN).
+(J u)_{c, n} = frac{u(n)}{Q_{n}}, (J u)_{d, n} = frac{u'(n) - D_{n} u(n)}{Q_{n}} (n in N).
The normalizations Q_{n}, D_{n} undo the leading behavior of P at that node. With these factors,
J p_{a} = a^{+}
-where a^{+} denotes the positive-node part of a, i.e. {c_{n}, d_{n}}_{n in mathcal N}calN with the "extra coordinates" (c_{0}, d_{0}, C) suppressed.
+where a^{+} denotes the positive-node part of a, i.e. {c_{n}, d_{n}}_{n in N} with the "extra coordinates" (c_{0}, d_{0}, C) suppressed.
Define the **transformed jet operator**
S a = -J K_{p_{a}}.
@@ -550,9 +531,9 @@ lvert lambda(t) rvert = frac{1}{b sqrt{t^{2} + h^{2}}}, lvert z(t) rvert^{2} =
Since B > 2 h^{2}, all three decrease with t. Their largest / smallest values on [0, 1] occur at endpoints, giving the displayed numerics. The sharper endpoint 5/6 comes from plugging t = 5/6 into these formulas and using the rational bounds on pi and sqrt 3.
**Tail bound (distant outputs of S).** For every positive integer r, every pair (sum of absolute node coefficients ge w, absolute constant coordinate ge c) of inputs satisfies
-sum_{n in mathcal N,calN,; n ge r} ( lvert (Sa)_{c, n} rvert + lvert (Sa)_{d, n} rvert ) le U_{r}(w, c) := frac{800(w+c) e^{-0.70 r}}{1 - e^{-0.70}} + frac{5.3(2.54 w / r + 2c) e^{-0.187 r}}{1 - e^{-0.187}}.
+sum_{n in N,; n ge r} ( lvert (Sa)_{c, n} rvert + lvert (Sa)_{d, n} rvert ) le U_{r}(w, c) := frac{800(w+c) e^{-0.70 r}}{1 - e^{-0.70}} + frac{5.3(2.54 w / r + 2c) e^{-0.187 r}}{1 - e^{-0.187}}.
-**Why it works.** For n ge r ge 1, the integrand in K_{p_{a}} carries an explicit exponential e^{i pi z(t) n}; its real part is e^{-pi Im z(t) n} le e^{-0.187 n}. The frequency derivative from d/ds brings down a polynomial in lvert z(t) rvert < 3, controlled by the 2.54 w / r factor in the second term. On [0, 5/6] the stronger e^{-0.70 n} decay dominates, giving the first term; on [5/6, 1] the weaker but polynomial-decay factor dominates, giving the second. The constants 800 and 5.3 are the total-variation product 36 cdot pi cdot lvert dimension factor rvert and a uniform bound on the growth of lvert z rvert on that segment.
+**Why it works.** For n ge r ge 1, the integrand in K_{p_{a}} carries an explicit exponential e^{i pi z(t) n}; its real part is e^{-pi Im z(t) n} le e^{-0.187 n}. The frequency derivative from d/ds brings down a polynomial in lvert z(t) rvert < 3, controlled by the 2.54 w / r factor in the second term. On [0, 5/6] the stronger e^{-0.70 n} decay dominates, giving the first term; on [5/6, 1] the weaker but polynomial-decay factor dominates, giving the second. The constants 800 and 5.3 are the total-variation product 36 · pi · lvert dimension factor rvert and a uniform bound on the growth of lvert z rvert on that segment.
**Operator norm.** Collecting the two bounds over all node columns (summing the le U_{1}(1, 1) bound, which is about 2500) gives
lVert S rVert_{op (finite lists)} < 4000.
@@ -570,12 +551,12 @@ These bounds are uniform in the node locations and do not require finite support
The task of Stages A-C is:
**Find summable coefficient lists a_{1}, a_{2} with prescribed extra coordinates e_{i} = E_{i} q(k) (see Section 5) such that**
-J H_{1} = J T_{k}, J H_{2} = 0 on all positive nodes n in mathcal N.calN.
+J H_{1} = J T_{k}, J H_{2} = 0 on all positive nodes n in N.
Once found, the pair (H_{1}, H_{2}) satisfies all four contacts of Theorem 4.2. The next two sections
- split the infinite problem into a finite block (84 nodes at n le 168) and a tail;
- solve the finite block numerically, and prove the tail is contractive;
-- bound the combined correction by 2 cdot 10^{-8} in ell^{1} norm.
+- bound the combined correction by 2 · 10^{-8} in ell^{1} norm.
The Gaussian pair's existence follows by this fixed-point argument. The signs H_{1} le T_{k} and H_{2} ge 0 (which are also part of Theorem 4.2) come later, in Section 7, from a Bernstein-polynomial certification.
@@ -586,7 +567,7 @@ The Gaussian pair's existence follows by this fixed-point argument. The signs H_
The interpolation problem of Section 4.7 lives in the infinite summable space. In practice it is solved in two steps:
1. **Truncate.** Restrict the positive nodes to those with n le 168 and the spectral variable s = b lvert x rvert^{2} to a finite quadrature grid. The truncated system is finite-dimensional; it is a 168 times 171 matrix equation.
-2. **Correct for truncation.** Prove that the full infinite system differs from the finite one by a factor small enough that the finite solution, extended by zero, is within 2 cdot 10^{-8} of the full solution.
+2. **Correct for truncation.** Prove that the full infinite system differs from the finite one by a factor small enough that the finite solution, extended by zero, is within 2 · 10^{-8} of the full solution.
Step 2 is the harder of the two analytically, and uses the tail bound U_{r}(w, c) of Section 4.6.
@@ -594,9 +575,9 @@ Step 2 is the harder of the two analytically, and uses the tail bound U_{r}(w, c
The finite truncation parameters are
-M = 168, mathcal FcalF = mathcal NcalN cap [1, M], N = 384.
+M = 168, F = N cap [1, M], N = 384.
-There are exactly 84 positive nodes in mathcal F:calF: each successive block of 12 integers contains 6 permitted residues {0, 1, 3, 4, 7, 9}, and 14 times 6 = 84.
+There are exactly 84 positive nodes in F:calF: each successive block of 12 integers contains 6 permitted residues {0, 1, 3, 4, 7, 9}, and 14 times 6 = 84.
A finite positive-node list has 168 coordinates: first all c_{n} in increasing n, then all d_{n} in increasing n. Three extra coordinates are appended: e = (c_{0}, d_{0}, C) in that order. So the complete finite input space has 171 coordinates.
@@ -618,7 +599,7 @@ The factor of 1/6 is the physical length of the interval.
**Quadrature error bound.** For every integrand of the form d_{j}(t) h(t) with h entire and lvert h^{(m)}(t) / m! rvert le R^{m} for lvert t - u rvert le 1/12 around each midpoint u = (2j - 1)/12, the difference between the integral and the quadrature sum is bounded by 10^{-31}.
-**Why this scale.** Fejér's first rule is exact for polynomials of degree le N - 1 = 383 on the standard interval. The Taylor series of h on a disc of radius 1/12 (smaller than the physical gap, so it stays inside the permitted region) converges fast enough that the tail after degree 383 is negligible. Cauchy's coefficient estimate gives lvert h^{(m)}(u)/m! rvert le bound, and the geometric tail is sum_{m ge 384} 2^{-m} < 2^{-383}. The result is dominated by 10^{83} cdot 2^{-384}, which is below 10^{-31}. The exact numerical allowance in the paper is 4 cdot 10^{83} cdot 2^{-384} < 10^{-31}; the integer inequality 4 cdot 10^{114} < 2^{384} is what makes it work.
+**Why this scale.** Fejér's first rule is exact for polynomials of degree le N - 1 = 383 on the standard interval. The Taylor series of h on a disc of radius 1/12 (smaller than the physical gap, so it stays inside the permitted region) converges fast enough that the tail after degree 383 is negligible. Cauchy's coefficient estimate gives lvert h^{(m)}(u)/m! rvert le bound, and the geometric tail is sum_{m ge 384} 2^{-m} < 2^{-383}. The result is dominated by 10^{83} · 2^{-384}, which is below 10^{-31}. The exact numerical allowance in the paper is 4 · 10^{83} · 2^{-384} < 10^{-31}; the integer inequality 4 · 10^{114} < 2^{384} is what makes it work.
10^{-31} is much smaller than every subsequent error budget (10^{-8}), so it will effectively be zero in the correction calculus.
@@ -630,7 +611,7 @@ rows = 6N + 7 = 2311, columns = 171.
Its rows are indexed by (j, v) in {1, ..., 6} times {0, ..., N-1} (the density quadrature points, in lexicographic order) followed by j in {0, ..., 6} (the seven atoms, in increasing j order). Its columns use the finite-coordinate order specified in Section 5.1.
-The entries are, for t = tau_{j v} and each finite node n in mathcal FcalF cup {0}:
+The entries are, for t = tau_{j v} and each finite node n in F cup {0}:
W_{(j, v), c_{n}} = -frac{2 pi^{2} o_{v}}{6}, e^{-i pi t n} sum_{ell = j}^{6} (t_{ell} - t), P_{ell}, e^{i pi t_{ell} n},
W_{(j, v), d_{n}} = frac{2 pi i o_{v}}{6}, e^{-i pi t n} sum_{ell = j}^{6} P_{ell}, e^{i pi t_{ell} n},
@@ -642,7 +623,7 @@ W_{atom(j), C} = e_{j} P_{j}, W_{atom(j), c_{n}} = W_{atom(j), d_{n}} = 0,
where e_{0} = 1 and e_{j} = 2 for j > 0.
-**What Wa computes.** For any input column a (a 171-vector), the vector Wa in mathbb C^bbC^{2311} has entries equal to the finite quadrature values of p_{a} (or more precisely, of the folded density and atomic contributions) at the mass points. Multiplying by the moment factors (Section 5.4) recovers the derivatives of p_{a} at any real center.
+**What Wa computes.** For any input column a (a 171-vector), the vector Wa in C^{2311} has entries equal to the finite quadrature values of p_{a} (or more precisely, of the folded density and atomic contributions) at the mass points. Multiplying by the moment factors (Section 5.4) recovers the derivatives of p_{a} at any real center.
Two notes.
@@ -655,7 +636,7 @@ The mass matrix W produces the *zeroth* finite value of p_{a} at each mass point
F_{a}(m, y; t) = e^{i pi t m} frac{(i pi y t)^{a}}{a!}, G_{a}(m, y; t) = lambda(t), e^{i pi z(t) m} frac{(i pi y z(t))^{a}}{a!}.
-For a real coefficient column A in mathbb R^bbR^{171}, the Taylor coefficient of order a at m (scaled by y^{a}/a!) of p_{a} is
+For a real coefficient column A in R^{171}, the Taylor coefficient of order a at m (scaled by y^{a}/a!) of p_{a} is
frac{y^{a}}{a!} p_{a}^{(a)}(m) = Re( F_{a}(m, y; t)^{top} W A ).
Similarly, for the transformed cardinal function,
frac{y^{a}}{a!} K_{p_{a}}^{(a)}(m) = Re( G_{a}(m, y; t)^{top} W A ).
@@ -673,11 +654,11 @@ We now assemble the finite interpolation problem.
S^{#}_{c(m), :} = -frac{1}{Q_{m}} Re( G_{0}(m, 1; t)^{top} W ),
S^{#}_{d(m), :} = frac{1}{Q_{m}} Re( D_{m} G_{0}(m, 1; t)^{top} W - G_{1}(m, 1; t)^{top} W ),
-for each finite node m in mathcal F.calF. The rows are indexed by the same 168 coordinates as before (all c_{m} in increasing m, then all d_{m}).
+for each finite node m in F. The rows are indexed by the same 168 coordinates as before (all c_{m} in increasing m, then all d_{m}).
-**Interpretation.** For a finite input a in mathbb R^bbR^{171}, the vector S^{#} a in mathbb R^bbR^{168} is the finite quadrature evaluation of J K_{p_{a}} at the finite nodes. The sign convention: S^{#} is the negative of J K_{p} (matching the definition of S in Section 4.6).
+**Interpretation.** For a finite input a in R^{171}, the vector S^{#} a in R^{168} is the finite quadrature evaluation of J K_{p_{a}} at the finite nodes. The sign convention: S^{#} is the negative of J K_{p} (matching the definition of S in Section 4.6).
-**The target column Y.** The right-hand side at five "fundamental nodes" n_{1}, ..., n_{5} = 1, 3, 4, 7, 9 is the target T_{k}. Because T_{k} is an exponential, its jet projection has a compact form. Let q(k) in mathbb R^bbR^{10} be the vector
+**The target column Y.** The right-hand side at five "fundamental nodes" n_{1}, ..., n_{5} = 1, 3, 4, 7, 9 is the target T_{k}. Because T_{k} is an exponential, its jet projection has a compact form. Let q(k) in R^{10} be the vector
q(k) = ( T_{k}(1), T_{k}(3), T_{k}(4), T_{k}(7), T_{k}(9), ; -T_{k}'(1), ..., -T_{k}'(9) ).
Define Y by
@@ -690,8 +671,8 @@ The target at the remaining finite nodes (all those that are not in {1, 3, 4, 7,
**The extra coordinates.** The three extra coordinates e_{i} = (c_{0}, d_{0}, C) for list i are chosen explicitly, independent of k. Collect them into vectors:
-- E_{1} in mathbb R^bbR^{3 times 10}: row of e coordinates for H_{1}'s list.
-- E_{2} in mathbb R^bbR^{3 times 10}: row of e coordinates for H_{2}'s list.
+- E_{1} in R^{3 times 10}: row of e coordinates for H_{1}'s list.
+- E_{2} in R^{3 times 10}: row of e coordinates for H_{2}'s list.
Concretely, the first column of E (viewed as 6 times 10) is
(0.567, ; 0.250, ; -0.0074, ; 0, ; -0.209, ; 0.0096)^{top}
@@ -705,7 +686,7 @@ The first three entries of each column give E_{1}, the last three give E_{2}. So
A_{1} - D A_{2} = Y + S^{#}_{F e} E_{2}, A_{2} - D A_{1} = S^{#}_{F e} E_{1}.
-Here A_{i} in mathbb R^bbR^{168 times 10} are the finite-positive parts of the two lists, one column per coordinate of q(k). The sign of D follows from the sign convention in S: -S on the diagonal becomes +D when the equation is written in this "shifted" form.
+Here A_{i} in R^{168 times 10} are the finite-positive parts of the two lists, one column per coordinate of q(k). The sign of D follows from the sign convention in S: -S on the diagonal becomes +D when the equation is written in this "shifted" form.
**The finite geometric-sum solution.** Summing and differencing the two equations,
(I - D)(A_{1} + A_{2}) = g_{1} + g_{2}, (I + D)(A_{1} - A_{2}) = g_{1} - g_{2},
@@ -716,9 +697,9 @@ For the finite system, we replace the exact inverses (I - D)^{-1} and (I + D)^{-
V_{+} = sum_{j = 0}^{511} D^{j}, V_{-} = sum_{j = 0}^{511} (-D)^{j}.
Then
-X_{1 mathcal F}calF = (1)/(2)( V_{+}(g_{1} + g_{2}) + V_{-}(g_{1} - g_{2}) ), X_{2 mathcal F}calF = (1)/(2)( V_{+}(g_{1} + g_{2}) - V_{-}(g_{1} - g_{2}) ),
+X_{1 F} = (1)/(2)( V_{+}(g_{1} + g_{2}) + V_{-}(g_{1} - g_{2}) ), X_{2 F} = (1)/(2)( V_{+}(g_{1} + g_{2}) - V_{-}(g_{1} - g_{2}) ),
and
-X_{i} = X_{i mathcal F}calF E_{i} in mathbb R^bbR^{171 times 10}, i = 1, 2.
+X_{i} = X_{i F} E_{i} in R^{171 times 10}, i = 1, 2.
The reference list for a given k is then X_{i} q(k), extended by zero on the positive nodes n > 168 (the "tail").
@@ -726,7 +707,7 @@ The reference list for a given k is then X_{i} q(k), extended by zero on the pos
(I - D) V_{+} = I - D^{512}, (I + D) V_{-} = I - D^{512}
show that the finite geometric sums solve the equations up to D^{512}. If lVert D^{512} rVert is small enough, the difference between X_{i} q(k) and the true solution is small. Section 5.6 verifies D^{2^9} = D^{512} has norm below 10^{-12} (row 8 of the power table).
-**What is left.** Given the reference lists X_{i} q(k), the full infinite solution differs from them by a correction that lives in the difference between the finite quadrature and the exact spectral integrals (bounded by 10^{-29}), the difference between the finite nodes and all nodes (bounded by 10^{-14} at 168 from the tail bound U_{168}), and by the difference between D^{512} and zero. Section 6 assembles these bounds into a 2 cdot 10^{-8} correction.
+**What is left.** Given the reference lists X_{i} q(k), the full infinite solution differs from them by a correction that lives in the difference between the finite quadrature and the exact spectral integrals (bounded by 10^{-29}), the difference between the finite nodes and all nodes (bounded by 10^{-14} at 168 from the tail bound U_{168}), and by the difference between D^{512} and zero. Section 6 assembles these bounds into a 2 · 10^{-8} correction.
### 5.6 The power-sum computation and the two tables
@@ -791,67 +772,67 @@ Both are documented in `verification/README.md`. Together they certify the finit
## 6. Stage C: exact interpolation
-We now prove that the finite reference lists of Section 5 can be corrected to *exact* solutions of the full infinite interpolation system, with a correction bounded by 2 cdot 10^{-8} in ell^{1}.
+We now prove that the finite reference lists of Section 5 can be corrected to *exact* solutions of the full infinite interpolation system, with a correction bounded by 2 · 10^{-8} in ell^{1}.
### 6.1 The proposition
-**Proposition (Exact interpolation).** *For every real k ge 2.36, there exists a unique pair of summable positive-node coefficient lists a_{1}, a_{2} in mathcal EcalE (where mathcal EcalE is the space of lists with prescribed extra coordinates e_{i} = E_{i} q(k)), whose full lists ell_{1}, ell_{2} satisfy the exact jets*
-H_{1}(n) = T_{k}(n), H_{1}'(n) = T_{k}'(n), H_{2}(n) = 0, H_{2}'(n) = 0 (n in mathcal N),calN),
+**Proposition (Exact interpolation).** *For every real k ge 2.36, there exists a unique pair of summable positive-node coefficient lists a_{1}, a_{2} in E (where E is the space of lists with prescribed extra coordinates e_{i} = E_{i} q(k)), whose full lists ell_{1}, ell_{2} satisfy the exact jets*
+H_{1}(n) = T_{k}(n), H_{1}'(n) = T_{k}'(n), H_{2}(n) = 0, H_{2}'(n) = 0 (n in N),
*where H_{1} = p_{ell_{1}} + K_{p_{ell_{2}}}, H_{2} = p_{ell_{2}} + K_{p_{ell_{1}}}.*
-*Let ell_{i}^{ref} = X_{i} q(k), extended by zero on the tail mathcal TcalT (all positive nodes n > 168). Then*
-sum_{i=1}^{2} lVert ell_{i}^{ref} rVert_{1} < 4.8, sum_{i=1}^{2} lVert ell_{i} - ell_{i}^{ref} rVert_{1} < 2 cdot 10^{-8}, sum_{i=1}^{2} lVert ell_{i} rVert_{1} < 5.
+*Let ell_{i}^{ref} = X_{i} q(k), extended by zero on the tail T (all positive nodes n > 168). Then*
+sum_{i=1}^{2} lVert ell_{i}^{ref} rVert_{1} < 4.8, sum_{i=1}^{2} lVert ell_{i} - ell_{i}^{ref} rVert_{1} < 2 · 10^{-8}, sum_{i=1}^{2} lVert ell_{i} rVert_{1} < 5.
*The functions H_{1}, H_{2} are entire and real on the real axis. In particular H_{1} - T_{k} and H_{2} have double zeros at every positive node, including the artificial nodes that are not actual lattice radii.*
-The third inequality (total ell^{1} norm < 5) is the sum of the reference bound 4.8 and the correction bound 2 cdot 10^{-8}.
+The third inequality (total ell^{1} norm < 5) is the sum of the reference bound 4.8 and the correction bound 2 · 10^{-8}.
-**Uniqueness.** The bounded inverse below gives uniqueness, within the prescribed coefficient system, for summable lists with fixed extras and jets prescribed on the enlarged periodic node set mathcal N.calN.
+**Uniqueness.** The bounded inverse below gives uniqueness, within the prescribed coefficient system, for summable lists with fixed extras and jets prescribed on the enlarged periodic node set N.
-This is worth contrasting with what is *not* claimed. Talebizadeh Sardari (2021, Theorem 1.7) proved that infinitely many linearly independent radial Schwartz functions have all their values and first derivatives (and those of their Fourier transforms) *vanish on the actual triangular shells* alone. So the interpolation problem that prescribes jets only on A ∖ {0} is *not* well-posed. The present paper enlarges the node set to mathcal N,calN, which contains all the actual shells and many artificial extras. The well-posedness is on the larger set, within the fixed summable coefficient system.
+This is worth contrasting with what is *not* claimed. Talebizadeh Sardari (2021, Theorem 1.7) proved that infinitely many linearly independent radial Schwartz functions have all their values and first derivatives (and those of their Fourier transforms) *vanish on the actual triangular shells* alone. So the interpolation problem that prescribes jets only on A ∖ {0} is *not* well-posed. The present paper enlarges the node set to N, which contains all the actual shells and many artificial extras. The well-posedness is on the larger set, within the fixed summable coefficient system.
### 6.2 The nonlinear block equation
-For summable lists with fixed extras, the coupled interpolation system of Section 4.7 becomes a nonlinear equation in the unknown tail a_{mathcal T}calT = (a_{1 mathcal T}calT, a_{2 mathcal T}calT):
+For summable lists with fixed extras, the coupled interpolation system of Section 4.7 becomes a nonlinear equation in the unknown tail a_{T} = (a_{1 T}, a_{2 T}:
-a_{mathcal F}calF = mathcal L_calL_{mathcal FcalF mathcal F}calF^{-1} (r_{mathcal F}calF - mathcal L_calL_{mathcal FcalF mathcal T}calT a_{mathcal T}calT),
+a_{F} = L_{F F}{-1} (r_{F} - L_{F T} a_{T},
-a_{mathcal T}calT = mathcal L_calL_{mathcal TcalT mathcal T}calT^{-1} (r_{mathcal T}calT - mathcal L_calL_{mathcal TcalT mathcal F}calF a_{mathcal F}calF),
+a_{T} = L_{T T}{-1} (r_{T} - L_{T F} a_{F},
where
-- a_{mathcal F}calF is the finite-positive part (the first 168 coordinates of each list);
-- a_{mathcal T}calT is the tail (nodes n > 168);
-- mathcal LcalL is the 2 times 2 block system satisfying the coupled equation from Section 4.7, split into finite/finite, finite/tail, tail/finite, tail/tail blocks;
-- r_{mathcal F}calF, r_{mathcal T}calT are the residual vectors (target minus the current approximation), bounded below.
+- a_{F} is the finite-positive part (the first 168 coordinates of each list);
+- a_{T} is the tail (nodes n > 168);
+- L is the 2 times 2 block system satisfying the coupled equation from Section 4.7, split into finite/finite, finite/tail, tail/finite, tail/tail blocks;
+- r_{F}, r_{T} are the residual vectors (target minus the current approximation), bounded below.
-The Schur complement of this system, with a_{mathcal F}calF eliminated, is a tail-space equation
-mathcal QcalQ a_{mathcal T}calT = psi_{mathcal T}calT, mathcal QcalQ = mathcal L_calL_{mathcal TcalT mathcal T}calT - mathcal L_calL_{mathcal TcalT mathcal F}calF , mathcal L_calL_{mathcal FcalF mathcal F}calF^{-1} mathcal L_calL_{mathcal FcalF mathcal T}calT,
-where psi_{mathcal T}calT is the effective right side.
+The Schur complement of this system, with a_{F} eliminated, is a tail-space equation
+Q a_{T} = psi_{T}, Q = L_{T T} - L_{T F} , L_{F F}{-1} L_{F T},
+where psi_{T} is the effective right side.
### 6.3 The operator bounds
-Four bounds establish that mathcal QcalQ is a small perturbation of the identity.
+Four bounds establish that Q is a small perturbation of the identity.
-**Bound on the finite inverse.** lVert mathcal L_calL_{mathcal FcalF mathcal F}calF^{-1} rVert < 40. This follows from the finite column-sum bound: the finite operator, viewed as a 336 times 336 block matrix (two lists combined), has column sums bounded by the reference-list column norms.
+**Bound on the finite inverse.** lVert L_{F F}{-1} rVert < 40. This follows from the finite column-sum bound: the finite operator, viewed as a 336 times 336 block matrix (two lists combined), has column sums bounded by the reference-list column norms.
-**Bound on the tail/tail block.** lVert mathcal L_calL_{mathcal TcalT mathcal T}calT - I rVert < delta, where delta = 1.1 cdot 10^{-14}. The tail decay is controlled by U_{168}(w, c) from Section 4.6, with the specific values w = 5 and c = 0.02 from the reference-list bounds.
+**Bound on the tail/tail block.** lVert L_{T T} - I rVert < delta, where delta = 1.1 · 10^{-14}. The tail decay is controlled by U_{168}(w, c) from Section 4.6, with the specific values w = 5 and c = 0.02 from the reference-list bounds.
-**Bound on the tail/finite block.** lVert mathcal L_calL_{mathcal TcalT mathcal F}calF rVert < delta. Same mechanism; the transformed contribution from a finite input vanishes rapidly at distance n > 168.
+**Bound on the tail/finite block.** lVert L_{T F} rVert < delta. Same mechanism; the transformed contribution from a finite input vanishes rapidly at distance n > 168.
-**Bound on the finite/tail block.** lVert mathcal L_calL_{mathcal FcalF mathcal T}calT rVert < 4000. This uses the operator norm of S (Section 4.6). It is not small; this is why one cannot just invert the finite block naively. But the Schur complement absorbs it.
+**Bound on the finite/tail block.** lVert L_{F T} rVert < 4000. This uses the operator norm of S (Section 4.6). It is not small; this is why one cannot just invert the finite block naively. But the Schur complement absorbs it.
### 6.4 The Schur complement is invertible
Combining the tail/finite, finite/finite, finite/tail, and tail/tail bounds gives
-lVert mathcal QcalQ - I rVert < delta(1 + 40 cdot 4000) = 1.760011 cdot 10^{-9} < 1.
+lVert Q - I rVert < delta(1 + 40 · 4000) = 1.760011 · 10^{-9} < 1.
-Since this is < 1, mathcal QcalQ has a convergent Neumann series mathcal Q^calQ^{-1} = sum_{k ge 0} (I - mathcal Q)^calQ)^{k}, and mathcal QcalQ is invertible with
-lVert mathcal Q^calQ^{-1} rVert < frac{1}{1 - 1.76 cdot 10^{-9}} approx 1 + 1.76 cdot 10^{-9}.
+Since this is < 1, Q has a convergent Neumann series Q^{-1} = sum_{k ge 0} (I - Q)^{k}, and Q is invertible with
+lVert Q^{-1} rVert < frac{1}{1 - 1.76 · 10^{-9}} approx 1 + 1.76 · 10^{-9}.
-Explicitly, for any right side psi = (psi_{mathcal F}calF, psi_{mathcal T}calT), the solution is reconstructed as
-a_{mathcal T}calT = mathcal Q^calQ^{-1} ( psi_{mathcal T}calT - mathcal L_calL_{mathcal TcalT mathcal F}calF mathcal L_calL_{mathcal FcalF mathcal F}calF^{-1} psi_{mathcal F}calF ),
-a_{mathcal F}calF = mathcal L_calL_{mathcal FcalF mathcal F}calF^{-1} ( psi_{mathcal F}calF - mathcal L_calL_{mathcal FcalF mathcal T}calT a_{mathcal T}calT ).
+Explicitly, for any right side psi = (psi_{F}, psi_{T}, the solution is reconstructed as
+a_{T} = Q^{-1} ( psi_{T} - L_{T F} L_{F F}{-1} psi_{F} ),
+a_{F} = L_{F F}{-1} ( psi_{F} - L_{F T} a_{T} ).
This is the exact full solution for any given right side psi. The question is now: how far is our reference list X q(k) from this exact solution?
@@ -860,18 +841,18 @@ This is the exact full solution for any given right side psi. The question is no
The reference list ell^{ref} = (X_{1} q(k), X_{2} q(k)) satisfies the interpolation system approximately. Three sources of discrepancy:
1. **The target at the ten "carrier" nodes.** The five q(k)-target nodes {1, 3, 4, 7, 9} are hit exactly. But the target T_{k} is nonzero at the other 79 finite nodes; the reference list gives Y q(k) = 0 there. The total target loss from omitted finite nodes is bounded by
-(1 + (1 + 2.12)/2.36)/(1.75) sum_{n = 12}^{∞} e^{-2.36(n - 1)} < 8 cdot 10^{-12}.
+(1 + (1 + 2.12)/2.36)/(1.75) sum_{n = 12}^{∞} e^{-2.36(n - 1)} < 8 · 10^{-12}.
2. **The quadrature vs. exact measure.** Section 5.2's quadrature error is 10^{-31} per quadrature point; multiplied by 2311 entries it stays well below 10^{-24}.
3. **The geometric-sum truncation.** As computed in Section 5.6, lVert D^{512} rVert < 10^{-24}. Three-times the residual from omitted D powers, times the zero-tail norm, is negligible.
Adding these three bounds:
-lVert r_{mathcal F}calF rVert_{1} < 8 cdot 10^{-12} + 10^{-24} + 1.4 cdot 10^{-15} < 10^{-11}.
+lVert r_{F} rVert_{1} < 8 · 10^{-12} + 10^{-24} + 1.4 · 10^{-15} < 10^{-11}.
(The middle number is a target-tail calculation; the last is the geometric-sum bound.)
**Tail residual.** At tail nodes n > 168, the reference list has zero positive-node coefficients, but the transformed operator still acts. Its total norm there is dominated by
-lVert r_{mathcal T}calT rVert_{1} le U_{168}(5, 0.02) + 10^{-170} < 8.3 cdot 10^{-14}.
+lVert r_{T} rVert_{1} le U_{168}(5, 0.02) + 10^{-170} < 8.3 · 10^{-14}.
The .02 is the combined extras constant bound (Section 6.6 below); the 10^{-170} is the target T_{k} decayed to node n = 169 and beyond, via the local geometric majorant of Section 8.
### 6.6 The extras constant and reference corner
@@ -884,29 +865,29 @@ Remember that the sum of the three extra coordinates, plus the reference list's
### 6.7 The correction size
-Put u_{mathcal F}calF = lVert (a - a^{ref})_{mathcal F}calF rVert_{1} and u_{mathcal T}calT = lVert (a - a^{ref})_{mathcal T}calT rVert_{1}. The block equations for the correction (a - a^{ref}), together with the Schur bound, give the system
+Put u_{F} = lVert (a - a^{ref})_{F} rVert_{1} and u_{T} = lVert (a - a^{ref})_{T} rVert_{1}. The block equations for the correction (a - a^{ref}), together with the Schur bound, give the system
-u_{mathcal F}calF le 40 ( 10^{-11} + 4000 , u_{mathcal T}calT ),
-u_{mathcal T}calT le 8.3 cdot 10^{-14} + 1.1 cdot 10^{-14} (u_{mathcal F}calF + u_{mathcal T}calT).
+u_{F} le 40 ( 10^{-11} + 4000 , u_{T} ),
+u_{T} le 8.3 · 10^{-14} + 1.1 · 10^{-14} (u_{F} + u_{T}
Substituting the first inequality into the second:
-u_{mathcal T}calT le frac{8.3 cdot 10^{-14} + 4.4 cdot 10^{-24}}{1 - 1.760011 cdot 10^{-9}} < 8.31 cdot 10^{-14},
+u_{T} le frac{8.3 · 10^{-14} + 4.4 · 10^{-24}}{1 - 1.760011 · 10^{-9}} < 8.31 · 10^{-14},
and from that
-u_{mathcal F}calF < 1.37 cdot 10^{-8}.
+u_{F} < 1.37 · 10^{-8}.
-Their sum is < 2 cdot 10^{-8}, which is the claimed correction bound.
+Their sum is < 2 · 10^{-8}, which is the claimed correction bound.
-Adding u_{mathcal F}calF + u_{mathcal T}calT to the reference norm lVert ell^{ref} rVert < 4.8 gives lVert ell rVert < 5 for the exact list.
+Adding u_{F} + u_{T} to the reference norm lVert ell^{ref} rVert < 4.8 gives lVert ell rVert < 5 for the exact list.
The extras did not change in the correction (they are pinned by the prescribed E_{i} q(k)), so this is the full-list bound, not just the positive-node part.
### 6.8 Finishing the proof of Proposition 6.1
The exact solution a of the full interpolation system of Section 6.2 exists and is unique (the Schur complement is invertible). Its lists ell_{1}, ell_{2} satisfy
-mathcal JcalJ H_{1} = mathcal JcalJ T_{k}, mathcal JcalJ H_{2} = 0
-at every positive node, and hence by definition of mathcal J,calJ, the four contacts
+J H_{1} = J T_{k}, J H_{2} = 0
+at every positive node, and hence by definition of J, the four contacts
H_{1}(n) = T_{k}(n), H_{1}'(n) = T_{k}'(n), H_{2}(n) = 0, H_{2}'(n) = 0
-at every n in mathcal N.calN.
+at every n in N.
The H_{i} are entire and real on the real axis by construction (Section 4.5). Lemma 4.5 gives them as the two halves of a real radial Schwartz Fourier pair, which is f and widehatwidehat ff of the normalized Gaussian theorem.
@@ -928,20 +909,20 @@ We want H_{1} - T_{k} le 0 and H_{2} ge 0. The signs -sigma_{i} with sigma_{1} =
sigma_{1}(H_{1} - T_{k}) ge 0, sigma_{2} H_{2} ge 0, i.e. sigma_{i}(H_{i} - delta_{i} T_{k}) ge 0
with delta_{1} = 1, delta_{2} = 0.
-Since we have *exact* contacts at nodes, both sides vanish at every n in mathcal N.calN. So the difference is *twice differentiable through zero* there. That is what makes the proof work.
+Since we have *exact* contacts at nodes, both sides vanish at every n in N. So the difference is *twice differentiable through zero* there. That is what makes the proof work.
### 7.2 The deleted-slack reduction
Define, for a twice-continuously-differentiable function u and a node m,
-mathcal D_calD_{m, 2} u(s) = frac{u(s) - u(m) - (s - m) u'(m)}{(s - m)^{2}} (s ne m),
-with removable value mathcal D_calD_{m, 2} u(m) = u''(m)/2. At the origin, we set mathcal D_calD_{0, 0} u = u. Define also the "slack" function
+D_{m, 2} u(s) = frac{u(s) - u(m) - (s - m) u'(m)}{(s - m)^{2}} (s ne m),
+with removable value D_{m, 2} u(m) = u''(m)/2. At the origin, we set D_{0, 0} u = u. Define also the "slack" function
F_{i, slack}(s) = sigma_{i}(H_{i}(s) - delta_{i} T_{k}(s)),
so that the sign we want is F_{i, slack}(s) ge 0.
-**Key identity.** At every positive node m in mathcal N,calN, both H_{i} and delta_{i} T_{k} have the target jets (by the contacts), so:
-F_{i, slack}(s) = (s - m)^{2}, mathcal D_calD_{m, 2}(sigma_{i}(H_{i} - delta_{i} T_{k}))(s).
+**Key identity.** At every positive node m in N, both H_{i} and delta_{i} T_{k} have the target jets (by the contacts), so:
+F_{i, slack}(s) = (s - m)^{2}, D_{m, 2}(sigma_{i}(H_{i} - delta_{i} T_{k}))(s).
The sign F_{i, slack}(s) ge 0 is therefore equivalent to
-sigma_{i}, mathcal D_calD_{m, 2}( H_{i} - delta_{i} T_{k} )(s) ge 0.
+sigma_{i}, D_{m, 2}( H_{i} - delta_{i} T_{k} )(s) ge 0.
(The sign of (s - m)^{2} is positive, so it drops out.)
The strategy is now clear:
@@ -952,8 +933,8 @@ The strategy is now clear:
We construct polynomial rows to which we will apply a Bernstein-polynomial argument. Recall that on [0, 1], the *Bernstein basis functions* binom{40}{d} x^{d}(1 - x)^{40 - d} for d = 0, ..., 40 are nonnegative and sum to one. So if a polynomial has all Bernstein coefficient > c, then it is > c on the whole interval [0, 1].
-For a fixed center m in mathcal N_calN_{0} cap [0, 88] and a signed half-gap length y, the half-gap consists of s = m + yx, 0 le x le 1. The Taylor coefficients of the "deleted quotient" are
-mathcal D_calD_{m, nu} u(m + yx) = sum_{r = 0}^{∞} frac{y^{r}}{(r + nu)!} u^{(r + nu)}(m) x^{r},
+For a fixed center m in N_{0} cap [0, 88] and a signed half-gap length y, the half-gap consists of s = m + yx, 0 le x le 1. The Taylor coefficients of the "deleted quotient" are
+D_{m, nu} u(m + yx) = sum_{r = 0}^{∞} frac{y^{r}}{(r + nu)!} u^{(r + nu)}(m) x^{r},
where nu = 0 if m = 0 and nu = 2 if m > 0.
Define the **Bernstein Taylor row** at center m, signed half-gap y:
@@ -965,11 +946,11 @@ L_{i, d} = sum_{r = 0}^{d} omega_{d, r}, l_{i, r}, omega_{d, r} = frac{binom{d}
By design, L_{i, d} is the d-th Bernstein coefficient of the partial Taylor series sum_{r=0}^{40} l_{i, r} x^{r} of the deleted quotient, with the **partial Taylor series being of the reference lists** X_{i} q(k) rather than the exact lists ell_{i}.
-**The correction from reference to exact.** By (5.4), the difference between reference and exact is controlled by lVert ell_{i} - X_{i} q(k) rVert_{1} < 2 cdot 10^{-8}. The derivative of a cardinal function is bounded by pi^{j} V, and the derivative of the transformed by 3(3pi)^{j} e^{-.187 s} V, with V le min(36 cdot 5, 180). The correct difference at every step is bounded by
-sup_{s in half-gap} | mathcal D_calD_{m, nu} (H_{i} - H_{i}^{ref})(s) | < .00011.
+**The correction from reference to exact.** By (5.4), the difference between reference and exact is controlled by lVert ell_{i} - X_{i} q(k) rVert_{1} < 2 · 10^{-8}. The derivative of a cardinal function is bounded by pi^{j} V, and the derivative of the transformed by 3(3pi)^{j} e^{-.187 s} V, with V le min(36 · 5, 180). The correct difference at every step is bounded by
+sup_{s in half-gap} | D_{m, nu} (H_{i} - H_{i}^{ref})(s) | < .00011.
This uses nu = 0 (zeroth derivative) or nu = 2 (with the additional 1/2 factor from int_0^1 (1-v) dv), and the maximum of pi^{nu}, 3(3pi)^{nu}.
-Similarly, the finite-truncation error in the Bernstein rows (from truncating the Taylor series after 40 terms) is bounded by 10^{-6}. And the quadrature error is 41 cdot 4 cdot 5 cdot 10^{-31} = 8.2 cdot 10^{-29}.
+Similarly, the finite-truncation error in the Bernstein rows (from truncating the Taylor series after 40 terms) is bounded by 10^{-6}. And the quadrature error is 41 · 4 · 5 · 10^{-31} = 8.2 · 10^{-29}.
### 7.4 Parameter boxes
@@ -988,16 +969,16 @@ l q(k) ge [l]_{K, J} := min_{x in {1/K, 1/J}} ( a_{1} + x b_{1} + sum_{j = 2}^{5
The right side of the Bernstein polynomial must dominate the deleted quotient of T_{k}, not just of H_{i}. The target's own deleted quotient has its own Taylor coefficients a_{r}^{*}, and these are bounded uniformly over k.
**Lemma (Exponential supports).** *For consecutive parameter endpoints K, J and K le k le J, the target's deleted quotient satisfies, on every prescribed half-gap,*
-mathcal D_calD_{m, nu} T_{k}(m + y x) ge sum_{r = 0}^{40} a_{r}^{*} x^{r} - 10^{-6} (0 le x le 1),
+D_{m, nu} T_{k}(m + y x) ge sum_{r = 0}^{40} a_{r}^{*} x^{r} - 10^{-6} (0 le x le 1),
*with coefficients:*
-- *At the origin (m = 0, nu = 0): a_{r}^{*} = (e^{K} / K) cdot (-Ky)^{r} / r!.*
-- *At node 1 (and other isolated nodes with m = 1): a_{r}^{*} = K cdot (-Ky)^{r} / (r + 2)!.*
+- *At the origin (m = 0, nu = 0): a_{r}^{*} = (e^{K} / K) · (-Ky)^{r} / r!.*
+- *At node 1 (and other isolated nodes with m = 1): a_{r}^{*} = K · (-Ky)^{r} / (r + 2)!.*
- *At node 3 (handling signed half-gaps): a_{0}^{*} = (J/2) e^{-13 J/6} when J < ∞; more complex expression at other y.*
**Sketch.** At the origin, T_{k}(s) = e^{-k(s-1)} / k, and ∂ T_{k} / ∂ k = T_{k}(s)(1 - s - 1/k) > 0 for k ge 2.36 > 2 and s le 1/2. So replacing k by K lowers the target. The Taylor polynomial through degree 40 is exactly (e^{K}/K)(-Ky)^{r}/r!, giving case 1.
-At m = 1, the deleted quotient is mathcal D_calD_{1, 2} T_{k}(1 + u) = (e^{-ku} - 1 + ku)/(k u^{2}), with value k/2 at u = 0. The k-derivative is (1 - (1 + ku) e^{-ku})/(k^{2} u^{2}) ge 0 by e^{x} ge 1 + x, so replacing k by K again lowers the target. The Taylor coefficients are K(-Ky)^{r}/(r + 2)!, giving case 2.
+At m = 1, the deleted quotient is D_{1, 2} T_{k}(1 + u) = (e^{-ku} - 1 + ku)/(k u^{2}), with value k/2 at u = 0. The k-derivative is (1 - (1 + ku) e^{-ku})/(k^{2} u^{2}) ge 0 by e^{x} ge 1 + x, so replacing k by K again lowers the target. The Taylor coefficients are K(-Ky)^{r}/(r + 2)!, giving case 2.
The exact tail after degree 41 is bounded by < 10^{-6} using scalar estimates and K le 6 in every parameter box (including J = ∞). QED
@@ -1008,24 +989,24 @@ Phi_{i}(x; k) = sum_{r = 0}^{40} ( l_{i, r} q(k) + delta_{i} a_{r}^{*} ) x^{r}.
Its Bernstein coefficients are
L_{i, d} q(k) + delta_{i} sum_{r = 0}^{d} omega_{d, r} a_{r}^{*}.
-**Certification condition.** For every parameter box, every half-gap center m in mathcal N_calN_{0} cap [0, 88], both signed half-gaps at each positive center, and every d in {0, ..., 40}, one has
+**Certification condition.** For every parameter box, every half-gap center m in N_{0} cap [0, 88], both signed half-gaps at each positive center, and every d in {0, ..., 40}, one has
L_{i, d} q(k) + delta_{i} sum_{r = 0}^{d} omega_{d, r} a_{r}^{*} > 0.001.
Here q(k) is evaluated at the box lower bound [l]_{K, J} (Section 7.4).
This is a finite rational check: 37310 separate inequalities, one per combination of (parameter box, half-gap, signed direction, d). The verification script `verification/numeric_balls.py` runs them.
**Conclusion of bounded-range signs.** When the certification condition holds, the Bernstein polynomial is > 0.001 on [0, 1]. Apply the three small-error bounds:
-mathcal D_calD_{m, nu} F_{i, slack}(m + yx) > .001 - .00011 - .000001 - .000001 = .000888 > 0.
+D_{m, nu} F_{i, slack}(m + yx) > .001 - .00011 - .000001 - .000001 = .000888 > 0.
So F_{i, slack} > 0 on [0, 89.5] off nodes, and = 0 at nodes. Done for the bounded range.
### 7.7 The tail: quadratic barrier for the sine product
Beyond s_{0} = 89.5, the number of nodes is infinite, so finite-row Bernstein certification cannot work. Instead, the paper uses the following *barrier*.
-**Lemma (Quadratic barrier).** For every real s and every nearest point m in mathcal ZcalZ of the full periodic zero set (so lvert s - m rvert = min_{n in mathcal Z}calZ lvert s - n rvert),
+**Lemma (Quadratic barrier).** For every real s and every nearest point m in Z of the full periodic zero set (so lvert s - m rvert = min_{n in Z} lvert s - n rvert),
P(s) ge 0.68 (s - m)^{2}.
-**Sketch.** P is periodic with period 12, has double zeros at mathcal Z,calZ, and no other real zeros. So it suffices to check the inequality on half-gaps. At each half-gap midpoint the exact values are computable:
+**Sketch.** P is periodic with period 12, has double zeros at Z, and no other real zeros. So it suffices to check the inequality on half-gaps. At each half-gap midpoint the exact values are computable:
| gap mod 12 | P(s)/(s-m)^{2} at its midpoint |
|---|---|
@@ -1034,16 +1015,16 @@ P(s) ge 0.68 (s - m)^{2}.
| [4, 7], [9, 12] | (8)/(9)(3 + sqrt 2 + sqrt 3 + sqrt 6) > .68 |
| [7, 9] | 9 > .68 |
-Logarithmic concavity of s mapsto P(s)^{1/2}/(s - m) interpolates the endpoint values at nodes. QED
+Logarithmic concavity of s |-> P(s)^{1/2}/(s - m) interpolates the endpoint values at nodes. QED
### 7.8 The tail signs
For s ge s_{0}, split each H_{i}:
-R_{i, 0}(s) = C_{i} + sum_{n in mathcal N_calN_{0},; n le 88} ( frac{c_{in}}{(s - n)^{2}} + frac{d_{in}}{s - n} ),
+R_{i, 0}(s) = C_{i} + sum_{n in N_{0},; n le 88} ( frac{c_{in}}{(s - n)^{2}} + frac{d_{in}}{s - n} ),
p_{i}(s) = P(s) R_{i, 0}(s) + p_{i, high}(s),
where p_{i, high} collects nodes n > 88 only.
-**Step 1: rational part is positive.** Combine the intermediate values from Section 7.6 (with min(0, cdot) floors on the lower evaluations), together with the reference correction. One gets
+**Step 1: rational part is positive.** Combine the intermediate values from Section 7.6 (with min(0, ·) floors on the lower evaluations), together with the reference correction. One gets
sigma_{i} R_{i, 0}(s) > .002 (s ge s_{0}).
The denominators s - n and (s - n)^{2} for n le 88 and s ge 89.5 are all ge 1.5, so all reciprocals are le 1 in modulus.
@@ -1051,17 +1032,17 @@ The denominators s - n and (s - n)^{2} for n le 88 and s ge 89.5 are all ge 1.5,
Z_{i}(s) = sigma_{i} ( p_{i, high}(s) + K_{p_{3 - i}}(s) ) + delta_{i} T_{k}(s).
A four-term Taylor bound using the derivative estimates of Section 4.6 gives
sup_{s ge s_{0}} lvert Z_{i}''(s) rvert < .0002.
-The four terms are: direct high contribution (36pi^{2} cdot 2.4 cdot 10^{-7}), low-frequency transformed (3(3pi)^{2} cdot 36 cdot 5 cdot e^{-.70 s_{0}}), refined transformed (1.25(1.32pi)^{2}(2.54 cdot 5 / s_{0} + .04) e^{-.187 s_{0}}), and the target (2.36 e^{-2.36(s_{0} - 1)}).
+The four terms are: direct high contribution (36pi^{2} · 2.4 · 10^{-7}), low-frequency transformed (3(3pi)^{2} · 36 · 5 · e^{-.70 s_{0}}), refined transformed (1.25(1.32pi)^{2}(2.54 · 5 / s_{0} + .04) e^{-.187 s_{0}}), and the target (2.36 e^{-2.36(s_{0} - 1)}).
-**Step 3: Zed has exact double zeros at high nodes.** By the exact contacts, at every m in mathcal N,calN, m ge 91, the decomposition
+**Step 3: Zed has exact double zeros at high nodes.** By the exact contacts, at every m in N, m ge 91, the decomposition
F_{i, slack}(s) = sigma_{i} P(s) R_{i, 0}(s) + Z_{i}(s)
-has Z_{i}(m) = Z_{i}'(m) = 0 (the P cdot R_{i, 0} term vanishes to order 2 at m, so it must absorb all of F_{i, slack}'s jet there, but F_{i, slack} also vanishes to order 2 at m, so Z_{i} does too).
+has Z_{i}(m) = Z_{i}'(m) = 0 (the P · R_{i, 0} term vanishes to order 2 at m, so it must absorb all of F_{i, slack}'s jet there, but F_{i, slack} also vanishes to order 2 at m, so Z_{i} does too).
-**Step 4: Taylor remainder bound.** For s ge s_{0}, let m be the nearest point of mathcal ZcalZ with m ge 91 (always possible in the tail by a nearest-neighbor pairing). Taylor's integral formula gives
+**Step 4: Taylor remainder bound.** For s ge s_{0}, let m be the nearest point of Z with m ge 91 (always possible in the tail by a nearest-neighbor pairing). Taylor's integral formula gives
lvert Z_{i}(s) rvert le .0001 (s - m)^{2}.
**Step 5: sign.** Combine:
-sigma_{i} P(s) R_{i, 0}(s) ge .68 cdot .002, (s - m)^{2} = .00136 (s - m)^{2}.
+sigma_{i} P(s) R_{i, 0}(s) ge .68 · .002, (s - m)^{2} = .00136 (s - m)^{2}.
Since .00136 > .0001,
F_{i, slack}(s) ge .00136(s - m)^{2} - .0001(s - m)^{2} = .00126(s - m)^{2} > 0.
At a node, the exact zero gives F_{i, slack}(m) = 0 (by construction). Done.
@@ -1083,7 +1064,7 @@ The normalized pair gave us one specific function f(x) = e^{-pi h b lvert x rver
### 8.1 The density linear program
-**Proposition (density LP).** *Let f : mathbb R^bbR^{2} to mathbb RbbR be an integrable even Schwartz function with widehatwidehat ff ge 0 pointwise. For every locally finite configuration C of centered disk density one,*
+**Proposition (density LP).** *Let f : R^{2} to R be an integrable even Schwartz function with widehatwidehat ff ge 0 pointwise. For every locally finite configuration C of centered disk density one,*
liminf_{R to ∞} frac{1}{N_{R}} sum_{substack{x, y in C_{R} x ne y}} f(x - y) ge widehatwidehat f(0)f(0) - f(0).
*If also f le g pointwise for a function g : (0, ∞) to [0, ∞), then the same bound holds with g on the left:*
@@ -1094,7 +1075,7 @@ E_{g}(C) ge widehatwidehat f(0)f(0) - f(0).
*Notation.* Let mu_{R} = sum_{x in C_{R}} delta_{x} be the point measure, and nu_{R} be the area measure restricted to B_{(1 + ε)R}, of total area V_{R} = pi(1 + ε)^{2} R^{2}.
*Positivity.* widehatwidehat ff ge 0 implies the sesquilinear form Q_{f}(mu, nu) = iint f(x - y) dmu(x) dnu(y) is positive semi-definite. So Cauchy-Schwarz applies:
-Q_{f}(mu_{R}, mu_{R}) cdot Q_{f}(nu_{R}, nu_{R}) ge lvert Q_{f}(mu_{R}, nu_{R}) rvert^{2}.
+Q_{f}(mu_{R}, mu_{R}) · Q_{f}(nu_{R}, nu_{R}) ge lvert Q_{f}(mu_{R}, nu_{R}) rvert^{2}.
*Cross-term estimate.* For each x in C_{R}, int f(x - y) dv_{R}(y) equals int f plus an error bounded by int_{lvert z rvert ge ε R} lvert f rvert, because the disk of radius ε R around x is contained in B_{(1 + ε)R}. So
Q_{f}(mu_{R}, nu_{R}) = N_{R} (widehatwidehat f(0)f(0) + o(1))
@@ -1105,7 +1086,7 @@ as R to ∞, uniformly in C through the boundary behavior.
*Diagonal.* Q_{f}(mu_{R}, mu_{R}) = N_{R} f(0) + sum_{x ne y in C_{R}} f(x - y).
*Combining.*
-frac{Q_{f}(mu_{R}, mu_{R})}{N_{R}} ge frac{(N_{R} (widehatwidehat f(0)f(0) + o(1)))^{2}}{N_{R} cdot Q_{f}(nu_{R}, nu_{R})} = frac{N_{R}}{V_{R}} cdot frac{(widehatwidehat f(0)f(0) + o(1))^{2}}{widehatwidehat f(0)f(0) + o(1)}.
+frac{Q_{f}(mu_{R}, mu_{R})}{N_{R}} ge frac{(N_{R} (widehatwidehat f(0)f(0) + o(1)))^{2}}{N_{R} · Q_{f}(nu_{R}, nu_{R})} = frac{N_{R}}{V_{R}} · frac{(widehatwidehat f(0)f(0) + o(1))^{2}}{widehatwidehat f(0)f(0) + o(1)}.
N_{R}/V_{R} to (1 + ε)^{-2}. Taking liminf in R and then ε ↓ 0:
liminf_{R} frac{Q_{f}(mu_{R}, mu_{R})}{N_{R}} ge widehatwidehat f(0).f(0).
Subtracting f(0) gives the claimed bound on the off-diagonal sum. QED
@@ -1127,7 +1108,7 @@ f_{alpha}(a) = G_{alpha}(a) for every a in A ∖ {0}, widehatwidehat f_f_{alp
**Proof sketch for alpha ge alpha_{min}.** Let k = pi(alpha / b - h) (so k ge 2.36), let f be the function of Theorem 4.2, and set f_{alpha} = k e^{-k} f. This scales f by a positive factor, so widehatwidehat f_f_{alpha} ge 0 still. The pointwise bound: with s = b lvert x rvert^{2},
f_{alpha}(x) = k e^{-k} e^{-pi h s} H_{1}(s) le k e^{-k} e^{-pi h s} T_{k}(s) = e^{-(k + pi h) s} = e^{-pi alpha lvert x rvert^{2}} = G_{alpha}(x).
-The direct contacts come from the exact jets in Theorem 4.2, applied at every n in mathcal N,calN, which contains every nonzero shell of A. The dual contacts come from the same contacts applied at every n in mathcal N,calN, using that A^{*} = JA has the same shells as A (Section 1.1).
+The direct contacts come from the exact jets in Theorem 4.2, applied at every n in N, which contains every nonzero shell of A. The dual contacts come from the same contacts applied at every n in N, using that A^{*} = JA has the same shells as A (Section 1.1).
**Proof sketch for 0 < alpha < alpha_{min} (Fourier complementation).** Set beta = 1/alpha > 1/alpha_{min}. Let F_{beta} be the large-beta witness constructed above:
F_{beta} le G_{beta}, widehatwidehat F_F_{beta} ge 0, F_{beta}(a) = G_{beta}(a) ; (a ne 0), widehatwidehat F_F_{beta}(w) = 0 ; (w ne 0).
@@ -1159,7 +1140,7 @@ So f_{alpha} = G_{alpha} - widehatwidehat F_F_{beta} is the small-alpha witness.
The contacts are what make the LP bound *sharp*. Without contacts, the LP bound widehatwidehat f(0)f(0) - f(0) would be strictly less than the target lattice sum. With contacts at both A (direct) and A^{*} (dual), the LP bound equals the target.
-**Lemma (Poisson and lattice value).** *For any even Schwartz f : mathbb R^bbR^{2} to mathbb RbbR with widehatwidehat ff absolutely integrable (automatic on Schwartz functions),*
+**Lemma (Poisson and lattice value).** *For any even Schwartz f : R^{2} to R with widehatwidehat ff absolutely integrable (automatic on Schwartz functions),*
sum_{a in A} f(a) = sum_{w in A^{*}} widehatwidehat f(w).f(w).
**Consequence for f_{alpha}.** Write the sum splitting off the origin:
@@ -1171,7 +1152,7 @@ sum_{a ne 0} G_{alpha}(a) = widehatwidehat f_f_{alpha}(0) - f_{alpha}(0).
So the LP bound is exactly the lattice sum. QED
-The proof of the paper's Poisson summation lemma: the periodization p_{f}(x) = sum_{a in A} f(x + a) is well-defined and smooth by Schwartz decay. Its Fourier coefficients over the torus mathbb R^bbR^{2}/A are exactly widehatwidehat f(w)f(w) for w in A^{*}. Evaluating the Fourier series at x = 0 gives the identity.
+The proof of the paper's Poisson summation lemma: the periodization p_{f}(x) = sum_{a in A} f(x + a) is well-defined and smooth by Schwartz decay. Its Fourier coefficients over the torus R^{2}/A are exactly widehatwidehat f(w)f(w) for w in A^{*}. Evaluating the Fourier series at x = 0 gives the identity.
**Only the lattice is periodized.** No periodicity is assumed of the *competitor* C; the LP applies to arbitrary locally finite configurations. This is central to the significance of the result. Periodization is used only to establish the target (LHS vs RHS) identity, not to restrict the competitor.
@@ -1208,7 +1189,7 @@ None of these pieces is optional. The LP would give a lower bound without contac
## 9. From Gaussian to universal: positive mixtures
-We now reduce the general completely monotone kernel g to the Gaussian case, by representing g (or rather g(ε + cdot)) as a positive mixture of Gaussians. This is the classical Hausdorff-Bernstein-Widder theorem.
+We now reduce the general completely monotone kernel g to the Gaussian case, by representing g (or rather g(ε + ·)) as a positive mixture of Gaussians. This is the classical Hausdorff-Bernstein-Widder theorem.
### 9.1 The positive mixture representation
@@ -1222,7 +1203,7 @@ The intuition: each v^{t} = e^{t log v} is itself completely monotone, and the c
*Step 1: discrete moments.* Fix d > 0. Repeated integration by parts gives (-1)^{r} Delta^{r} F(j d) ge 0, where Delta is the forward difference operator. Define a linear functional Λ on polynomials by Λ(x^{j}) = F(j d); positivity gives Λ a representing measure eta_{d} on [0, 1] with eta_{d}([0, 1]) = F(0).
-*Step 2: refine to positive real exponents.* For l in ℕ, push eta_{d} forward by x mapsto x^{l} (with d = 1/l). The result rho_{l} has mass F(0) and int v^{j/l} drho_{l} = F(j/l) for j ge 0. Take a weakly convergent subsequence; the limit rho = lim_{n} rho_{l_{n}} exists by compactness.
+*Step 2: refine to positive real exponents.* For l in ℕ, push eta_{d} forward by x |-> x^{l} (with d = 1/l). The result rho_{l} has mass F(0) and int v^{j/l} drho_{l} = F(j/l) for j ge 0. Take a weakly convergent subsequence; the limit rho = lim_{n} rho_{l_{n}} exists by compactness.
*Step 3: continuity in the exponent.* For fixed t > 0, let t_{n} = lceil l_{n} t rceil / l_{n}. Then lvert v^{t_{n}} - v^{t} rvert le (t_{n} - t)/(e t) to 0 uniformly in v in [0, 1]. So continuity of F forces int v^{t} drho = F(t).
@@ -1249,28 +1230,28 @@ The shift is removed as ε ↓ 0, in the limit of the energy argument. This is c
Fix a kernel g : (0, ∞) to [0, ∞) that is smooth and completely monotone. For ε > 0, let rho_{ε} be the representing measure of F_{ε}(t) = g(ε + t), mass g(ε).
For a configuration C of centered disk density one, consider the shifted energy
-E_{g(ε + cdot)}(C) = liminf_{R} frac{1}{N_{R}} sum_{substack{x, y in C_{R} x ne y}} g(ε + lvert x - y rvert^{2}).
+E_{g(ε + ·)}(C) = liminf_{R} frac{1}{N_{R}} sum_{substack{x, y in C_{R} x ne y}} g(ε + lvert x - y rvert^{2}).
A subtlety: the shift moves lvert x - y rvert^{2} up by ε, which for a pair at distance zero would give ε > 0 instead of 0. But zero-distance pairs are excluded from the off-diagonal sum; the shift is only felt at pairs with lvert x - y rvert^{2} > 0. For pairs at distance at least delta > 0, the shifted energy is close to the unshifted one as ε to 0. But pairs closer than delta can have large differences; that is why the limit ε ↓ 0 must be taken *after* taking R to ∞ and the lower limit in liminf.
-**Key inequality (Fatou's lemma).** Write E_{g(ε + cdot)}(C) as an inner product against the positive mixture. Fatou's lemma makes the liminf of a positive mixture ge the mixture of liminfs:
-E_{g(ε + cdot)}(C) ge int_{0}^{1} E_{G_{alpha(v)}}(C), drho_{ε}(v)
+**Key inequality (Fatou's lemma).** Write E_{g(ε + ·)}(C) as an inner product against the positive mixture. Fatou's lemma makes the liminf of a positive mixture ge the mixture of liminfs:
+E_{g(ε + ·)}(C) ge int_{0}^{1} E_{G_{alpha(v)}}(C), drho_{ε}(v)
where alpha(v) = -log(v)/pi. The Gaussian case (Section 8) applies to each E_{G_{alpha}}, giving
E_{G_{alpha(v)}}(C) ge E_{G_{alpha(v)}}(A) = sum_{a ne 0} G_{alpha(v)}(lvert a rvert^{2}).
So
-E_{g(ε + cdot)}(C) ge int_{0}^{1} sum_{a ne 0} G_{alpha(v)}(lvert a rvert^{2}), drho_{ε}(v).
+E_{g(ε + ·)}(C) ge int_{0}^{1} sum_{a ne 0} G_{alpha(v)}(lvert a rvert^{2}), drho_{ε}(v).
Tonelli's theorem moves the sum out:
= sum_{a ne 0} int_{0}^{1} G_{alpha(v)}(lvert a rvert^{2}), drho_{ε}(v).
Recognizing the inner integral as F_{ε}(lvert a rvert^{2}) = g(ε + lvert a rvert^{2}):
-E_{g(ε + cdot)}(C) ge sum_{a ne 0} g(ε + lvert a rvert^{2}).
+E_{g(ε + ·)}(C) ge sum_{a ne 0} g(ε + lvert a rvert^{2}).
This is the shifted version of the main theorem.
### 9.4 Removing the shift
-As ε ↓ 0, the RHS sum_{a ne 0} g(ε + lvert a rvert^{2}) increases monotonically to sum_{a ne 0} g(lvert a rvert^{2}). The LHS E_{g(ε + cdot)}(C) requires care, but the paper proves that
-lim_{ε ↓ 0} E_{g(ε + cdot)}(C) = E_{g}(C)
+As ε ↓ 0, the RHS sum_{a ne 0} g(ε + lvert a rvert^{2}) increases monotonically to sum_{a ne 0} g(lvert a rvert^{2}). The LHS E_{g(ε + ·)}(C) requires care, but the paper proves that
+lim_{ε ↓ 0} E_{g(ε + ·)}(C) = E_{g}(C)
for every locally finite C of centered disk density one. The argument uses the singularity structure: for smooth completely monotone g, the singular behavior of g at zero is dominated by the ε ↓ 0 limit and can be controlled by the integral int_{0}^{1} v^{t} drho_{ε} against the pair density.
**Main Theorem (restated).** *Let g : (0, ∞) to [0, ∞) be smooth and completely monotone. For every locally finite configuration C of centered disk density one,*
@@ -1306,12 +1287,12 @@ Fix 0 le s < 2 once and for all. The interaction is g(x) = lvert x rvert^{-s} fo
kappa_{0} = 2pi, kappa_{s} = 4pi (0 < s < 2),
g_{0}(x) = -log lvert x rvert, g_{s}(x) = lvert x rvert^{-s}, q_{0} = 2pi, q_{s} = frac{2^{2-s}piGamma(1-s/2)}{Gamma(s/2)}.
-**The weighted extension.** The potential g_{s} in the plane lifts to a *weighted extension problem* in mathbb R^bbR^{3}:
+**The weighted extension.** The potential g_{s} in the plane lifts to a *weighted extension problem* in R^{3}:
w_{s}(y) = lvert y rvert^{gamma}, gamma = s - 1 for 0 < s < 2, gamma = 0 (so w_{0} = 1) at s = 0.
-Points (a, 0) in mathbb R^bbR^{2} times {0} are identified with their base-plane position a; the "charges" live on the plane y = 0.
+Points (a, 0) in R^{2} times {0} are identified with their base-plane position a; the "charges" live on the plane y = 0.
-**Admissible fields.** A field is a gradient E = nabla h in L^{p}_{loc}(mathbb R^bbR^{3}; mathbb R^bbR^{3}) for some p in (1, 2) (or more generally p in the range fixed at the start; see the paper), with w_{s} E in L^{1}_{loc}, satisfying the divergence equation
--div(w_{s} E) = kappa_{s} ( sum_{p in C} delta_{(p, 0)} - delta_{mathbb R^bbR^{2}} ).
+**Admissible fields.** A field is a gradient E = nabla h in L^{p}_{loc}(R^{3}; R^{3}) for some p in (1, 2) (or more generally p in the range fixed at the start; see the paper), with w_{s} E in L^{1}_{loc}, satisfying the divergence equation
+-div(w_{s} E) = kappa_{s} ( sum_{p in C} delta_{(p, 0)} - delta_{R^{2}} ).
Here the right side is the charge distribution: point charges at the particles, minus a uniform neutralizing background on the plane y = 0.
**Cutoff and truncated field.** For a self-energy cutoff eta > 0, define
@@ -1319,93 +1300,93 @@ f_{s, eta} = (g_{s} - g_{s}(eta))_{+}, E_{eta} = E - sum_{p in C} nabla f_{s, e
The function f_{s, eta} is the "capped fundamental solution": it equals g_{s} outside the cap and is constantly g_{s}(eta) inside. Subtracting it makes E_{eta} finite-energy (removes the singular part of E at each particle).
**Field energy.** For a centered square K_{R} = [-R/2, R/2]^{2}:
-mathcal W_calW_{s, eta}(E) = limsup_{R to ∞} [ frac{1}{R^{2}} int_{K_{R} times mathbb R^bbR^{k}} w_{s} lvert E_{eta} rvert^{2} - kappa_{s} g_{s}(eta) ].
+W_{s, eta}(E) = limsup_{R to ∞} [ frac{1}{R^{2}} int_{K_{R} times R^{k}} w_{s} lvert E_{eta} rvert^{2} - kappa_{s} g_{s}(eta) ].
A word about order of limits: for each fixed cutoff eta, we take R to ∞ first, then eta ↓ 0. The constant kappa_{s} g_{s}(eta) subtracts the self-energy of one particle (of a specific cutoff).
-mathcal W_calW_{s}(E) = lim_{eta ↓ 0} mathcal W_calW_{s, eta}(E), W_{s}(C) = inf_{E compatible} mathcal W_calW_{s}(E).
+W_{s}(E) = lim_{eta ↓ 0} W_{s, eta}(E), W_{s}(C) = inf_{E compatible} W_{s}(E).
### 10.2 The periodic field and the Green function
-Everything turns on the periodic picture. Fix a torus T = mathbb R^bbR^{2} / L of area N in ℕ (where N = lvert T rvert is an integer), and N distinct points a_{1}, ..., a_{N} in T.
+Everything turns on the periodic picture. Fix a torus T = R^{2} / L of area N in ℕ (where N = lvert T rvert is an integer), and N distinct points a_{1}, ..., a_{N} in T.
-**Canonical potential.** There is a mean-zero trace potential H on T times mathbb R^bbR^{k} satisfying
+**Canonical potential.** There is a mean-zero trace potential H on T times R^{k} satisfying
-div(w_{s} nabla H) = kappa_{s} ( sum_{i = 1}^{N} delta_{(a_{i}, 0)} - delta_{T} ).
-Here delta_{T} denotes the uniform area measure on the base T (the neutralizing background). The identity understood in the weak sense: test against gradients nabla varphi with varphi compactly supported.
+Here delta_{T} denotes the uniform area measure on the base T (the neutralizing background). The identity understood in the weak sense: test against gradients nabla phi with phi compactly supported.
**Periodic energy.** Define
-W_{s, L}(a_{1}, ..., a_{N}) = lim_{eta ↓ 0} [ (1)/(N) int_{T times mathbb R^bbR^{k}} w_{s} lvert nabla H_{eta} rvert^{2} - kappa_{s} g_{s}(eta) ],
+W_{s, L}(a_{1}, ..., a_{N}) = lim_{eta ↓ 0} [ (1)/(N) int_{T times R^{k}} w_{s} lvert nabla H_{eta} rvert^{2} - kappa_{s} g_{s}(eta) ],
with H_{eta} the truncated version of H (subtracting f_{s, eta} at each particle).
-**Green function representation.** Let mathcal G_calG_{L} be the mean-zero unit-source extension Green function:
--div(w_{s} nabla mathcal G_calG_{L}) = delta_{(0, 0)} - N^{-1} delta_{T}.
+**Green function representation.** Let G_{L} be the mean-zero unit-source extension Green function:
+-div(w_{s} nabla G_{L}) = delta_{(0, 0)} - N^{-1} delta_{T}.
Integration by parts gives the explicit formula
-W_{s, L} = kappa_{s}^{2} [ (1)/(N) sum_{i ne j} mathcal G_calG_{L}(a_{i} - a_{j}, 0) + lim_{x to 0} ( mathcal G_calG_{L}(x, 0) - frac{g_{s}(x)}{kappa_{s}} ) ].
+W_{s, L} = kappa_{s}^{2} [ (1)/(N) sum_{i ne j} G_{L}(a_{i} - a_{j}, 0) + lim_{x to 0} ( G_{L}(x, 0) - frac{g_{s}(x)}{kappa_{s}} ) ].
The first sum is off-diagonal (all pairs of distinct particles); the second is a limit that removes the diagonal singularity from the Green function's own self-contribution.
-This follows the integration-by-parts argument of Petrache and Serfaty (2017, Proposition 1.5). In the log case (s = 0), mathcal G_calG_{L} reduces to the ordinary 2D torus Green function.
+This follows the integration-by-parts argument of Petrache and Serfaty (2017, Proposition 1.5). In the log case (s = 0), G_{L} reduces to the ordinary 2D torus Green function.
-**Comparison across period lattices.** A key issue for the corollary is: two periodic configurations mathcal CcalC and mathcal DcalD may not share a lattice, so their tori may have different sizes. The next lemma gives a comparison identity that works across arbitrary period lattices.
+**Comparison across period lattices.** A key issue for the corollary is: two periodic configurations C and D may not share a lattice, so their tori may have different sizes. The next lemma gives a comparison identity that works across arbitrary period lattices.
### 10.3 Heat-kernel comparison
-Define Psi_{t}(x) = (4pi t)^{-1} e^{-lvert x rvert^{2}/(4t)}, the two-dimensional heat kernel. For a periodic configuration mathcal CcalC = ∪_{i} (a_{i} + L) with N = lvert T rvert classes per unit cell, set
-P_{t, L}(x) = sum_{v in L} Psi_{t}(x - v), H_{mathcal C}calC(t) = (1)/(N) sum_{i, j = 1}^{N} P_{t, L}(a_{i} - a_{j}) - Psi_{t}(0).
+Define Psi_{t}(x) = (4pi t)^{-1} e^{-lvert x rvert^{2}/(4t)}, the two-dimensional heat kernel. For a periodic configuration C = ∪_{i} (a_{i} + L) with N = lvert T rvert classes per unit cell, set
+P_{t, L}(x) = sum_{v in L} Psi_{t}(x - v), H_{C} = (1)/(N) sum_{i, j = 1}^{N} P_{t, L}(a_{i} - a_{j}) - Psi_{t}(0).
-P_{t, L} is the heat-kernel Green function on T; H_{mathcal C}calC(t) is (up to constants) the "self-energy at heat time t."
+P_{t, L} is the heat-kernel Green function on T; H_{C} is (up to constants) the "self-energy at heat time t."
-**Lemma (Heat comparison across period lattices).** *Let 0 le s < 2, and let mathcal CcalC and mathcal DcalD be simple periodic configurations of density one. Then*
-V_{s}(mathcal C)calC) - V_{s}(mathcal D)calD) = frac{kappa_{s} q_{s}}{Gamma(1 - s/2)} int_{0}^{∞} ( H_{mathcal C}calC(t) - H_{mathcal D}calD(t) ) t^{-s/2}, dt,
-*where V_{s}(mathcal C)calC) = W_{s, L}(a_{1}, ..., a_{N}) is the canonical periodic value of mathcal C,calC, and similarly for mathcal D.*calD.*
+**Lemma (Heat comparison across period lattices).** *Let 0 le s < 2, and let C and D be simple periodic configurations of density one. Then*
+V_{s}(C) - V_{s}(D) = frac{kappa_{s} q_{s}}{Gamma(1 - s/2)} int_{0}^{∞} ( H_{C} - H_{D} ) t^{-s/2}, dt,
+*where V_{s}(C) = W_{s, L}(a_{1}, ..., a_{N}) is the canonical periodic value of C, and similarly for D.*calD.*
**Proof sketch.** The heat representation of the Green function on any flat torus is
-mathcal G_calG_{L}(x) = (1)/(Gamma(alpha)) int_{0}^{∞} ( P_{t, L}(x) - (1)/(N) ) t^{alpha - 1}, dt,
+G_{L}(x) = (1)/(Gamma(alpha)) int_{0}^{∞} ( P_{t, L}(x) - (1)/(N) ) t^{alpha - 1}, dt,
where alpha = 1 - s/2 for 0 < s < 2.
-This is a spectral identity on the torus T; it applies to any flat torus. The individual H_{mathcal C}calC(t) are uniformly bounded: near t = 0 by Ct^{-1} e^{-c/t} (from the Gaussian decay of Psi_{t} at nonzero image displacements), and near t = ∞ by Ce^{-lambda t} where lambda is the spectral gap of the torus Laplacian.
+This is a spectral identity on the torus T; it applies to any flat torus. The individual H_{C} are uniformly bounded: near t = 0 by Ct^{-1} e^{-c/t} (from the Gaussian decay of Psi_{t} at nonzero image displacements), and near t = ∞ by Ce^{-lambda t} where lambda is the spectral gap of the torus Laplacian.
-So the difference H_{mathcal C}calC - H_{mathcal D}calD is absolutely integrable against t^{-s/2} on (0, ∞), and the identity holds. QED
+So the difference H_{C} - H_{D} is absolutely integrable against t^{-s/2} on (0, ∞), and the identity holds. QED
-**Why the comparison is useful.** The key point: H_{mathcal C}calC(t) is directly comparable to Gaussian energies! Setting g_{t}(u) = e^{-u/(4t)} at heat time t, one has
-H_{mathcal C}calC(t) = (1)/(4 pi t) E_{g_{t}}(mathcal C).calC).
-So the Gaussian energy comparison (Section 8) applies: H_{mathcal C}calC(t) ge H_{A}(t) for every t > 0 and every periodic mathcal CcalC of density one. Apply the lemma:
+**Why the comparison is useful.** The key point: H_{C} is directly comparable to Gaussian energies! Setting g_{t}(u) = e^{-u/(4t)} at heat time t, one has
+H_{C} = (1)/(4 pi t) E_{g_{t}}(C).
+So the Gaussian energy comparison (Section 8) applies: H_{C} ge H_{A}(t) for every t > 0 and every periodic C of density one. Apply the lemma:
-V_{s}(mathcal C)calC) ge V_{s}(A), for every periodic mathcal CcalC of density one.
+V_{s}(C) ge V_{s}(A), for every periodic C of density one.
This is the periodic version of Corollary 2.3(i).
### 10.4 The infinite-system comparison
-For a *nonperiodic* configuration mathcal CcalC of density one, the periodic heat comparison does not directly apply: there is no period lattice. The paper extends the comparison via a *cubic approximation*: replace mathcal CcalC by a square-periodic configuration on large cubes, prove the comparison there, and let the cube grow.
+For a *nonperiodic* configuration C of density one, the periodic heat comparison does not directly apply: there is no period lattice. The paper extends the comparison via a *cubic approximation*: replace C by a square-periodic configuration on large cubes, prove the comparison there, and let the cube grow.
-**Sketch.** Fix a large cube Λ_{R} = [-R, R]^{2}. Let T_{R} = mathbb R^bbR^{2} / (2R mathbb Z)^bbZ)^{2} be the torus of area (2R)^{2}. Replace mathcal CcalC by the periodic configuration mathcal C_calC_{R} obtained by wrapping points into the torus. This introduces boundary errors of size O(R) (from points near ∂ Λ_{R}), but these vanish relative to R^{2} in the field-energy normalization.
+**Sketch.** Fix a large cube Λ_{R} = [-R, R]^{2}. Let T_{R} = R^{2} / (2R Z)^{2} be the torus of area (2R)^{2}. Replace C by the periodic configuration C_{R} obtained by wrapping points into the torus. This introduces boundary errors of size O(R) (from points near ∂ Λ_{R}), but these vanish relative to R^{2} in the field-energy normalization.
-For each R, the periodic comparison gives V_{s}(mathcal C_calC_{R}) ge V_{s}(A). Take R to ∞: on the left side, V_{s}(mathcal C_calC_{R}) to mathcal W_calW_{s}(E_{mathcal C}calC) for a canonical field E_{mathcal C}calC obtained from the periodic canonical potentials H_{R} by a limit. On the right side, V_{s}(A/R mathbb Z)bbZ) to W_{s}(A) trivially (the lattice repeats).
+For each R, the periodic comparison gives V_{s}(C_{R}) ge V_{s}(A). Take R to ∞: on the left side, V_{s}(C_{R}) to W_{s}(E_{C} for a canonical field E_{C} obtained from the periodic canonical potentials H_{R} by a limit. On the right side, V_{s}(A/R Z) to W_{s}(A) trivially (the lattice repeats).
-Combining: mathcal W_calW_{s}(E_{mathcal C}calC) ge W_{s}(A). Infimizing over E_{mathcal C}calC yields
-W_{s}(mathcal C)calC) ge W_{s}(A).
+Combining: W_{s}(E_{C} ge W_{s}(A). Infimizing over E_{C} yields
+W_{s}(C) ge W_{s}(A).
-**Screening.** The field-energy lower bound ignores the possibility that mathcal CcalC has "screening" structure: negative charge redistributions on the field side that improve the energy. The paper handles this by *screening*: construct a sequence of fields E_{j} compatible with a density-one configuration C_{j} whose renormalized energies approach W_{s}(A) from above.
+**Screening.** The field-energy lower bound ignores the possibility that C has "screening" structure: negative charge redistributions on the field side that improve the energy. The paper handles this by *screening*: construct a sequence of fields E_{j} compatible with a density-one configuration C_{j} whose renormalized energies approach W_{s}(A) from above.
-The mechanism: take the canonical field E_{mathcal C}calC from the periodic limit, and modify it in shells of thickness ε R around each particle and near the cube boundary, to correct for the "screening defect"
-V_{s}(mathcal C)calC) - mathcal W_calW_{eta}(E^{can}_{mathcal C}calC) = (kappa)/(lvert T rvert) sum_{p in T} sum_{q ne p} q_{eta}(p - q) - 2kappa F_{eta}, F_{eta} = int_{mathbb R^bbR^{2}} f_{eta}(x, 0), dx.
+The mechanism: take the canonical field E_{C} from the periodic limit, and modify it in shells of thickness ε R around each particle and near the cube boundary, to correct for the "screening defect"
+V_{s}(C) - W_{eta}(E^{can}_{C} = (kappa)/(lvert T rvert) sum_{p in T} sum_{q ne p} q_{eta}(p - q) - 2kappa F_{eta}, F_{eta} = int_{R^{2}} f_{eta}(x, 0), dx.
-The defect is nonnegative (stationarity), and vanishes as eta ↓ 0 for minimizers of mathcal W.calW. Screening provides an explicit approximating field whose energy is V_{s}(mathcal C)calC) up to o(1).
+The defect is nonnegative (stationarity), and vanishes as eta ↓ 0 for minimizers of W. Screening provides an explicit approximating field whose energy is V_{s}(C) up to o(1).
**Corollary (from Section 10.4).** *Under these definitions,*
-W_{s}(A) = inf_{mathcal CcalC density one} W_{s}(mathcal C),calC),
+W_{s}(A) = inf_{C density one} W_{s}(C),
*attained at the triangular lattice A.*
The full argument for screening (Petrache-Serfaty 2017, Section 6) is technical: it constructs local correction fields in each shell, uses weighted trace and Poincaré inequalities, and proves that the sum of shell contributions is o(R^{2}) in the field-energy normalization. The paper writes out the construction in full.
### 10.5 The periodic torus inequality
-**Corollary (Torus inequality).** *For every integer n ge 1, and every configuration of n^{2} distinct points in mathbb R^bbR^{2}/(nA),*
+**Corollary (Torus inequality).** *For every integer n ge 1, and every configuration of n^{2} distinct points in R^{2}/(nA),*
V_{s}(a_{1}, ..., a_{n^{2}}) ge V_{s}(a_{1}^{△}, ..., a_{n^{2}}^{△}),
*where a_{i}^{△} are the n^{2} classes of A/(nA) in the torus.*
-**Proof.** Apply the heat comparison lemma (Section 10.3) with mathcal DcalD = A and mathcal CcalC the given torus configuration embedded periodically. The heat-kernel identity gives
-V_{s}(mathcal C)calC) - V_{s}(A) = frac{kappa_{s} q_{s}}{Gamma(1 - s/2)} int_{0}^{∞} (H_{mathcal C}calC(t) - H_{A}(t)) t^{-s/2}, dt.
-The Gaussian energy comparison (Section 8) gives H_{mathcal C}calC(t) ge H_{A}(t) for every t > 0, so the integral is ge 0. QED
+**Proof.** Apply the heat comparison lemma (Section 10.3) with D = A and C the given torus configuration embedded periodically. The heat-kernel identity gives
+V_{s}(C) - V_{s}(A) = frac{kappa_{s} q_{s}}{Gamma(1 - s/2)} int_{0}^{∞} (H_{C} - H_{A}(t)) t^{-s/2}, dt.
+The Gaussian energy comparison (Section 8) gives H_{C} ge H_{A}(t) for every t > 0, so the integral is ge 0. QED
Note: repeating the argument with nA instead of A (and H_{A} unchanged because A is nA-periodic) shows that the inequality holds on the nA torus as well. So the triangular lattice minimizes W_{s} on every larger torus, not just the unit torus.
@@ -1426,7 +1407,7 @@ The proof has three parts.
**Part 1: Periodic comparison.** For each N, minimize J over N points in K_{√(N)}. Confinement: points near the boundary can be moved inward without increasing the energy, because the fundamental solution g_{s} is monotone (attractive / monotone-positive). So the minimum is attained in a compact region and is finite.
-**Part 2: Limit exists.** Using the periodic comparison V_{s} ge V_{s}(A) on the nA torus, one bounds the min-energy from below by N cdot W_{s}(A) / kappa_{s} - o(N). Using the periodic comparison plus a "widely spaced" approximation, one bounds it from above by the same thing. So the limit exists and equals W_{s}(A)/kappa_{s}.
+**Part 2: Limit exists.** Using the periodic comparison V_{s} ge V_{s}(A) on the nA torus, one bounds the min-energy from below by N · W_{s}(A) / kappa_{s} - o(N). Using the periodic comparison plus a "widely spaced" approximation, one bounds it from above by the same thing. So the limit exists and equals W_{s}(A)/kappa_{s}.
**Part 3: Identification.** The classical thermodynamic results of Lewin-Lieb-Seiringer (2019, Section VI, Theorem 2) and Lauritsen (2021, Theorem II.1) supply the necessary existence and equality statements for the thermodynamic limit of the jellium. Combined with the periodic comparison, they identify the limit as W_{s}(A)/kappa_{s}.
@@ -1446,24 +1427,24 @@ Each of these moves is standard in the crystallization literature; the paper's n
The "screening" move of Section 10.4 is a field-theoretic construction that must be fully specified in any complete proof. Here is the shape of the argument; the paper's Section ~6 gives the full details.
-Fix the cutoff eta and a compatible field E_eta with mathcal W_calW_eta(E_eta) le m + delta (where m = W_s(A)). The target is: replace E_eta by a screened field widehatwidehat E_E_eta compatible with a *new* configuration with the same background and with energy no larger (up to o(R^2)).
+Fix the cutoff eta and a compatible field E_eta with W_ le m + delta (where m = W_s(A)). The target is: replace E_eta by a screened field widehatwidehat E_E_eta compatible with a *new* configuration with the same background and with energy no larger (up to o(R^2)).
-The construction splits the ambient space mathbb R^bbR^{2+k} into five regions.
+The construction splits the ambient space R^{2+k} into five regions.
*Inner region.* D_0 = K'_R times [-ell, ell]^k, where K'_R is a concentric square inside K_R, its faces at distance ε R from the outer boundary. Inside D_0, the old field E_eta is retained.
*Cap regions* (only k = 1). Above D_0: K_R times (ell, R); below: K_R times (-R, -ell).
-*Shell region.* The lateral sides of the shell between K'_R and K_R, subdivided into rectangular cells H_i ordered so each has area |H_i| in [1/m_i, 1] for integer-labeled m_i. On H_i, integer n_i = lfloor m_i |H_i| rfloor particles are placed.
+*Shell region.* The lateral sides of the shell between K'_R and K_R, subdivided into rectangular cells H_i ordered so each has area |H_i| in [1/m_i, 1] for integer-labeled m_i. On H_i, integer n_i = floor( m_i |H_i| ) particles are placed.
*Outside shell.* Subdivided further into auxiliary "rooted tree" cells, each of side a fixed small width b, so that eta-balls around retained centers distribute across these cells in a tree structure.
**The five component fields.**
- E_cross: completes the retained smeared charges across the inner boundary. On each auxiliary tree, the assigned outward flux through the face leading to the root is -kappa times the tree's charge mass. This makes the cell problems locally compatible.
-- E_vert: a harmonic vertical correction h_2(y) = (ell^gamma)/(1-gamma) C^{pm} |y|^{1-gamma} in the caps, with source -ell^gamma (C^+ + C^-) delta_{mathbb R^2}bbR^2.
-- E_side: on each shell cell H_i, a constant-outward-flux solution with source kappa(m_i - 1) + ell^gamma(C^+ + C^-) and datum -E_eta cdot nu_0 + j on the inner face. The kappa(m_i - 1) corrects for the "missing" background of the shell-cell.
-- E_round: a rounding correction with source kappa sum_i delta_i |H_i|^{-1} delta_{mathbb R^2}bbR^2 where delta_i = n_i - m_i |H_i| (the rounding error at each cell). Its sum delta_i = 0, so it vanishes as a global source.
+- E_vert: a harmonic vertical correction h_2(y) = (ell^gamma)/(1-gamma) C^{pm} |y|^{1-gamma} in the caps, with source -ell^gamma (C^+ + C^-) delta_{R^2}
+- E_side: on each shell cell H_i, a constant-outward-flux solution with source kappa(m_i - 1) + ell^gamma(C^+ + C^-) and datum -E_eta · nu_0 + j on the inner face. The kappa(m_i - 1) corrects for the "missing" background of the shell-cell.
+- E_round: a rounding correction with source kappa sum_i delta_i |H_i|^{-1} delta_{R^2} where delta_i = n_i - m_i |H_i| (the rounding error at each cell). Its sum delta_i = 0, so it vanishes as a global source.
- E_new: the contributions of the N_new new particles placed at the barycenters of the n_i-decomposed rectangles, each with the truncated fundamental solution field around it.
Each component has an energy bound of the form
@@ -1478,7 +1459,7 @@ Here M_{R,eta} = R^{-2} Q_eta(E,R) is the truncated field energy per unit area.
R^{-2} int w |widehatwidehat E_E_eta|^2 le M_{R,eta} + C_{s,eta'} ε(1 + g(eta))(1 + M_{R,eta} + M_{R,eta'}) + o_R(1).
-The right side can be made as close to M_{R,eta} as desired (by choosing ε small), and then M_{R,eta} is itself close to m + delta by assumption. Letting eta, delta tend to zero gives mathcal W_s(calW_s(widehatwidehat E)E) = m.
+The right side can be made as close to M_{R,eta} as desired (by choosing ε small), and then M_{R,eta} is itself close to m + delta by assumption. Letting eta, delta tend to zero gives W_s( E)E) = m.
### 10.9 The two-cutoff defect
@@ -1493,11 +1474,11 @@ D_{alpha,eta} := a_alpha - a_eta + 2kappa (F_eta - F_alpha) ge 0,
where
-- a_eta is the "mean truncated energy" at cutoff eta, morally mathbb E_P[|E_bbE_P[|E_eta|^2 dmathbb R^2];bbR^2];
-- F_eta = int_{mathbb R^2}bbR^2 f_eta(x, 0), dx is the self-energy of one charged particle at cutoff eta;
-- D_{alpha,eta} counts the energy of the ordered pairs of truncated kernels q_eta(p - q) for p neq q.
+- a_eta is the "mean truncated energy" at cutoff eta, morally E_P[|E_bbE_P[|E_eta|^2 dR^2];bbR^2];
+- F_eta = int_{R^2} f_eta(x, 0), dx is the self-energy of one charged particle at cutoff eta;
+- D_{alpha,eta} counts the energy of the ordered pairs of truncated kernels q_eta(p - q) for p != q.
-**Collision detection.** Suppose a coincident pair exists at some location, in some configuration contributing to the ergodic average with positive probability. Let c_coll = mathbb E_PbbE_P sum_{p} N_p(N_p - 1) count the coincidence intensity (number of colliding pairs per unit area, in expectation). Then the coincident-pair part of D_{alpha,eta} is kappa[g_s(alpha) - g_s(eta)] c_coll. Since g_s(alpha) to ∞ as alpha ↓ 0 for 0 < s < 2, and the right side of D_{alpha,eta} ge 0 stays bounded as alpha ↓ 0 (with only eta fixed), one gets c_coll = 0.
+**Collision detection.** Suppose a coincident pair exists at some location, in some configuration contributing to the ergodic average with positive probability. Let c_coll = E_P sum_{p} N_p(N_p - 1) count the coincidence intensity (number of colliding pairs per unit area, in expectation). Then the coincident-pair part of D_{alpha,eta} is kappa[g_s(alpha) - g_s(eta)] c_coll. Since g_s(alpha) to ∞ as alpha ↓ 0 for 0 < s < 2, and the right side of D_{alpha,eta} ge 0 stays bounded as alpha ↓ 0 (with only eta fixed), one gets c_coll = 0.
**Simplicity.** So the minimizer is *simple*: no two particles coincide. This is exactly the property one wants to reason about point sets, not "clouds of charges at shared locations."
@@ -1526,10 +1507,10 @@ Taking N = 65 gives two explicit rational inequalities that enclose pi within p_
**Proof sketch for b.** b = √(3)/2 iff b^{2} = 3/4. Squaring the rational endpoints gives the pair of rational comparisons b_{*}^{2} < 3/4 < (b_{*} + ε)^{2}. QED
For the Gaussian duality threshold k ge 2.36, a shorter rational chain suffices:
-pi(2/√(3) - 2/5) > (157)/(50) cdot (1025838)/(1732500) = (1025838)/(433250) > (59)/(25) = 2.36.
+pi(2/√(3) - 2/5) > (157)/(50) · (1025838)/(1732500) = (1025838)/(433250) > (59)/(25) = 2.36.
**Exponential enclosure.** For rational a ge 0 and integer q ge 0, let P_{q}(a) = sum_{j=0}^{q} a^{j}/j!. If a > 0 and q + 2 > a, then
-P_{q}(a) < e^{a} < P_{q}(a) + frac{a^{q+1}}{(q+1)!} cdot (1)/(1 - a/(q+2)).
+P_{q}(a) < e^{a} < P_{q}(a) + frac{a^{q+1}}{(q+1)!} · (1)/(1 - a/(q+2)).
This is used with q = 2000 for scalar comparisons and with a = 1, q = 6 for e < 2719/1000.
### 11.2 The scalar error budgets
@@ -1538,17 +1519,17 @@ Eleven strict inequalities are the "arithmetic backbone" of the sign and correct
| Bound | Value |
|---|---|
-| U_{168}(5, .02) + 10^{-170} | < 8.3 cdot 10^{-14} |
-| U_{91}(5, .02) + 10^{-89} | < 2.4 cdot 10^{-7} |
-| Target tail c_{jet} e^{-2.36 cdot 168}/(1 - e^{-2.36}) | < 10^{-170} |
-| Target tail c_{jet} e^{-2.36 cdot 90}/(1 - e^{-2.36}) | < 10^{-89} |
-| Half-gap Taylor tails mathcal R(m,calR(m, Y, nu) at four tuples | < 10^{-8} each |
+| U_{168}(5, .02) + 10^{-170} | < 8.3 · 10^{-14} |
+| U_{91}(5, .02) + 10^{-89} | < 2.4 · 10^{-7} |
+| Target tail c_{jet} e^{-2.36 · 168}/(1 - e^{-2.36}) | < 10^{-170} |
+| Target tail c_{jet} e^{-2.36 · 90}/(1 - e^{-2.36}) | < 10^{-89} |
+| Half-gap Taylor tails R(m, Y, nu) at four tuples | < 10^{-8} each |
| Target-support Taylor tails (two cases) | < 10^{-6} each |
| Second-derivative sup_{s ge s_{0}} lvert Z_{i}''(s) rvert | < .0002 |
| Product endpoint 12 - 8√(2) | > .68 |
| Bernstein margin .001 - .00011 - .000001 - .000001 | = .000888 > 0 |
-| Low-node rational margin .0021 - 2 cdot 10^{-8} | > .002 |
-| Tail-barrier product .68 cdot .002 | > .0001 |
+| Low-node rational margin .0021 - 2 · 10^{-8} | > .002 |
+| Tail-barrier product .68 · .002 | > .0001 |
Each of these is proved by a chain of rational inequalities, with pi and √(3) replaced by the rational enclosures p_{*}, b_{*} and, where needed, by 157/50 < pi < 22/7 and √(3) < 1733/1000.
@@ -1558,7 +1539,7 @@ The paper also supplies a completely automatic rational procedure for verifying
**Prescription (Appendix B, in brief).**
-- `R(x)` = ε cdot lfloor x/ε rfloor, computed separately on real and imaginary parts.
+- `R(x)` = ε · floor( x/ε ), computed separately on real and imaginary parts.
- `e_star(w)` computes e^{w} via 12 squarings of the Taylor polynomial at w/4096, with `R(x)` applied at every arithmetic step.
- `W` (2311 × 171): mass matrix, exact rational + `R` floors. Computed once.
- `Ssharp`, `Ysharp`: 168 × 171 and 168 × 10, from `W` and jet projection, with `R` floors.
@@ -1568,7 +1549,7 @@ The paper also supplies a completely automatic rational procedure for verifying
The row-comparison procedure for signs (Section 7.6) becomes:
-- For each parameter box, each half-gap center m in mathcal N_calN_{0} cap [0, 88], both signed half-gaps at m > 0, both lists i = 1, 2, and d in {0, ..., 40}:
+- For each parameter box, each half-gap center m in N_{0} cap [0, 88], both signed half-gaps at m > 0, both lists i = 1, 2, and d in {0, ..., 40}:
- Compute `L_{i, d}` as a rational row-vector `lsum = sum_{r=0}^d w_dr l_r` with w_{dr} = binom{d}{r}/binom{40}{r}, then evaluate `lsum` at the containing-box lower bound `[l]_{K, J}`.
- Compute `tsum` (target support) and add.
- Test `value > .001`.
@@ -1585,7 +1566,7 @@ Similarly, the tail-region check (Section 7.8) becomes: for each parameter box,
- Partial-sum error v_{9}: < 10^{-34}.
- Column error (X1, X2 assembled): < 10^{-29}.
- Bernstein row entry error: < 10^{-16}.
-- Lower-evaluation error: < 10^{-6} (94 terms × 2 cdot 10^{-28}).
+- Lower-evaluation error: < 10^{-6} (94 terms × 2 · 10^{-28}).
Combined budget: the floor-rounded verification, if it passes, transfers to the looser exact-array bounds with margin. For example, .00216 - 10^{-6} > .0021 and .00116 - 10^{-6} > .001.
@@ -1602,7 +1583,7 @@ Both check every strict comparison in every table. If all pass, the finite const
### 11.5 What certification actually proves
-The certifier checks finitely many strict comparisons. Combined with Sections 5.2 (quadrature error < 10^{-31}), 4.6 (tail bound U_{r}), and 6.3 (operator bounds), this recovers the exact infinite-frequency statement of Proposition 6.1 with the 2 cdot 10^{-8} correction bound.
+The certifier checks finitely many strict comparisons. Combined with Sections 5.2 (quadrature error < 10^{-31}), 4.6 (tail bound U_{r}), and 6.3 (operator bounds), this recovers the exact infinite-frequency statement of Proposition 6.1 with the 2 · 10^{-8} correction bound.
The four error sources in moving from finite to exact:
@@ -1610,10 +1591,10 @@ The four error sources in moving from finite to exact:
|---|---|
| Quadrature → exact spectral | 10^{-31} |
| Power-sum truncation D^{512} | < 10^{-24} |
-| Omitted finite nodes (target T_{k} loss) | < 8 cdot 10^{-12} |
-| Tail (nodes n > 168) | < 8.3 cdot 10^{-14} |
+| Omitted finite nodes (target T_{k} loss) | < 8 · 10^{-12} |
+| Tail (nodes n > 168) | < 8.3 · 10^{-14} |
-The largest is 8 cdot 10^{-12}; multiplied through the Schur complement (lVert mathcal Q^calQ^{-1} rVert approx 1), the finite solution extends to the exact infinite solution with correction lVert ell - ell^{ref} rVert < 2 cdot 10^{-8}.
+The largest is 8 · 10^{-12}; multiplied through the Schur complement (lVert Q^{-1} rVert approx 1), the finite solution extends to the exact infinite solution with correction lVert ell - ell^{ref} rVert < 2 · 10^{-8}.
---
@@ -1621,10 +1602,10 @@ The largest is 8 cdot 10^{-12}; multiplied through the Schur complement (lVert m
The specific values 168, 384, 89.5, and the constants in the tables are not chosen by magic; each is a threshold at which a rational tail estimate crosses a strict bound. The pattern is:
-- M = 168: the point where U_{168} (tail error at node 168) crosses 8.3 cdot 10^{-14} for the reference list size used. Any larger M works too; 168 is a convenient round choice.
+- M = 168: the point where U_{168} (tail error at node 168) crosses 8.3 · 10^{-14} for the reference list size used. Any larger M works too; 168 is a convenient round choice.
- N = 384 = 168 + 216: the Fejér quadrature order at which e^{.083 pi M} < 10^{83} (the Cauchy-derivative bound). Roughly half of M; not tight.
-- s_{0} = 89.5: the smallest s where the "low-node" vs "high-node" cutoff is consistent with the reference-list bound w < 5. Determined by maximizing the test ratio mu cdot lambda / sup lvert Z_{i}'' rvert > 1 on the interval.
-- Correction 2 cdot 10^{-8}: the sum of the finite-correction bound 1.37 cdot 10^{-8} (Section 6.7) and the tail-correction bound 8.31 cdot 10^{-14}, rounded up.
+- s_{0} = 89.5: the smallest s where the "low-node" vs "high-node" cutoff is consistent with the reference-list bound w < 5. Determined by maximizing the test ratio mu · lambda / sup lvert Z_{i}'' rvert > 1 on the interval.
+- Correction 2 · 10^{-8}: the sum of the finite-correction bound 1.37 · 10^{-8} (Section 6.7) and the tail-correction bound 8.31 · 10^{-14}, rounded up.
Every choice is a matter of tradeoff between the analytic simplicity of the bound and the numerical tightness of the tables. None is sharp.
@@ -1646,7 +1627,7 @@ For ease of reference, every numerical hypothesis invoked anywhere in the paper:
6. The E_{1}, E_{2} specific values from Section 5.5 (extras).
7. k ge 2.36 throughout the construction (from the Gaussian duality threshold).
8. Reference list size lVert X_{1} q rVert + lVert X_{2} q rVert < 4.8.
-9. Exact list correction bound lVert ell - ell^{ref} rVert < 2 cdot 10^{-8}.
+9. Exact list correction bound lVert ell - ell^{ref} rVert < 2 · 10^{-8}.
10. Extras constant bound < .02.
11. s_{0} = 89.5.