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.

Polynomial chaos stochastic collocation and Galerkin UQ — Examples

1 · Prerequisites

2 · Summary

Objective

The examples verify an exact degree-one expansion for a positive two-state reaction rate, uniform coercivity and the zero solution for an affine random diffusion, the Cauchy-law failure of a degree-one moment cutoff, singularity of a higher-degree Gram matrix on finite support, and the mode/node work comparison for a three-input degree-two truncation. The two counterexamples delimit finite moment construction from completeness and positive definiteness. The work comparison records the three-dimensional counts explicitly and does not claim a general sparse-grid tractability rate.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

CounterexampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

A Cauchy input has no L2 degree-one polynomial chaos

Statement refuted

Every real probability law supports a degree-one orthonormal polynomial chaos basis.

Facts & Assumptions

Given: The Cauchy probability law and the finite moment-Gram requirements of Finite product-law polynomial-chaos input data.

[F1]

Degree one requires the finite second moment and positive-definite monomial Gram matrix of Finite product-law polynomial-chaos input data.

Counterexample

1.1givenF1constructalgebra

Take the standard Cauchy law, whose density is ρ(x)=1/(π(1+x2)) on R. Its second moment integral is ∫x2 dρ(x)=π−1∫Rx2/(1+x2) dx. For ∣x∣≥1, x2/(1+x2)≥1/2, so the integral over [−R,−1]∪[1,R] is at least (R−1)/π.

2.1F1step 1.1algebra∎

Letting R→∞ shows the second moment is infinite. Hence x∉L2(ρ), the degree-one monomial Gram entry is not finite, and [F1] fails; the finite Gram--Schmidt construction cannot supply a degree-one chaos basis for this law.

CounterexampleConstruction: AI-generatedVerification: AI-generatedOpen item page →

Finite support can make a higher-degree moment Gram matrix singular

Statement refuted

Finite moments through degree 2p guarantee a positive-definite degree-p monomial Gram matrix for every probability law.

Facts & Assumptions

Given: The two-point probability law and the degree-two Gram criterion of Finite product-law polynomial-chaos input data.

[F1]

The degree-two Gram matrix is positive definite exactly when every nonzero coefficient vector has strictly positive squared polynomial norm (Finite product-law polynomial-chaos input data).

Counterexample

1.1givenF1algebra

Let ρ=(δ−1+δ1)/2 and take p=2. All moments are finite. The coefficient vector of q(x)=x2−1 in the ordered monomials (1,x,x2) is (−1,0,1)≠0. Yet q(−1)=q(1)=0, so ∫q(x)2 dρ(x)=0.

2.1F1step 1.1algebra∎

Therefore the degree-two Gram quadratic form vanishes on a nonzero vector and is singular despite finiteness of every moment. The stated sufficiency claim is false.

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

A bounded random diffusion coefficient remains uniformly coercive

Example

On D=(0,1), let Y be uniform on [−1,1], take the degree cutoff p1=0, set a(x,Y)=2+Y, and set the forcing F(Y)=0. This is an affine random diffusion with explicit uniform ellipticity bounds; its unique pointwise and Bochner weak solution is zero.

Facts & Assumptions

Given: The bounded interval D, uniform product law on [−1,1], constant coefficient terms a0=2, a1=1, and zero forcing.

[F1]

Finite product-law polynomial-chaos input data permits a finite product law with the stated admissible cutoff.

[F2]

Uniformly elliptic affine random diffusion model requires 0<a∗≤a(x,y)≤a∗ for every supported parameter and uses the gradient norm on H01(D).

[F3]

Affine random diffusion has a measurable Bochner solution gives the unique pointwise and Bochner solution under those hypotheses.

Verification

1.1F1F2givenalgebra

At cutoff p1=0, the only moment-Gram matrix is [1], so the uniform probability law is admissible by [F1]. Its support is Γ=[−1,1], and for every y∈Γ, 1≤2+y≤3. Thus the diffusion definition applies with a∗=1 and a∗=3, and F=0 is a bounded affine forcing.

2.1F2F3step 1.1algebra∎

