Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
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 posterior law in an isonormal inverse experiment

Statement

Assume the Axiom of Choice. Let X and H be separable real Hilbert spaces with supplied finite or countable complete orthonormal bases (vj) and (en). Let K:X→H be bounded and linear, let ϵ>0, and let U be a Borel Gaussian random element with mean m0∈X and positive self-adjoint, injective, trace-class covariance C0. Let Z be a jointly Gaussian centered family indexed by H, linear into L2 with covariance E[Z(g)Z(k)]=⟨g,k⟩H, independent of U, and observe the random field Y(g)=⟨KU,g⟩H+ϵZ(g),g∈H, on RH with its cylinder sigma-algebra CH; write PY for the law of this field. Write S=C01/2, B=SK∗KS,R=(B+ϵ2IX)−1,Cpost=ϵ2SRS, and for h∈X put Φh=KSRSh. For y∈RH, set bj(y)=⟨m0,vj⟩X+y(Φvj)−⟨Km0,Φvj⟩H. If ∑jbj(y)2<∞, define My=∑jbj(y)vj; otherwise define My=m0. In finite dimension these sums terminate, and an empty basis is allowed for the zero space.

There is a data-indexed probability kernel Πy on X that is a regular conditional law of U given the field Y, and for every y it is the Borel Gaussian law with mean My and covariance Cpost. In particular, for every fixed h∈X and every Borel set A⊆R, Πy{u:⟨u,h⟩X∈A}=N ⁣(⟨My,h⟩X,⟨Cposth,h⟩X)(A). For each fixed h, for PY-almost every y, ⟨My,h⟩X=⟨m0,h⟩X+y(Φh)−⟨Km0,Φh⟩H. The exceptional null set in this identity may depend on h; no simultaneous identity for every h on one sample set is asserted. Here N(a,σ2) denotes the scalar normal law of mean a and variance σ2, including the zero-variance point mass.

Facts & Assumptions

Given: The Gaussian Bayesian model and operator hypotheses in the Statement, including the supplied bases and the independent isonormal noise.

[F1]

The white-noise field is centered after subtracting its signal, has covariance E[Z(g)Z(k)]=⟨g,k⟩H, and each finite orthonormal coordinate tuple consists of independent standard normals. Isonormal Gaussian white-noise inverse experiment

[F2]

A proper prior and sampling kernel define the joint prior-predictive law; a posterior is a regular conditional distribution of the parameter given the data field. Bayesian model as a prior and sampling kernel, Bayesian posterior as a regular conditional law

[F3]

Translation by the fixed mean m0 preserves Borel measurability, so U−m0 is a centered Borel Gaussian random element with covariance C0; every finite family of its continuous linear projections is jointly Gaussian because each scalar linear combination is again such a projection. The finite-linear-combination criterion in Gaussian process records this joint-Gaussian convention. The centered premise applies to U−m0, not to U when m0≠0. Centered Borel Gaussian random element on a separable Banach space, Gaussian process

[F4]

A positive trace-class operator is compact and has a positive square root under Countable Choice. The spectral theorem supplies a complete eigenbasis for C0; the positive-trace theorem gives tr⁡C0 as the sum of its positive eigenvalues, so S=C01/2 is Hilbert–Schmidt relative to that basis with squared norm tr⁡C0, and Hilbert–Schmidt basis independence transfers this to the supplied bases. For every positive trace-class T, its trace is the sum of its diagonal entries in any supplied Hilbert basis. Composing a compact operator with bounded operators preserves compactness. Trace class operator, Self-adjoint, positive, unitary and normal operators, Positive square root of a compact positive operator, Hilbert–Schmidt operator and Hilbert–Schmidt norm, The Hilbert–Schmidt norm is basis independent, Trace of a positive operator is the sum of its eigenvalues, Trace is absolutely convergent and basis independent, Compositions with a compact operator are compact

[F5]

A bounded linear K has adjoint K∗ satisfying ⟨Kx,g⟩H=⟨x,K∗g⟩X, and (KS)∗(KS)+λI is invertible for every λ>0. A bounded linear operator between normed spaces, The shifted Hilbert-space normal operator is invertible with inverse norm at most 1/λ, The Hilbert-space adjoint of a bounded operator

[F6]

Under the Axiom of Choice, finite jointly Gaussian blocks with zero cross-covariance are independent. Independent finite Gaussian vectors are jointly Gaussian, including singular covariance matrices. Jointly Gaussian blocks with zero cross-covariance are independent, including singular blocks, A finite stack of independent Gaussian vectors is jointly Gaussian

[F7]

In a Hilbert space, a supplied complete orthonormal basis gives norm-convergent Fourier expansions and Parseval's identity. Hilbert space, Orthonormal families, complete orthonormal systems and Hilbert bases, Fourier expansion in a Hilbert space, Parseval equivalences for an orthonormal family

[F8]

