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.
Nested one-dimensional quadrature levels and differences
Definition
Let be a finite quadrature functional of the form where , the nodes are distinct, and . A one-dimensional nested level hierarchy is a sequence of such functionals, with node sets satisfying for every . Set , the zero functional, and define the detail functional Finite sums are as in Finite sums and finite products, by recursion. For each , the integration functional used below is , with the multiple Riemann integral convention of The lower and upper Darboux integrals over a nondegenerate rectangle in .
The convergence and rate results in this pair use the dyadic composite- Simpson hierarchy where is the even-panel rule of Composite Simpson rule on an even uniform grid. The number of panels is even and at least two. The sets are nested because , and their weights are nonnegative with total weight one: each two-panel block has nonnegative weights summing to its length , and the blocks partition an interval of length one. Level zero has nodes and weights .
For a multi-index , any tensor product of these finite functionals means the finite weighted functional obtained by multiplying the coordinate weights and evaluating on the corresponding node tuples. In particular, . No exactness or error property is implied by the notation alone.
Depends on
Used by
- Deterministic node merging for Smolyak cubature Algorithm
- Finite-budget dimension-adaptive Smolyak surplus selection Algorithm
- Smolyak cubature on a finite downward-closed index set Definition
- A signed Simpson-Smolyak weight makes a nonnegative chaos coefficient estimate negative Example
- Convergence of dyadic tensor composite-Simpson rules Lemma
- Mixed-derivative bounds for dyadic Simpson details Lemma
- Rectangular telescoping of tensor details Lemma
- Absolute detail reconstruction and omitted-tail error bound Theorem
- Explicit work and error rate for dyadic Simpson Smolyak cubature Theorem
- Smolyak polynomial exactness from actual one-dimensional levels Theorem
Dependency tree · two levels
22 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)
- T. Gerstner and M. Griebel, Dimension-Adaptive Tensor-Product Quadrature, §2 (standard reference, not scraped)