How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Polynomial chaos stochastic collocation and Galerkin UQ — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- 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
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Distributions Test Functions and Differentiation
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces Adjoint Operators and Annihilators
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- 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
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- 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
- 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
- Pointwise Extended-Real Function Products
- Polynomial chaos stochastic collocation and Galerkin UQ
- Polynomial interpolation and remainder
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- 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
- 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
- Simple Field Extensions and the Construction of the Complex Numbers
- Smooth Approximation and Sobolev Extension
- Smooth Partitions of Unity and Exhaustions
- Sobolev Poincare and Morrey Inequalities
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Analytic Hahn Banach Theorem
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Derivative and the Mean Value Theorems
- The Exponential Function
- 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 Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- 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
Objective
The examples verify an exact degree-one expansion for a positive two-state reaction rate, uniform coercivity and the zero solution for an affine random diffusion, the Cauchy-law failure of a degree-one moment cutoff, singularity of a higher-degree Gram matrix on finite support, and the mode/node work comparison for a three-input degree-two truncation. The two counterexamples delimit finite moment construction from completeness and positive definiteness. The work comparison records the three-dimensional counts explicitly and does not claim a general sparse-grid tractability rate.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A Cauchy input has no L2 degree-one polynomial chaos
Statement refuted
Every real probability law supports a degree-one orthonormal polynomial chaos basis.
Facts & Assumptions
Given: The Cauchy probability law and the finite moment-Gram requirements of Finite product-law polynomial-chaos input data.
Degree one requires the finite second moment and positive-definite monomial Gram matrix of Finite product-law polynomial-chaos input data.
Counterexample
Take the standard Cauchy law, whose density is on . Its second moment integral is For , , so the integral over is at least .
Letting shows the second moment is infinite. Hence , the degree-one monomial Gram entry is not finite, and [F1] fails; the finite Gram--Schmidt construction cannot supply a degree-one chaos basis for this law.
Finite support can make a higher-degree moment Gram matrix singular
Statement refuted
Finite moments through degree guarantee a positive-definite degree- monomial Gram matrix for every probability law.
Facts & Assumptions
Given: The two-point probability law and the degree-two Gram criterion of Finite product-law polynomial-chaos input data.
The degree-two Gram matrix is positive definite exactly when every nonzero coefficient vector has strictly positive squared polynomial norm (Finite product-law polynomial-chaos input data).
Counterexample
Let and take . All moments are finite. The coefficient vector of in the ordered monomials is . Yet , so .
Therefore the degree-two Gram quadratic form vanishes on a nonzero vector and is singular despite finiteness of every moment. The stated sufficiency claim is false.
A bounded random diffusion coefficient remains uniformly coercive
Example
On , let be uniform on , take the degree cutoff , set , and set the forcing . This is an affine random diffusion with explicit uniform ellipticity bounds; its unique pointwise and Bochner weak solution is zero.
Facts & Assumptions
Given: The bounded interval , uniform product law on , constant coefficient terms , , and zero forcing.
Finite product-law polynomial-chaos input data permits a finite product law with the stated admissible cutoff.
Uniformly elliptic affine random diffusion model requires for every supported parameter and uses the gradient norm on .
Affine random diffusion has a measurable Bochner solution gives the unique pointwise and Bochner solution under those hypotheses.
Verification
At cutoff , the only moment-Gram matrix is , so the uniform probability law is admissible by [F1]. Its support is , and for every , . Thus the diffusion definition applies with and , and is a bounded affine forcing.
The pointwise weak equation is for every . Taking and using gives , so for every . This solution is a strongly measurable square-integrable zero function and satisfies the Bochner equation; uniqueness also follows from [F3].
A two-state uncertain reaction rate has an exact degree-one chaos expansion
Example
Let take the values and with probability each, choose cutoff , and let the uncertain positive reaction rate be with and . Its degree-one chaos expansion is exact, with mean and variance .
Facts & Assumptions
Given: The symmetric two-point probability law and the rate parameters , .
Finite product-law polynomial-chaos input data requires finite moments and a positive-definite monomial Gram matrix through the chosen cutoff.
Positive moment Gram matrices produce orthonormal polynomial families constructs the normalized degree-zero and degree-one polynomials.
Finite chaos projection, Parseval identity, mean, and variance identifies the constant and first nonconstant coefficients with mean and variance contributions.
Verification
The first two moments are and , so the degree-one Gram matrix is , positive definite. Thus [F1] applies. Gram--Schmidt gives and , since already has mean zero and unit norm and its leading coefficient is positive.
Substitution gives at both support points, so the degree-one projection residual is identically zero. Its coefficients are and . By [F3], the mean is and variance is .
The condition implies at both states, so the reaction rate is positive on its whole support. Every function on this support also has the exact form ; hence this two-dimensional finite basis spans for this particular law.
Three-input degree-two chaos uses ten total-degree modes versus twenty-seven tensor modes
Example
For three independent uniform inputs on with admissible cutoff , a total-degree order-two chaos basis has ten modes, while the full coordinatewise degree-two tensor basis has twenty-seven modes. A tensor Gaussian rule with three nodes in each coordinate also uses twenty-seven node evaluations.
Facts & Assumptions
Given: Three independent uniform inputs on , cutoffs , total-degree order , and a three-node Gaussian rule for each marginal.
Total-degree and hyperbolic-cross chaos index sets defines the cutoff total-degree set by coordinate sum and the tensor box by coordinatewise cutoffs.
The stated chaos index sets are finite and contain zero confirms the specified finite sets are legitimate index sets containing zero.
Tensor-product Gaussian quadrature preserves coordinatewise exactness gives exactly distinct nodes for a tensor rule with coordinate orders .
Verification
For one uniform marginal, the moment Gram matrix through degree two is . Its quadratic form at is , which is positive for every nonzero vector; all required moments are finite on . Thus the cutoff is admissible. In three coordinates, the total-degree set has one zero multi-index, three degree-one indices, three indices , and three indices with . These are disjoint and exhaust the nonnegative triples with sum at most two, so its cardinality is .
The full degree-two tensor box has choices in each of three coordinates, hence multi-indices. The three-node Gaussian rules are defined for the positive uniform measures on ; their tensor rule with has distinct nodes by [F3]. Thus in this example the total-degree basis uses ten modes compared with twenty-seven tensor modes and node evaluations.