Tonelli interchanges expectation and a countable sum of nonnegative random variables; composing a Hilbert–Schmidt operator with a bounded one preserves the Hilbert–Schmidt property, and a product of two Hilbert–Schmidt operators is trace class. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product, Hilbert Schmidt operators form a two sided ideal, Trace class iff product of two Hilbert Schmidt operators

[F9]

Finite measures agreeing on a generating pi-system that contains the whole space agree on its generated sigma-algebra. The constant sequence equal to the whole space supplies the required finite-measure exhaustion. Measures agreeing on a generating pi-system are equal under an increasing finite-measure exhaustion from that pi-system

[F10]

A nonnegative-kernel integral of a jointly measurable function is measurable in the conditioning argument. Measurability of integration against a kernel

[F11]

Markov's inequality, the first Borel–Cantelli lemma, and measurability of limits apply to the scalar coordinate reconstructions. Chebyshev-Markov inequality for the integral, The first Borel-Cantelli lemma for measures, Sequential suprema, infima, limsup, liminf, and pointwise limits of measurable functions are measurable

[F12]

Independence means independence of generated sigma-algebras, and measurable functions of independent random elements remain independent. Independent random elements, Measurable coordinatewise functions preserve independence

[A1]

The Axiom of Choice is assumed. It implies Countable Choice for the Hilbert adjoint, square-root, and basis interfaces in [F4]–[F7], and is the explicit hypothesis of [F6]. The Axiom of Choice, The Axiom of Countable Choice (ACω)

Proof

1.1givenA1F4F5F8algebra

Set S=C01/2. The positive trace-class operator C0 is compact by [F4], so S is compact and self-adjoint. Then B=SK∗KS is compact, self-adjoint, and positive, because a composition containing a compact operator is compact. By [F5], applied to KS, B+ϵ2IX is bijective and R is bounded. Its inverse is self-adjoint: writing x=(B+ϵ2I)u and z=(B+ϵ2I)v transfers symmetry of B+ϵ2I to R. It is positive because ⟨Rz,z⟩=⟨v,(B+ϵ2I)v⟩≥ϵ2∥v∥2 when z=(B+ϵ2I)v. The inverse identities give BR=RB=I−ϵ2R. For z∈X, put v=Rz, so z=(B+ϵ2I)v. Expanding this equation and using self-adjointness of B gives ∥z∥2−ϵ2⟨Rz,z⟩=∥Bv∥2+ϵ2⟨Bv,v⟩≥0. Thus 0≤ϵ2R≤IX, so BR=I−ϵ2R is positive and I−BR=ϵ2R≥0. Define D=SBRS; then D is positive, Cpost=ϵ2SRS is positive, and D+Cpost=S(BR+ϵ2R)S=C0. The products are trace class by [F8] because S is Hilbert–Schmidt and the intervening operators are bounded. Consequently 0≤D≤C0 and tr⁡D≤tr⁡C0.

2.1givenF1F3F5step 1.1algebra

For g∈H, write Y0(g)=Y(g)−⟨Km0,g⟩H. The signal and noise are independent, so covariance expansion gives E[Y0(g)Y0(k)]=⟨KC0K∗g,k⟩H+ϵ2⟨g,k⟩H. For h∈X, Y0(Φh)=y(Φh)−⟨Km0,Φh⟩H when the observed field is y. Using SK∗Φh=BRSh and Φh=KSRSh, the covariance identity yields E[Y0(Φh)Y0(Φk)]=⟨SBRSh,k⟩X=⟨Dh,k⟩X. Likewise E[⟨U−m0,h⟩XY0(Φk)]=⟨Dh,k⟩X. These equalities follow by expanding the two covariance terms, using BR=RB and (B+ϵ2I)R=I.

3.1givenF7F8F11step 1.1step 2.1constructalgebra

For the supplied finite or countable basis (vj) of X, [F8] and step 1.1 give E∑j∣Y0(Φvj)∣2=∑j⟨Dvj,vj⟩X=tr⁡D≤tr⁡C0<∞. Therefore the nonnegative sum is finite almost surely: if it were infinite on a set of positive probability, its expectation would exceed every finite bound. Parseval gives ∑j∣⟨m0,vj⟩X∣2=∥m0∥X2<∞, and ∣a+b∣2≤2∣a∣2+2∣b∣2 shows ∑jbj(Y)2<∞ on that probability-one set. Hence the first branch of the Statement's definition applies and MY=m0+∑jY0(Φvj)vj there. The same argument includes finite and empty bases. The series converges in X by [F7]. Its partial sums are measurable; their Cauchy set is a countable intersection and union of norm-comparison events, hence measurable, and completeness of X gives a limit there. For each nonempty closed set F⊆X, distance to F is continuous, so the distance of the limit to F is the limit of the measurable distances of the partial sums; [F11] makes this limit measurable. Because each coordinate map y↦y(Φvj) is measurable for the cylinder sigma-algebra, the convergence construction and the default value m0 show that y↦My is measurable from (RH,CH) to X with its Borel sigma-algebra. For each fixed h, expand h in the supplied basis. The corresponding finite linear combinations of Y0(Φvj) converge in L2 to Y0(Φh), since [F7] makes the basis projections converge to h and [step 2.1] bounds the squared error by ∥D∥ times the squared projection error. The same finite combinations converge almost surely to the inner product of the coordinate-series limit with h. Uniqueness of limits in probability gives ⟨MY−m0,h⟩X=Y0(Φh) almost surely for this fixed h. This proves the displayed posterior-mean formula, with an exceptional set allowed to depend on h.

