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

1 · Prerequisites

2 · Summary

Finite product-law basis

The input is a finite family of independent real random variables with a specified product law and an explicit admissible moment cutoff. Gram–Schmidt gives the law-matched finite univariate polynomials; their tensor products are orthonormal by product integration. Total-degree and hyperbolic-cross truncations are intersected with the declared cutoff box. The construction proves finite orthogonality only. Polynomial completeness requires a separate law-specific density hypothesis, and moments alone do not supply it.

Projection and coefficient quadrature

For any finite chaos space, the projection leaves an exact orthogonal residual. Its squared norm, mean and variance retain that residual, so no completeness premise is hidden in Parseval-style identities. A cubature coefficient estimator, using a representative evaluable at its nodes, splits into projection error and coefficient quadrature error. Tensor Gaussian exactness applies when each marginal rule integrates the coordinate degrees of every product integrand; the coefficient result here assumes a polynomial input and the stated node count. The Smolyak bound applies only to the uniform cube when each coefficient integrand satisfies the supplied mixed fourth-derivative and endpoint hypotheses.

Christoffel-weighted least squares

The algorithm samples from the normalized Christoffel density, weights by the reciprocal leverage, and returns coefficients only when the empirical Gram spectrum is in [1/2,3/2]. The locally proved matrix concentration argument gives this event with probability at least 1−δ when M≥12∣Λ∣log⁡(2∣Λ∣/δ). On the event, the fit error separates into the finite projection residual and the weighted sampled residual. This is a least-squares guarantee; no universal aliasing or collocation-equals-Galerkin statement is made.

Affine random diffusion and Galerkin approximation

For bounded product input, an affine coefficient uniformly bounded above and below for every supported parameter, and bounded affine forcing F(y)=f0+∑jyjfj with fj∈V∗, the pointwise weak solution is Lipschitz in the parameter and defines a Bochner L2(H01) solution. Countable Choice is used through the stated Sobolev, Bochner and Lax–Milgram interfaces. Integrating the form preserves its exact continuity and coercivity constants, so a finite tensor Galerkin space whose chaos indices lie in the declared admissible cutoff box satisfies Céa's estimate with factor a∗/a∗. The finite-element rate is stated only on a shape-regular matching affine mesh and when the solution has an exact finite chaos expansion with spatially regular coefficients and a global conforming interpolant assembled from a fixed reference element with bounded degrees of freedom on the required Sobolev class. No arbitrary-input spectral rate is claimed.

The proof items preserve the law-specific and regularity hypotheses in Completeness and spectral rates require law-specific hypotheses.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Finite product-law polynomial-chaos input data

Definition

Fix an integer d≥1, independent real random variables Y1,…,Yd with marginal Borel probability laws ρ1,…,ρd, and a degree cutoff vector p=(p1,…,pd)∈N0d. Their joint law is ρ=ρ1⊗⋯⊗ρd on Rd, as in Independent random elements have product joint law. For a Borel probability law ρj on R, define supp⁡(ρj):={x∈R:ρj(U)>0 for every open U∋x}. The complement is a union of zero-measure members of the countable rational interval basis, so countable additivity gives ρj(supp⁡(ρj))=1. Set Γ=∏j=1dsupp⁡(ρj) and give it the trace Borel sigma-algebra from Rd. The product rectangle formula gives ρ(Γ)=1. Whenever the measure space is written as (Γ,B(Γ),ρ), ρ denotes the restriction of the product law on Rd to B(Γ); it is therefore a probability measure. The product rectangle formula also identifies this restriction with the finite product of the marginal laws restricted to their supports. The cutoff vector p is admissible when, for every j=1,…,d, ∫∣y∣2pj dρj(y)<∞ and the monomial Gram matrix Gj=(∫yr+s dρj(y))0≤r,s≤pj is positive definite, meaning cTGjc>0 for each nonzero c∈Rpj+1. Throughout the pair, assume the selected cutoff vector is admissible. The admissible degree box is {α∈N0d:0≤αj≤pj for every j}. Admissibility gives a finite inner product on each stated polynomial space. It is only a finite-degree condition; it does not assert that polynomials are dense in any L2(ρj).

RemarkRemark: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Completeness and spectral rates require law-specific hypotheses

Remarks

The finite moment and Gram hypotheses in Finite product-law polynomial-chaos input data construct only the declared finite polynomial family. Completeness in L2(ρ) requires a separate density proof for that law; no such conclusion is inferred from moments alone. Likewise, an exponential or algebraic spectral rate requires quantified mixed-derivative or analyticity bounds. The weighted least-squares procedure in this page is a separately defined collocation method. No general equality with a spectral Galerkin method is asserted; exact agreement is limited to the polynomial degree conditions stated in the Gaussian-quadrature corollary.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Total-degree and hyperbolic-cross chaos index sets

Definition

For d inputs with admissible cutoff vector p=(p1,…,pd) from Finite product-law polynomial-chaos input data, the cutoff total-degree set of order s≥0 and cutoff hyperbolic-cross set of threshold N≥1 are Λs,pTD={α∈N0d:0≤αj≤pj, ∑j=1dαj≤s},ΛN,pHC={α∈N0d:0≤αj≤pj, ∏j=1d(αj+1)≤N}, The cutoff vector prevents either set from requesting polynomials above the moment degree declared in Finite product-law polynomial-chaos input data. Both are finite and contain zero. An arbitrary finite index set used below is denoted by Λ; whenever a downward-closed set is required, this means α∈Λ and 0≤βj≤αj for every j imply β∈Λ.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Bochner L2 space for a finite product-law input

Definition

Let (Γ,B(Γ),ρ) be the finite product-law probability space of Finite product-law polynomial-chaos input data, and let V be a separable real Hilbert space. Scalar integrals involving strongly measurable maps are taken using measurable versions: if simple maps converge to U outside a measurable null set N, set U~=U off N and U~=0 on N, and set the approximants to zero on N. They then converge everywhere to U~. For every open set O⊆V, convergence expresses U~−1(O) through countably many eventual bounds on distances of the simple maps to V∖O, so this version is Borel measurable. Any two such versions agree outside a measurable null set. In particular, norm-square and pairing integrals below mean the integrals of ∥U~∥V2 and (U~,W~)V; their values are independent of the versions. This convention preserves arbitrary null-set values of strongly measurable maps and does not complete the underlying probability space.

Define Lρ2(V) to be the space of strongly measurable maps U:Γ→V for which ∫Γ∥U(y)∥V2 dρ(y)<∞, modulo equality ρ-almost everywhere. Its inner product is (U,W)Lρ2(V)=∫Γ(U(y),W(y))V dρ(y).

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Positive moment Gram matrices produce orthonormal polynomial families

Statement

Let ρj be one factor law with admissible degree pj as in Finite product-law polynomial-chaos input data. The monomial classes 1,y,…,ypj are linearly independent in L2(ρj). Applying the finite Gram–Schmidt recursion to this ordered list gives real orthonormal polynomials ϕj,0,…,ϕj,pj, where ϕj,k has degree k, positive leading coefficient, and ϕj,0=1.

Facts & Assumptions

Given: A probability law ρj with finite 2pj moment and positive-definite monomial Gram matrix.

[F1]

Finite product-law polynomial-chaos input data states that for every nonzero coefficient vector c, the quadratic form cTGjc is strictly positive.

