What was already known
Giladi, Mendel and Naor obtained the general upper bound . A two-point test gives the lower order for a nontrivial space.
AI involvement
Mendel credits GPT-6 Astra with the proofs. He posed the questions, guided the search for better bounds and clearer arguments, edited the text and checked the proofs.
Importance
A continuous-torus smoothing kernel improves the general upper-bound exponent by one half and attains the optimal order for the product of approximation and smoothing constants in the universal scheme.
Technical verification
Mendel reports checking the proofs. The source gives no separate checking record describing how the proof of the general bound was audited.
Human understanding
Mendel reports understanding the work and guiding the search for simpler arguments. The disclosure credits the models with the written proof and does not identify a separate human exposition of the kernel construction.
Correction and publication history
New curated research with documented central AI work.
Read this published revision