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.
Sparse grid cubature and mixed regularity — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Clenshaw–Curtis and extrapolation quadrature
- Combinatorial Classes and the Symbolic Method
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Composite quadrature rules
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Darboux, L'Hôpital, and Taylor's Theorem
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Formal Power Series
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian quadrature
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper Integrals
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Measures and Their Basic Properties
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial approximation and Chebyshev interpolation
- Polynomial interpolation and remainder
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Sparse grid cubature and mixed regularity
- Subspaces, Products, and Quotients
- Suprema and Infima
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
These examples verify a four-dimensional Clenshaw–Curtis sparse grid with 48 distinct nodes, show that a diagonal ridge fails the fourth-derivative hypothesis, and compute a nonnegative polynomial chaos coefficient whose level-two Simpson-Smolyak estimate is negative. Positive tensor Gaussian weights preserve nonnegativity, without an exactness claim for that polynomial.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A diagonal ridge fails the mixed fourth-derivative hypothesis
Example
On , take . The pure second partials are continuous, but even the pure fourth derivative required by the rate theorem fails to exist at every interior diagonal point with . Thus this ridge does not meet the mixed regularity hypothesis for the isotropic rate in Explicit work and error rate for dyadic Simpson Smolyak cubature.
Verification
Given: on and the mixed-derivative hypotheses in Explicit work and error rate for dyadic Simpson Smolyak cubature. Each coordinate partial is the ordinary derivative of the section obtained by fixing the other coordinate.
[F1] Mixed-derivative bounds for dyadic Simpson details: the mixed-regularity hypothesis includes and requires it to exist continuously on the whole square.
[F2] Explicit work and error rate for dyadic Simpson Smolyak cubature: its rate requires every to exist continuously and have a finite bound on the whole cube.
[F3] The derivative of at a point that is a limit point of , and differentiability on a set: a one-dimensional derivative is the limit of its difference quotient.
[F4] For a natural the function is differentiable everywhere with derivative ; for it is the constant , with derivative ; for a natural the function is differentiable at every with derivative ; consequently every polynomial function is differentiable at every real, with the derivative computed term by term: for , the derivative of is .
[F5] Sums, scalar multiples, products and quotients: , , , and when : scalar multiples of differentiable functions have the corresponding scalar-multiple derivative.
Fix an interior and write for sufficiently small positive and negative . By [F4]–[F5], on the two sides and for . The difference quotients at zero give and . The derivative of at zero would require , whose right-hand value is and left-hand value is . Thus does not exist, so cannot exist. By [F3], the required derivative therefore fails at the interior diagonal point .
Since [F1] requires to exist continuously everywhere, the failure in step 1.1 violates a stated hypothesis of the rate theorem [F2]. The theorem makes no such rate claim for this ridge.
For every fixed , the same formulas give , including its value zero on the diagonal; the same one-sided calculations apply at . By symmetry as well. These partials are continuous and bounded by on the square since , illustrating that lower-order smoothness does not imply the fourth-order condition used here.
A four-dimensional product exactly integrated on a sparse node union
Example
Use the Clenshaw–Curtis levels with polynomial degrees and on in four dimensions, and let . For , the Smolyak rule is exact with distinct nodes; the full tensor product of level-one nodes has nodes.
Facts & Assumptions
Given: on , with and , the Clenshaw–Curtis rules of polynomial degrees one and two.
Smolyak cubature on a finite downward-closed index set: is the sum of the tensor details at , and its node union is the union of the corresponding level-grid products.
Deterministic node merging for Smolyak cubature: each distinct point in that union is counted once, including a point whose combined weight is zero.
Clenshaw–Curtis quadrature with the midpoint zero-degree case: on , the th rule samples at for ; thus is level and is level .
Polynomial exactness and best-approximation error for Clenshaw–Curtis: the th Clenshaw–Curtis rule integrates every polynomial of degree at most exactly.
For a natural the function is differentiable everywhere with derivative ; for it is the constant , with derivative ; for a natural the function is differentiable at every with derivative ; consequently every polynomial function is differentiable at every real, with the derivative computed term by term and The second fundamental theorem: if is differentiable on with and is integrable, then : and .
The integral of a product function on a product rectangle is the product of the two integrals: the integral of a product over a product rectangle is the product of its coordinate integrals.
Verification
The Given rules are the and rules. By [F3], their normalized nodes are ; [F5] and [F8] give and . By [F4], these rules are exact through degrees and , respectively. Writing the level-zero weights as , exactness on and gives and , hence . Also and by exactness and [F6]. Thus and .
Since is a product, its tensor details factor into one-dimensional values. The zero-index term is . The term is , and each term for vanishes because . Therefore . By [F6]–[F7], , so the cubature is exact.
The node union is together with, for each coordinate , the points whose th coordinate is and whose other coordinates are endpoints. Those four midpoint sets are disjoint from one another and from the corners, so . The full tensor level-one grid has nodes.
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 .
Sources
- T. Gerstner and M. Griebel, Sparse Grids, Encyclopedia of Quantitative Finance, §Classical Sparse Grids
- T. Gerstner and M. Griebel, Dimension-Adaptive Tensor-Product Quadrature, §2
- Lloyd N. Trefethen, Is Gauss Quadrature Better than Clenshaw–Curtis?, §2
- N. Zabaras, Sparse Grid Collocation Methods, lecture notes, slides 17–26
- T. Gerstner and M. Griebel, Sparse Grids, Encyclopedia of Quantitative Finance, §Numerical integration
- John A. Gubner, Gaussian Quadrature and the Eigenvalue Problem, §§2–5
- Tobin A. Driscoll and Richard J. Braun, Fundamentals of Numerical Computation, §5.6