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 feature identifiability and Gaussian MAP tests

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

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

Exact linear feature estimability through the adjoint range

Definition

Assume Countable Choice. Let X be a real Hilbert space and let H be a separable real Hilbert space. Let K:X→H be bounded and linear, let ϵ>0, and let Z be a jointly Gaussian centered family indexed by H, linear into L2 with covariance E[Z(g)Z(k)]=⟨g,k⟩H. For each x∈X define Yx(g)=⟨Kx,g⟩H+ϵZ(g). A continuous linear feature is a map ϕ∈X∗, where X∗ is the continuous dual of X. By the Riesz representation theorem there is a unique hϕ∈X with ϕ(x)=⟨x,hϕ⟩X for every x∈X. The feature is exactly linearly estimable by one probe if some Φ∈H makes the statistic Yx(Φ) unbiased for ϕ(x) for every x∈X. Writing R(K∗)={K∗Φ:Φ∈H} for the adjoint range, this holds exactly when hϕ∈R(K∗). Every such probe has variance ϵ2∥Φ∥H2. This definition concerns one-probe unbiased linear estimators; it does not identify membership in R(K∗)‾ with exact estimability.

Facts & Assumptions

Given: Real Hilbert spaces X,H, a bounded linear map K:X→H, an isonormal white-noise experiment with ϵ>0, and a continuous linear feature ϕ(x)=⟨x,hϕ⟩X.

[F1]

In the isonormal experiment, ExYx(Φ)=⟨Kx,Φ⟩H and Var⁡x(Yx(Φ))=ϵ2∥Φ∥H2 for every fixed x∈X and Φ∈H. Isonormal Gaussian white-noise inverse experiment

[F2]

The adjoint satisfies ⟨Kx,Φ⟩H=⟨x,K∗Φ⟩X. The Hilbert-space adjoint of a bounded operator

[F3]

Every continuous linear functional on a real Hilbert space has a unique representing vector hϕ with ϕ(x)=⟨x,hϕ⟩X. Riesz representation for Hilbert spaces

[A1]

Countable Choice is assumed by [F2] and [F3]. The Axiom of Countable Choice (ACω)

Proof

1.1givenA1F1F2F3algebra

Fix a probe Φ∈H. By [F1] and [F2], whose supplier hypotheses are recorded in [A1], its mean at parameter x is ⟨x,K∗Φ⟩X and its variance is finite, equal to ϵ2∥Φ∥H2. If it is unbiased for every x, then ⟨x,K∗Φ−hϕ⟩X=0 for every x∈X. Taking x=K∗Φ−hϕ gives K∗Φ=hϕ, so hϕ∈R(K∗).

2.1givenA1F1F2F3step 1.1choosealgebra∎

Conversely, if hϕ∈R(K∗), use [A1] to choose Φ∈H with K∗Φ=hϕ. Equations [F1] and [F2] then give ExYx(Φ)=⟨x,hϕ⟩X=ϕ(x) for every x, and [F1] gives its finite variance ϵ2∥Φ∥H2. Hence this probe is an exact one-probe estimator, proving both directions and the variance assertion.

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

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.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicableverified 2026-10-22 (gpt-6.1-sol)Open item page →

Gaussian MAP feature test

Definition

Assume the Axiom of Choice. Let X,H be separable real Hilbert spaces, let K:X→H be bounded and linear, and let ϵ>0. Let U be a Borel Gaussian prior with mean m0 and positive self-adjoint, injective, trace-class covariance C0, independent of a jointly Gaussian centered family Z indexed by H, linear into L2 with covariance E[Z(g)Z(k)]=⟨g,k⟩H. For parameter x∈X, the observation field is Yx(g)=⟨Kx,g⟩H+ϵZ(g). Fix a feature vector h∈X. Let S=C01/2,B=SK∗KS,R=(B+ϵ2IX)−1,Φh=KSRSh, and define the raw threshold ch=⟨Km0,Φh⟩H−⟨m0,h⟩X. Input a white-noise observation field y∈RH. Compute q=y(Φh)−ch. Return 1 when q>0 and return 0 when q≤0. This strict raw comparison defines the Gaussian MAP feature test for every field input y.

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

