Alphabeta Math
Pipeline-generated
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

2 · Logical flowchart

3 · Definitions, theorems and proofs

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

Support and pseudoinverse coordinates of a finite singular Gaussian

Statement

Assume the Axiom of Choice. Let n≥1, m∈Rn, and let C∈Rn×n be symmetric with vTCv≥0 for every v∈Rn. Let X be a random vector with law Nn(m,C), and define μX(E)=P(X∈E) for Borel E⊆Rn. Write Ran⁡(C)={Cv:v∈Rn}, and put r=dim⁡Ran⁡(C). For a Borel probability μ on Rn, define its topological support by supp⁡(μ)={x:μ(B(x,ε))>0 for every ε>0}, where B(x,ε) is the open Euclidean ball. If r>0, there are U∈Rn×r and a symmetric positive-definite Λ∈Rr×r with UTU=Ir such that C=UΛUT,Ran⁡(C)=Ran⁡(U),C†=UΛ−1UT. Moreover, X has the same law as m+UΛ1/2Z, where Z∼Nr(0,Ir), and supp⁡(μX)=m+Ran⁡(C). Here C† is the unique matrix satisfying CC†C=C, C†CC†=C†, and such that CC† and C†C are symmetric. If r=0, then C=0, X=m almost surely, C†=0, and the support is {m}.

Facts & Assumptions

Given: AC, a finite-dimensional real inner-product space, a symmetric positive-semidefinite covariance matrix C, a mean vector m, and a supplied law X∼Nn(m,C).

[A1]

AC is assumed by the multivariate-normal and standard-normal construction interfaces. The Axiom of Choice

[F2]

A finite-dimensional non-negative operator has a unique non-negative square root. A non-negative operator has a unique non-negative square root

[F3]

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

[F4]

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

[F5]

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 A+ 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.

1.1givenF1algebra

By [F1], choose an orthonormal eigenbasis of C and order it so the positive eigenvalues are λ1,…,λr. Let U have the corresponding eigenvectors as columns and set Λ=diag⁡(λ1,…,λr). The zero eigenspace is the orthogonal complement of these columns, so C=UΛUT and Ran⁡(C)=Ran⁡(U). When r=0, the eigenbasis gives C=0.

2.1F5step 1.1algebra

If r>0, set P=UΛ−1UT. The decomposition in step 1.1 gives CP=PC=UUT, hence CPC=C and PCP=P; also CP and PC are symmetric. Thus P satisfies all four equations in [F5], so uniqueness gives P=C†. If r=0, the zero matrix satisfies the four equations for C=0, and uniqueness gives C†=0.

2.2A1F2F3step 1.1algebra

Suppose r>0. By [F2], the square root is C1/2=UΛ1/2UT. By [F3], X has the law of m+UΛ1/2UTZn for a standard-normal vector Zn. For every a∈Rr, the scalar aTUTZn=(Ua)TZn is centered normal with variance ∥Ua∥22=∥a∥22, so UTZn has law Nr(0,Ir). Therefore X has the stated representation. When r=0, [F3] makes X=m almost surely.

3.1F4step 2.2givenconstruct∎

If r>0, let x=m+UΛ1/2z be any point of m+Ran⁡(C). The continuous map t↦m+UΛ1/2t sends z to x, so the preimage of every open ball about x contains an open ball about z. By [F4], Nr(0,Ir) assigns positive measure to every nonempty open ball. The representation in step 2.2 therefore gives positive μX-mass to every neighborhood of x. Conversely, the law in step 2.2 is concentrated on the finite-dimensional closed affine subspace m+Ran⁡(C); every point outside it has a neighborhood of zero mass. Hence the support is exactly that subspace. If r=0, the point-mass law from step 2.2 has support {m}.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

Finite linear Gaussian inverse posterior with singular prior covariance

Statement

Assume AC. Let n,m≥1, m0∈Rn, and let C0∈Rn×n be symmetric with vTC0v≥0 for every v∈Rn. Let A∈Rm×n and let Γ∈Rm×m be symmetric positive definite, meaning uTΓu>0 for every nonzero u∈Rm. Suppose X and η are independent random vectors with laws X∼Nn(m0,C0) and η∼Nm(0,Γ), and set Y=AX+η. Define μ0(E)=P(X∈E) for Borel E⊆Rn, and set S=AC0AT+Γ. Then S is positive definite. For each y∈Rm, define Φy(x)=12(y−Ax)TΓ−1(y−Ax),Z(y)=∫Rne−Φy(x) μ0(dx). For every y, 0<Z(y)<∞, so the normalized potential update Πy(E)=∫Ee−Φy(x) μ0(dx)Z(y)(E∈B(Rn)) is a probability measure and equals the conditional-law version obtained by conditioning the observation model at y. Its Gaussian formula, defined for every y, is Nn ⁣(m0+C0ATS−1(y−Am0), C0−C0ATS−1AC0). Let PY(B)=P(Y∈B) for Borel B⊆Rm. Conditional-law versions are unique only PY-almost surely. The displayed mean and covariance formulas invert only S, not C0; C0 and the posterior covariance may be singular. The prior support is m0+Ran⁡(C0).

Facts & Assumptions

Given: AC; a finite-dimensional Gaussian prior Nn(m0,C0) with C0⪰0; independent Gaussian observation noise Nm(0,Γ) with Γ≻0; and the linear observation map A.

[A1]

AC is assumed by the repository's multivariate-normal, Gaussian-process, and finite Gaussian conditioning interfaces. The Axiom of Choice

[F1]

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

[F2]

The prior is supported on m0+Ran⁡(C0) and admits coordinates C0=UΛUT with a standard Gaussian vector on that range. Support and pseudoinverse coordinates of a finite singular Gaussian

[F3]

A real process is Gaussian when all its finite linear combinations are normal. Gaussian process

[F4]

Independence of random elements is independence of their generated sigma-algebras. Independent random elements

[F5]

Measurable functions of independent random elements remain independent. Measurable coordinatewise functions preserve independence

[F6]

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 m∗+K∗X(KXX+R)−1(y−mX) and covariance K∗∗−K∗X(KXX+R)−1KX∗, defined for every y even when the prior or conditional covariance is singular. Finite Gaussian-process posterior and predictive laws

[F7]

A positive-definite Gaussian observation-noise covariance has the Lebesgue density proportional to exp⁡(−12zTΓ−1z), which is strictly positive everywhere. A positive-definite multivariate normal law has its Gaussian density

[F8]

The inverse-problem potential update is the prior reweighted by e−Φy and normalized by its evidence when that evidence is positive and finite. Misfit evidence and the potential posterior law

[F9]

A finite continuous potential with lower envelope 0 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.

1.1givenalgebra

For v∈Rm∖{0}, vTSv=(ATv)TC0(ATv)+vTΓv>0, since the first term is nonnegative and the second is positive. Thus S≻0 and S−1 exists.

1.2A1F1F3givenconstructalgebra

Let T be the finite index set with state indices s1,…,sn and observation indices o1,…,om. Define fsi=Xi and foj=(AX)j. Every finite linear combination of these coordinates is a linear projection of X, so it is normal by [F1] and f is a Gaussian process by [F3]. Its covariance blocks are KSS=C0, KSO=C0AT, and KOO=AC0AT.

1.3F7F8F9givenalgebra

For each fixed y, Φy is finite, continuous, and nonnegative on Rn, and (x,y)↦Φy(x) is jointly continuous. The prior μ0 is a probability on the separable Banach space Rn, and the envelope M1(r)=0 satisfies ∫eM1(∥x∥2) μ0(dx)=1. Therefore [F9] gives 0<Z(y)<∞ for every y, and [F8] defines Πy. The likelihood density from [F7] is a positive constant independent of x times e−Φy(x); its constant cancels in the normalized update.

2.1A1F4F5F6givenstep 1.1step 1.2algebra

The vector f is a measurable function of X, so [F4] and [F5] make η independent of f. The observed covariance is KOO+Γ=S≻0 by step 1.1. Applying [F6] with test list S and observation list O gives the displayed Gaussian conditional-law version for every y.

2.2F2F7F8step 1.3given

Suppose r=rank⁡(C0)>0. By [F2], write C0=UΛUT and represent X as m0+Lξ, where L=UΛ1/2 and ξ∼Nr(0,Ir). Put B=AL and d=y−Am0. By the pushforward formula for μ0 and the likelihood in [F7], the density of the normalized update in these coordinates is proportional, for every y, to exp⁡ ⁣(−12[ξTξ+(d−Bξ)TΓ−1(d−Bξ)]). This is a pointwise fixed-data calculation; it does not replace the all-data version convention in step 1.3.

3.1F2F7step 2.2algebra

Set Q=Ir+BTΓ−1B and h=BTΓ−1d. Then Q≻0, and expansion gives ξTξ+(d−Bξ)TΓ−1(d−Bξ)=(ξ−Q−1h)TQ(ξ−Q−1h)+dTΓ−1d−hTQ−1h. Thus the update in step 2.2 is the Gaussian law of ξ with mean Q−1h and covariance Q−1, so the update of X=m0+Lξ has mean m0+LQ−1BTΓ−1d and covariance LQ−1LT.

4.1step 1.1step 3.1algebra

Since S=Γ+BBT, multiplication gives QBT=BTΓ−1S, hence Q−1BTΓ−1=BTS−1. Also Q(Ir−BTS−1B)=Q−QBTS−1B=Ir, so Q−1=Ir−BTS−1B. Substituting these identities into step 3.1 yields m0+LQ−1BTΓ−1d=m0+C0ATS−1d and LQ−1LT=C0−C0ATS−1AC0. These are exactly the mean and covariance in the Statement.

5.1F2F7F8step 2.1step 1.3algebra∎

If r=0, [F2] gives C0=0 and X=m0 almost surely. Reweighting a point mass by the positive likelihood leaves that point mass, while the displayed formulas reduce to mean m0 and covariance 0. 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.

CorollaryStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Finite Gaussian MAP, posterior mean, and support-restricted Tikhonov minimizer coincide

Statement

Assume AC and let n,m≥1, m0∈Rn, C0∈Rn×n symmetric with vTC0v≥0 for all v∈Rn, A∈Rm×n, and Γ∈Rm×m symmetric with uTΓu>0 for all nonzero u∈Rm. Let X∼Nn(m0,C0) and η∼Nm(0,Γ) be independent, and observe Y=AX+η. Put S0=m0+Ran⁡(C0) and r=dim⁡Ran⁡(C0). The r-dimensional Euclidean Lebesgue measure on S0 is the pushforward of Lebesgue measure on Rr under any affine isometry onto S0; 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 r=0, the unique point of S0 is the MAP point. The Moore–Penrose pseudoinverse C0† satisfies C0C0†C0=C0,C0†C0C0†=C0†, and C0C0† and C0†C0 are symmetric. The optimization below is restricted to S0. Then for every y∈Rm, the unique MAP point equals the posterior mean and the unique minimizer over x∈S0 of Jy(x)=(Ax−y)TΓ−1(Ax−y)+(x−m0)TC0†(x−m0). All objects are finite-dimensional; no minimization over points outside the prior support is asserted when C0 is singular.

Facts & Assumptions

Given: AC; the finite linear Gaussian inverse model with C0⪰0, Γ≻0, and the support and MAP conventions in the Statement.

[A1]

AC is inherited from the finite Gaussian posterior and multivariate-normal interfaces. The Axiom of Choice

[F1]

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

[F2]

There are orthonormal range coordinates C0=UΛUT, C0†=UΛ−1UT, and the prior support is m0+Ran⁡(U). Support and pseudoinverse coordinates of a finite singular Gaussian

[F3]

The Moore–Penrose pseudoinverse is characterized by the four Penrose equations. The Moore--Penrose pseudoinverse A+ as the solution of the four Penrose equations

[F4]
[F5]

The Tikhonov objective is ∥Dz−b∥22+λ∥z∥22 for λ>0. The Tikhonov regularised least-squares objective ∥Ax−b∥22+λ∥x∥22 for λ>0

[F7]

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.

1.1F1F2givenalgebra

If r=0, [F2] gives C0=0 and S0={m0}. The posterior is the point mass at m0 by [F1], so its mean and unique MAP point are m0. The objective Jy has only this admissible point, hence it has the same unique minimizer on S0.

1.2F2F3givenalgebraconstruct

Suppose r>0. By [F2], choose U,Λ with C0=UΛUT, C0†=UΛ−1UT, and write L=UΛ1/2. The map z↦m0+Lz is a bijection from Rr onto S0. For x=m0+Lz, (x−m0)TC0†(x−m0)=zTz.

2.1F4F5F6step 1.2algebra

Let W be the non-negative square root of Γ−1. Since Γ≻0, W is symmetric positive definite and WTW=Γ−1 by [F4]. Set D=WAL and b=W(y−Am0). Substituting x=m0+Lz into the objective in the Statement gives Jy(m0+Lz)=∥Dz−b∥22+∥z∥22. This is the Tikhonov objective in [F5] with λ=1, so [F6] gives the unique minimizer z^=(DTD+Ir)−1DTb.

3.1A1F1F2F7step 1.2step 2.1algebra∎

By the Gaussian representation in [F2], the prior coordinate z has standard Gaussian density. The likelihood is proportional to exp⁡(−12∥Dz−b∥22) by [F7]. Thus the posterior density in z is proportional to exp⁡[−12(∥Dz−b∥22+∥z∥22)]. Its precision matrix H=Ir+DTD is positive definite, and completing the square gives a Gaussian density with mean H−1DTb=z^ and covariance H−1. This density has its unique maximum at its mean. The affine bijection in step 1.2 has constant positive Jacobian in orthonormal coordinates on S0, so its image has the unique MAP point x^=m0+Lz^. Its posterior mean is also m0+Lz^, and step 2.1 makes this point the unique minimizer of Jy on S0.

4 · Examples, counterexamples and false statements

None yet.

Sources