[F2]

The finite 2pj moment makes every monomial of degree at most 2pj integrable: for 0≤q≤2pj, ∣y∣q≤1+∣y∣2pj.

[F3]

On a real inner-product space, Gram–Schmidt turns every finite independent list into an orthonormal list with the same successive spans constructs the finite orthonormal list by recursive subtraction and normalization, preserving each successive span.

[F4]

The norm ∥v∥=⟨v,v⟩ induced by a real or complex inner product defines normalization by the positive norm of each nonzero residual.

Proof

1.1givenF1F2algebra

Let Ppj be the real vector space spanned by the formal monomials 1,y,…,ypj. For q,r∈Ppj define ⟨q,r⟩ρj:=∫q(y)r(y) dρj(y). Every product qr has degree at most 2pj and is integrable by [F2], so the pairing is finite; linearity of the integral makes it bilinear and symmetric. If q(y)=∑r=0pjcryr, then ⟨q,q⟩ρj=cTGjc, which is positive for each nonzero formal polynomial by [F1]. Thus this is an inner product on Ppj.

2.1step 1.1F1F2F3algebra

Every q∈Ppj has finite squared integral by [F2], so it defines an L2(ρj) class. If that class is zero, then q=0 almost everywhere and ∫q2 dρj=0; by [F1] its coefficient vector must be zero. Thus the class map is injective and the monomial classes are linearly independent. The formal monomials are also independent by uniqueness of their coefficient lists, so [F3] applies to this list in Ppj. Its residual at stage k is yk minus a polynomial of degree at most k−1, so it has degree k and leading coefficient 1.

3.1givenF3F4step 2.1algebra∎

Each residual is nonzero in Ppj by its degree and leading coefficient, so [F4] makes its norm strictly positive. The normalized residual is orthogonal to the preceding polynomials and has positive leading coefficient. At k=0, the residual is 1 and its norm is ∫1 dρj=1 because ρj is a probability law; hence ϕj,0=1. This proves the stated finite orthonormal family.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Finite orthonormal polynomial tensor basis

Definition

Let ϕj,k be the Gram–Schmidt polynomials from Positive moment Gram matrices produce orthonormal polynomial families, and let Λ be a finite subset of the admissible degree box in Finite product-law polynomial-chaos input data. For α=(α1,…,αd)∈Λ, define ψα(y1,…,yd)=∏j=1dϕj,αj(yj). Here L2(ρ) uses the full-mass restriction to Γ specified in Finite product-law polynomial-chaos input data, which the product rectangle formula identifies with the product of the restricted marginal laws. The finite polynomial-chaos space is PΛ=span⁡{ψα:α∈Λ} inside L2(ρ). Whenever 0∈Λ (in particular, for the stated total-degree and hyperbolic-cross sets), the family contains the constant mode ψ0=1. No density of PΛ in L2(ρ) is part of this definition.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Uniformly elliptic affine random diffusion model

Definition

Let D⊂Rm be a bounded polyhedral open set and V=H01(D;R) with norm ∥v∥V=∥∇v∥L2(D). The zero-boundary Sobolev energy space is a separable Hilbert space supplies the separable Hilbert structure under Countable Choice; the gradient norm is equivalent to its Sobolev norm there.

Let Y=(Y1,…,Yd) have the product law ρ of Finite product-law polynomial-chaos input data, and assume its support Γ is bounded, so ∣yj∣≤Rj<∞ for every y∈Γ. For real coefficient functions a0,…,ad∈L∞(D) define a(x,y)=a0(x)+∑j=1dyjaj(x). Assume constants 0<a∗≤a∗<∞ satisfy, for every y∈Γ, a∗≤a(x,y)≤a∗ for almost every x∈D. This explicit all-parameter condition ensures the pointwise variational problem is well-posed for every stated parameter, not merely almost every one. Let F(y)=f0+∑j=1dyjfj with fj∈V∗.

The pointwise weak form is ay(u,v)=∫Da(x,y)∇u(x)⋅∇v(x) dx=F(y)(v),v∈V. The Bochner weak form uses the bilinear form A(U,W)=∫Γay(U(y),W(y)) dρ(y) and the functional F(W)=∫ΓF(y)(W(y)) dρ(y) on Lρ2(V) from Bochner L2 space for a finite product-law input.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

The stated chaos index sets are finite and contain zero

Statement

For every admissible cutoff vector p∈N0d, order s≥0, and threshold N≥1, the sets Λs,pTD and ΛN,pHC of Total-degree and hyperbolic-cross chaos index sets are finite and contain 0.

Facts & Assumptions

Given: d≥1, an admissible cutoff vector p∈N0d, s≥0, and N≥1, with the two index-set definitions above.

[F1]

Total-degree and hyperbolic-cross chaos index sets defines the sets by coordinate sums and products of positive integers.

Proof

1.1givenF1algebra

If α∈Λs,pTD, then every coordinate satisfies 0≤αj≤pj by the cutoff condition in [F1]. Hence this set is a subset of the finite box ∏j{0,…,pj}.

2.1givenF1step 1.1algebra∎

The same cutoff condition places ΛN,pHC in the finite box ∏j{0,…,pj}. Since 0≤s and 1≤N, zero satisfies both defining inequalities. Thus both sets are finite and contain zero.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Finite-input Bochner L2 of a separable Hilbert space is Hilbert

Statement

Assume Countable Choice. For the space Lρ2(V) of Bochner L2 space for a finite product-law input, the displayed integral pairing is a well-defined real inner product, its norm is ∥U∥Lρ2(V)=(∫Γ∥U(y)∥V2 dρ(y))1/2, and this norm is complete. Moreover, finite-valued strongly measurable functions are dense in this space.

Facts & Assumptions

Given: Countable Choice, a finite product Borel probability space (Γ,B(Γ),ρ), and a separable real Hilbert space V.

[F1]

Bochner L2 space for a finite product-law input defines the elements as strongly measurable V-valued classes with square-integrable norm, modulo equality almost everywhere.

[F2]

Hilbert space gives completeness of V and the positive-definite inner product (⋅,⋅)V.

[F3]

Cauchy-Schwarz inequality for L2 gives the scalar integral estimate ∫fg dρ≤∥f∥2∥g∥2 for nonnegative f,g∈L2(ρ).

[F4]

Minkowski's inequality and monotone convergence for nonnegative integrals are Minkowski's inequality for integrals, including p=∞ and Monotone convergence for the integral.

[F5]

A Borel map into a separable Banach space on a probability space is strongly measurable (A Borel map into a separable Banach space is strongly measurable).

[F6]

Dominated convergence applies to integrable scalar majorants (Dominated convergence).

[A1]

Countable Choice permits selecting a subsequence of a Cauchy sequence with prescribed summable successive distances (The Axiom of Countable Choice (ACω)).

[A2]

Countable Choice also permits selecting strongly measurable representatives and their simple-approximation witnesses for a countable sequence of equivalence classes; replacing each representative on its measurable null exceptional set by zero gives a Borel version.

Proof

1.1F1F2F3given

