{"id":"09a76375-0db4-47d2-b2ed-a84e4e77db41","arxiv_id":"2502.07448","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"For the double exponential weight, the squared orthogonal-polynomial coefficients weighted by log-squared degree are controlled by a weighted Sobolev energy, and this rate is sharp.","lead":"This paper proves a sharp bound on how quickly smooth functions can be approximated by polynomials when the error is measured with the double exponential (Laplace) weight. The bound is logarithmic and cannot be improved, and it carries over to products of such weights in higher dimensions.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The reduction from the double-exponential measure μ1 to the hyperbolic-secant weight ν is invalid as written: μ1 and ν are not comparable, so Lemma 5 and Eq. (8) cannot transfer the theorem.","rationale":"The reader's weakest assumption identifies precisely the same load-bearing concern: the claimed pointwise comparability of μ1 and ν is false, and the transfer mechanism of Lemma 5 and Eq. (8) collapses without it. I agree that this is the central gap in v1. It is not a mere typo: the π/2 factor changes the exponential decay rate, so the two measures are not comparable and no c,C exist. The rest of the proof establishes the theorem only for ν, so Theorem 1 for μ1 lacks support as written. However, the gap is local and a standard two-step reduction (first compare μ1 with 1/(2 cosh x), then dilate to ν) appears to repair the argument; the constants and logarithmic weights change only by bounded factors under this procedure. I also checked the tightness argument's final Banach-Steinhaus step; although terse, it can be read as uniform boundedness of the truncated quadratic forms and is not a separate fatal defect. Minor issues such as the omitted proof of Lemma 5 and the derivative typo in Lemma 17 do not affect the assessment. Because the theorem is plausible and the sole identified gap is repairable, the conditional verdict is appropriate and no change to the reader's recommendation is needed.","tokens_in":19823,"tokens_out":17031,"duration_ms":171724,"concrete_test":"Compute the ratio exp(-|x|)/(1/(2 cosh(πx/2))) at x=10 and x=20; it grows like exp((π/2−1)|x|), directly refuting the asserted cν≤μ1≤Cν. Then test the proposed repair: (i) verify that μ1 is comparable to η=1/(2 cosh x); (ii) substitute y=πx/2 to transfer Theorem 1 from ν to η; (iii) re-run Lemma 5 and Eq. (8) on each step. If all constants remain finite and the log(e+|x|) factor changes only by a bounded multiplicative factor, the theorem is recovered and the gap is local.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The load-bearing step is the reduction in Section 1. The text asserts that 1/(2 cosh x) ≤ exp(-|x|) ≤ 1/(2 cosh x) and then concludes that it suffices to prove Theorem 1 for ν(dx)=1/(2 cosh(πx/2))dx. This is false: for |x| large, exp(-|x|)/(1/(2 cosh(πx/2))) ≈ 2 exp((π/2−1)|x|), which is unbounded, so no constants c,C with cν≤μ1≤Cν exist. Lemma 5 and Eq. (8), which transfer coefficient inequalities between comparable measures, therefore cannot transfer the theorem from ν to μ1. Since the proof of Theorem 1 is carried out only for the Meixner-Pollaczek weight ν, the theorem for the double exponential is unsupported as written. The gap appears repairable: first compare μ1 with η=1/(2 cosh x), then apply the dilation y=πx/2 to reach ν; the weights and log(e+|x|) terms change only by constants. But that intermediate step is absent, so the central claim is conditional on its repair.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies L^2 polynomial approximation for the two-sided exponential measure μ1(dx)=e^{-|x|}/2 dx. Its main theorem, Theorem 1, asserts a logarithmic coefficient-weight estimate: for every absolutely continuous f, the weighted sum Σ_{k≥1} log^2(e+k)⟨f,P_k⟩^2 is controlled by ∫ log^2(e+|x|) f^2 dμ1 plus ∫(f')^2 dμ1, with an analogous variant in which the logarithmic weight is moved onto (f')^2. The theorem also claims sharpness in the strong sense that log^2(e+k) cannot be multiplied by a sequence tending to infinity. The proof passes to the Meixner-Pollaczek weight ν(dx)=1/(2 cosh(πx/2)) dx, uses the explicit generating function G_ℓ(x,s)=e^{x arctan s}/(1+s^2)^{ℓ/2}, derives identities expressing weighted coefficient sums as integrals of holomorphic differences, and then proves the desired inequality by Fourier/Laplace estimates and a Poincaré inequality. A tensorization argument yields a d-dimensional corollary with a logarithmic rate for Lipschitz functions.","tokens_in":20003,"tokens_out":21920,"duration_ms":190533,"significance":"The analytic core of the paper—the generating-function identity, the weighted Parseval identities in Lemmas 9 and 10, and the sharpness construction via scaled Gaussians—is explicit, parameter-free, and of independent interest. If the measure-reduction gap is repaired, the result would significantly sharpen Lubinsky's logarithmic error estimate to a coefficient-wise ℓ^1 statement with a sharp weight, and it would give the first tensorizable higher-dimensional rate for the double-exponential measure. The paper contains no fitted parameters and the main coefficient identities are stated in machine-checkable form. However, as written, the proof of Theorem 1 for μ1 is conditional on an invalid comparison between μ1 and ν.","major_comments":[{"comment":"The reduction from μ1 to ν is invalid as written. The paragraph beginning 'Remark that 1/(2 cosh(x)) ≤ exp(−|x|) ≤ 1/(2 cosh(x))' cannot be correct as printed, since the two inequalities are mutually incompatible. More importantly, the measure comparison needed for Lemma 5 and Eq. (8) fails: for ν(dx)=1/(2 cosh(πx/2))dx, the ratio e^{-|x|}/(1/(2 cosh(πx/2))) = 2e^{-|x|}cosh(πx/2) ∼ e^{(π/2−1)|x|} as |x|→∞, so no constants c,C satisfy cν≤μ1≤Cν. Consequently the invocation of Lemma 5 and the chain of inequalities in Eq. (8) do not transfer the theorem from ν to μ1, and the proof of Theorem 1 for μ1 is unsupported. The gap is repairable: first compare μ1 with η(dx)=1/(2 cosh x)dx, where 1/(2 cosh x)≤e^{-|x|}≤2/(2 cosh x), then use the dilation y=πx/2 to pass from η to ν, keeping track of the universal constants in the log(e+|x|) factors and in the orthonormal expansion. This intermediate step must be written explicitly before Lemma 5 is applied.","section":"1. Preliminaries"},{"comment":"The statement and proof of Lemma 14 are corrupted as printed. The displayed lower bound 'φ(1/k)/(32 + k/2 Φ(1/2k)) ≤ Γφ(k)' does not follow from the proof that follows it, and the proof's interval '[1/2k, 3k/4], which has length k/4' is inconsistent: for k>1 the interval is not contained in [0,1] and its length is not k/4. The intended argument appears to be a lower bound of the form Γφ(k) ≥ φ(1/k)/32 + (k/2)Φ(1/(2k)), with the second interval [1/(2k), 3/(4k)] of length 1/(4k). Since Lemma 14 is the source of the crucial equivalence Γφ(k) ≍ log^2(e+k) used in both the upper and lower bounds, the statement and proof must be corrected.","section":"2, Lemma 14"}],"minor_comments":[{"comment":"The constants c² and C² in Eq. (8) do not match the comparison cν≤μ≤Cν; using c and C would be consistent, although the argument is unaffected up to renaming constants.","section":"1, Eq. (8)"},{"comment":"In the statement of Lemma 5, 'If Σ bkφk ≤ ∞' should read 'If Σ bkφk < ∞'.","section":"2, Lemma 5"},{"comment":"The appeal to the Banach-Steinhaus theorem should specify the Hilbert space (for instance H^1(ν) with norm ∥f∥²=∫ f² dν + ∫(f')² dν) and the bounded linear operators T_N(f)=(√(a_k) log(e+k)⟨f,P_k⟩)_{k≤N}; with that specification the argument is valid, but as written the space and operators are not identified.","section":"3.2, final paragraph"},{"comment":"The sentence 'We proved (3) and it remains to establish (4)' is placed after the derivation of (3) from Lemma 10; since the following translation argument proves (4), the paragraph would be clearer if the two steps were labeled separately.","section":"3.1"}],"recommendation":"major_revision","confidential_remarks":"The main gap is local and repairable: inserting the comparison with η=1/(2 cosh x)dx and the subsequent dilation to ν would make the transfer from ν to μ1 rigorous. The analytic identities and the sharpness construction appear sound, so I do not recommend rejection. The authors should also correct the typographical corruption in Lemma 14. If these fixes are made, the central claim is likely correct."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Short version: the headline result is real and materially stronger than Lubinsky's, but the proof as written has a load-bearing gap in the reduction from μ1 to ν. I would send it to a referee, not desk-reject it, with a clear instruction to check that reduction.\n\nWhat is new: Theorem 1 controls the full weighted ℓ1 sum of squared coefficients with log^2(e+k), where Lubinsky only had the tail error En. The sharpness statement against arbitrary ak→∞ is genuinely new, and the tensorized product-Laplace corollary is a nice consequence. The analytic machinery—the generating function of the Meixner-Pollaczek polynomials and the two-sided coefficient formula in Lemma 10—is a real technique. The computations in Lemmas 6–18 are detailed and mostly check out. There are no fitted parameters and no circularity.\n\nThe soft spot is exactly where your reader put it. The text asserts that 1/(2 cosh x) ≤ e^{-|x|} ≤ 1/(2 cosh x) and concludes that μ1 may be replaced by ν(dx)=1/(2 cosh(πx/2))dx. That comparison is false: for large |x|, e^{-|x|}/sech(πx/2) grows like e^{(π/2−1)|x|}, which is unbounded. Lemma 5 and equation (8) require comparable measures, so the transfer from ν to μ1 is unsupported as written. This is not cosmetic: Theorem 1 is proved for ν, and the step to μ1 is the whole point. The gap looks repairable—first compare μ1 with 1/(2 cosh x), then apply a dilation to reach ν, checking the log(e+|x|) factors—but that intermediate argument is absent. Minor issues: the proof of Lemma 5 is omitted (standard, fine), and there is a typo in the derivative display in Lemma 17.\n\nThe citation pattern is honest and appropriate. I do not think the authors are hiding anything; this is an over-compressed reduction, not a fake result. The paper deserves a serious referee, but acceptance should be conditional on fixing the measure comparison.","headline":"The coefficient inequality is a genuine advance over Lubinsky, but the paper as written contains a load-bearing gap: the claimed reduction from the double-exponential measure μ1 to the hyperbolic-secant measure ν is invalid, because the two densities are not comparable.","tokens_in":20552,"tokens_out":3844,"would_cite":false,"duration_ms":35726,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["41A10","42C05"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper proves a sharp, coefficient-level logarithmic bound for polynomial approximation in $L^2$ of the double-exponential measure, and shows the logarithmic weight cannot be improved.","keywords":["polynomial approximation","double-exponential weight","orthogonal polynomials","Meixner-Pollaczek polynomials","logarithmic rate","tensorization","sharp inequality","complex analysis"],"falsifier":"Evaluate the ratio $e^{-|x|}\\big/(1/(2\\cosh(\\pi x/2)))$ as $|x|\\to\\infty$; it behaves like $2 e^{(\\pi/2-1)|x|}$, so no universal constants make the two densities comparable, directly settling the validity of the reduction step and showing an intermediate comparison is required.","tokens_in":19547,"feed_emoji":"📉","tokens_out":10210,"duration_ms":88526,"temperature":0.7,"pith_summary":"This paper proves a sharp coefficient-level bound for polynomial approximation in $L^2$ of the double-exponential measure $\\mu_1(dx)=e^{-|x|}\\,dx/2$. For every absolutely continuous $f$, the weighted coefficient sum $\\sum_{k\\ge 1}\\log^2(e+k)\\langle f,P_k\\rangle^2$ is controlled by a weighted $L^2$ norm of $f$ plus the $L^2$ norm of $f'$, and the factor $\\log^2(e+k)$ cannot be replaced by $a_k\\log^2(e+k)$ for any sequence $a_k\\to\\infty$. This upgrades earlier logarithmic error-rate estimates to a stronger statement about the individual coefficients, and it tensorizes to product measures in $\\mathbb{R}^d$. The argument passes through explicit complex-analytic formulas for the Meixner-Pollaczek polynomials attached to the hyperbolic-secant weight.","feed_headline":"Double-exponential approximation hits a sharp logarithmic rate","feed_subtitle":"The paper upgrades earlier error rates to coefficient-level control and extends it to higher dimensions.","key_machinery":"The carrying object is the generating function $G_\\ell(x,s)=e^{x\\arctan s}/(1+s^2)^{\\ell/2}$, whose Taylor coefficients are the Meixner-Pollaczek polynomials $P_k^{(\\ell)}$, orthogonal for the convolution measures $\\nu_\\ell$ with densities $|\\Gamma((\\ell+ix)/2)|^2/(2\\pi)$. For $\\ell=1$, $\\nu$ has density $1/(2\\cosh(\\pi x/2))$, the smoothed proxy for $\\mu_1$. The central mechanism is Lemma 10: for a positive weight $\\varphi$, the weighted coefficient sum $\\sum_k \\Gamma_\\varphi(k)\\langle f,P_k\\rangle^2$ is sandwiched between two integrals over the Fourier transform of $K_u(x)\\,(f(x+i)-f(x-i))$, with $K_u(x)=x e^{ux}/\\sinh(\\pi x/2)$; choosing $\\varphi(\\varepsilon)=\\log^2(\\varepsilon)$ makes $\\Gamma_\\varphi(k)\\asymp \\log^2(e+k)$. The proof obtains this by mapping the unit disk through $\\arctan$ onto the strip $|\\operatorname{Re} z|<\\pi/4$, using a Paley-Wiener identity and Parseval's formula, and bounding the resulting integrals with elementary hyperbolic-function inequalities.","core_discovery":"On the paper's own terms, the central discovery is that the logarithmic decay of polynomial approximation under $\\mu_1$ is not merely an error-rate phenomenon but a coefficient phenomenon. Theorem 1 states that $\\sum_{k\\ge 1}\\log^2(e+k)\\langle f,P_k\\rangle^2 \\lesssim \\int \\log^2(e+|x|) f^2\\,d\\mu_1 + \\int (f')^2\\,d\\mu_1$, together with a variant where the derivative is weighted by $\\log^2(e+|x|)$; when the right-hand side is bounded this gives a logarithmic rate of approximation, recovering Lubinsky's result, while the left-hand side records the full weighted $\\ell^1$ summability of the coefficients. The sharpness clause asserts that the weight $\\log^2(e+k)$ is optimal: for any positive increasing $a_k\\to\\infty$ there is a function with bounded right-hand side whose $a_k\\log^2(e+k)$-weighted coefficient sum diverges, via a Banach-Steinhaus argument applied to scaled Gaussians. A tensorization theorem transfers the one-dimensional control to $\\mu_1^{\\otimes d}$, with explicit rates for Lipschitz functions. The authors also conjecture the matching reverse inequality.","pith_inferences":["Extending the same coefficient machinery to the general Meixner-Pollaczek family ($\\ell>1$) would yield sharp weighted-sum inequalities for the convolution measures $\\nu_\\ell$; the paper's proof already contains the $\\ell$-dependent generating function.","A testable repair of the reduction step is to insert the intermediate weight $1/(2\\cosh x)$ between $\\mu_1$ and $\\nu$ and then dilate; the density ratio argument currently needs this extra comparison to be rigorous.","The tensorization theorem should apply to any product of measures whose orthogonal-polynomial coefficients satisfy weighted Poincaré-type inequalities, so anisotropic weights with distinct $\\varphi_i$ and $w_i$ would give dimension-dependent rates beyond the isotropic case."],"forward_implications":["For any absolutely continuous $f$ with the weighted derivative norm finite, the coefficients satisfy $\\sum_{k\\ge 1}\\log^2(e+k)\\langle f,P_k\\rangle^2<\\infty$, a stronger $\\ell^1$-type statement than the earlier weak-$\\ell^1$ error estimates.","When the right-hand side is bounded, Theorem 1 yields $E_n(f,\\mu_1)\\lesssim \\log^{-2}(n)$, recovering and refining Lubinsky's logarithmic Jackson-type rate.","The tensorization theorem gives, for $\\mu_1^{\\otimes d}$ and $1$-Lipschitz $f$, approximation rates of order $\\log\\log d/\\log n$, showing the rate degrades only logarithmically in dimension.","The optimality clause rules out any improvement of the logarithm: no sequence $a_k\\to\\infty$ can multiply $\\log^2(e+k)$ while preserving the inequality for all admissible $f$.","The comparison with Laguerre polynomials on the half line shows the two-sided exponential is the critical case: the one-sided exponential gives a linear rate, so the logarithmic rate is genuinely a two-sided phenomenon."],"supporting_citations":[{"why":"Supplies the identity $\\int e^{\\alpha x}d\\nu(x)=1/\\cos\\alpha$ and the Meixner-Pollaczek polynomial framework used in Lemma 6.","marker":"[Ara04]"},{"why":"Supplies the Pollaczek polynomial generating function and the convolution-density representation of the measures $\\nu_\\ell$.","marker":"[Sze39]"},{"why":"Gives the earlier logarithmic Jackson-type rate for $\\mu_1$ that Theorem 1 refines to a coefficient inequality.","marker":"[Lub06]"},{"why":"Provides the initial logarithmic approximation result in $L^1$ for this weight, the quantitative precedent for the present bound.","marker":"[FGR78]"}],"fun_headline_variants":["Sharp log-rate inequality for double-exponential polynomial approximation","Optimal log decay for polynomial fits under double-exponential weight","Coefficientwise log control: sharp for double-exponential weight","Double-exponential weight: log approximation rate is optimal","Log-rate sharpness extended to higher dimensions via tensorization"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that the double-exponential measure and the hyperbolic-secant measure are mutually bounded up to constants, a comparison that fails as written and whose repair is needed for the theorem to transfer.","fun_headline_variants_meta":{"raw":{"variants":["Sharp log-rate inequality for double-exponential polynomial approximation","Optimal log decay for polynomial fits under double-exponential weight","Coefficientwise log control: sharp for double-exponential weight","Double-exponential weight: log approximation rate is optimal","Log-rate sharpness extended to higher dimensions via tensorization"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000217,"raw_usage":{"total_tokens":1504,"prompt_tokens":1081,"completion_tokens":423,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":697,"completion_tokens_details":{"reasoning_tokens":342}},"tokens_in":697,"tokens_out":423,"duration_ms":4159,"temperature":1.0,"reasoning_tokens":342,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-08T12:44:09.749851+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Evaluate the ratio $e^{-|x|}\\big/(1/(2\\cosh(\\pi x/2)))$ as $|x|\\to\\infty$; it behaves like $2 e^{(\\pi/2-1)|x|}$, so no universal constants make the two densities comparable, directly settling the validity of the reduction step and showing an intermediate comparison is required.","supporting_citations":[],"review_version":1}