Level, power, and weighted regularization of Gaussian MAP feature tests

Statement

Assume the Axiom of Choice. Let X,H be separable real Hilbert spaces, K:X→H bounded and linear, ϵ>0, and let U be a Borel Gaussian prior with mean m0 and positive self-adjoint, injective, trace-class covariance C0, independent of a jointly Gaussian centered family Z indexed by H, linear into L2 with covariance E[Z(g)Z(k)]=⟨g,k⟩H. Fix h∈X, define S=C01/2, B=SK∗KS, R=(B+ϵ2I)−1, Φh=KSRSh, and ch=⟨Km0,Φh⟩H−⟨m0,h⟩X. Let Yx(g)=⟨Kx,g⟩H+ϵZ(g) and let the raw MAP test reject exactly when Yx(Φh)>ch. Define G(t)=∫−∞t(2π)−1/2e−s2/2 ds, the standard normal cumulative distribution function. For every x∈X its rejection probability is Px{Yx(Φh)>ch}={G ⁣(⟨x,K∗Φh⟩X−chϵ∥Φh∥H),Φh≠0,1{0>ch},Φh=0.

Let PY be the prior-predictive law of the field Y(g)=⟨KU,g⟩H+ϵZ(g) on RH with its cylinder sigma-algebra, and let Πy and My be the data-indexed posterior kernel and mean supplied by the Gaussian posterior-law theorem, using supplied finite or countable complete orthonormal bases of X and H as in that theorem. For every y, the scalar feature marginal under Πy is normal with mean ⟨My,h⟩X and variance ⟨Cposth,h⟩X; its mode is its mean, with the support point serving as the mode when the variance is zero. For each fixed h, the raw MAP test agrees for PY-almost every y with rejection exactly when this posterior marginal mode is positive. The exceptional null set may depend on h. If h=0, then Φh=ch=0, and the raw test returns 0 almost surely under every sampling law and under PY.

For a further real Hilbert space V and a continuous linear injection i:V→X, define the residual functional rΦ∈V∗, where V∗ is the continuous dual of V, by rΦ(v)=⟨Ki(v),Φ⟩H−⟨i(v),h⟩X,∥rΦ∥V∗=sup⁡∥v∥V≤1∣rΦ(v)∣. For 0<α<1 let z1−α satisfy G(z1−α)=1−α. If Φ≠0, the calibrated probe test rejects exactly when Yx(Φ)>ϵ∥Φ∥Hz1−α+∥rΦ∥V∗. Its rejection probability at every x∈X is the same displayed Gaussian-tail formula with Φ in place of Φh and calibrated threshold in place of ch. If x=i(v) satisfies ∥v∥V≤1 and ⟨x,h⟩X≤0, this test has rejection probability at most α. For Φ=0 it never rejects and has level zero.

As an additional weighted-regularization identity, assume Countable Choice and suppose that C0K∗K=K∗KC0. Let J be the real partial isometry in the polar decomposition K=J(K∗K)1/2. Let D={C01/2x:x∈X}, and define C0−1/2 as the inverse of C01/2 on D. On Ψ∈H, set Jh(Ψ)=∥K∗Ψ−h∥X2+ϵ2∥C0−1/2J∗Ψ∥X2 when J∗Ψ∈D, and set Jh(Ψ)=+∞ otherwise. Then Φh is a minimizer of Jh, and K∗Φh=B(B+ϵ2IX)−1h.

Facts & Assumptions

Given: The Gaussian model and hypotheses in the Statement, a feature vector h, a truth space V when the calibrated test is used, and the commutation hypothesis for the final clause.

[F1]

The MAP feature test has probe Φh=KC01/2(C01/2K∗KC01/2+ϵ2I)−1C01/2h and threshold ch=⟨Km0,Φh⟩−⟨m0,h⟩. Gaussian MAP feature test

[F2]

At any fixed x and probe Φ, Yx(Φ) is normal with mean ⟨Kx,Φ⟩H and variance ϵ2∥Φ∥H2; the zero probe is the constant zero. Isonormal Gaussian white-noise inverse experiment

[F3]

The standard normal distribution is continuous, strictly increasing, symmetric, and its upper 1−α quantile satisfies 1−G(z1−α)=α. The standard normal CDF has unique symmetric quantiles

[F4]

A positive injective trace-class covariance is compact and has a positive square root; its compact positive operator admits a complete orthonormal eigenbasis under Countable Choice. Trace class operator, Positive square root of a compact positive operator, Spectral theorem for compact self adjoint operators

[F5]

The cited partial-isometry definition uses nonzero complex Hilbert spaces; it supplies only the terminology here. The real operator J is constructed and its defining properties are verified directly in step 1.2. Isometry coisometry and partial isometry

[F6]

A self-adjoint operator on each finite-dimensional real inner-product space has an orthonormal eigenbasis, and Hilbert-basis expansions converge in norm with Parseval's identity. Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis, Fourier expansion in a Hilbert space, Parseval equivalences for an orthonormal family

[F7]

The Hilbert adjoint satisfies ⟨Kx,Φ⟩H=⟨x,K∗Φ⟩X. The Hilbert-space adjoint of a bounded operator

[F8]

For σ>0, the density of N(a,σ2) is uniquely maximized at a; when σ=0, N(a,0) is the point mass at a, whose support point is its mode.

[F9]

For every fixed h, the posterior-law theorem gives ⟨My,h⟩X=⟨m0,h⟩X+y(Φh)−⟨Km0,Φh⟩H for PY-almost every y, and gives the scalar posterior marginal stated in the Statement. Gaussian posterior law in an isonormal inverse experiment

[A1]

The posterior input inherits the Axiom of Choice from its separate conditional-law construction. Countable Choice is used for the compact spectral and square-root suppliers in the weighted clause; its real partial isometry is constructed in the proof. The Gaussian-tail and calibration calculations use no additional choice principle. The Axiom of Choice, The Axiom of Countable Choice (ACω)

Proof

1.1givenF1F2F3F7algebra

For fixed x and Φ≠0, [F2] gives Yx(Φ)=⟨Kx,Φ⟩H+ϵ∥Φ∥HZ0 in law, where Z0 is standard normal. By [F7], the mean is ⟨x,K∗Φ⟩X. Hence Px{Yx(Φ)>c}=1−G((c−⟨x,K∗Φ⟩)/(ϵ∥Φ∥)), which equals the stated formula by symmetry in [F3]. For Φ=0, Yx(0)=0 and the probability is exactly 1{0>c}. Substituting Φh,ch proves the raw MAP formula.

1.2givenA1F4F5F6F7algebra

For the weighted clause, [F4] gives the compact positive injective spectral decomposition C0vj=cjvj with cj>0, finite-dimensional eigenspaces, and a complete orthonormal family spanning X. The commutation hypothesis makes each such eigenspace invariant under the self-adjoint positive operator K∗K. By [F6], diagonalize its finite-dimensional restriction in each eigenspace. This gives a common complete orthonormal basis with C0vj=cjvj and K∗Kvj=λjvj, λj≥0. For λj>0, put wj=Kvj/λj; then ⟨wi,wj⟩H=δij by [F7]. Define Tvj=λjvj and define Jvj=wj for λj>0 and Jvj=0 for λj=0. For a finite sum x=∑jajvj, orthonormality gives ∥Tx∥2=∑jλj∣aj∣2≤∥K∥2∥x∥2 and ∥Jx∥2=∑λj>0∣aj∣2≤∥x∥2. Thus both rules extend by completeness to bounded real-linear operators on X, with T self-adjoint and positive and T2=K∗K. Any bounded self-adjoint positive square root Q of K∗K commutes with its square and therefore preserves each eigenspace; on an eigenspace with eigenvalue λ≥0, it equals λI. Indeed, for Q2=λI, a=λ, and a vector x in that eigenspace, V=(Q−aI)x satisfies QV=−aV, which positivity forces to vanish; when λ=0, ∥Qx∥2=⟨Q2x,x⟩=0. Hence T=(K∗K)1/2. Also ∥Kx∥2=∑jλj∣⟨x,vj⟩∣2, so ker⁡K is the closed span of the zero-eigenvalue vectors and (ker⁡K)⊥ is the closed span of the positive-eigenvalue vectors. The extended J vanishes on ker⁡K, is isometric on (ker⁡K)⊥, and has ker⁡J=ker⁡K by its coordinate formula; these real-space properties verify that J is a partial isometry as characterized in [F5], including when the basis is empty. The expansions of Kx and Jx show K=JT and R(K)‾=span⁡‾{wj:λj>0}. Since wj are orthonormal, with ξj=⟨Ψ,wj⟩H the adjoint identities and Fourier expansion in X give J∗Ψ=∑λj>0ξjvj and K∗Ψ=∑λj>0λjξjvj. If hj=⟨h,vj⟩X, the Fourier expansions give ∥K∗Ψ−h∥X2=∑λj>0∣λjξj−hj∣2+∑λj=0∣hj∣2 and ∥C0−1/2J∗Ψ∥X2=∑λj>0∣ξj∣2/cj whenever the second term is defined. Components of Ψ in R(K)‾⊥ affect neither expression.

1.3F2F8F9algebra

For each fixed h, [F9] gives for PY-almost every y that ⟨My,h⟩X=⟨m0,h⟩X+y(Φh)−⟨Km0,Φh⟩H=y(Φh)−ch. For every y, the posterior feature marginal has the normal law stated in the theorem. If its variance σ2 is positive, its density is (σ2π)−1exp⁡(−(t−⟨My,h⟩X)2/(2σ2)), uniquely maximized at ⟨My,h⟩X; if its variance is zero, it is the point mass at that same value. Thus its mode is ⟨My,h⟩X in both cases. On the probability-one set where the displayed identity holds, the raw comparison y(Φh)>ch is therefore equivalent to a positive posterior marginal mode; its exceptional null set may depend on h. If h=0, the definitions give Φh=ch=0, and [F2] gives Yx(0)=0 almost surely under each Px and Y(0)=0 almost surely under PY, so the raw test returns 0 under all those laws.

2.1givenF2F3F7step 1.1algebra

For x=i(v) in the stated null ball, [F7] gives ⟨Kx,Φ⟩=⟨x,K∗Φ⟩X=⟨x,h⟩X+rΦ(v)≤∣rΦ(v)∣≤∥rΦ∥V∗. Thus the calibrated threshold is at least ⟨Kx,Φ⟩+ϵ∥Φ∥z1−α. Applying step 1.1 to that threshold and using [F3] bounds the rejection probability by 1−G(z1−α)=α. The same substitution gives the exact stated power formula at every x. If Φ=0, then r0(v)=−⟨i(v),h⟩ and its norm is nonnegative, so the strict comparison is 0>∥r0∥V∗, which is false; the level and power are zero.

3.1step 1.2F4F6F7algebra∎

For each λj>0, the scalar quadratic ∣λjξ−hj∣2+ϵ2∣ξ∣2/cj is minimized at ξj=λjcjhj/(λjcj+ϵ2). These coefficients define a vector in H and lie in the inverse-square-root domain because ∣ξj∣2/cj=λjcj∣hj∣2/(λjcj+ϵ2)2≤∣hj∣2/(4ϵ2), using t/(t+ϵ2)2≤1/(4ϵ2) for t≥0; Parseval makes the bound summable. The corresponding vector is KSRSh=Φh, since SRS has coefficient cjhj/(λjcj+ϵ2) on vj. Each coordinate minimizes its summand, while the λj=0 terms are fixed and the orthogonal observation component is irrelevant, so Φh minimizes Jh. Finally [F7] and the diagonal action of B show that K∗Φh has coefficient λjcjhj/(λjcj+ϵ2), which is the coefficient of B(B+ϵ2I)−1h.

Remarks

The raw MAP formula uses a prior fixed independently of the observation whose rejection is tested. If prior covariance is tuned using the same sample, this theorem does not establish the displayed level or power formula for that empirical procedure.

Polar factorization diagram

The triangle records the real polar factorization K=J(K∗K)1/2. On the common eigenbasis in step 3.1, the upper arrow sends vj to λjvj; the right arrow then sends it to λjwj when λj>0, and to zero when λj=0. This agrees with the lower arrow K on the basis and therefore on all of X by boundedness and density. The diagram summarizes step 1.2 and is not used in any proof step.

XXH(K¤K)1=2KJ
TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

A non-eigenfeature can give an unrestricted Gaussian MAP test level one

Statement

Assume the Axiom of Choice. Let X,H be separable real Hilbert spaces, K:X→H bounded and linear, ϵ>0, and let U be a Borel Gaussian prior with mean m0 and positive self-adjoint, injective, trace-class covariance C0, independent of a jointly Gaussian centered family Z indexed by H, linear into L2 with covariance E[Z(g)Z(k)]=⟨g,k⟩H. Put S=C01/2, B=SK∗KS, R=(B+ϵ2IX)−1. For a feature vector h∈X, define Φh=KSRSh, ch=⟨Km0,Φh⟩H−⟨m0,h⟩X, and the raw test δh=1{Yx(Φh)>ch}, where Yx(g)=⟨Kx,g⟩H+ϵZ(g). Suppose C0K∗K=K∗KC0, h≠0, and Bh is not a scalar multiple of h. Then the unrestricted null set H0={x∈X:⟨x,h⟩X≤0} satisfies sup⁡x∈H0Px{δh=1}=1. The supremum need not be attained at any finite parameter value.

Facts & Assumptions

Given: The Gaussian inverse model, operators, feature, and test in the Statement, together with the commutation and non-eigenfeature hypotheses.

[F1]

Under the commutation hypothesis, K∗Φh=B(B+ϵ2I)−1h, and the raw test has rejection probability G((⟨x,K∗Φh⟩−ch)/(ϵ∥Φh∥)) when Φh≠0. Level, power, and weighted regularization of Gaussian MAP feature tests

[F2]

The shifted normal operator B+ϵ2I is invertible, and its inverse commutes with B. The shifted Hilbert-space normal operator is invertible with inverse norm at most 1/λ

[F3]

The adjoint identity is ⟨Kx,Φ⟩H=⟨x,K∗Φ⟩X, and inner products satisfy Cauchy–Schwarz. The Hilbert-space adjoint of a bounded operator, Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs

[A1]

The Axiom of Choice is inherited from the posterior and polar-decomposition branches; Countable Choice is used for Hilbert adjoints and shifted-operator inversion. The Axiom of Choice, The Axiom of Countable Choice (ACω)

Proof

1.1givenA1F1F2algebra

Put A=B(B+ϵ2I)−1. By [F1] and its inherited Axiom of Choice hypothesis [A1], K∗Φh=Ah. If Ah=ηh for a real scalar η, multiply the identity by B+ϵ2I and use [F2] to obtain Bh=η(B+ϵ2I)h, hence (1−η)Bh=ηϵ2h. The case η=1 forces h=0, contrary to the hypothesis; otherwise Bh=ηϵ2(1−η)−1h. Thus any scalar dependence of Ah and h would make Bh a scalar multiple of h. The assumed non-eigenfeature condition therefore implies Ah∉span⁡{h}.

2.1givenA1F1F2F3step 1.1constructalgebra

Let w=Ah−⟨Ah,h⟩X∥h∥X2h. Then w≠0, ⟨w,h⟩X=0, and ⟨Ah,w⟩X=∥w∥X2>0 by orthogonal projection. For t>0, xt=tw belongs to H0. Moreover Ah≠0, since otherwise Bh=0 by invertibility of B+ϵ2I and h would be an eigenvector with eigenvalue zero; so K∗Φh=Ah implies Φh≠0.

3.1givenA1F1F3step 2.1algebra∎

By [F3] and the inherited Axiom of Choice hypothesis [A1], the test statistic at xt has mean ⟨xt,K∗Φh⟩X=t⟨w,Ah⟩X=t∥w∥X2 and positive standard deviation ϵ∥Φh∥H. The exact tail formula [F1] gives Pxt{δh=1}=G ⁣(t∥w∥X2−chϵ∥Φh∥H)⟶1 as t→∞. Every xt is null, so the supremum over H0 is at least this limit and at most one; it is therefore one. Since a nondegenerate normal tail is strictly below one at every finite threshold, the limiting sequence does not assert attainment.

4 · Examples, counterexamples and false statements

None yet.

Sources