4.1givenF1F3step 1.1step 2.1step 3.1algebra

For fixed h∈X and g∈H, covariance expansion gives Cov⁡(⟨U−m0,h⟩X,Y0(g))=⟨KC0h,g⟩H. The covariance of Y0(Φh) with Y0(g) is ⟨KC0K∗Φh+ϵ2Φh,g⟩H. Since C0=S2, SK∗KS=B, and (B+ϵ2I)R=I, one has KC0K∗Φh+ϵ2Φh=KSBRSh+ϵ2KSRSh=KS(B+ϵ2I)RSh=KSSh=KC0h. By step 3.1, ⟨MY−m0,h⟩=Y0(Φh) almost surely, so the residual W=U−MY has zero covariance with every observation Y(g). Both ⟨U−m0,h⟩ and Y0(Φh) are centered, so the same identity shows E⟨W,h⟩=0 for each h; thus W is centered. Its covariance is C0−D=Cpost by the two covariance identities in step 2.1 and the covariance of U.

5.1givenF3F6F7F9F12step 3.1step 4.1constructalgebra

For each fixed basis vector vj, step 3.1 identifies ⟨MY−m0,vj⟩ almost surely with Y0(Φvj). For any finite list of basis vectors, intersect the corresponding probability-one events; the associated coordinates of W are then linear images of finite Gaussian projections of U−m0 and Z. The same holds jointly with any finite list of observations. The underlying finite U−m0 and Z blocks are independent by [F12], so their joint linear images are Gaussian by [F3] and [F6]. Step 4.1 makes the residual-coordinate and observation blocks have zero cross-covariance, so [F6] makes those blocks independent. The rational finite linear combinations of the supplied basis (vj) form a countable dense subset of X. For each center in this set, Parseval expresses the squared distance from W as the limit of finite sums of squared basis-coordinate differences, so open balls with rational radii about these centers are measurable in the basis-coordinate sigma-algebra; they form a countable base, proving that these coordinates generate the Borel sigma-algebra of W. For a fixed finite list of observations, finite basis-coordinate cylinder rectangles and observation rectangles have the product of their marginal probabilities by the independence just proved. These rectangles form a generating pi-system for the product of the residual Borel sigma-algebra and the finite observation Borel sigma-algebra, so [F9] extends the product identity and shows that W is independent of this finite observation block. Now fix any A∈B(X). The finite measures C↦P(W∈A,C) and C↦P(W∈A)P(C) agree on the pi-system of finite observation cylinder events, including the whole space. By [F9] they agree on σ(Y(g):g∈H). Since this holds for every A, W is independent of the full field. This argument includes finite and empty supplied bases and requires no inclusion in the ordinary completion of a basis-observation sigma-algebra.

6.1givenF2F10step 3.1step 4.1step 5.1constructalgebra

The map y↦My is measurable by step 3.1. Let ν be the Borel law of the residual random element W, whose mean is zero and covariance is Cpost by step 4.1. Define Πy(A)=∫X1A(My+w) ν(dw) for A∈B(X). The map (y,w)↦My+w is measurable, and [F10] makes y↦Πy(A) measurable; for each y, translation of ν is a probability measure. Since W is independent of the full data field by step 5.1 and U=MY+W, integrating first with respect to the fixed law ν gives P(U∈A,Y∈C)=∫CΠy(A) PY(dy) for every Borel A⊆X and C∈CH. This is the regular conditional distribution identity from [F2].

7.1givenF2F3F6F12step 3.1step 4.1step 6.1algebra∎

For every finite list h1,…,hq∈X, step 3.1 gives almost surely, simultaneously for this finite list, ⟨W,ha⟩=⟨U−m0,ha⟩−Y0(Φha). The vector of these residual functionals is therefore a linear image of finite Gaussian projections of U−m0 and Z, whose blocks are independent by [F12] and jointly Gaussian by [F3] and [F6]; hence it is jointly Gaussian. Step 4.1 gives that W is centered with covariance Cpost, so W is a centered Borel Gaussian random element with that covariance. Translating by My shows that every section Πy is Gaussian with mean My and covariance Cpost, including the zero-dimensional and finite-dimensional cases. For fixed h, step 3.1 identifies the posterior mean with ⟨m0,h⟩+y(Φh)−⟨Km0,Φh⟩ almost surely, and the scalar marginal under a translated Gaussian is normal with variance ⟨Cposth,h⟩. This proves all asserted posterior-law and feature-marginal formulas; the exceptional set remains feature-dependent.

Depends on

Used by

Dependency tree · two levels

162 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources