Higher Russian Formula

• Higher Russian Formula is a lattice-based numerical integration rule defined on the unit cube, leveraging function spaces with dominating mixed smoothness.
• It uses Frolov’s cubature method to achieve optimal error bounds in large-smoothness regimes and distinct logarithmic corrections in small-smoothness settings.
• The analysis employs dual-lattice geometry, Poisson summation, and discrete reproducing formulas to precisely characterize convergence rates.

Searching arXiv for the specified paper and closely related work on Frolov cubature. Higher Russian Formula denotes the higher-order “Russian” cubature of Frolov: a lattice-based numerical integration rule on the unit cube whose error is analyzed in function spaces of dominating mixed smoothness with homogeneous boundary condition. In the formulation studied in "The role of Frolov's cubature formula for functions with bounded mixed derivative" (Ullrich et al., 2015), the rule yields upper bounds for worst-case integration errors in Besov spaces $\mathbf{B}^s_{p,\theta}$ and Triebel–Lizorkin spaces $\mathbf{F}^s_{p,\theta}$ over the whole range of admissible parameters $(s\ge 1/p)$. The analysis isolates two qualitatively different smoothness regimes: a “large-smoothness” regime in which the bounds are optimal and a “small-smoothness” regime, especially for $\mathbf{F}^s_{p,\theta}$ with $1<\theta<p<\infty$ and $1/p<s\le 1/\theta$, where the upper bounds have a different logarithmic structure and the matching optimality theory remains open (Ullrich et al., 2015).

1. Lattice construction and cubature rule

Let $d\ge 1$. The construction starts from a non-singular Vandermonde matrix $T$, where $\{\xi_i\}_{i=1}^d$ are the distinct real roots of an integer polynomial of degree $d$, so that $\mathbf{F}^s_{p,\theta}$0 (Ullrich et al., 2015). For each integer $\mathbf{F}^s_{p,\theta}$1, one defines

$\mathbf{F}^s_{p,\theta}$2

Because $\mathbf{F}^s_{p,\theta}$3, one has $\mathbf{F}^s_{p,\theta}$4. The Frolov cubature rule is

$\mathbf{F}^s_{p,\theta}$5

equivalently a cubature rule with uniform weights $\mathbf{F}^s_{p,\theta}$6 and nodes $\mathbf{F}^s_{p,\theta}$7.

The central structural feature is the choice of lattice. Its dual lattice

$\mathbf{F}^s_{p,\theta}$8

satisfies the product-size estimate

$\mathbf{F}^s_{p,\theta}$9

This estimate, together with a refined counting lemma for dual-lattice points in dyadic boxes, is the mechanism that makes the cubature rule effective for mixed-smoothness classes. A plausible implication is that the geometry of the dual lattice, rather than only the primal sampling set, determines the achievable asymptotic error order.

2. Function-space setting

The analysis is carried out in Besov and Triebel–Lizorkin spaces of dominating mixed smoothness on $(s\ge 1/p)$0, defined by a tensorized local-mean decomposition (Ullrich et al., 2015). One fixes univariate Schwartz kernels $(s\ge 1/p)$1 satisfying the moment conditions

$(s\ge 1/p)$2

and

$(s\ge 1/p)$3

For $(s\ge 1/p)$4,

$(s\ge 1/p)$5

and the multivariate kernels $(s\ge 1/p)$6 are obtained by tensorization.

The Besov space of dominating mixed smoothness $(s\ge 1/p)$7 consists of all tempered distributions $(s\ge 1/p)$8 such that

$(s\ge 1/p)$9

with the usual $\mathbf{F}^s_{p,\theta}$0-modification for $\mathbf{F}^s_{p,\theta}$1.

The Triebel–Lizorkin space of dominating mixed smoothness $\mathbf{F}^s_{p,\theta}$2 is defined by

$\mathbf{F}^s_{p,\theta}$3

When $\mathbf{F}^s_{p,\theta}$4 and $\mathbf{F}^s_{p,\theta}$5, one recovers the mixed-Sobolev space $\mathbf{F}^s_{p,\theta}$6.

To impose homogeneous boundary conditions, one sets

$\mathbf{F}^s_{p,\theta}$7

The stated purpose of this restriction is that Frolov’s lattice sum does not “see” boundary artifacts. This places the cubature problem in a compactly supported mixed-smoothness setting aligned with the unit-cube integration domain.

3. Minimal worst-case error and the large-smoothness regime

The $\mathbf{F}^s_{p,\theta}$8th minimal worst-case error in a normed class $\mathbf{F}^s_{p,\theta}$9 is

$1<\theta<p<\infty$0

The paper bounds $1<\theta<p<\infty$1 from above by the Frolov rule $1<\theta<p<\infty$2 (Ullrich et al., 2015).

