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.
Gaussian-process priors and finite posterior laws — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Brownian Motion Construction and Continuity
- Central Limit Theorems
- Characteristic Functions Inversion and Continuity
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Conditional Distributions and Regular Conditional Probability
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Conjugate families and Gaussian conditioning
- 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
- Cyclic Groups and Direct Products
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Direct Matrix Factorisations: LU, Cholesky and QR
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- 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 Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Gaussian-process priors and finite posterior laws
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- 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 effects and longitudinal models
- 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
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Partitions of Unity and Paracompactness
- Pointwise Extended-Real Function Products
- 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
- Radon Measures and the Riesz Markov Kakutani Theorem
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- 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
- Splitting Fields
- State-space model laws
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- 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 Galois Correspondence
- 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
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
2 · Summary
The examples calculate a nonzero-mean posterior with correlated observation noise, show how noise makes an observed covariance positive definite despite a singular prior block while the predictive covariance remains singular, and show that an independent unobserved index retains its prior uncertainty. Each pointwise calculation uses the stated Gaussian conditional-kernel version; values on observation-null sets are not uniquely fixed by the regular conditional law.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Singular prior and predictive covariances in Gaussian-process regression
Example
On take mean zero and constant kernel . Observe both indices with independent noise covariance , and test the repeated list . At observation vector , the selected posterior-kernel mean is and covariance is which is singular, although the observed covariance is positive definite.
Facts & Assumptions
Given: AC; the two-index constant-kernel process; and noise independent of the process.
AC is required by the finite Gaussian-process and multivariate-normal constructions. The Axiom of Choice
Any symmetric positive-semidefinite kernel on an arbitrary set defines a canonical cylinder-space Gaussian process under AC. A mean and positive-semidefinite kernel define a Gaussian process
Under AC, every finite symmetric positive-semidefinite covariance matrix defines a possibly singular Gaussian law. Multivariate normal law, including singular covariance
A finite product of sigma-finite measures exists and has the rectangle product formula. For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique
Product-coordinate random elements are independent when their rectangle probabilities factor. Independent random elements Independent random elements are characterized by finite rectangle probabilities
Coordinates on the cylinder sigma-algebra are measurable, and a finite product sigma-algebra is generated by its coordinate sets. Coordinate maps, finite-coordinate cylinders, and the cylinder -algebra The product sigma-algebra and its finite iterates
With positive-definite observed covariance, the finite posterior law is Gaussian with the Schur-complement covariance, which may be singular. Finite Gaussian-process posterior and predictive laws
Verification
Given: The parameters, repeated test list, and observation vector in the Example.
For any finite coefficient list, the constant kernel's quadratic form is . Thus [F1] constructs the cylinder GP and [F2] supplies . Their product probability exists by [F3]; its process and noise random elements are measurable by [F5] and independent by [F4].
The observation covariance is , which has rank one, while has quadratic form for every nonzero . Hence it is positive definite and . For the repeated test list, . Since is positive definite, the hypotheses of [F6] hold.
Multiplication gives . Also , so and the conditional covariance is . Its determinant is zero and its rank is one. By [F6] this is a valid singular Gaussian conditional law.
The prior observation covariance and conditional predictive covariance are both singular, whereas the matrix inverted by the formula is the positive-definite observed covariance . This verifies why singular prior and predictive blocks are permitted under the stated condition.
A Gaussian process retains uncertainty at an independent index
Example
Let , let , and set if and otherwise. Observe only with independent noise variance one and predict . The posterior-kernel law of is for every observation value, so observing the independent coordinate does not reduce uncertainty at .
Facts & Assumptions
Given: AC; the two-index equality kernel; and an independent observation-noise variable.
AC is required by the finite Gaussian-process and multivariate-normal constructions. The Axiom of Choice
Any symmetric positive-semidefinite kernel on an arbitrary set defines a canonical cylinder-space Gaussian process under AC. A mean and positive-semidefinite kernel define a Gaussian process
Under AC, every finite symmetric positive-semidefinite covariance matrix defines a possibly singular Gaussian law. Multivariate normal law, including singular covariance
A finite product of sigma-finite measures exists and has the rectangle product formula. For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique
Product-coordinate random elements are independent when their rectangle probabilities factor. Independent random elements Independent random elements are characterized by finite rectangle probabilities
Coordinates on the cylinder sigma-algebra are measurable, and a finite product sigma-algebra is generated by its coordinate sets. Coordinate maps, finite-coordinate cylinders, and the cylinder -algebra The product sigma-algebra and its finite iterates
With positive-definite observed covariance, the finite posterior law is Gaussian with the stated mean and covariance. Finite Gaussian-process posterior and predictive laws
Verification
Given: The two-index model and one noisy observation in the Example.
For any finite list of indices, group coefficients at repeated sites. The equality kernel's quadratic form is the sum, over distinct sites , of , hence is nonnegative. By [F1] the canonical GP law exists and [F2] supplies the noise law. Their product probability exists by [F3]; its process and noise random elements are measurable by [F5] and independent by [F4].
Here , , , and the noise covariance is . Thus , so [F6] applies.
The formula in [F6] gives posterior mean and variance for every . Hence the posterior version at the unobserved independent index is its original law.