The pointwise weak equation is ∫01(2+y)u′(x)v′(x) dx=0 for every v∈H01(0,1). Taking v=u and using 2+y≥1 gives ∥u∥H012≤0, so u=0 for every y. This solution is a strongly measurable square-integrable zero function and satisfies the Bochner equation; uniqueness also follows from [F3].

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

A two-state uncertain reaction rate has an exact degree-one chaos expansion

Example

Let Y take the values −1 and 1 with probability 1/2 each, choose cutoff p1=1, and let the uncertain positive reaction rate be k(Y)=κ(1+ηY) with κ>0 and ∣η∣<1. Its degree-one chaos expansion is exact, with mean κ and variance κ2η2.

Facts & Assumptions

Given: The symmetric two-point probability law and the rate parameters κ>0, ∣η∣<1.

[F1]

Finite product-law polynomial-chaos input data requires finite moments and a positive-definite monomial Gram matrix through the chosen cutoff.

[F2]

Positive moment Gram matrices produce orthonormal polynomial families constructs the normalized degree-zero and degree-one polynomials.

[F3]

Finite chaos projection, Parseval identity, mean, and variance identifies the constant and first nonconstant coefficients with mean and variance contributions.

Verification

1.1F1F2givenalgebra

The first two moments are E[Y]=0 and E[Y2]=1, so the degree-one Gram matrix is (1001), positive definite. Thus [F1] applies. Gram--Schmidt gives ψ0=1 and ψ1=Y, since Y already has mean zero and unit norm and its leading coefficient is positive.

2.1F3step 1.1algebra

Substitution gives k(Y)=κψ0+κηψ1 at both support points, so the degree-one projection residual is identically zero. Its coefficients are c0=E[k(Y)]=κ and c1=E[k(Y)Y]=κη. By [F3], the mean is c0 and variance is c12=κ2η2.

3.1givenstep 1.1algebra∎

The condition ∣η∣<1 implies 1+ηY≥1−∣η∣>0 at both states, so the reaction rate is positive on its whole support. Every function on this support also has the exact form g(Y)=g(1)+g(−1)2+g(1)−g(−1)2Y; hence this two-dimensional finite basis spans L2(ρ) for this particular law.

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

Three-input degree-two chaos uses ten total-degree modes versus twenty-seven tensor modes

Example

For three independent uniform inputs on [−1,1] with admissible cutoff p=(2,2,2), a total-degree order-two chaos basis has ten modes, while the full coordinatewise degree-two tensor basis has twenty-seven modes. A tensor Gaussian rule with three nodes in each coordinate also uses twenty-seven node evaluations.

Facts & Assumptions

Given: Three independent uniform inputs on [−1,1], cutoffs pj=2, total-degree order s=2, and a three-node Gaussian rule for each marginal.

[F1]

Total-degree and hyperbolic-cross chaos index sets defines the cutoff total-degree set by coordinate sum and the tensor box by coordinatewise cutoffs.

[F2]

The stated chaos index sets are finite and contain zero confirms the specified finite sets are legitimate index sets containing zero.

[F3]

Tensor-product Gaussian quadrature preserves coordinatewise exactness gives exactly ∏jmj distinct nodes for a tensor rule with coordinate orders mj.

Verification

1.1F1F2givenalgebra

For one uniform marginal, the moment Gram matrix through degree two is (101/301/301/301/5). Its quadratic form at (c0,c1,c2) is (c0+c2/3)2+c12/3+4c22/45, which is positive for every nonzero vector; all required moments are finite on [−1,1]. Thus the cutoff is admissible. In three coordinates, the total-degree set has one zero multi-index, three degree-one indices, three indices 2ej, and three indices ei+ej with i<j. These are disjoint and exhaust the nonnegative triples with sum at most two, so its cardinality is 1+3+3+3=10.

2.1F1F3step 1.1algebra∎

The full degree-two tensor box has 3 choices in each of three coordinates, hence 33=27 multi-indices. The three-node Gaussian rules are defined for the positive uniform measures on [−1,1]; their tensor rule with m1=m2=m3=3 has 33=27 distinct nodes by [F3]. Thus in this example the total-degree basis uses ten modes compared with twenty-seven tensor modes and node evaluations.