For U,W∈Lρ2(V), use the Borel representatives obtained by the null-set modification in [F1], and denote them again by U,W. Their norm functions and pairings are measurable. Pointwise Cauchy–Schwarz gives ∣(U(y),W(y))V∣≤∥U(y)∥V∥W(y)∥V. Integrating and applying [F3] shows that the product is integrable and the pairing is finite. Changing either representative on a null set does not change the integral. The pairing is bilinear and symmetric. If its value on (U,U) is zero, then for each integer n≥1 the set En={y:∥U(y)∥V≥1/n} has measure zero, since 0=∫∥U∥2≥ρ(En)/n2; their countable union contains every point where U≠0. Thus the class of U is zero, proving positive definiteness.

1.2F1F4A1A2given

Let (Un) be Cauchy in the displayed norm. By [A1] select a subsequence (Unk) with ∥Unk+1−Unk∥Lρ2(V)≤2−k. By [A2], choose strongly measurable representatives for these countably many classes and simple-approximation witnesses for each representative; replace each representative by zero on its measurable null exceptional set, obtaining Borel versions of the same classes. Put dk(y)=∥Unk+1(y)−Unk(y)∥V and sm=∑k=1mdk. Minkowski [F4] gives ∥sm∥2≤∑k=1m2−k≤1. The functions sm2 increase, so monotone convergence [F4] yields ∫(lim⁡msm)2 dρ≤1. Therefore ∑kdk(y)<∞ outside a measurable null set; otherwise its square integral would be infinite on a set of positive measure.

2.1F2F5F6step 1.2

Let E={y:∑kdk(y)<∞}, a Borel set of full measure by step 1.2. On E, (Unk(y)) is Cauchy in V and hence has a limit by [F2]. Define U(y) to be this limit on E and zero on Ec. The Borel maps equal to Unk on E and zero on Ec converge pointwise everywhere to U; their pointwise limit is Borel measurable (equivalently, distances to a countable dense subset of V are Borel limits). By [F5], U is strongly measurable. If gm=∑k≥mdk, then gm↓0 almost everywhere, gm≤lim⁡ksk, and the latter is in L2 by step 1.2. Dominated convergence [F6] gives ∥gm∥2→0, while ∥U−Unm∥V≤gm almost everywhere on E. Thus Unm→U in Lρ2(V).

3.1step 1.2step 2.1algebra

Since (Un) is Cauchy and its subsequence converges to U, the full sequence converges to U: for ε>0, choose N so ∥Un−Um∥<ε/2 for m,n≥N, then choose nk≥N with ∥Unk−U∥<ε/2; the triangle inequality gives ∥Un−U∥<ε for n≥N. This proves completeness.

4.1F1F6∎

Let U∈Lρ2(V) and choose a strongly measurable representative with simple approximants and measurable null exceptional set as in the definition. Change the representative and approximants to zero on that set; the resulting representative is measurable and the finite-valued simple approximants converge to it everywhere. Truncate each approximant to zero where its norm exceeds 2∥U(y)∥V. The truncation set is measurable; the truncated functions remain finite-valued simple functions, converge to U almost everywhere, and their squared errors are bounded by 9∥U(y)∥V2. Dominated convergence [F6] gives convergence in Lρ2(V), proving density.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicableOpen item page →

Christoffel-weighted least-squares polynomial collocation

Definition

Let Λ be finite, contain 0, and let ψ=(ψα)α∈Λ be the real orthonormal basis of Finite orthonormal polynomial tensor basis. Set N=∣Λ∣ and KΛ(y)=∑α∈Λ∣ψα(y)∣2. The algorithm takes an evaluable real function u, a positive integer sample count M, and independent samples X1,…,XM from the probability law dν=(KΛ/N) dρ. It forms G=1M∑i=1MNKΛ(Xi)ψ(Xi)ψ(Xi)T,b=1M∑i=1MNKΛ(Xi)u(Xi)ψ(Xi). If every eigenvalue of G lies in [1/2,3/2], return the unique coefficient vector c=G−1b and polynomial u^=∑α∈Λcαψα. Otherwise return unstable-sample and no coefficients. The weighted empirical objective minimized on the accepted branch is 1M∑i=1MNKΛ(Xi)∣u(Xi)−p(Xi)∣2, over p∈PΛ.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Finite polynomial-chaos orthogonal projection

Definition

For real u∈L2(ρ) and a finite subset Λ of the admissible degree box, with (ψα)α∈Λ as in Finite orthonormal polynomial tensor basis, define cα=⟨u,ψα⟩L2(ρ)=∫u(y)ψα(y) dρ(y),PΛu=∑α∈Λcαψα. The scalar integral pairing is choice-free: for representatives f,g of classes in L2(ρ), Cauchy–Schwarz makes fg integrable, and the integral is unchanged when either representative is changed on a null set. Its bilinearity follows from linearity of the integral and its symmetry from commutativity of multiplication; moreover ∫f2 dρ=∥[f]∥22, so it is positive definite on the quotient. These facts use only the integral pairing, not completeness of L2(ρ). The displayed finite sum is the orthogonal projection onto PΛ of Finite orthonormal polynomial tensor basis.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Affine diffusion forms are well-defined on Bochner L2

Statement

For the model of Uniformly elliptic affine random diffusion model, let H=Lρ2(V). For U,W∈H, the scalar functions y↦ay(U(y),W(y)) and y↦F(y)(W(y)) have measurable integrable versions in the convention of Bochner L2 space for a finite product-law input, so A(U,W) and F(W) are well-defined on equivalence classes. They satisfy ∣A(U,W)∣≤a∗∥U∥H∥W∥H,A(U,U)≥a∗∥U∥H2, and ∣F(W)∣≤∥F∥Lρ2(V∗)∥W∥H<∞.

Facts & Assumptions

Given: A bounded-support product law, the affine coefficient and forcing, and the uniform coefficient bounds in Uniformly elliptic affine random diffusion model.

[F1]

For every y∈Γ, the pointwise form satisfies ∣ay(v,w)∣≤a∗∥v∥V∥w∥V and ay(v,v)≥a∗∥v∥V2; F(y)=f0+∑jyjfj is bounded and affine (Uniformly elliptic affine random diffusion model).

[F2]

Strongly measurable maps are almost-everywhere limits of measurable finite-valued simple maps (Strongly measurable Banach-valued function).

[F3]

The scalar integral Cauchy--Schwarz inequality is Cauchy-Schwarz inequality for L2.

[F4]

Bochner L2 space for a finite product-law input identifies H with strongly measurable square-integrable maps modulo almost-everywhere equality.

Proof

1.1F1F2givenalgebra

Choose finite-valued measurable simple maps Un,Wn converging respectively to U,W almost everywhere, using [F2]. On every intersection of their finite partition sets, y↦ay(Un(y),Wn(y)) is an affine continuous scalar function of y by the displayed coefficient formula in [F1]. It is therefore measurable. On the common full-measure set where both approximations converge, continuity of the bounded bilinear form gives convergence to ay(U(y),W(y)). Setting the scalar function to zero on the common measurable exceptional null set gives a measurable version; an arbitrary modification on that set need not be measurable. The integral uses this version, as in [F4].

1.2F1F2given

For a finite-valued simple Wn converging almost everywhere to W, the scalar function F(y)(Wn(y)) is measurable on each partition piece because F(y) is affine continuous into the finite-dimensional span of f0,…,fd. Its pointwise limit on the full-measure convergence set is F(y)(W(y)), so setting the limit to zero on the measurable exceptional null set gives a measurable version in the convention [F4]. Since ∣yj∣≤Rj, ∥F(y)∥V∗≤∥f0∥V∗+∑jRj∥fj∥V∗; hence F∈Lρ2(V∗).

