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
- Absolute and Conditional Convergence; Rearrangement; Products
- Absolute Continuity and the Sharp Fundamental Theorem of Calculus
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Analyticity of Holomorphic Functions; Liouville and Morera
- Arc Length and Rectifiable Curves
- Areas of Elementary Plane Figures
- Banach Gaussian priors, RKHS support, and concentration
- Banach Valued Integration and the Radon Nikodym Property
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Bounded Variation and the Riemann–Stieltjes Integral
- Céa and Aubin–Nitsche error estimates
- Combinatorial Classes and the Symbolic Method
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Coordinate and Path Transport
- Complex Differentiability and the Cauchy–Riemann Equations
- Complex Lp Spaces and Test-Function Conventions
- Complex Norms and Realification
- Complex Power Series and Analytic Functions
- Complex Subspace Realification
- Complexification, Realification and Real Structures
- Composite quadrature rules
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Connectedness
- 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
- Contour Integration
- Convexity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Darboux, L'Hôpital, and Taylor's Theorem
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Differentiation of Monotone Functions and the Vitali Covering Theorem
- Distributions Test Functions and Differentiation
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces Adjoint Operators and Annihilators
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Dimensional Normed Spaces and Riesz Lemma
- Finite-element meshes and interpolation
- Formal Power Series
- Foundations of the Real Numbers for Analysis
- Fredholm Elliptic Problems and the Elliptic Spectrum
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Gaussian quadrature
- Goursat's Theorem and Cauchy's Theorem in a Convex Domain
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Harmonic Functions and Mean Values in Rn
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Independence Borel Cantelli and Zero One Laws
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lax--Milgram and Weak Elliptic Solutions
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Line Integrals and the Gradient Theorem
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Norming and Separation under Hahn–Banach
- Order, Zorn's Lemma, and the Axiom of Choice
- Orthonormal Bases, Parseval and Fourier Series
- Outer Measure and the Caratheodory Extension Theorem
- Parabolic finite-element methods
- Partitions of Unity and Paracompactness
- Pointwise Extended-Real Function Products
- Poisson Problems and Interior Harmonic Estimates
- Polynomial interpolation and remainder
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- 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
- Robust Covariance and Sparse Robust Estimation
- Roots, Rational Powers, and Classical Inequalities
- Schwartz Space and the Plancherel Theorem
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Smooth Approximation and Sobolev Extension
- Smooth Manifolds and Smooth Maps
- Smooth Partitions of Unity and Exhaustions
- Sobolev Poincare and Morrey Inequalities
- Sparse grid cubature and mixed regularity
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tangent Cotangent and the Differential
- The Analytic Hahn Banach Theorem
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Fundamental Theorems of Calculus
- The Galois Correspondence
- The Identity Theorem, the Maximum Principle and the Open Mapping Theorem
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Derivatives and Sobolev Spaces
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 . The locally proved matrix concentration argument gives this event with probability at least when . 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 with , the pointwise weak solution is Lipschitz in the parameter and defines a Bochner 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 . 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
Finite product-law polynomial-chaos input data
Definition
Fix an integer , independent real random variables with marginal Borel probability laws , and a degree cutoff vector . Their joint law is on , as in Independent random elements have product joint law. For a Borel probability law on , define The complement is a union of zero-measure members of the countable rational interval basis, so countable additivity gives . Set and give it the trace Borel sigma-algebra from . The product rectangle formula gives . Whenever the measure space is written as , denotes the restriction of the product law on to ; 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 is admissible when, for every , and the monomial Gram matrix is positive definite, meaning for each nonzero . Throughout the pair, assume the selected cutoff vector is admissible. The admissible degree box is . 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 .
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 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.
Total-degree and hyperbolic-cross chaos index sets
Definition
For inputs with admissible cutoff vector from Finite product-law polynomial-chaos input data, the cutoff total-degree set of order and cutoff hyperbolic-cross set of threshold are 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 for every imply .
Bochner L2 space for a finite product-law input
Definition
Let be the finite product-law probability space of Finite product-law polynomial-chaos input data, and let be a separable real Hilbert space. Scalar integrals involving strongly measurable maps are taken using measurable versions: if simple maps converge to outside a measurable null set , set off and on , and set the approximants to zero on . They then converge everywhere to . For every open set , convergence expresses through countably many eventual bounds on distances of the simple maps to , 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 and ; 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 to be the space of strongly measurable maps for which , modulo equality -almost everywhere. Its inner product is
Positive moment Gram matrices produce orthonormal polynomial families
Statement
Let be one factor law with admissible degree as in Finite product-law polynomial-chaos input data. The monomial classes are linearly independent in . Applying the finite Gram–Schmidt recursion to this ordered list gives real orthonormal polynomials , where has degree , positive leading coefficient, and .
Facts & Assumptions
Given: A probability law with finite moment and positive-definite monomial Gram matrix.
Finite product-law polynomial-chaos input data states that for every nonzero coefficient vector , the quadratic form is strictly positive.
The finite moment makes every monomial of degree at most integrable: for , .
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.
The norm induced by a real or complex inner product defines normalization by the positive norm of each nonzero residual.
Proof
Let be the real vector space spanned by the formal monomials . For define . Every product has degree at most and is integrable by [F2], so the pairing is finite; linearity of the integral makes it bilinear and symmetric. If , then , which is positive for each nonzero formal polynomial by [F1]. Thus this is an inner product on .
Every has finite squared integral by [F2], so it defines an class. If that class is zero, then almost everywhere and ; 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 . Its residual at stage is minus a polynomial of degree at most , so it has degree and leading coefficient .
Each residual is nonzero in 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 , the residual is and its norm is because is a probability law; hence . This proves the stated finite orthonormal family.
Finite orthonormal polynomial tensor basis
Definition
Let 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 , define Here 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 inside . Whenever (in particular, for the stated total-degree and hyperbolic-cross sets), the family contains the constant mode . No density of in is part of this definition.
Uniformly elliptic affine random diffusion model
Definition
Let be a bounded polyhedral open set and with norm . 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 have the product law of Finite product-law polynomial-chaos input data, and assume its support is bounded, so for every . For real coefficient functions define Assume constants satisfy, for every , for almost every . This explicit all-parameter condition ensures the pointwise variational problem is well-posed for every stated parameter, not merely almost every one. Let with .
The pointwise weak form is The Bochner weak form uses the bilinear form and the functional on from Bochner L2 space for a finite product-law input.
The stated chaos index sets are finite and contain zero
Statement
For every admissible cutoff vector , order , and threshold , the sets and of Total-degree and hyperbolic-cross chaos index sets are finite and contain .
Facts & Assumptions
Given: , an admissible cutoff vector , , and , with the two index-set definitions above.
Total-degree and hyperbolic-cross chaos index sets defines the sets by coordinate sums and products of positive integers.
Proof
If , then every coordinate satisfies by the cutoff condition in [F1]. Hence this set is a subset of the finite box .
The same cutoff condition places in the finite box . Since and , zero satisfies both defining inequalities. Thus both sets are finite and contain zero.
Finite-input Bochner L2 of a separable Hilbert space is Hilbert
Statement
Assume Countable Choice. For the space of Bochner L2 space for a finite product-law input, the displayed integral pairing is a well-defined real inner product, its norm is 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 , and a separable real Hilbert space .
Bochner L2 space for a finite product-law input defines the elements as strongly measurable -valued classes with square-integrable norm, modulo equality almost everywhere.
Hilbert space gives completeness of and the positive-definite inner product .
Cauchy-Schwarz inequality for gives the scalar integral estimate for nonnegative .
Minkowski's inequality and monotone convergence for nonnegative integrals are Minkowski's inequality for integrals, including and Monotone convergence for the integral.
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).
Dominated convergence applies to integrable scalar majorants (Dominated convergence).
Countable Choice permits selecting a subsequence of a Cauchy sequence with prescribed summable successive distances (The Axiom of Countable Choice ()).
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
For , use the Borel representatives obtained by the null-set modification in [F1], and denote them again by . Their norm functions and pairings are measurable. Pointwise Cauchy–Schwarz gives . 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 is zero, then for each integer the set has measure zero, since ; their countable union contains every point where . Thus the class of is zero, proving positive definiteness.
Let be Cauchy in the displayed norm. By [A1] select a subsequence with . 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 and . Minkowski [F4] gives . The functions increase, so monotone convergence [F4] yields . Therefore outside a measurable null set; otherwise its square integral would be infinite on a set of positive measure.
Let , a Borel set of full measure by step 1.2. On , is Cauchy in and hence has a limit by [F2]. Define to be this limit on and zero on . The Borel maps equal to on and zero on converge pointwise everywhere to ; their pointwise limit is Borel measurable (equivalently, distances to a countable dense subset of are Borel limits). By [F5], is strongly measurable. If , then almost everywhere, , and the latter is in by step 1.2. Dominated convergence [F6] gives , while almost everywhere on . Thus in .
Since is Cauchy and its subsequence converges to , the full sequence converges to : for , choose so for , then choose with ; the triangle inequality gives for . This proves completeness.
Let 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 . The truncation set is measurable; the truncated functions remain finite-valued simple functions, converge to almost everywhere, and their squared errors are bounded by . Dominated convergence [F6] gives convergence in , proving density.
Christoffel-weighted least-squares polynomial collocation
Definition
Let be finite, contain , and let
be the real orthonormal basis of
Finite orthonormal polynomial tensor basis. Set and
The algorithm takes an evaluable real function , a positive integer sample
count , and independent samples from the probability law
. It forms
If every eigenvalue of lies in , return the unique coefficient
vector and polynomial .
Otherwise return unstable-sample and no coefficients. The weighted empirical
objective minimized on the accepted branch is
over .
Finite polynomial-chaos orthogonal projection
Definition
For real and a finite subset of the admissible degree box, with as in Finite orthonormal polynomial tensor basis, define The scalar integral pairing is choice-free: for representatives of classes in , Cauchy–Schwarz makes 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 , so it is positive definite on the quotient. These facts use only the integral pairing, not completeness of . The displayed finite sum is the orthogonal projection onto of Finite orthonormal polynomial tensor basis.
Affine diffusion forms are well-defined on Bochner L2
Statement
For the model of Uniformly elliptic affine random diffusion model, let . For , the scalar functions and have measurable integrable versions in the convention of Bochner L2 space for a finite product-law input, so and are well-defined on equivalence classes. They satisfy and
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.
For every , the pointwise form satisfies and ; is bounded and affine (Uniformly elliptic affine random diffusion model).
Strongly measurable maps are almost-everywhere limits of measurable finite-valued simple maps (Strongly measurable Banach-valued function).
The scalar integral Cauchy--Schwarz inequality is Cauchy-Schwarz inequality for .
Bochner L2 space for a finite product-law input identifies with strongly measurable square-integrable maps modulo almost-everywhere equality.
Proof
Choose finite-valued measurable simple maps converging respectively to almost everywhere, using [F2]. On every intersection of their finite partition sets, is an affine continuous scalar function of 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 . 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].
For a finite-valued simple converging almost everywhere to , the scalar function is measurable on each partition piece because is affine continuous into the finite-dimensional span of . Its pointwise limit on the full-measure convergence set is , so setting the limit to zero on the measurable exceptional null set gives a measurable version in the convention [F4]. Since , ; hence .
The pointwise bound [F1] gives . 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].
Pointwise duality gives . Apply [F3] to obtain the stated integrability and functional bound.
Integrating the pointwise coercivity bound [F1] gives . Integrating the pointwise continuity bound and applying [F3] as in step 2.1 gives . These estimates prove the remaining assertions.
Independent polynomial-chaos tensor products are orthonormal
Statement
Let and form from Finite orthonormal polynomial tensor basis for indices in the admissible degree box. Then each belongs to and In particular, the family indexed by any finite subset of the box is orthonormal; when , it includes the constant mode .
Facts & Assumptions
Given: Independent real inputs with product law , admissible one-dimensional moment data, and indices in the finite degree box.
Independent random elements have product joint law identifies the joint law with .
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.
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
For in the admissible box set . Each is integrable because it is a polynomial of degree at most and the moment is finite. By [F4], the restricted measure on is the product of the restricted marginal laws. Repeated Tonelli [F3] first gives ; repeated Fubini [F3] then gives . The product-law statement [F2] identifies the ambient finite product measure with the joint law, and [F4] restricts it to .
The factorization in step 1.1 and univariate orthonormality [F1] give . This product is one exactly when every coordinate agrees, and zero otherwise; with it also shows . Multiplying over the finitely many coordinates gives , so whenever the finite family includes this constant mode.
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 be any declared finite cubature functional whose nodes lie in the domain of evaluation of . For an evaluable real function , define the quadrature coefficient and the resulting polynomial by When represents an element of , its exact coefficients and projection are those of Finite polynomial-chaos orthogonal projection. The quadrature quantities use the specified node values of and need not be invariant under changes on null sets. This definition gives no accuracy claim for a general cubature rule.
Christoffel sampling is normalized and its weighted Gram has mean identity
Statement
Let and be as in Christoffel-weighted least-squares polynomial collocation, with . Then pointwise, the measure is a probability measure, and the random matrix satisfies , , and almost surely.
Facts & Assumptions
Given: A finite real orthonormal polynomial family indexed by , with , and its Christoffel kernel.
Christoffel-weighted least-squares polynomial collocation defines and the rank-one matrix .
Integration is linear on integrable functions (The Lebesgue integral is linear on ); the finite sums defining can therefore be integrated term by term.
Cauchy-Schwarz inequality for makes each product integrable. Since , integration against is integration against that density for nonnegative measurable functions, and for signed functions once absolute integrability is established.
Proof
Since and , . By [F2]–[F3], . Therefore is a probability measure and the denominator in [F1] is positive everywhere.
For each pair , [F4] and show , so the entry is integrable under . Using the signed density identity in [F4], its expectation is by [F2], hence . The rank-one outer product is positive semidefinite and has operator norm , proving the remaining assertions.
Affine random diffusion has a measurable Bochner solution
Statement
Under the hypotheses of Uniformly elliptic affine random diffusion model, for each there is a unique satisfying the pointwise weak problem. The map is Lipschitz on the bounded parameter set, strongly measurable, and belongs to . It is also the unique solution of the Bochner weak equation
Facts & Assumptions
Given: A bounded product parameter set, affine coefficient and forcing, and constants as in Uniformly elliptic affine random diffusion model.
The zero-boundary Sobolev energy space is a separable Hilbert space supplies the separable real Hilbert structure on under Countable Choice.
Pointwise is a bounded real bilinear form, with and , by the coefficient bounds in Uniformly elliptic affine random diffusion model.
The real bilinear Lax–Milgram theorem under Countable Choice gives a unique solution and (The Lax--Milgram theorem, The Axiom of Countable Choice ()).
A Borel map into the separable Banach space is strongly measurable (A Borel map into a separable Banach space is strongly measurable).
Affine diffusion forms are well-defined on Bochner L2 supplies measurability, integrability, continuity, and coercivity of and boundedness of on .
is a Hilbert space and finite-valued simple functions are dense (Finite-input Bochner L2 of a separable Hilbert space is Hilbert).
Proof
For each , [F2] verifies the boundedness and coercivity hypotheses of [F3], while is a bounded functional. Lax–Milgram gives a unique and , where because is bounded.
For , put and subtract the weak equations: The affine formulas give and , where and . Set and use [F2] and the bound from step 1.1. If , divide the resulting coercive inequality by ; if the conclusion is immediate. This proves . Thus is Lipschitz and Borel measurable.
Since is separable, [F4] makes strongly measurable. The uniform bound in step 1.1 and give , so .
For a finite-valued simple test , integrate the pointwise weak identity for each over and sum; [F5] ensures the scalar integrands are measurable and integrable. This gives .
The bounds in [F5] make both sides continuous on . Finite-valued simple tests are dense by [F6], so step 3.1 extends to every . If two Bochner solutions existed, testing their difference against itself and using the coercivity bound in [F5] would force their difference to be zero.
Finite chaos projection, Parseval identity, mean, and variance
Statement
Let be finite, contain , and let the real basis be as in Finite orthonormal polynomial tensor basis. For real set and as in Finite polynomial-chaos orthogonal projection. Then The residual is orthogonal to , , and Here ; no completeness of the polynomial family is assumed.
Facts & Assumptions
Given: A finite real orthonormal polynomial family containing and .
Finite polynomial-chaos orthogonal projection defines and by the displayed finite sum.
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
For each , bilinearity and [F2] give . Thus the residual is orthogonal to every basis vector and hence to their finite span.
Write . By step 1.1 the two terms are orthogonal, so bilinearity and symmetry from [F3] give . Expanding the finite sum with [F2] gives . This proves the norm identity directly from the integral pairing.
Since , . The centered variable decomposes as . 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.
Tensor products are dense in Bochner L2 under scalar and spatial density
Statement
Let be the scalar linear span of a declared polynomial-chaos family in and let be a linear subspace dense in the separable real Hilbert space . Assume separately that is dense in ; this law-specific completeness hypothesis is not inferred from finite moments. Then the algebraic tensor span is dense in .
Facts & Assumptions
Given: A finite product probability space, the stated scalar density hypothesis, and a dense linear spatial subspace .
Bochner L2 space for a finite product-law input defines using strongly measurable square-integrable maps.
Dominated convergence gives convergence of scalar integrals for pointwise almost-everywhere convergence under an integrable measurable majorant.
Scalar density of in is an explicit hypothesis in Given, not a conclusion of the finite-basis orthonormality theorem.
Density of in is an explicit hypothesis in Given.
Strongly measurable Banach-valued function characterizes strong measurability through simple-map approximation; a scalar measurable function times a fixed vector is strongly measurable.
Proof
Fix and . By [F1] and [F5], choose a simple approximation sequence and replace it and by zero on their measurable null exceptional set. Write for the resulting simple maps, which converge everywhere to the Borel representative . Set . The truncation sets are measurable and is finite-valued simple. At it is zero; at every other point it eventually equals , so . Since , [F2] gives . Choose one such map with error below , taking by allowing a zero value. It remains to approximate its finitely many terms with total error below .
For each , use [F3] and [F4] to choose and with . Such choices are possible by first making the scalar error arbitrarily small, which bounds , and then making the vector error small. The product norm estimate 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.
The finite sum belongs to the displayed algebraic tensor span, and the triangle inequality with step 2.1 gives distance less than from . Together with step 1.1 its distance from is less than . Since and were arbitrary, the span is dense.
Projection and quadrature errors split in L2
Statement
Let be real, choose a representative 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 as the evaluable input to that estimator. Then Since the finite sum equals , the triangle inequality also gives 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, , and finite quadrature values .
Quadrature estimates of polynomial-chaos coefficients defines using the finite basis sum.
Finite polynomial-chaos orthogonal projection defines and .
Independent polynomial-chaos tensor products are orthonormal gives the orthonormality of the finite basis.
Finite polynomial-chaos orthogonal projection gives the choice-free bilinear integral pairing inducing the norm; the finite orthogonality identities follow by expansion.
Cauchy-Schwarz inequality for bounds , and The modulus of an integral is bounded by the integral of the modulus bounds by that integral. Expanding then gives the norm triangle inequality.
Proof
For each , the coefficient formula [F2], orthonormality [F3], and bilinearity [F4] give . Thus is orthogonal to the finite span , including when is empty. Subtracting the two finite expansions gives , so this difference is orthogonal to the residual.
The identity is an orthogonal sum by step 1.1. Expanding its squared norm using [F4] gives ; orthonormality [F3] identifies the second term with . To obtain the final inequality, use [F5] to expand and deduce for and .
Bounded-Christoffel sampling stabilizes the empirical Gram matrix
Statement
Let , , and the independent Christoffel samples be as in Christoffel-weighted least-squares polynomial collocation. Let be its weighted empirical Gram matrix. For , if then
Facts & Assumptions
Given: A finite real orthonormal basis of size , independent Christoffel samples, and .
Christoffel sampling is normalized and its weighted Gram has mean identity gives rank-one matrices with and .
Christoffel-weighted least-squares polynomial collocation specifies independent samples, hence the matrices formed from them are independent.
Bounded independent matrix Bernstein bound from the trace exponential gives, for centered independent Hermitian summands bounded by with variance bound , the two-sided tail .
Proof
Put . Then . Since , spectral calculus gives , and hence . Also every eigenvalue of lies in , so . These are the hypotheses of [F2] with .
Apply [F3] to with . Direct substitution gives , because and .
The sample-size condition makes the last bound at most , since . On the complementary event, for every unit vector , ; the Rayleigh quotient characterization therefore puts every eigenvalue of in .
Stochastic Galerkin coercivity and Cea quasi-optimality
Statement
Assume Countable Choice and the affine diffusion hypotheses of Uniformly elliptic affine random diffusion model. Let be the selected admissible cutoff vector of the finite product-law input, and let be finite. Let be any finite-dimensional conforming spatial subspace. Define the stochastic Galerkin space The Bochner form is continuous with constant and coercive with constant . There is a unique satisfying and, for the exact solution of Affine random diffusion has a measurable Bochner solution, 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.
Affine diffusion forms are well-defined on Bochner L2 gives a well-defined bounded coercive real bilinear form with constants and and a bounded linear functional .
Affine random diffusion has a measurable Bochner solution gives the exact satisfying for all .
Finite-input Bochner L2 of a separable Hilbert space is Hilbert makes a real Hilbert space.
Independent polynomial-chaos tensor products are orthonormal gives , so for every .
Strongly measurable Banach-valued function characterizes strong measurability by almost-everywhere limits of finite-valued measurable simple maps.
Céa quasi-optimality for coercive conforming Galerkin problems gives existence, uniqueness, and the error bound for finite-dimensional conforming subspaces under Countable Choice.
Proof
Each is a continuous scalar polynomial. Approximate it pointwise by finite-valued measurable simple real functions; multiplying those functions by a fixed gives simple -valued maps converging to . Thus is strongly measurable by [F5] and has Bochner norm by [F4]. A finite basis of and finite therefore generate from finitely many members of , making it finite-dimensional and conforming.
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 and ; it gives the unique discrete solution and . This is the claimed estimate.
Smolyak mixed-regularity bounds control chaos coefficient error
Statement
Assume is uniform product probability on , so its integral is in Explicit work and error rate for dyadic Simpson Smolyak cubature. Let 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 be that theorem's dyadic Simpson Smolyak rule, with . Let be real and fix a representative defined at every node of . For every , suppose the coefficient integrand has the continuous mixed fourth derivatives and finite bounds required by Mixed-derivative bounds for dyadic Simpson details. Define with the constants and mixed norm of the sparse-grid theorem. Then 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 , a finite chaos basis, and the stated mixed-derivative hypotheses for each coefficient integrand.
Explicit work and error rate for dyadic Simpson Smolyak cubature bounds each scalar Smolyak integration error by under its displayed hypotheses.
Mixed-derivative bounds for dyadic Simpson details supplies the exact mixed-derivative and endpoint convention required by [F1].
Smolyak cubature on a finite downward-closed index set defines as a finite cubature functional.
Projection and quadrature errors split in L2 identifies the Euclidean coefficient-error norm as the L2 quadrature contribution.
Proof
For each , apply [F1] to . Its assumptions are exactly the mixed-derivative bounds and cube domain in Given, with [F2] supplying the theorem's specified mixed norm. Thus . Since represents , the integral equals by the uniform product law.
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.
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.
Conditional spatial finite-element rate for stochastic Galerkin
Statement
Assume the hypotheses of the stochastic Galerkin theorem with , , and suppose the exact solution has the exact finite expansion for integers and . Choose a fixed reference finite element whose polynomial space contains and whose unisolvent degrees of freedom are bounded on of the reference cell; let its reference interpolant reproduce and define local interpolants by affine pullback as in Local interpolation estimates on shape-regular affine meshes. Let be a shape-regular family of matching affine simplicial meshes as in Matching affine simplicial meshes and shape regularity, with maximum cell diameter , and assume for each mesh that a globally conforming spatial interpolant 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 , 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.
Stochastic Galerkin coercivity and Cea quasi-optimality gives the Galerkin error bounded by times best approximation in the tensor space.
Local interpolation estimates on shape-regular affine meshes with , , the fixed reference space containing , bounded degrees of freedom on , and gives . The generic theorem uses the boundedness hypothesis directly; the corollary does not infer nodal boundedness from point evaluation.
Independent polynomial-chaos tensor products are orthonormal gives the orthonormal finite random basis.
Proof
Define . Each interpolated coefficient belongs to the spatial finite-element subspace, so . By [F3], orthogonality in the random variable gives
For each coefficient and cell , [F2] gives . Square, sum over the mesh cells, and use to obtain . This uses the assumed cellwise conformity and disjoint cell interiors.
Square the bounds from step 1.2, sum over the finite , and use step 1.1 to get . Then [F1] bounds the Galerkin error by times this particular approximation error, proving the claim.
Weighted least squares is stable on the good Gram event
Statement
Let real have a representative evaluable at the Christoffel samples, and let be the accepted weighted least-squares fit from Christoffel-weighted least-squares polynomial collocation. On the event , the normal equations have a unique solution, and is the unique minimizer over of the weighted empirical objective Moreover, so For and , the good event has probability at least by Bounded-Christoffel sampling stabilizes the empirical Gram matrix.
Facts & Assumptions
Given: A finite real orthonormal family, , samples and weights from the Christoffel least-squares algorithm, and the good Gram event.
Christoffel-weighted least-squares polynomial collocation defines , the weighted normal-equation vector, and the accepted fit.
Bounded-Christoffel sampling stabilizes the empirical Gram matrix gives probability at least for the good Gram event under the stated sample budget.
Finite polynomial-chaos orthogonal projection defines and its coefficient vector .
Independent polynomial-chaos tensor products are orthonormal gives the real orthonormal basis used by the design matrix.
Proof
Put , and let the th row of the design matrix be . Then . On the good event, is positive definite, so the normal equations have the unique solution , where .
For any coefficient vector , the objective at is . The normal equations give . With , expansion yields Positive definiteness of makes this difference strictly positive whenever . Since the basis coefficients uniquely identify elements of , is the unique minimizer.
Let be the exact coefficient vector of and let . Then has entries , and the normal equations give . Moreover, . Thus , yielding the first bound.
Orthonormality [F5] gives . By [F4], is orthogonal to this polynomial difference, so Pythagoras gives . Substitute the first bound and square it to obtain the second inequality.
The probability assertion is exactly [F2] under its stated independent sampling and budget hypotheses; no probability is asserted outside that good-event regime.
Tensor Gaussian rules recover polynomial-chaos coefficients exactly
Statement
Suppose each marginal law is the positive measure in Gaussian data from Coordinatewise product-moment functional for tensor polynomials, with , where is the admissible cutoff vector of Finite product-law polynomial-chaos input data. Let be the tensor rule of Tensor-product Gaussian quadrature, exact through degree in coordinate . For every and , the quadrature coefficient equals the exact coefficient . Hence 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, , and .
Finite product-law polynomial-chaos input data bounds every basis coordinate degree by .
Finite orthonormal polynomial tensor basis defines each as a product of one-dimensional polynomials of degree in coordinate .
Independent random elements have product joint law identifies the joint law with the product of its marginal laws.
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.
Tensor-product Gaussian quadrature preserves coordinatewise exactness states exactness of the tensor Gaussian functional for coordinatewise degrees at most .
Proof
Expand . By [F1] and [F2], each has coordinate degree , so each product has degree at most in coordinate .
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 by [F6]. Finite linearity then gives .
The equality in step 2.1 holds for every , so all coefficient differences vanish and the finite sums defining and coincide. The quadrature contribution in the error split is therefore zero.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Dongbin Xiu and George Em Karniadakis, The Wiener–Askey Polynomial Chaos for Stochastic Differential Equations, §§1, 4–6
- Dongbin Xiu, Fast Numerical Methods for Stochastic Computations, §§2–4
- Dongbin Xiu and George Em Karniadakis, The Wiener–Askey Polynomial Chaos for Stochastic Differential Equations, §§4–6
- Ivo Babuška, Fabio Nobile, and Raúl Tempone, A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data, §4
- Bruno Sudret, Polynomial Chaos Expansions and Stochastic Finite Element Methods, §3.3.2
- Dongbin Xiu, Fast Numerical Methods for Stochastic Computations, §3
- Ivo Babuška, Fabio Nobile, and Raúl Tempone, A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data, §1
- Bruno Sudret, Polynomial Chaos Expansions and Stochastic Finite Element Methods, §4
- Dongbin Xiu and George Em Karniadakis, The Wiener–Askey Polynomial Chaos for Stochastic Differential Equations, §4
- Bruno Sudret, Polynomial Chaos Expansions and Stochastic Finite Element Methods, §§3.2.1–3.2.2
- Gerald Teschl, Topics in Real and Functional Analysis, §11.6
- Christian Clason, Introduction to Finite Element Methods, Chapter 11
- Albert Cohen and Giovanni Migliorati, Optimal Weighted Least-Squares Methods, §§2–3
- Dongbin Xiu, Fast Numerical Methods for Stochastic Computations, §5
- Dongbin Xiu, Fast Numerical Methods for Stochastic Computations, §§3.3–3.4
- Bruno Sudret, Polynomial Chaos Expansions and Stochastic Finite Element Methods, §3.4.2
- Dongbin Xiu, Fast Numerical Methods for Stochastic Computations, §3.2
- Bruno Sudret, Polynomial Chaos Expansions and Stochastic Finite Element Methods, §3.2.2
- Dongbin Xiu, Fast Numerical Methods for Stochastic Computations, §§4–5
- Bruno Sudret, Polynomial Chaos Expansions and Stochastic Finite Element Methods, §§3.4.2–3.4.3
- Albert Cohen and Giovanni Migliorati, Optimal Weighted Least-Squares Methods, §2
- Joel A. Tropp, An Introduction to Matrix Concentration Inequalities, §6.2
- Bruno Sudret, Polynomial Chaos Expansions and Stochastic Finite Element Methods, §§3–4
- Bruno Sudret, Polynomial Chaos Expansions and Stochastic Finite Element Methods, §3.4.3
- Dongbin Xiu, Fast Numerical Methods for Stochastic Computations, §4
- Joel A. Tropp, An Introduction to Matrix Concentration Inequalities, §§3.2–3.3 and §6.6
- Bruno Sudret, Polynomial Chaos Expansions and Stochastic Finite Element Methods, Chapter 6, §§3–4
- Ivo Babuška, Fabio Nobile, and Raúl Tempone, A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data, §§1–2
- Bruno Sudret, Polynomial Chaos Expansions and Stochastic Finite Element Methods, Chapter 6