Alphabeta Math
Pipeline-generated
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

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

ExampleConstruction: AI-generatedVerification: AI-adaptedOpen item page →

A diagonal ridge fails the mixed fourth-derivative hypothesis

Example

On [0,1]2, take f(x,y)=∣x−y∣3. 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 (y,y) with 0<y<1. 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: f(x,y)=∣x−y∣3 on [0,1]2 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 D{1}f=∂x4f 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 DSf to exist continuously and have a finite bound on the whole cube.

1.1givenF3F4F5algebra

Fix an interior y∈(0,1) and write g(h)=f(y+h,y)=∣h∣3 for sufficiently small positive and negative h. By [F4]–[F5], on the two sides g′(h)=3h∣h∣ and g′′(h)=6∣h∣ for h≠0. The difference quotients at zero give g′(0)=0 and g′′(0)=lim⁡h→03∣h∣=0. The derivative of g′′ at zero would require lim⁡h→0(g′′(h)−g′′(0))/h=lim⁡h→06∣h∣/h, whose right-hand value is 6 and left-hand value is −6. Thus g′′′(0) does not exist, so g(4)(0) cannot exist. By [F3], the required derivative therefore fails at the interior diagonal point (y,y).

2.1givenF1F2step 1.1

Since [F1] requires D{1}f=∂x4f 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.

3.1givenF3F4F5step 1.1algebra∎

For every fixed y, the same formulas give ∂x2f(x,y)=6∣x−y∣, including its value zero on the diagonal; the same one-sided calculations apply at x=0,1. By symmetry ∂y2f(x,y)=6∣x−y∣ as well. These partials are continuous and bounded by 6 on the square since ∣x−y∣≤1, illustrating that lower-order smoothness does not imply the fourth-order condition used here.

ExampleConstruction: AI-generatedVerification: AI-adaptedjudge pass (gpt-6-luna)Open item page →

A four-dimensional product exactly integrated on a sparse node union

Example

Use the Clenshaw–Curtis levels with polynomial degrees 1 and 2 on [0,1] in four dimensions, and let Λ1={ℓ∈N04:∣ℓ∣1≤1}. For f(x)=x12x2x3x4, the Smolyak rule is exact with 48 distinct nodes; the full tensor product of level-one nodes has 81 nodes.

Facts & Assumptions

Given: f(x)=x12x2x3x4 on [0,1]4, with Q0:=Q1,[0,1] and Q1:=Q2,[0,1], the Clenshaw–Curtis rules of polynomial degrees one and two.

[F1]

Smolyak cubature on a finite downward-closed index set: QΛ1 is the sum of the tensor details at 0,e1,e2,e3,e4, and its node union is the union of the corresponding level-grid products.

[F2]

Deterministic node merging for Smolyak cubature: each distinct point in that union is counted once, including a point whose combined weight is zero.

[F3]

Clenshaw–Curtis quadrature with the midpoint zero-degree case: on [0,1], the nth rule samples at xj=(1+cos⁡(jπ/n))/2 for j=0,…,n; thus Q0 is level n=1 and Q1 is level n=2.

[F4]

Polynomial exactness and best-approximation error for Clenshaw–Curtis: the nth Clenshaw–Curtis rule integrates every polynomial of degree at most n exactly.

[F5]

Quarter-turn values and shifts by pi/2 and pi: cos⁡(π)=−1 and cos⁡(π/2)=0.

[F7]

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

1.1givenF3F4F5F6F8algebra

The Given rules are the n=1 and n=2 rules. By [F3], their normalized nodes are (1+cos⁡(jπ/n))/2; [F5] and [F8] give X0={0,1} and X1={0,1/2,1}. By [F4], these rules are exact through degrees 1 and 2, respectively. Writing the level-zero weights as w0,w1, exactness on 1 and x gives w0+w1=1 and w1=1/2, hence Q0(x)=Q0(x2)=1/2. Also Q1(x)=1/2 and Q1(x2)=1/3 by exactness and [F6]. Thus Δ1(x)=0 and Δ1(x2)=−1/6.

2.1givenF1F6F7step 1.1algebra

Since f is a product, its tensor details factor into one-dimensional values. The zero-index term is Q0(x2)Q0(x)3=1/16. The e1 term is Δ1(x2)Q0(x)3=−1/48, and each ej term for j=2,3,4 vanishes because Δ1(x)=0. Therefore QΛ1(f)=1/16−1/48=1/24. By [F6]–[F7], I4(f)=(1/3)(1/2)3=1/24, so the cubature is exact.

3.1givenF1F2step 1.1algebra∎

The node union is X04 together with, for each coordinate j, the 8 points whose jth coordinate is 1/2 and whose other coordinates are endpoints. Those four midpoint sets are disjoint from one another and from the 16 corners, so W(Λ1)=16+4⋅8=48. The full tensor level-one grid has ∣X1∣4=34=81 nodes.

ExampleConstruction: AI-generatedVerification: AI-adaptedOpen item page →

A signed Simpson-Smolyak weight makes a nonnegative chaos coefficient estimate negative

Example

For k=1,…,8, put ϕ(x)=∏k=18(1−8x/k)2 on [0,1] and u(x,y)=ϕ(x)ϕ(y). This is a nonnegative polynomial. Under the uniform law on [0,1]2, the constant polynomial-chaos coefficient is c00=∫[0,1]2u>0. Yet the level-two composite-Simpson Smolyak rule on Λ2={(i,j):i+j≤2} returns −1/144. 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 u; no Gaussian exactness for this high-degree polynomial is asserted.

Facts & Assumptions

Given: The uniform probability law on [0,1]2, ϕ(x)=∏k=18(1−8x/k)2, u(x,y)=ϕ(x)ϕ(y), the constant chaos basis Ψ00=1, and the Simpson hierarchy of Nested one-dimensional quadrature levels and differences.

[F1]

Nested one-dimensional quadrature levels and differences: Qℓ=QS(⋅;0,1,2ℓ+1), Δ0=Q0, and Δℓ=Qℓ−Qℓ−1.

[F2]

Composite Simpson rule on an even uniform grid: the endpoint weight at level ℓ is 1/(3⋅2ℓ+1), and the other weights are nonnegative.

[F3]

Smolyak cubature on a finite downward-closed index set: for Λ2={(i,j):i+j≤2}, the Smolyak functional is the sum of its six tensor details.

[F5]

A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion: a continuous function on a nondegenerate closed interval is Riemann integrable.

[F8]

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.

[F9]

The m-node Gaussian quadrature rule for a positive measure: a Gaussian rule returns a finite weighted sum of samples.

[F10]

Gaussian quadrature is exact through degree 2m−1 and has positive weights: for valid positive-measure moment data, every Gaussian weight is strictly positive.

[F11]

Tensor-product Gaussian quadrature: tensor weights are products of coordinate weights.

[F12]

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.

[F13]

By trichotomy, every real z is zero, positive, or negative. Its square is 0 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 (−z)>0 and (−z)2=z2 by Sign rules for products: (−a)b=−(ab) and (−a)(−b)=ab. Thus every real square is nonnegative; Multiplication by zero: 0⋅a=0 supplies the zero case.

Verification

1.1givenF4F5F6F7F8F12F13choose

Every real square is nonnegative by [F13], so each factor in ϕ is nonnegative and [F12] gives ϕ(x)≥0 on [0,1]. The polynomial ϕ is continuous by [F4] and satisfies ϕ(0)=1. Continuity at zero gives η>0 such that ϕ(x)>1/2 for 0≤x<η; choose δ=min⁡(η/2,1/2), so 0<δ<η and δ<1. By [F5]–[F6], ∫0δϕ≥δ/2 and ∫δ1ϕ≥0; [F7] then gives ∫01ϕ≥δ/2>0. Applying [F8] to the continuous coordinate factors establishes integrability of u and gives c00=(∫01ϕ)2>0.

2.1givenF1F3F12F13step 1.1algebra

For each m=0,…,8, ϕ(m/8)=0 when m>0, because the factor indexed by k=m vanishes; ϕ(0)=1. The nested Simpson grids through level two are X0={0,1/2,1}, X1={m/4:0≤m≤4}, and X2={m/8:0≤m≤8}. Thus every sampled value of u on any tensor rule in Λ2 vanishes except at (0,0), where it is one; all sampled values are nonnegative by [F13] and [F12].

3.1givenF1F2F3F12step 2.1algebra

Let wℓ be the level-ℓ endpoint weight. By [F2], w0=1/6, w1=1/12, and w2=1/24. Expanding the six details from [F3] and using finite distributivity [F12] gives QΛ2=Q2⊗Q0+Q0⊗Q2−Q1⊗Q0−Q0⊗Q1+Q1⊗Q1. By step 2.1, its value on u is the combined coefficient at (0,0): 2w2w0−2w1w0+w12=2/(24⋅6)−2/(12⋅6)+1/122=−1/144<0. This differs in sign from c00>0 in step 1.1.

4.1givenF9F10F11F12F13step 3.1algebra∎

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 u 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 u.

Sources