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 — Examples and Counterexamples
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 Gaussian inverse posteriors and Tikhonov
- 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
None yet.
4 · Examples, counterexamples and false statements
A rank-one prior gives a singular Gaussian inverse posterior
Example
Assume AC. Let , independently, , and observe in the model . The prior support is . The Gaussian posterior version has mean and covariance . On , the support-restricted objective is and its unique minimizer is .
Example references
Facts & Assumptions
Given: AC, the model and datum in the Example.
AC is inherited from the Gaussian-law and finite Gaussian-conditioning interfaces. The Axiom of Choice
The finite linear Gaussian posterior mean and covariance are given by the displayed conditioning formulas, even for singular prior covariance. Finite linear Gaussian inverse posterior with singular prior covariance
The posterior MAP and mean equal the unique support-restricted Tikhonov minimizer. Finite Gaussian MAP, posterior mean, and support-restricted Tikhonov minimizer coincide
A rank-one Gaussian prior with covariance has support and pseudoinverse . Support and pseudoinverse coordinates of a finite singular Gaussian
Verification
Given: The hypotheses and facts in the Example and Facts & Assumptions.
Here and . Thus and , which gives the posterior mean and covariance in the Example by [F1].
On , and by [F3]. The objective becomes , so it has the unique minimizer . By [F2] this point is also the posterior MAP and mean, as asserted.
Prior whitening turns an anisotropic Gaussian posterior into Tikhonov form
Example
Assume AC. Let , independently, , and observe in . Put and . The coordinate change makes the prior on standard Gaussian, and whitens the observation noise in that . The preconditioned Tikhonov objective is The posterior mean, MAP point, and minimizer in the original parameter coordinates are , and the posterior covariance is .
Example references
Facts & Assumptions
Given: AC, the model and datum in the Example.
AC is inherited from the Gaussian-law and finite Gaussian-conditioning interfaces. The Axiom of Choice
The finite linear Gaussian posterior formula is valid for singular or positive-definite prior covariance and positive-definite noise covariance. Finite linear Gaussian inverse posterior with singular prior covariance
The finite Gaussian MAP and posterior mean equal the support-restricted Tikhonov minimizer. Finite Gaussian MAP, posterior mean, and support-restricted Tikhonov minimizer coincide
For , the Tikhonov objective is , with unique minimizer . The Tikhonov regularised least-squares objective for , For every , the Tikhonov objective is strictly convex and has the unique minimiser
Verification
Given: The hypotheses and facts in the Example and Facts & Assumptions.
Here , so [F1] gives and .
The whitening matrices satisfy and , while . Applying [F3] with gives . Therefore . By [F2] this is the unique MAP, posterior mean, and support-restricted minimizer.
A non-Gaussian posterior can have different MAP and mean
Statement refuted
For every probability density on with finite first absolute moment and at least one global maximizer, every maximum a posteriori (MAP) point, meaning every global maximizer of , equals its mean .
Statement references
Facts & Assumptions
Given: AC; a prior uniform on ; independent standard-normal observation noise; and the observation model in the Counterexample.
AC is assumed by the standard-normal law. The Axiom of Choice
The standard-normal noise has a strictly positive Gaussian density. Standard normal and normal laws, A positive-definite multivariate normal law has its Gaussian density
A normalized potential update is the prior reweighted by its likelihood and divided by its evidence when the evidence is positive and finite. Misfit evidence and the potential posterior law
The equality of MAP, posterior mean, and support-restricted Tikhonov minimizer proved for the finite Gaussian model uses Gaussian prior and likelihood assumptions. Finite Gaussian MAP, posterior mean, and support-restricted Tikhonov minimizer coincide
Counterexample
Given: Let have the uniform probability density on . Independently let , observe , and condition on . The likelihood potential is on and the posterior density relative to Lebesgue measure is
The evidence in [F2] is . Since on , one has . Thus the displayed normalized posterior density is proper.
On , the derivative of is . The posterior density vanishes outside , so its unique global maximizer is . Its support is the bounded interval and it is not a point mass. A nondegenerate one-dimensional Gaussian has a strictly positive density on all of by [F1], whereas a zero-variance Gaussian is a point mass. Therefore this posterior is non-Gaussian.
The posterior mean is which differs from the MAP point . This refutes the universal claim. It also shows why [F3] is restricted to the Gaussian model.