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.
A signed Simpson-Smolyak weight makes a nonnegative chaos coefficient estimate negative
Example
For , put on and . This is a nonnegative polynomial. Under the uniform law on , the constant polynomial-chaos coefficient is . Yet the level-two composite-Simpson Smolyak rule on returns . This shows why signed Smolyak weights matter when integrating chaos coefficients. Any tensor product of Gaussian rules with positive coordinate weights returns a nonnegative value on ; no Gaussian exactness for this high-degree polynomial is asserted.
Facts & Assumptions
Given: The uniform probability law on , , , the constant chaos basis , and the Simpson hierarchy of Nested one-dimensional quadrature levels and differences.
Composite Simpson rule on an even uniform grid: the endpoint weight at level is , and the other weights are nonnegative.
Smolyak cubature on a finite downward-closed index set: for , the Smolyak functional is the sum of its six tensor details.
Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function: one-variable polynomials and their finite products and sums are continuous.
A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion: a continuous function on a nondegenerate closed interval is Riemann integrable.
If on and both are integrable then ; and : pointwise order between integrable functions implies the same order between their integrals.
For : is integrable on if and only if it is integrable on and on , and then ; with the oriented form for arbitrary : the integral over is the sum of integrals over and when .
The integral of a product function on a product rectangle is the product of the two integrals: the integral of a product function on a product rectangle factors into the coordinate integrals.
The m-node Gaussian quadrature rule for a positive measure: a Gaussian rule returns a finite weighted sum of samples.
Gaussian quadrature is exact through degree 2m−1 and has positive weights: for valid positive-measure moment data, every Gaussian weight is strictly positive.
Tensor-product Gaussian quadrature: tensor weights are products of coordinate weights.
Finite sums and finite products, by recursion and Laws of finite sums and finite products: finite sums distribute; finite sums and finite products of nonnegative terms are nonnegative.
By trichotomy, every real is zero, positive, or negative. Its square is in the zero case, positive by Sign rules for products and monotonicity of multiplication in the positive case, and positive in the negative case because and by Sign rules for products: and . Thus every real square is nonnegative; Multiplication by zero: supplies the zero case.
Verification
Every real square is nonnegative by [F13], so each factor in is nonnegative and [F12] gives on . The polynomial is continuous by [F4] and satisfies . Continuity at zero gives such that for ; choose , so and . By [F5]–[F6], and ; [F7] then gives . Applying [F8] to the continuous coordinate factors establishes integrability of and gives .
For each , when , because the factor indexed by vanishes; . The nested Simpson grids through level two are , , and . Thus every sampled value of on any tensor rule in vanishes except at , where it is one; all sampled values are nonnegative by [F13] and [F12].
Let be the level- endpoint weight. By [F2], , , and . Expanding the six details from [F3] and using finite distributivity [F12] gives . By step 2.1, its value on is the combined coefficient at : . This differs in sign from in step 1.1.
For tensor products of Gaussian rules with valid positive-measure moment data, [F10] makes every coordinate weight positive and [F11] makes each tensor weight a product of positive numbers. Since all samples of are nonnegative by [F12]–[F13], [F9] and [F12] make the resulting finite sum nonnegative. Together with the negative Simpson estimate in step 3.1, this is a sign comparison; it does not claim that such a Gaussian rule exactly integrates .
Depends on
- Smolyak cubature on a finite downward-closed index set
- Nested one-dimensional quadrature levels and differences
- Composite Simpson rule on an even uniform grid
- The m-node Gaussian quadrature rule for a positive measure
- Gaussian quadrature is exact through degree 2m−1 and has positive weights
- Tensor-product Gaussian quadrature
- Finite sums and finite products, by recursion
- Laws of finite sums and finite products
- Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function
- A continuous function on $[a,b]$ is Riemann integrable, by Heine-Cantor and Riemann's criterion
- If $f \le g$ on $[a,b]$ and both are integrable then $\int_a^b f \le \int_a^b g$; and $m(b-a) \le \int_a^b f \le M(b-a)$
- For $a<c<b$: $f$ is integrable on $[a,b]$ if and only if it is integrable on $[a,c]$ and on $[c,b]$, and then $\int_a^b f = \int_a^c f + \int_c^b f$; with the oriented form for arbitrary $a,b,c$
- The integral of a product function on a product rectangle is the product of the two integrals
- Sign rules for products and monotonicity of multiplication
- Sign rules for products: $(-a)b = -(ab)$ and $(-a)(-b) = ab$
- Multiplication by zero: $0 \cdot a = 0$
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
80 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)
- John A. Gubner, Gaussian Quadrature and the Eigenvalue Problem, §§2–5 (standard reference, not scraped)
- Tobin A. Driscoll and Richard J. Braun, Fundamentals of Numerical Computation, §5.6 (standard reference, not scraped)