Theorem A covers the large-smoothness regime. Let $1<\theta<p<\infty$3, $1<\theta<p<\infty$4, with $1<\theta<p<\infty$5 in the $1<\theta<p<\infty$6-case, and suppose

$1<\theta<p<\infty$7

Then

$1<\theta<p<\infty$8

and likewise

$1<\theta<p<\infty$9

These formulas identify the asymptotic rate in both the Besov and Triebel–Lizorkin scales. The power of $1/p<s\le 1/\theta$0 reflects the mixed smoothness parameter $1/p<s\le 1/\theta$1, while the logarithmic correction depends on $1/p<s\le 1/\theta$2 and the fine-scale exponent $1/p<s\le 1/\theta$3. In this regime the upper bounds are optimal in the sense that they cannot be improved by any other cubature formula.

4. Small smoothness in the Triebel–Lizorkin scale

Theorem B treats the difficult small-smoothness case in the $1/p<s\le 1/\theta$4-scale (Ullrich et al., 2015). Let $1/p<s\le 1/\theta$5, $1/p<s\le 1/\theta$6, and assume

$1/p<s\le 1/\theta$7

Then the Frolov rule satisfies

$1/p<s\le 1/\theta$8

The paper emphasizes that these upper bounds show a completely different behavior compared to “large” smoothness $1/p<s\le 1/\theta$9. The distinction is not in the principal power $d\ge 1$0, which remains unchanged, but in the exponent of $d\ge 1$1 and the appearance of an additional $d\ge 1$2 factor at the critical value $d\ge 1$3.

For the mixed-Sobolev class $d\ge 1$4, obtained by setting $d\ge 1$5, the consequences are stated explicitly: $d\ge 1$6

$d\ge 1$7

and

$d\ge 1$8

A common misconception is that mixed-Sobolev error bounds necessarily retain the same logarithmic exponent across all admissible $d\ge 1$9. The stated results show otherwise: the logarithmic term changes once the smoothness crosses the threshold $T$0, and the critical line may introduce a further iterated logarithm.

5. Analytical mechanism behind the two regimes

The proof combines Poisson summation, a discrete Calderón reproducing formula, and dual-lattice counting estimates (Ullrich et al., 2015). There exist Schwartz-class systems $T$1 and $T$2 such that

$T$3

For $T$4 supported in $T$5, Poisson summation and reproducing yield the error identity

$T$6

The dual lattice points are partitioned into dyadic boxes, and

$T$7

denotes the number of dual points in the box $T$8. The counting lemma gives

$T$9

and

$\{\xi_i\}_{i=1}^d$0

From the error identity one applies Hölder to the inner sum over $\{\xi_i\}_{i=1}^d$1, producing a factor $\{\xi_i\}_{i=1}^d$2, and then performs a second summation over $\{\xi_i\}_{i=1}^d$3. The decisive point is the order in which Hölder is applied across the $\{\xi_i\}_{i=1}^d$4 and $\{\xi_i\}_{i=1}^d$5 structures. If $\{\xi_i\}_{i=1}^d$6, one groups first in the $\{\xi_i\}_{i=1}^d$7-norm and then in $\{\xi_i\}_{i=1}^d$8, recovering the rate

$\{\xi_i\}_{i=1}^d$9

If $d$0 but still $d$1, one must switch the order of Hölder to avoid divergence. The result is a different logarithmic exponent, namely $d$2, with an additional $d$3 term when $d$4.

This suggests that the phase transition at $d$5 is not an artifact of proof technique alone. Rather, it is tied to the interaction between mixed smoothness, fine-scale summability, and the combinatorics of dual-lattice occupation numbers.

6. Optimality, lower bounds, and open problems

In the large-smoothness case $d$6, matching lower bounds obtained via atomic constructions show that no cubature can do better than

$d$7

Accordingly, Frolov’s rule is optimal in that regime (Ullrich et al., 2015). The paper characterizes this as the regime in which the upper bounds are optimal and cannot be improved by any other cubature formula.

In the small-smoothness case $d$8, the upper bounds are believed sharp, but the matching lower bound is still open in full generality. The summary states that it is known for $d$9 via Fibonacci-lattice methods. The abstract likewise notes that the optimality for “small” smoothness is open.

The resulting picture is therefore asymmetric. For $\mathbf{F}^s_{p,\theta}$00, the theory provides a sharp order of convergence in both $\mathbf{F}^s_{p,\theta}$01- and $\mathbf{F}^s_{p,\theta}$02-scales. For $\mathbf{F}^s_{p,\theta}$03 in the Triebel–Lizorkin scale, the upper theory is precise enough to reveal a qualitatively different logarithmic behavior, but the full minimax classification remains incomplete. This leaves the higher Russian Formula as both a definitive optimal construction in one parameter regime and an unresolved benchmark in another.