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.
Linear Gaussian inverse posteriors and Tikhonov
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
- Bayesian models, priors, and posterior laws
- 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
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- 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
- Domination and Likelihood Ratios
- 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
- Function-space priors and sample regularity
- 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
- Hilbert Space Geometry and Riesz Representation
- 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
- Inverse maps, identifiability, and stability
- Lebesgue Measure on Euclidean Space
- Lebesgue-Stieltjes Measures and Distribution Functions
- Likelihood potentials and posterior propriety
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Loss, Risk and Decision Theory
- 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
- Normed and Banach Spaces
- 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
- Posterior propriety and dominated Bayes formula
- 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
- Standard-Borel Real Codings and Determining Classes
- State-space model laws
- Statistical Experiments, Models and Identifiability
- 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 Moore--Penrose Pseudoinverse and Regularised Least Squares
- 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 · Logical flowchart
3 · Definitions, theorems and proofs
Support and pseudoinverse coordinates of a finite singular Gaussian
Statement
Assume the Axiom of Choice. Let , , and let be symmetric with for every . Let be a random vector with law , and define for Borel . Write , and put . For a Borel probability on , define its topological support by where is the open Euclidean ball. If , there are and a symmetric positive-definite with such that Moreover, has the same law as , where , and Here is the unique matrix satisfying , , and such that and are symmetric. If , then , almost surely, , and the support is .
Statement references
Facts & Assumptions
Given: AC, a finite-dimensional real inner-product space, a symmetric positive-semidefinite covariance matrix , a mean vector , and a supplied law .
AC is assumed by the multivariate-normal and standard-normal construction interfaces. The Axiom of Choice
A finite-dimensional non-negative operator has an orthonormal eigenbasis with non-negative eigenvalues. A non-negative operator is equivalently self-adjoint with nonnegative eigenvalues, a positive semidefinite matrix in an orthonormal basis, or an operator of the form S^*S
A finite-dimensional non-negative operator has a unique non-negative square root. A non-negative operator has a unique non-negative square root
A multivariate-normal law permits singular covariance and is the law of its mean plus the covariance square root applied to a vector of independent standard-normal coordinates. Multivariate normal law, including singular covariance
A positive-definite multivariate-normal covariance gives a Lebesgue density that is strictly positive everywhere. A positive-definite multivariate normal law has its Gaussian density
A matrix is a Moore–Penrose pseudoinverse when it satisfies the four Penrose equations, and every finite real matrix has a unique such matrix. The Moore--Penrose pseudoinverse as the solution of the four Penrose equations, Every finite real or complex matrix has a unique Moore--Penrose pseudoinverse
Proof
Given: The hypotheses in the Statement.
By [F1], choose an orthonormal eigenbasis of and order it so the positive eigenvalues are . Let have the corresponding eigenvectors as columns and set . The zero eigenspace is the orthogonal complement of these columns, so and . When , the eigenbasis gives .
If , set . The decomposition in step 1.1 gives , hence and ; also and are symmetric. Thus satisfies all four equations in [F5], so uniqueness gives . If , the zero matrix satisfies the four equations for , and uniqueness gives .
Suppose . By [F2], the square root is . By [F3], has the law of for a standard-normal vector . For every , the scalar is centered normal with variance , so has law . Therefore has the stated representation. When , [F3] makes almost surely.
If , let be any point of . The continuous map sends to , so the preimage of every open ball about contains an open ball about . By [F4], assigns positive measure to every nonempty open ball. The representation in step 2.2 therefore gives positive -mass to every neighborhood of . Conversely, the law in step 2.2 is concentrated on the finite-dimensional closed affine subspace ; every point outside it has a neighborhood of zero mass. Hence the support is exactly that subspace. If , the point-mass law from step 2.2 has support .
Finite linear Gaussian inverse posterior with singular prior covariance
Statement
Assume AC. Let , , and let be symmetric with for every . Let and let be symmetric positive definite, meaning for every nonzero . Suppose and are independent random vectors with laws and , and set . Define for Borel , and set . Then is positive definite. For each , define For every , , so the normalized potential update is a probability measure and equals the conditional-law version obtained by conditioning the observation model at . Its Gaussian formula, defined for every , is Let for Borel . Conditional-law versions are unique only -almost surely. The displayed mean and covariance formulas invert only , not ; and the posterior covariance may be singular. The prior support is .
Statement references
Facts & Assumptions
Given: AC; a finite-dimensional Gaussian prior with ; independent Gaussian observation noise with ; and the linear observation map .
AC is assumed by the repository's multivariate-normal, Gaussian-process, and finite Gaussian conditioning interfaces. The Axiom of Choice
A finite Gaussian law is characterized by its Gaussian scalar projections, permits singular covariance, and has the covariance-square-root representation. Multivariate normal law, including singular covariance
The prior is supported on and admits coordinates with a standard Gaussian vector on that range. Support and pseudoinverse coordinates of a finite singular Gaussian
A real process is Gaussian when all its finite linear combinations are normal. Gaussian process
Independence of random elements is independence of their generated sigma-algebras. Independent random elements
Measurable functions of independent random elements remain independent. Measurable coordinatewise functions preserve independence
For a finite Gaussian process with independent Gaussian observation noise, if the observed covariance is positive definite, the conditional law of the test vector is the Gaussian with mean and covariance , defined for every even when the prior or conditional covariance is singular. Finite Gaussian-process posterior and predictive laws
A positive-definite Gaussian observation-noise covariance has the Lebesgue density proportional to , which is strictly positive everywhere. A positive-definite multivariate normal law has its Gaussian density
The inverse-problem potential update is the prior reweighted by and normalized by its evidence when that evidence is positive and finite. Misfit evidence and the potential posterior law
A finite continuous potential with lower envelope under a proper prior on a separable Banach space has positive finite evidence at every datum. Function-space posterior propriety from a common lower envelope
Proof
Given: The hypotheses in the Statement.
For , , since the first term is nonnegative and the second is positive. Thus and exists.
Let be the finite index set with state indices and observation indices . Define and . Every finite linear combination of these coordinates is a linear projection of , so it is normal by [F1] and is a Gaussian process by [F3]. Its covariance blocks are , , and .
For each fixed , is finite, continuous, and nonnegative on , and is jointly continuous. The prior is a probability on the separable Banach space , and the envelope satisfies . Therefore [F9] gives for every , and [F8] defines . The likelihood density from [F7] is a positive constant independent of times ; its constant cancels in the normalized update.
The vector is a measurable function of , so [F4] and [F5] make independent of . The observed covariance is by step 1.1. Applying [F6] with test list and observation list gives the displayed Gaussian conditional-law version for every .
Suppose . By [F2], write and represent as , where and . Put and . By the pushforward formula for and the likelihood in [F7], the density of the normalized update in these coordinates is proportional, for every , to This is a pointwise fixed-data calculation; it does not replace the all-data version convention in step 1.3.
Set and . Then , and expansion gives Thus the update in step 2.2 is the Gaussian law of with mean and covariance , so the update of has mean and covariance .
Since , multiplication gives , hence . Also , so . Substituting these identities into step 3.1 yields and These are exactly the mean and covariance in the Statement.
If , [F2] gives and almost surely. Reweighting a point mass by the positive likelihood leaves that point mass, while the displayed formulas reduce to mean and covariance . This also matches the conditional version from step 2.1 and proves the rank-zero boundary. Thus the fixed-data update and the stated all-data conditional version have the displayed law in every rank case.
Finite Gaussian MAP, posterior mean, and support-restricted Tikhonov minimizer coincide
Statement
Assume AC and let , , symmetric with for all , , and symmetric with for all nonzero . Let and be independent, and observe . Put and . The -dimensional Euclidean Lebesgue measure on is the pushforward of Lebesgue measure on under any affine isometry onto ; this measure is independent of the chosen orthonormal coordinates. A MAP point means a maximizer of the posterior density with respect to this measure; for , the unique point of is the MAP point. The Moore–Penrose pseudoinverse satisfies and and are symmetric. The optimization below is restricted to . Then for every , the unique MAP point equals the posterior mean and the unique minimizer over of All objects are finite-dimensional; no minimization over points outside the prior support is asserted when is singular.
Statement references
Facts & Assumptions
Given: AC; the finite linear Gaussian inverse model with , , and the support and MAP conventions in the Statement.
AC is inherited from the finite Gaussian posterior and multivariate-normal interfaces. The Axiom of Choice
The posterior update is the finite Gaussian law with the stated mean and covariance, defined for every datum. Finite linear Gaussian inverse posterior with singular prior covariance
There are orthonormal range coordinates , , and the prior support is . Support and pseudoinverse coordinates of a finite singular Gaussian
The Moore–Penrose pseudoinverse is characterized by the four Penrose equations. The Moore--Penrose pseudoinverse as the solution of the four Penrose equations
A finite-dimensional non-negative matrix has a unique non-negative square root, and a non-negative self-adjoint matrix has an orthonormal eigenbasis. A non-negative operator has a unique non-negative square root, A non-negative operator is equivalently self-adjoint with nonnegative eigenvalues, a positive semidefinite matrix in an orthonormal basis, or an operator of the form S^*S
The Tikhonov objective is for . The Tikhonov regularised least-squares objective for
For this objective the unique minimizer is . For every , the Tikhonov objective is strictly convex and has the unique minimiser
A positive-definite Gaussian law has a density proportional to its positive quadratic exponential. A positive-definite multivariate normal law has its Gaussian density
Proof
Given: The hypotheses in the Statement.
If , [F2] gives and . The posterior is the point mass at by [F1], so its mean and unique MAP point are . The objective has only this admissible point, hence it has the same unique minimizer on .
Suppose . By [F2], choose with , , and write . The map is a bijection from onto . For , .
Let be the non-negative square root of . Since , is symmetric positive definite and by [F4]. Set and . Substituting into the objective in the Statement gives . This is the Tikhonov objective in [F5] with , so [F6] gives the unique minimizer .
By the Gaussian representation in [F2], the prior coordinate has standard Gaussian density. The likelihood is proportional to by [F7]. Thus the posterior density in is proportional to . Its precision matrix is positive definite, and completing the square gives a Gaussian density with mean and covariance . This density has its unique maximum at its mean. The affine bijection in step 1.2 has constant positive Jacobian in orthonormal coordinates on , so its image has the unique MAP point . Its posterior mean is also , and step 2.1 makes this point the unique minimizer of on .
4 · Examples, counterexamples and false statements
None yet.