How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Convergence of dyadic tensor composite-Simpson rules
Statement
Let and let be continuous. For the dyadic composite-Simpson hierarchy of Nested one-dimensional quadrature levels and differences, the tensor product converges to the multiple Riemann integral:
Facts & Assumptions
Given: and a continuous .
Nested one-dimensional quadrature levels and differences: is composite Simpson with equal panels. Regrouping into two-panel blocks gives each block length and weights at its left endpoint, midpoint, and right endpoint.
Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line: every closed box in Euclidean , including , is compact.
Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous: a continuous map from a compact metric space to a metric space is uniformly continuous.
Every continuous function on a closed nondegenerate rectangle in is Riemann integrable and Riemann's criterion on a nondegenerate rectangle in : integrability is equivalent to arbitrarily small Darboux gaps: a continuous function on the cube is Riemann integrable, and its integral lies between each lower and upper Darboux sum.
Grid partitions of a rectangle in , their cells, refinements and mesh: the uniform partition into side- boxes covers the cube, has disjoint interiors, and its cell volumes sum to one.
Lower and upper Darboux sums over a grid partition in and The lower and upper Darboux integrals over a nondegenerate rectangle in : for each cell , the lower and upper contributions are and .
Composite Simpson rule on an even uniform grid: every two-panel Simpson block has coefficients proportional to , which are nonnegative and sum to .
Laws of finite sums and finite products: finite sums distribute and may be regrouped.
A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value: a continuous function on a nonempty compact metric space has finite maximum and minimum, so its Darboux cell extrema are finite.
For the sequence is null, and for the sequence diverges to and Limits and Cauchy sequences of reals: for every positive rational , all sufficiently large satisfy ; Laws of integer exponents gives .
The rationals embed densely in the reals: below every positive real lies a positive rational.
Canonical naturals are positive and strictly increasing and Square roots exist: a unique with ; the positives are : the canonical natural is positive, so its nonnegative square root is nonzero and hence positive; Inverses of positives are positive, and reciprocation reverses order makes positive, and Sign rules for products and monotonicity of multiplication makes positive.
Proof
Fix . By [F2] and [F3], is uniformly continuous on . Choose such that implies . By [F12], ; use [F11] to choose a positive rational , then [F10] to choose with . Thus , and every cell of the uniform -dimensional grid has diameter .
For the chosen in step 1.1, the tensor Simpson rule is the sum over grid cells of their tensor two-panel block rules: each cell contributes times a weighted average of its endpoint/midpoint tensor nodes, with coefficients . These coefficients are nonnegative and sum to one by [F7]. Each closed cell is compact and nonempty, so [F9] gives finite infimum and supremum of there. Every node lies in its cell and its value lies between those extrema. Regrouping finite sums by [F8] gives , with the factors equal to cell volumes.
By step 1.1, the oscillation of on each cell is at most . Thus [F5]–[F6] give . By [F4], lies between these Darboux sums; step 2.1 places the tensor-Simpson value between them as well. Therefore . This holds for sufficiently large for each , proving convergence.
Depends on
- Nested one-dimensional quadrature levels and differences
- Composite Simpson rule on an even uniform grid
- The lower and upper Darboux integrals over a nondegenerate rectangle in $\mathbb{R}^m$
- Grid partitions of a rectangle in $\mathbb{R}^m$, their cells, refinements and mesh
- Lower and upper Darboux sums over a grid partition in $\mathbb{R}^m$
- Riemann's criterion on a nondegenerate rectangle in $\mathbb{R}^m$: integrability is equivalent to arbitrarily small Darboux gaps
- Every continuous function on a closed nondegenerate rectangle in $\mathbb{R}^m$ is Riemann integrable
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
- Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous
- A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value
- Laws of finite sums and finite products
- For $|r| < 1$ the sequence $r^k$ is null, and for $|r| > 1$ the sequence $|r|^k$ diverges to $+\infty$
- Laws of integer exponents
- Limits and Cauchy sequences of reals
- The rationals embed densely in the reals
- Square roots exist: a unique $\sqrt{a} \ge 0$ with $(\sqrt{a})^2 = a$; the positives are $\{x^2 : x \neq 0\}$
- Canonical naturals are positive and strictly increasing
- Inverses of positives are positive, and reciprocation reverses order
- Sign rules for products and monotonicity of multiplication
Used by
Dependency tree · two levels
97 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- T. Gerstner and M. Griebel, Sparse Grids, Encyclopedia of Quantitative Finance, §Numerical integration (standard reference, not scraped)
- N. Zabaras, Sparse Grid Collocation Methods, lecture notes, slides 17–21 (standard reference, not scraped)
- Tobin A. Driscoll and Richard J. Braun, Fundamentals of Numerical Computation, §5.6 (standard reference, not scraped)