2.1F1F3F4step 1.1

The pointwise bound [F1] gives ∣ay(U(y),W(y))∣≤a∗∥U(y)∥V∥W(y)∥V. Both norm functions are square-integrable, so [F3] makes this majorant integrable. The form integral is finite and depends only on the almost-everywhere classes by [F4].

2.2F3step 1.2

Pointwise duality gives ∣F(y)(W(y))∣≤∥F(y)∥V∗∥W(y)∥V. Apply [F3] to obtain the stated integrability and functional bound.

3.1F1F3F4step 2.1∎

Integrating the pointwise coercivity bound [F1] gives A(U,U)≥a∗∫∥U(y)∥V2 dρ=a∗∥U∥H2. Integrating the pointwise continuity bound and applying [F3] as in step 2.1 gives ∣A(U,W)∣≤a∗∥U∥H∥W∥H. These estimates prove the remaining assertions.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Independent polynomial-chaos tensor products are orthonormal

Statement

Let ρ=⊗j=1dρj and form ψα from Finite orthonormal polynomial tensor basis for indices in the admissible degree box. Then each ψα belongs to L2(ρ) and ∫Γψα(y)ψβ(y) dρ(y)={1,α=β,0,α≠β. In particular, the family indexed by any finite subset Λ of the box is orthonormal; when 0∈Λ, it includes the constant mode ψ0=1.

Facts & Assumptions

Given: Independent real inputs with product law ρ, admissible one-dimensional moment data, and indices α,β in the finite degree box.

[F1]

Positive moment Gram matrices produce orthonormal polynomial families gives ∫ϕj,kϕj,l dρj=δkl and ϕj,0=1.

[F2]

Independent random elements have product joint law identifies the joint law with ⊗jρj.

[F3]

Tonelli and Fubini hold for the uncompleted product of sigma-finite measure spaces (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product, Fubini's theorem for L^1 functions on a sigma-finite product); finite iteration gives factorization for a finite product.

[F4]

The product law on Γ is the full-mass restriction specified in Finite orthonormal polynomial tensor basis, so Tonelli and Fubini apply to the product of the restricted marginal laws.

Proof

1.1F1F2F3F4given

For α,β in the admissible box set gj(yj)=ϕj,αj(yj)ϕj,βj(yj). Each gj is integrable because it is a polynomial of degree at most 2pj and the 2pj moment is finite. By [F4], the restricted measure on Γ is the product of the restricted marginal laws. Repeated Tonelli [F3] first gives ∫Γ∏j∣gj(yj)∣ dρ=∏j=1d∫∣gj∣ dρj<∞; repeated Fubini [F3] then gives ∫Γ∏jgj(yj) dρ=∏j=1d∫gj dρj. The product-law statement [F2] identifies the ambient finite product measure with the joint law, and [F4] restricts it to Γ.

2.1F1step 1.1algebra∎

The factorization in step 1.1 and univariate orthonormality [F1] give ∫Γψαψβ dρ=∏j=1dδαjβj. This product is one exactly when every coordinate agrees, and zero otherwise; with β=α it also shows ψα∈L2(ρ). Multiplying ϕj,0=1 over the finitely many coordinates gives ψ0=1, so whenever 0∈Λ the finite family includes this constant mode.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Quadrature estimates of polynomial-chaos coefficients

Definition

Let Λ be a finite subset of the admissible degree box, with (ψα)α∈Λ as in Finite orthonormal polynomial tensor basis, and let Q be any declared finite cubature functional Q(g)=∑q=1Jwqg(y(q)) whose nodes lie in the domain of evaluation of g. For an evaluable real function u, define the quadrature coefficient and the resulting polynomial by c^α:=Q(uψα),P^Λu:=∑α∈Λc^αψα. When u represents an element of L2(ρ), its exact coefficients cα and projection PΛu are those of Finite polynomial-chaos orthogonal projection. The quadrature quantities use the specified node values of u and need not be invariant under changes on null sets. This definition gives no accuracy claim for a general cubature rule.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Christoffel sampling is normalized and its weighted Gram has mean identity

Statement

Let Λ and KΛ be as in Christoffel-weighted least-squares polynomial collocation, with N=∣Λ∣≥1. Then KΛ≥1 pointwise, the measure dν=(KΛ/N)dρ is a probability measure, and the random matrix A(X)=NKΛ(X)ψ(X)ψ(X)T,X∼ν, satisfies A⪰0, EνA=IN, and ∥A∥op≤N almost surely.

Facts & Assumptions

Given: A finite real orthonormal polynomial family indexed by Λ, with 0∈Λ, and its Christoffel kernel.

[F1]

Christoffel-weighted least-squares polynomial collocation defines KΛ=∑α∈Λ∣ψα∣2 and the rank-one matrix A.

[F2]

Independent polynomial-chaos tensor products are orthonormal gives ∫ψαψβ dρ=δαβ and ψ0=1.

[F3]

Integration is linear on integrable functions (The Lebesgue integral is linear on L1(μ)); the finite sums defining KΛ can therefore be integrated term by term.

[F4]

Cauchy-Schwarz inequality for L2 makes each product ψαψβ integrable. Since dν=(KΛ/N)dρ, integration against ν is integration against that density for nonnegative measurable functions, and for signed functions once absolute integrability is established.

Proof

1.1F1F2F3algebra

Since 0∈Λ and ψ0=1, KΛ(y)≥1. By [F2]–[F3], ∫KΛ dρ=∑α∈Λ∫∣ψα∣2 dρ=N. Therefore dν=(KΛ/N)dρ is a probability measure and the denominator in [F1] is positive everywhere.

2.1F1F2F4step 1.1algebra∎

For each pair α,β, [F4] and ∫∣ψαψβ∣ dρ≤1 show ∫∣Aαβ∣ dν=∫∣ψαψβ∣ dρ≤1, so the entry is integrable under ν. Using the signed density identity in [F4], its expectation is ∫Γψα(y)ψβ(y) dρ(y)=δαβ by [F2], hence EνA=IN. The rank-one outer product is positive semidefinite and has operator norm N∥ψ(y)∥22/KΛ(y)=N, proving the remaining assertions.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Affine random diffusion has a measurable Bochner solution

Statement

Under the hypotheses of Uniformly elliptic affine random diffusion model, for each y∈Γ there is a unique u(y)∈V satisfying the pointwise weak problem. The map y↦u(y) is Lipschitz on the bounded parameter set, strongly measurable, and belongs to Lρ2(V). It is also the unique solution of the Bochner weak equation A(u,W)=F(W)(W∈Lρ2(V)).

Facts & Assumptions

Given: A bounded product parameter set, affine coefficient and forcing, and constants 0<a∗≤a∗ as in Uniformly elliptic affine random diffusion model.

[F1]

The zero-boundary Sobolev energy space is a separable Hilbert space supplies the separable real Hilbert structure on V=H01(D) under Countable Choice.

[F2]

Pointwise ay is a bounded real bilinear form, with ∣ay(v,w)∣≤a∗∥v∥V∥w∥V and ay(v,v)≥a∗∥v∥V2, by the coefficient bounds in Uniformly elliptic affine random diffusion model.

[F3]

The real bilinear Lax–Milgram theorem under Countable Choice gives a unique solution and ∥u(y)∥V≤∥F(y)∥V∗/a∗ (The Lax--Milgram theorem, The Axiom of Countable Choice (ACω)).

[F4]

A Borel map into the separable Banach space V is strongly measurable (A Borel map into a separable Banach space is strongly measurable).

[F5]

Affine diffusion forms are well-defined on Bochner L2 supplies measurability, integrability, continuity, and coercivity of A and boundedness of F on Lρ2(V).

[F6]

Lρ2(V) is a Hilbert space and finite-valued simple functions are dense (Finite-input Bochner L2 of a separable Hilbert space is Hilbert).

Proof

1.1F1F2F3given

For each y∈Γ, [F2] verifies the boundedness and coercivity hypotheses of [F3], while F(y)=f0+∑jyjfj is a bounded functional. Lax–Milgram gives a unique u(y)∈V and ∥u(y)∥V≤Fmax⁡/a∗, where Fmax⁡:=sup⁡y∈Γ∥F(y)∥V∗<∞ because Γ is bounded.

2.1F2step 1.1algebra

For y,z∈Γ, put d=u(y)−u(z) and subtract the weak equations: ay(d,v)=(F(y)−F(z))(v)+(az−ay)(u(z),v). The affine formulas give ∥F(y)−F(z)∥V∗≤CF∥y−z∥1 and ∣az(v,w)−ay(v,w)∣≤Ca∥y−z∥1∥v∥V∥w∥V, where CF=∑j∥fj∥V∗ and Ca=∑j∥aj∥L∞(D). Set v=d and use [F2] and the bound ∥u(z)∥V≤Fmax⁡/a∗ from step 1.1. If d≠0, divide the resulting coercive inequality by ∥d∥V; if d=0 the conclusion is immediate. This proves ∥u(y)−u(z)∥V≤a∗−1(CF+CaFmax⁡/a∗)∥y−z∥1. Thus u is Lipschitz and Borel measurable.

2.2F1F4step 1.1

Since V is separable, [F4] makes u strongly measurable. The uniform bound in step 1.1 and ρ(Γ)=1 give ∫Γ∥u(y)∥V2 dρ(y)≤(Fmax⁡/a∗)2<∞, so u∈Lρ2(V).

3.1F5step 2.2

For a finite-valued simple test W(y)=∑i=1m1Ei(y)vi, integrate the pointwise weak identity for each vi over Ei and sum; [F5] ensures the scalar integrands are measurable and integrable. This gives A(u,W)=F(W).

4.1F5F6step 3.1algebra∎

The bounds in [F5] make both sides continuous on Lρ2(V). Finite-valued simple tests are dense by [F6], so step 3.1 extends to every W. If two Bochner solutions existed, testing their difference against itself and using the coercivity bound in [F5] would force their difference to be zero.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Finite chaos projection, Parseval identity, mean, and variance

Statement

Let Λ be finite, contain 0, and let the real basis (ψα)α∈Λ be as in Finite orthonormal polynomial tensor basis. For real u∈L2(ρ) set cα=⟨u,ψα⟩ and PΛu=∑α∈Λcαψα as in Finite polynomial-chaos orthogonal projection. Then ∥u∥L2(ρ)2=∑α∈Λcα2+∥u−PΛu∥L2(ρ)2. The residual is orthogonal to PΛ, E[u]=c0, and Var⁡(u)=∑α∈Λ∖{0}cα2+∥u−PΛu∥L2(ρ)2. Here Var⁡(u)=E[(u−Eu)2]; no completeness of the polynomial family is assumed.

Facts & Assumptions

Given: A finite real orthonormal polynomial family containing ψ0=1 and u∈L2(ρ).

[F1]

Finite polynomial-chaos orthogonal projection defines cα and PΛu by the displayed finite sum.

[F2]

Independent polynomial-chaos tensor products are orthonormal gives ⟨ψα,ψβ⟩=δαβ and ψ0=1.

[F3]

Finite polynomial-chaos orthogonal projection establishes the choice-free integral inner product and its norm-square identity; bilinearity and symmetry give the finite orthogonal norm identities by expansion, without completeness.

Proof

1.1F1F2algebra

For each β∈Λ, bilinearity and [F2] give ⟨u−PΛu,ψβ⟩=cβ−∑α∈Λcαδαβ=0. Thus the residual is orthogonal to every basis vector and hence to their finite span.

2.1F2F3step 1.1algebra

Write u=PΛu+(u−PΛu). By step 1.1 the two terms are orthogonal, so bilinearity and symmetry from [F3] give ∥u∥22=∥PΛu∥22+∥u−PΛu∥22. Expanding the finite sum with [F2] gives ∥PΛu∥22=∑α,β∈Λcαcβδαβ=∑α∈Λcα2. This proves the norm identity directly from the integral pairing.

3.1F1F2F3step 1.1algebra∎

Since ψ0=1, c0=⟨u,1⟩=E[u]. The centered variable decomposes as u−E[u]=∑α∈Λ∖{0}cαψα+(u−PΛu). The two summands are orthogonal by step 1.1, and expansion of the integral norm square as in step 2.1, followed by [F2], gives the displayed variance identity.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Tensor products are dense in Bochner L2 under scalar and spatial density

Statement

Let S be the scalar linear span of a declared polynomial-chaos family in L2(ρ) and let V0 be a linear subspace dense in the separable real Hilbert space V. Assume separately that S is dense in L2(ρ); this law-specific completeness hypothesis is not inferred from finite moments. Then the algebraic tensor span span⁡{ s(⋅)v:s∈S, v∈V0 } is dense in Lρ2(V).

Facts & Assumptions

Given: A finite product probability space, the stated scalar density hypothesis, and a dense linear spatial subspace V0⊆V.

[F1]

Bochner L2 space for a finite product-law input defines Lρ2(V) using strongly measurable square-integrable maps.

[F2]

Dominated convergence gives convergence of scalar integrals for pointwise almost-everywhere convergence under an integrable measurable majorant.

[F3]

Scalar density of S in L2(ρ) is an explicit hypothesis in Given, not a conclusion of the finite-basis orthonormality theorem.

[F4]

Density of V0 in V is an explicit hypothesis in Given.

[F5]

Strongly measurable Banach-valued function characterizes strong measurability through simple-map approximation; a scalar measurable function times a fixed vector is strongly measurable.

Proof

1.1F1F2F5givenchoose

Fix U∈Lρ2(V) and ε>0. By [F1] and [F5], choose a simple approximation sequence and replace it and U by zero on their measurable null exceptional set. Write Sn for the resulting simple maps, which converge everywhere to the Borel representative U. Set Tn=Sn1{∥Sn∥V≤2∥U∥V}. The truncation sets are measurable and Tn is finite-valued simple. At U=0 it is zero; at every other point it eventually equals Sn, so Tn→U. Since ∥Tn−U∥V2≤9∥U∥V2, [F2] gives ∥Tn−U∥Lρ2(V)→0. Choose one such map S=∑k=1m1Ekvk with error below ε/2, taking m≥1 by allowing a zero value. It remains to approximate its finitely many terms with total error below ε/2.

2.1F1F3F4F5step 1.1algebra

For each k, use [F3] and [F4] to choose sk∈S and wk∈V0 with ∥1Ek−sk∥L2(ρ)∥vk∥V+∥sk∥L2(ρ)∥vk−wk∥V<ε/(2m). Such choices are possible by first making the scalar error arbitrarily small, which bounds ∥sk∥2≤∥1Ek∥2+∥1Ek−sk∥2, and then making the vector error small. The product norm estimate ∥1Ekvk−skwk∥Lρ2(V)≤∥1Ek−sk∥2∥vk∥V+∥sk∥2∥vk−wk∥V follows pointwise from the triangle inequality and then from scalar square-integral estimation. Each product is strongly measurable by [F5], so these are legitimate Bochner-space norms.

3.1step 1.1step 2.1algebra∎

The finite sum ∑k=1mskwk belongs to the displayed algebraic tensor span, and the triangle inequality with step 2.1 gives distance less than ε/2 from S. Together with step 1.1 its distance from U is less than ε. Since U and ε were arbitrary, the span is dense.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Projection and quadrature errors split in L2

Statement

Let u∈L2(ρ) be real, choose a representative u~ defined at every node of the finite cubature rule used below, let Λ be finite, and use the exact and quadrature coefficients from Finite polynomial-chaos orthogonal projection and Quadrature estimates of polynomial-chaos coefficients, with u~ as the evaluable input to that estimator. Then ∥u−P^Λu∥L2(ρ)2=∥u−PΛu∥L2(ρ)2+∑α∈Λ∣c^α−cα∣2. Since the finite sum equals ∥P^Λu−PΛu∥L2(ρ)2, the triangle inequality also gives ∥u−P^Λu∥L2(ρ)≤∥u−PΛu∥L2(ρ)+∥P^Λu−PΛu∥L2(ρ). Thus coefficient quadrature error and finite-space projection error remain separate even when no completeness statement is available.

Facts & Assumptions

Given: A finite real orthonormal family, u∈L2(ρ), and finite quadrature values c^α.

[F1]

Quadrature estimates of polynomial-chaos coefficients defines P^Λu using the finite basis sum.

[F2]

Finite polynomial-chaos orthogonal projection defines cα=⟨u,ψα⟩ and PΛu=∑α∈Λcαψα.

[F3]

Independent polynomial-chaos tensor products are orthonormal gives the orthonormality of the finite basis.

[F4]

Finite polynomial-chaos orthogonal projection gives the choice-free bilinear integral pairing inducing the L2 norm; the finite orthogonality identities follow by expansion.

[F5]

Cauchy-Schwarz inequality for L2 bounds ∫∣vw∣ dρ, and The modulus of an integral is bounded by the integral of the modulus bounds ∣∫vw dρ∣ by that integral. Expanding ∥v+w∥22 then gives the norm triangle inequality.

Proof

1.1F1F2F3F4algebra

For each β∈Λ, the coefficient formula [F2], orthonormality [F3], and bilinearity [F4] give ⟨u−PΛu,ψβ⟩=cβ−∑α∈Λcαδαβ=0. Thus u−PΛu is orthogonal to the finite span PΛ, including when Λ is empty. Subtracting the two finite expansions gives P^Λu−PΛu=∑α∈Λ(c^α−cα)ψα∈PΛ, so this difference is orthogonal to the residual.

2.1F3F4F5step 1.1algebra∎

The identity u−P^Λu=(u−PΛu)−(P^Λu−PΛu) is an orthogonal sum by step 1.1. Expanding its squared norm using [F4] gives ∥u−P^Λu∥2=∥u−PΛu∥2+∥P^Λu−PΛu∥2; orthonormality [F3] identifies the second term with ∑α∈Λ∣c^α−cα∣2. To obtain the final inequality, use [F5] to expand ∥v+w∥22 and deduce ∥v+w∥2≤∥v∥2+∥w∥2 for v=u−PΛu and w=PΛu−P^Λu.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Bounded-Christoffel sampling stabilizes the empirical Gram matrix

Statement

Let Λ, N=∣Λ∣≥1, and the independent Christoffel samples X1,…,XM be as in Christoffel-weighted least-squares polynomial collocation. Let G be its weighted empirical Gram matrix. For 0<δ<1, if M≥12Nlog⁡(2N/δ), then P{ spec⁡(G)⊆[1/2,3/2] }≥1−δ.

Facts & Assumptions

Given: A finite real orthonormal basis of size N≥1, independent Christoffel samples, and 0<δ<1.

[F1]

Christoffel sampling is normalized and its weighted Gram has mean identity gives rank-one matrices Ai⪰0 with EAi=IN and ∥Ai∥op≤N.

[F2]

Christoffel-weighted least-squares polynomial collocation specifies independent samples, hence the matrices formed from them are independent.

[F3]

Bounded independent matrix Bernstein bound from the trace exponential gives, for centered independent Hermitian summands bounded by R with variance bound v, the two-sided tail P{∥∑iBi∥op≥t}≤2Nexp⁡(−t2/(2(Mv+Rt/3))).

[F4]

Christoffel-weighted least-squares polynomial collocation defines G=M−1∑iAi.

Proof

1.1F1F2algebra

Put Bi=Ai−IN. Then EBi=0. Since 0⪯Ai⪯NIN, spectral calculus gives Ai2⪯NAi, and hence 0⪯EBi2=EAi2−IN⪯(N−1)IN⪯NIN. Also every eigenvalue of Ai lies in [0,N], so ∥Bi∥op≤N. These are the hypotheses of [F2] with R=v=N.

2.1F2F3F4step 1.1algebra

Apply [F3] to Y=∑i=1MBi with t=M/2. Direct substitution gives P{∥G−IN∥op>1/2}≤2Nexp⁡(−3M/(28N)), because G−IN=Y/M and (M/2)2/[2(MN+N(M/2)/3)]=3M/(28N).

3.1givenstep 2.1algebra∎

The sample-size condition makes the last bound at most 2Nexp⁡[−(9/7)log⁡(2N/δ)]=δ(δ/(2N))2/7≤δ, since 0<δ/(2N)<1. On the complementary event, for every unit vector x, ∣xT(G−IN)x∣≤∥G−IN∥op≤1/2; the Rayleigh quotient characterization therefore puts every eigenvalue of G in [1/2,3/2].

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Stochastic Galerkin coercivity and Cea quasi-optimality

Statement

Assume Countable Choice and the affine diffusion hypotheses of Uniformly elliptic affine random diffusion model. Let p be the selected admissible cutoff vector of the finite product-law input, and let Λ⊆{α∈N0d:0≤αj≤pj for all j} be finite. Let Vh⊂V be any finite-dimensional conforming spatial subspace. Define the stochastic Galerkin space VΛ,h:=span⁡{ ψα(⋅)v:α∈Λ, v∈Vh }⊂Lρ2(V). The Bochner form is continuous with constant a∗ and coercive with constant a∗. There is a unique UΛ,h∈VΛ,h satisfying A(UΛ,h,Wh)=F(Wh)(Wh∈VΛ,h), and, for the exact solution u of Affine random diffusion has a measurable Bochner solution, ∥u−UΛ,h∥Lρ2(V)≤a∗a∗inf⁡Wh∈VΛ,h∥u−Wh∥Lρ2(V). No stochastic-basis completeness or spectral-rate claim is part of this finite-dimensional estimate.

Facts & Assumptions

Given: The real affine diffusion model, Countable Choice, a finite chaos index set contained in the selected admissible cutoff box, and a finite-dimensional conforming spatial subspace.

[F1]

Affine diffusion forms are well-defined on Bochner L2 gives a well-defined bounded coercive real bilinear form with constants a∗ and a∗ and a bounded linear functional F.

[F2]

Affine random diffusion has a measurable Bochner solution gives the exact u∈Lρ2(V) satisfying A(u,W)=F(W) for all W.

[F3]

Finite-input Bochner L2 of a separable Hilbert space is Hilbert makes Lρ2(V) a real Hilbert space.

[F4]

Independent polynomial-chaos tensor products are orthonormal gives ∥ψα∥L2(ρ)=1, so ψαv∈Lρ2(V) for every v∈V.

[F5]

Strongly measurable Banach-valued function characterizes strong measurability by almost-everywhere limits of finite-valued measurable simple maps.

[F6]

Céa quasi-optimality for coercive conforming Galerkin problems gives existence, uniqueness, and the M/α error bound for finite-dimensional conforming subspaces under Countable Choice.

Proof

1.1F3F4F5given

Each ψα is a continuous scalar polynomial. Approximate it pointwise by finite-valued measurable simple real functions; multiplying those functions by a fixed v∈V gives simple V-valued maps converging to ψαv. Thus ψαv is strongly measurable by [F5] and has Bochner norm ∥ψα∥L2(ρ)∥v∥V=∥v∥V by [F4]. A finite basis of Vh and finite Λ therefore generate VΛ,h from finitely many members of Lρ2(V), making it finite-dimensional and conforming.

2.1F1F2F3F6step 1.1given∎

The model form and load satisfy the boundedness and coercivity hypotheses in [F6] by [F1], and the ambient space is Hilbert by [F3]. The finite-dimensional subspace condition is step 1.1. Apply [F6] with M=a∗ and α=a∗; it gives the unique discrete solution and ∥u−UΛ,h∥≤(a∗/a∗)inf⁡Wh∈VΛ,h∥u−Wh∥. This is the claimed estimate.

CorollaryStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Smolyak mixed-regularity bounds control chaos coefficient error

Statement

Assume ρ is uniform product probability on [0,1]d, so its integral is Id in Explicit work and error rate for dyadic Simpson Smolyak cubature. Let p be an admissible cutoff vector for this law and let Λ be a finite subset of its admissible degree box, with basis from Finite orthonormal polynomial tensor basis. Let QΛn be that theorem's dyadic Simpson Smolyak rule, with n≥2d. Let u∈L2(ρ) be real and fix a representative u~ defined at every node of QΛn. For every α∈Λ, suppose the coefficient integrand gα=u~ψα has the continuous mixed fourth derivatives and finite bounds Mα,S required by Mixed-derivative bounds for dyadic Simpson details. Define Eα,n:=Cd∥gα∥mix,dWn,d−4(log⁡(2+Wn,d))5(d−1), with the constants and mixed norm of the sparse-grid theorem. Then (∑α∈Λ∣QΛn(uψα)−⟨u,ψα⟩∣2)1/2≤(∑α∈ΛEα,n2)1/2. The error-split theorem consequently bounds the L2 coefficient contribution by the right-hand side; this claim is restricted to the stated cube law and mixed regularity.

Facts & Assumptions

Given: Uniform product measure on [0,1]d, a finite chaos basis, and the stated mixed-derivative hypotheses for each coefficient integrand.

[F1]

Explicit work and error rate for dyadic Simpson Smolyak cubature bounds each scalar Smolyak integration error by Eα,n under its displayed hypotheses.

[F2]

Mixed-derivative bounds for dyadic Simpson details supplies the exact mixed-derivative and endpoint convention required by [F1].

[F3]

Smolyak cubature on a finite downward-closed index set defines QΛn as a finite cubature functional.

[F4]

Projection and quadrature errors split in L2 identifies the Euclidean coefficient-error norm as the L2 quadrature contribution.

Proof

1.1F1F2F3given

For each α, apply [F1] to gα=u~ψα. Its assumptions are exactly the mixed-derivative bounds and cube domain in Given, with [F2] supplying the theorem's specified mixed norm. Thus ∣QΛn(gα)−∫gα dρ∣≤Eα,n. Since u~ represents u, the integral equals ⟨u,ψα⟩ by the uniform product law.

2.1step 1.1algebra

Square the finitely many nonnegative inequalities from step 1.1, sum over α, and take square roots; monotonicity of the square root gives the stated Euclidean bound.

3.1F4step 2.1∎

Apply [F4] with these coefficient errors. Its exact orthogonal error decomposition leaves the projection residual unchanged and adds the bounded Euclidean coefficient term, which proves the final assertion.

CorollaryStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Conditional spatial finite-element rate for stochastic Galerkin

Statement

Assume the hypotheses of the stochastic Galerkin theorem with D⊂Rd, d≥2, and suppose the exact solution has the exact finite expansion u(y)=∑α∈Λuαψα(y),uα∈Hr(D)∩H01(D), for integers k≥0 and 1≤ℓ≤r≤k+1. Choose a fixed reference finite element whose polynomial space contains Pk and whose unisolvent degrees of freedom are bounded on Wℓ,2 of the reference cell; let its reference interpolant reproduce Pk and define local interpolants by affine pullback as in Local interpolation estimates on shape-regular affine meshes. Let {Th} be a shape-regular family of matching affine simplicial meshes as in Matching affine simplicial meshes and shape regularity, with maximum cell diameter h, and assume for each mesh that a globally conforming spatial interpolant Ih maps these coefficients into its finite-element space, restricts cellwise to those local interpolants, and preserves the zero boundary condition. These are the generic bounded-degree-of-freedom hypotheses of the local estimate. Then for the stochastic Galerkin solution UΛ,h, ∥u−UΛ,h∥Lρ2(H01(D))≤a∗a∗ Chr−1(∑α∈Λ∣uα∣Hr(D)2)1/2. The regularity and finite-expansion assumptions are explicit; this is not a general spatial rate for arbitrary random solutions.

Facts & Assumptions

Given: Uniform ellipticity, the exact finite expansion and coefficient regularity above, a shape-regular mesh, and a globally conforming interpolant with the stated cell restrictions.

[F1]

Stochastic Galerkin coercivity and Cea quasi-optimality gives the Galerkin error bounded by (a∗/a∗) times best approximation in the tensor space.

[F2]

Local interpolation estimates on shape-regular affine meshes with p=2, m=1, the fixed reference space containing Pk, bounded degrees of freedom on Wℓ,2, and ℓ≤r≤k+1 gives ∣v−IKv∣W1,2(K)≤ChKr−1∣v∣Wr,2(K). The generic theorem uses the boundedness hypothesis directly; the corollary does not infer nodal boundedness from point evaluation.

[F3]

Independent polynomial-chaos tensor products are orthonormal gives the orthonormal finite random basis.

Proof

1.1F3given

Define Wh(y)=∑α∈Λψα(y)Ihuα. Each interpolated coefficient belongs to the spatial finite-element subspace, so Wh∈VΛ,h. By [F3], orthogonality in the random variable gives ∥u−Wh∥Lρ2(V)2=∑α∈Λ∥uα−Ihuα∥V2.

1.2F2givenalgebra

For each coefficient and cell K, [F2] gives ∣uα−IKuα∣W1,2(K)≤ChKr−1∣uα∣Wr,2(K). Square, sum over the mesh cells, and use hK≤h to obtain ∥uα−Ihuα∥V≤Chr−1∣uα∣Hr(D). This uses the assumed cellwise conformity and disjoint cell interiors.

2.1F1step 1.1step 1.2algebra∎

Square the bounds from step 1.2, sum over the finite Λ, and use step 1.1 to get ∥u−Wh∥Lρ2(V)≤Chr−1(∑α∣uα∣Hr(D)2)1/2. Then [F1] bounds the Galerkin error by (a∗/a∗) times this particular approximation error, proving the claim.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Weighted least squares is stable on the good Gram event

Statement

Let real u∈L2(ρ) have a representative evaluable at the Christoffel samples, and let u^ be the accepted weighted least-squares fit from Christoffel-weighted least-squares polynomial collocation. On the event spec⁡(G)⊆[1/2,3/2], the normal equations have a unique solution, and u^ is the unique minimizer over p∈PΛ of the weighted empirical objective JM(p):=1M∑i=1MNKΛ(Xi)∣u(Xi)−p(Xi)∣2. Moreover, ∥u^−PΛu∥L2(ρ)≤2(1M∑i=1MNKΛ(Xi)∣u(Xi)−PΛu(Xi)∣2)1/2, so ∥u−u^∥L2(ρ)2≤∥u−PΛu∥L2(ρ)2+2M∑i=1MNKΛ(Xi)∣u(Xi)−PΛu(Xi)∣2. For 0<δ<1 and M≥12Nlog⁡(2N/δ), the good event has probability at least 1−δ by Bounded-Christoffel sampling stabilizes the empirical Gram matrix.

Facts & Assumptions

Given: A finite real orthonormal family, u∈L2(ρ), samples and weights from the Christoffel least-squares algorithm, and the good Gram event.

[F1]

Christoffel-weighted least-squares polynomial collocation defines G, the weighted normal-equation vector, and the accepted fit.

[F2]

Bounded-Christoffel sampling stabilizes the empirical Gram matrix gives probability at least 1−δ for the good Gram event under the stated sample budget.

[F3]

Finite polynomial-chaos orthogonal projection defines PΛu and its coefficient vector c.

[F4]

Finite chaos projection, Parseval identity, mean, and variance gives u−PΛu⊥PΛ.

[F5]

Independent polynomial-chaos tensor products are orthonormal gives the real orthonormal basis used by the design matrix.

Proof

1.1F1givenalgebra

Put wi=N/KΛ(Xi)>0, and let the ith row of the design matrix A be wi/M ψ(Xi)T. Then ATA=G. On the good event, G is positive definite, so the normal equations have the unique solution c^=G−1ATz, where zi=wi/M u(Xi).

1.2F1step 1.1algebra

For any coefficient vector γ, the objective at p=∑α∈Λγαψα is JM(p)=∥Aγ−z∥22. The normal equations give AT(Ac^−z)=0. With d:=γ−c^, expansion yields JM(p)−JM(u^)=2dTAT(Ac^−z)+dTATAd=dTGd. Positive definiteness of G makes this difference strictly positive whenever γ≠c^. Since the basis coefficients uniquely identify elements of PΛ, u^ is the unique minimizer.

2.1F1F3F5step 1.1algebra

Let c be the exact coefficient vector of PΛu and let ri=u(Xi)−PΛu(Xi). Then z−Ac has entries wi/M ri, and the normal equations give c^−c=G−1AT(z−Ac). Moreover, (G−1AT)(G−1AT)T=G−1ATAG−1=G−1. Thus ∥G−1AT∥op2=λmax⁡(G−1)=1/λmin⁡(G)≤2, yielding the first bound.

3.1F4F5step 2.1algebra

Orthonormality [F5] gives ∥u^−PΛu∥L2(ρ)=∥c^−c∥2. By [F4], u−PΛu is orthogonal to this polynomial difference, so Pythagoras gives ∥u−u^∥2=∥u−PΛu∥2+∥u^−PΛu∥2. Substitute the first bound and square it to obtain the second inequality.

4.1F2given∎

The probability assertion is exactly [F2] under its stated independent sampling and budget hypotheses; no probability is asserted outside that good-event regime.

CorollaryStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Tensor Gaussian rules recover polynomial-chaos coefficients exactly

Statement

Suppose each marginal law ρj is the positive measure μj in Gaussian data from Coordinatewise product-moment functional for tensor polynomials, with mj≥pj+1, where p is the admissible cutoff vector of Finite product-law polynomial-chaos input data. Let Q⊗ be the tensor rule of Tensor-product Gaussian quadrature, exact through degree 2mj−1 in coordinate j. For every u∈PΛ and α∈Λ, the quadrature coefficient Q⊗(uψα) equals the exact coefficient ⟨u,ψα⟩. Hence P^Λu=PΛu and the coefficient quadrature term in Projection and quadrature errors split in L2 is zero.

Facts & Assumptions

Given: A product law with the stated marginal Gaussian moment data, mj≥pj+1, and u∈PΛ.

[F1]

Finite product-law polynomial-chaos input data bounds every basis coordinate degree by pj.

[F2]

Finite orthonormal polynomial tensor basis defines each ψβ as a product of one-dimensional polynomials of degree βj in coordinate j.

[F3]

Independent random elements have product joint law identifies the joint law with the product of its marginal laws.

[F4]

Coordinatewise product-moment functional for tensor polynomials defines the algebraic product-moment functional; Tensor product moments equal integration against the finite product measure proves that it equals integration under the finite product of the marginal measures for these coordinatewise tensor polynomials.

[F5]

Tensor-product Gaussian quadrature preserves coordinatewise exactness states exactness of the tensor Gaussian functional for coordinatewise degrees at most 2mj−1.

[F6]

Independent polynomial-chaos tensor products are orthonormal gives ∫ψβψα dρ=δαβ.

[F7]

Quadrature estimates of polynomial-chaos coefficients defines c^α=Q⊗(uψα).

Proof

1.1F1F2givenalgebra

Expand u=∑β∈Λcβψβ. By [F1] and [F2], each ψβ has coordinate degree βj≤pj, so each product ψβψα has degree at most 2pj≤2mj−2≤2mj−1 in coordinate j.

2.1F3F4F5F6step 1.1algebra

By [F3] and [F4], the product-law integral of this finite polynomial equals its coordinatewise product-moment functional. Its degrees satisfy the limits checked in step 1.1, so [F5] gives Q⊗(ψβψα)=∫ψβψα dρ=δαβ by [F6]. Finite linearity then gives Q⊗(uψα)=cα=⟨u,ψα⟩.

3.1F7step 2.1algebra∎

The equality in step 2.1 holds for every α∈Λ, so all coefficient differences vanish and the finite sums defining P^Λu and PΛu coincide. The quadrature contribution in the error split is therefore zero.

5 · Examples, counterexamples and false statements

None yet.

Sources