Configuration-Dependent Lower Bounds for Approximation by Shallow ReLU k Networks on the Sphere

We establish two related but logically distinct results for shallow ReLU k neural networks on the unit sphere d. First, for an arbitrary set of inner neural-network parameters, the best L 2(d) approximation of a fixed target function with smoothness r> 2 admits an asymptotic lower bound given by a constant multiple of n-1/2 k+1/2, where denotes the antipodal separation distance of the normalized inner-parameter set. This lower bound depends explicitly on the parameter configuration through and applies without additional assumptions on the parameters. Second, for antipodally quasi-uniform parameters, n-1/d, and the lower bound establishes the exact saturation order n-d+2k+1 over 2d for such parameter families: a target function with regularity greater than d+2k+1 over 2 and satisfying the required parity condition can be approximated at this rate, whereas approximation at any strictly faster rate forces the target function to be zero. Our results therefore place linearized neural-network approximation within the classical saturation framework and show that, although ReLU k network spaces can outperform finite elements of the same degree, this advantage is intrinsically limited.