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.
Rectangular telescoping of tensor details
Statement
Let and . For and the details of Nested one-dimensional quadrature levels and differences,
Facts & Assumptions
Given: A dimension , terminal levels , and the nested one-dimensional level hierarchies.
Nested one-dimensional quadrature levels and differences: and for , with ; tensor rules multiply coordinate weights.
Smolyak cubature on a finite downward-closed index set: a cubature on a finite index set is the finite sum of the corresponding tensor details.
Laws of finite sums and finite products: scalar finite sums satisfy additivity, scaling, and telescoping.
The product of a finite list in a monoid, by recursion, with the empty product () equal to the identity: a finite product is formed by recursively multiplying its coordinate factors.
Proof
Fix any one-dimensional input and coordinate , and put . By [F3], ; for this is the empty-sum identity. Adding and using [F1] yields . Since was arbitrary, this is equality of functionals.
For each coordinate , represent every , , on the common finite node set , inserting zero weights at absent nodes; this is possible by nestedness. Write its weight at as , so has weight by scalar additivity. By [F1], the tensor of these coordinate sums has weight at each node tuple. Repeated scalar scaling and additivity [F3], applied to the recursively formed product [F4], expand this weight as . Multiplying by any input value and summing over the finite node tuples gives , since scalar additivity permits interchanging the finite sums. This is by [F2]. Step 1.1 identifies each coordinate sum with , proving the claimed equality of functionals for every .
Depends on
Used by
Dependency tree · two levels
25 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)
- T. Gerstner and M. Griebel, Dimension-Adaptive Tensor-Product Quadrature, §2 (standard reference, not scraped)