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.

Banach Gaussian priors, RKHS support, and concentration

1 · Prerequisites

2 · Summary

This page develops centered Borel Gaussian random elements in real separable Banach spaces. It distinguishes a Banach-valued prior from a Gaussian process specified only by finite-dimensional cylinder laws, constructs its covariance RKHS, proves the Cameron–Martin translation and support results, and gives Fernique and norm-concentration bounds. The concentration function uses the full squared RKHS norm. The source sieve bounds require the Banach Gaussian isoperimetric expansion theorem; the sharp finite-dimensional inequality and its Banach reduction are proved locally. These prior bounds alone do not imply posterior contraction without a separate statistical-distance comparison.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Centered Borel Gaussian random element on a separable Banach space

Definition

Let (Ω,F,P) be a probability space and let B be a real separable Banach space with its norm Borel sigma-algebra. A map W:Ω→B is a centered Borel Gaussian random element if it is Borel-measurable and, for every ℓ∈B∗, the real random variable ℓ(W) has a centered (possibly zero-variance) normal law. Its law is the Borel probability μ=P∘W−1. When the word tight is used, it means that for every δ>0 there is a norm-compact K⊆B with μ(K)>1−δ.

This definition concerns a random element in B. A Gaussian process on an arbitrary index set with only a cylinder-space law does not satisfy it unless a Borel B-valued realization is separately constructed.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

A Borel map into a separable Banach space is strongly measurable

Statement

Let (Ω,F,P) be a probability space, let B be a separable Banach space, and let f:Ω→B be Borel-measurable. Then f is strongly measurable: outside a P-null set it is the pointwise limit of finite-valued measurable simple functions.

Facts & Assumptions

[F1]

Separability supplies a countable dense subset of B (Separability: the existence of an at most countable dense subset).

[F2]

A finite-valued measurable simple function is a finite sum of vectors times measurable indicators; strong measurability is almost-everywhere pointwise approximation by such functions (Banach-valued simple function and integral, Strongly measurable Banach-valued function).

[F3]

For a finite measure, continuity from above implies continuity from below by taking complements (Continuity from above when one set has finite measure).

[F4]

The measure of a countable union is at most the sum of the measures Finite and countable subadditivity of measures.

Proof

Given: A probability space (Ω,F,P), a separable Banach space B, and a Borel-measurable map f:Ω→B.

1.1givenF1F3choose

Choose a countable dense sequence (dj)j≥1 in B. For each n≥1, assign ω to the first index j for which ∥f(ω)−dj∥<2−n; such an index exists by density. The resulting sets An,j form a measurable countable partition: each is the preimage of an open ball under f, with the finitely many earlier preimages removed.

2.1givenF2F3step 1.1construct

Since the partial unions ⋃j≤NAn,j increase to Ω, [F3] gives an integer Nn for which the omitted tail has measure at most 2−2n. Define sn=dj on An,j for j≤Nn, and sn=0 on the omitted tail. Then sn is a finite-valued measurable simple function.

3.1F2F3F4step 2.1algebra∎

The tail events Tn=⋃j>NnAn,j satisfy ∑nP(Tn)≤∑n2−2n<∞. By [F4], for every N, P(⋃n≥NTn)≤∑n≥N2−2n; continuity from above makes the probability of belonging to infinitely many Tn equal to zero. Outside that null set, for all sufficiently large n the point is not in Tn, and then ∥sn(ω)−f(ω)∥<2−n. Thus sn→f almost everywhere, which is strong measurability by [F2].

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

A separable Banach space has a countable norming family

Statement

Assume HB and countable choice. Let B be a real separable Banach space. There is a sequence (ℓj)j≥1⊆B∗ with ∥ℓj∥=1 such that ∥x∥=sup⁡j≥1∣ℓj(x)∣(x∈B). If B={0}, the conclusion is interpreted using the zero functional and the supremum is 0.

Facts & Assumptions

[F1]

Separability supplies a countable dense subset of B (Separability: the existence of an at most countable dense subset).

[F2]

For each nonzero x∈B, Hahn–Banach supplies ℓ∈B∗ with ∥ℓ∥=1 and ℓ(x)=∥x∥ (The real dominated-extension principle as an additional hypothesis over ZF, Relative dual norming, point separation, and recovery of the norm).

[A1]

Countable choice selects one such functional for each element of a countable dense subset (The Axiom of Countable Choice (ACω)).

Proof

Given: HB, countable choice, and a real separable Banach space B.

1.1givenF1F2A1choose

If B={0}, take the constant zero sequence. Otherwise let D be a countable dense subset of B. The normalized set {d/∥d∥:d∈D, d≠0} is countable and dense in the unit sphere: for ∥x∥=1 and d→x, eventually d≠0 and ∥d/∥d∥−x∥≤2∥d−x∥. Enumerate it as (xj). By [F2] and [A1], choose ℓj∈B∗ with ∥ℓj∥=1 and ℓj(xj)=1 for each j.

2.1givenstep 1.1algebra∎

For every x∈B and every j, ∣ℓj(x)∣≤∥x∥, so the supremum is at most ∥x∥. If x≠0, choose unit vectors xjk→x/∥x∥. Then ℓjk(x/∥x∥)≥1−∥xjk−x/∥x∥∥→1, so sup⁡j∣ℓj(x)∣≥∥x∥. The zero vector gives equality directly.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Finite-dimensional Gaussian isoperimetric expansion

Statement

Assume AC. For d≥1, let γd be standard Gaussian measure on Rd, let A⊆Rd be Borel, and let A+rB2d={a+ru:a∈A, ∣u∣≤1}. Then for every r≥0, γd,∗(A+rB2d)≥Φ ⁣(Φ−1(γd(A))+r), where γd,∗(S)=sup⁡{γd(K):K⊆S, K compact} is Gaussian inner measure, and Φ−1(0)=−∞, Φ−1(1)=+∞.

Facts & Assumptions

Given: AC, d≥1, standard Gaussian measure γd, a Borel set A, and r≥0.

[F1]

The standard d-dimensional Gaussian γd=Nd(0,Id) has density (2π)−d/2e−∣x∣2/2 by A positive-definite multivariate normal law has its Gaussian density. The scalar standard normal has density φ(x)=(2π)−1/2e−x2/2, and Φ is continuous and strictly increasing with limits 0 and 1 at the two infinities. Independent standard Gaussian vectors form a joint Gaussian vector, and orthogonal linear combinations have their stated Gaussian laws. Standard normal and normal laws, Multivariate normal law, including singular covariance, A finite stack of independent Gaussian vectors is jointly Gaussian, The standard normal CDF is continuous and strictly increasing.

[F2]

Differentiation under the integral follows from an integrable majorant, dominated convergence passes dominated limits, and Fubini applies to absolutely integrable functions. Differentiation under the integral sign, Dominated convergence, Fubini's theorem for L^1 functions on a sigma-finite product.

[F3]

Integration by parts and the fundamental theorem apply on one-dimensional absolutely continuous slices. AC implies their DC and Countable Choice assumptions. Integration by parts for absolutely continuous functions, Fundamental theorem of calculus for absolutely continuous functions, AC implies DC implies countable choice, The Axiom of Choice.

[F4]
[F5]

A unit-mass smooth bump gives the scaled convolution family. One may choose it nonnegative and supported in the unit ball by normalizing exp⁡(−1/(1−∣x∣2))1{∣x∣<1}. The mollifier family generated by a unit-mass smooth bump.

[F6]

Under Countable Choice, the nonnegative Lebesgue change-of-variables theorem applies to Euclidean dilations and orthogonal maps; hence a ball of radius R has volume vdRd with finite vd bounded by the volume of the containing cube. A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions.

[F8]
[F9]

For finite real rows, (∑iaibi)2≤(∑iai2)(∑ibi2) The Cauchy-Schwarz inequality for finite sums.

[F10]

Absolute continuity uses sums of endpoint increments over disjoint intervals of sufficiently small total length; the mean value theorem bounds increments by a derivative bound Absolute continuity on a compact interval The mean value theorem, as the case g(x)=x of Cauchy's: for f continuous on [a,b] with a<b and differentiable on (a,b) there is c∈(a,b) with f(b)−f(a)=f′(c)(b−a).

Proof

Given: The objects and assumptions above; φ(x)=(2π)−1/2e−x2/2 denotes the standard-normal density. The auxiliary function I is defined in step 1.1.

1.1F1F2F3F7F8givenalgebra

Write φ(x)=(2π)−1/2e−x2/2. For h≠0, the density formula gives [Φ(x+h)−Φ(x)]/h=h−1∫xx+hφ(s) ds, which tends to φ(x) by continuity; hence Φ′(x)=φ(x)>0. The CDF lemma gives continuity, strict increase and limits 0,1 at the two infinities. For any u∈(0,1), choose a<b with Φ(a)<u<Φ(b) using those limits; [F8] applied to Φ on [a,b] gives an x with Φ(x)=u, and strict increase makes it unique. Thus Φ is a bijection onto (0,1). Set I(u)=φ(Φ−1(u)) for 0<u<1, and set I(0)=I(1)=0. The derivative-of-inverse rule [F7] therefore gives (Φ−1)′(u)=1/φ(Φ−1(u))=1/I(u). From φ(x+h)=φ(x)e−xh−h2/2 and (exp⁡)′(0)=1 in [F7], the difference quotient gives φ′(x)=−xφ(x). Writing x=Φ−1(u), the chain rule [F7] yields I′(u)=φ′(x)/φ(x)=−x and then I′′(u)=−(Φ−1)′(u)=−1/I(u). Thus II′′=−1. As u↓0 or u↑1, Φ−1(u) tends to the corresponding infinity and φ(Φ−1(u))→0, so I is continuous on [0,1]; also 0<I(u)≤(2π)−1/2 on (0,1). First take a smooth f valued in [η,1−η], 0<η<1/2, with all derivatives bounded. Define Ptf(x)=∫f(e−tx+1−e−2ty)γd(dy) and ut=Ptf. Gaussian integration by parts in y gives ∂tut=Lut, L=Δ−x⋅∇, while ∇Ptf=e−tPt∇f. Invariance ∫Ptg dγd=∫g dγd follows because e−tX+1−e−2tY is standard Gaussian for independent standard X,Y. Differentiation is justified by [F2]; the integration-by-parts boundary terms vanish by bounded derivatives and Gaussian decay.

1.2F1F2constructalgebra

Let D be a nonempty finite union of closed balls of one common positive radius. Its boundary is contained in finitely many spheres, which have Lebesgue and hence Gaussian measure zero. For h>0 put fh=(1−dist⁡(⋅,D)/h)+. Distance is 1-Lipschitz, since dist⁡(x,D)≤∣x−y∣+dist⁡(y,D) and one may interchange x,y. Thus 0≤fh≤1 and it is 1/h-Lipschitz. Outside finitely many inner and outer cutoff spheres and nearest-center bisector hyperplanes it is smooth, its gradient has norm at most 1/h, and its gradient vanishes outside (D+hB2d)∖D. These exceptional sets have Lebesgue measure zero by Fubini in suitable orthogonal coordinates.

2.1F1F2F3F9step 1.1algebra

Put v=∇ut, H=D2ut, K=I(ut)2+∣v∣2 and J(t)=∫K dγd. The identity ∇Lu=L∇u−∇u, Gaussian integration by parts, and II′′=−1 give J′(t)=∫−∥I′(ut)vvT−I(ut)H∥F2+∣Hv∣2−∥H∥F2∣v∣2K3/2 dγd≤0. To verify the displayed computation, differentiating J first gives ∫[II′Lu+v⋅∇Lu]/K. Integrating both Lu and each Lvi by parts leaves numerator −I′2∣v∣4+2II′vTHv−I2∥H∥F2−∥H∥F2∣v∣2+∣Hv∣2, the displayed square expansion. Applying [F9] to row i gives (∑jHijvj)2≤(∑jHij2)(∑jvj2); summing over the finitely many rows gives ∣Hv∣2≤∥H∥F2∣v∣2. All operations on compact time intervals are dominated because I(ut) has a fixed positive lower bound, derivatives are bounded, and Gaussian polynomial moments are finite.

3.1F2step 1.1step 2.1algebra

As t→∞, ut(x)→∫f dγd and ∣∇ut∣≤e−t∥∇f∥∞→0. Dominated convergence and step 2.1 yield I(∫f dγd)≤∫I(f)2+∣∇f∣2 dγd≤∫I(f) dγd+∫∣∇f∣ dγd. Replacing a smooth [0,1]-valued f by η+(1−2η)f and letting η↓0 extends this inequality to smooth [0,1]-valued functions with bounded derivatives.

4.1F2F3F5step 3.1step 1.2algebra

Convolve fh with the nonnegative bumps ρδ from [F5]. The convolutions are smooth, valued in [0,1], have bounded derivatives, and converge uniformly to fh. On almost every coordinate line the distance formula is a finite piecewise smooth minimum of distances to centers, so fh is absolutely continuous there with derivative bounded by 1/h. One-dimensional integration by parts and Fubini show ∇(fh∗ρδ)=(∇fh)∗ρδ. At each point off the exceptional hypersurfaces the latter converges to ∇fh, and its norm is at most 1/h. Dominated convergence against Gaussian probability therefore passes step 3.1 to fh and gives I(∫fh dγd)≤∫I(fh) dγd+γd(D+hB2d)−γd(D)h. As h↓0, fh→1D and I(fh)→0, so I(γd(D)) is at most the lower right derivative of the neighborhood mass.

5.1F1F3F6F7F10step 1.1step 4.1algebra

Set Dt=D+tB2d and V(t)=γd(Dt). On each bounded interval [0,R], V is Lipschitz: for 0≤t<t+h≤R, the mass difference is bounded by the sum of masses of finitely many spherical shells. Gaussian density is bounded, and [F6] gives each shell volume as vd((a+t+h)d−(a+t)d)≤CRh, where a>0 is the common initial radius. Thus ∣V(t+h)−V(t)∣≤LRh for a finite constant LR. For any finite disjoint interval family, the sum of its endpoint increments is therefore at most LR times its total length; taking δ=ε/(LR+1) proves absolute continuity directly from [F10]. By [F3], V is differentiable almost everywhere. Each Dt is again a finite union of equal-radius balls, so the lower-right derivative bound in step 4.1 implies V′(t)≥I(V(t)) at each differentiability point. Since D0 has interior and DR is bounded, 0<V(0)≤V(t)≤V(R)<1. On this compact range, I has a positive minimum, so the inverse derivative formula in step 1.1 and the mean value theorem [F10] show that Φ−1 is Lipschitz there. Hence G=Φ−1∘V is Lipschitz on [0,R]; the same finite-total-length argument proves that G is absolutely continuous. At every differentiability point of V, the chain rule [F7] gives G′=V′/I(V)≥1. Applying the fundamental theorem [F3] to G and taking R=r (with r=0 immediate) yields G(r)−G(0)≥r, or γd(D+rB2d)≥Φ(Φ−1(γd(D))+r).

6.1F4step 5.1givenchoosealgebra∎

For nonempty compact K and r>0, choose 0<δ<r and cover K by finitely many closed δ-balls centered in K; call their union Dδ. Then K⊆Dδ⊆K+δB2d and Dδ+(r−δ)B2d⊆K+rB2d. Step 5.1 gives γd(K+rB2d)≥Φ(Φ−1(γd(K))+r−δ); let δ↓0. For Borel A, inner regularity provides compact K⊆A with mass arbitrarily close to γd(A). Each K+rB2d is compact and contained in A+rB2d, so taking the supremum gives the asserted inner-measure bound. If γd(A)=0 the right side is zero; if it is one, compact inner approximation gives lower bound one. At r=0, [F4] identifies the inner and ordinary measures of A.

Source notes

The full Bobkov paper and the complete Chafaï–Lehec semigroup proof were read. The sharp functional inequality is proved by the local derivative computation above; the finite-ball cutoff and compact approximation supply the full neighborhood passage without an imported spherical isoperimetry, coarea theorem, or Rademacher theorem.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Gross logarithmic Sobolev inequality for standard Gaussian measure

Statement

Assume AC, DC, and countable choice, and let γd be standard Gaussian measure on Rd. For every g∈C2(Rd) bounded above and below by positive constants, with bounded first and second derivatives, Ent⁡γd(g):=∫glog⁡g dγd−(∫g dγd)log⁡(∫g dγd)≤12∫∣∇g∣2g dγd.

Facts & Assumptions

[F1]

The standard d-dimensional Gaussian γd=Nd(0,Id) has Lebesgue density (2π)−d/2e−∣x∣2/2 (A positive-definite multivariate normal law has its Gaussian density), and independent standard Gaussian vectors have joint standard Gaussian law (Standard normal and normal laws, A finite stack of independent Gaussian vectors is jointly Gaussian).

[A1]

AC, DC, and countable choice are assumed in the Statement: AC meets the Gaussian suppliers' hypotheses, and DC and countable choice meet the integration-by-parts and fundamental-theorem-of-calculus hypotheses (The Axiom of Choice, The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain, The Axiom of Countable Choice (ACω)).

[F2]

Differentiation under an integral is justified by a common integrable majorant (Differentiation under the integral sign).

[F3]

Under DC and countable choice, one-dimensional integration by parts holds for absolutely continuous functions on compact intervals (Integration by parts for absolutely continuous functions).

[F4]

Dominated convergence and Fubini apply to the bounded semigroup integrands (Dominated convergence, Fubini's theorem for L^1 functions on a sigma-finite product).

[F5]

Monotone convergence passes the nonnegative entropy dissipation integrals to their endpoint limits (Monotone convergence for the integral).

[F6]

The fundamental theorem of calculus applies to the continuously differentiable entropy function on every compact time interval (Fundamental theorem of calculus for absolutely continuous functions).

[F7]

Cauchy–Schwarz holds for square-integrable functions on γd (Cauchy-Schwarz inequality for L2).

Proof

Given: AC, DC, countable choice, d≥1, standard Gaussian measure γd, and g satisfying the hypotheses in the Statement.

1.1A1F1F2F3F4givenalgebra

For t>0, put a=e−t, b=1−e−2t, and Ptg(x)=∫g(ax+by) dγd(y). By [F1], aX+bY is standard Gaussian for independent X,Y∼γd; Fubini [F4] gives ∫Ptg dγd=∫g dγd. Differentiation under the integral [F2] gives ∇Ptg=aPt(∇g) and ΔPtg=a2Pt(Δg). It also gives ∂tPtg=−ax⋅Pt(∇g)+(a2/b)∫y⋅∇g(ax+by) dγd(y). For each coordinate, [F3] applied against the Gaussian density gives ∫yi∂ig(ax+by) dγd=b∫∂iig(ax+by) dγd; the boundary terms vanish because ∂ig is bounded and the Gaussian density tends to zero at both ends. Thus ∂tPtg=ΔPtg−x⋅∇Ptg.

2.1A1F1F2F3F4F5F6step 1.1algebra

Put ut=Ptg. Differentiate the entropy using step 1.1 and [F2]: ddtEnt⁡γd(ut)=∫(1+log⁡ut)(Δut−x⋅∇ut) dγd. For each coordinate, [F3] applied to v=1+log⁡ut and ∂iut against the Gaussian density [F1] gives ∫v(∂iiut−xi∂iut)dγd=−∫(∂iut)2/ut dγd; the boundary term vanishes because v and ∇ut are bounded and the density tends to zero. Summing coordinates yields ddtEnt⁡γd(ut)=−∫∣∇ut∣2ut dγd. The differentiated integrands are dominated on each compact time interval because ut stays between the positive bounds for g and its first two derivatives are bounded. As t↓0, continuity of g and bounded convergence [F4] give Ptg(x)→g(x) and Ent⁡γd(ut)→Ent⁡γd(g). As t→∞, ut(x)→∫g dγd, so [F4] gives entropy limit zero. Integrate the derivative on [δ,T] by [F6], then let δ↓0 and T↑∞ using [F5] on the nonnegative dissipation. Therefore Ent⁡γd(g)=∫0∞∫∣∇Ptg∣2/(Ptg) dγd dt.

2.2F7step 1.1algebra

For each x,t, apply [F7] to each coordinate after writing ∇g=(∇g/g)g inside the probability integral defining Pt. Summing the coordinate inequalities gives ∣Pt(∇g)(x)∣2Ptg(x)≤Pt ⁣(∣∇g∣2g)(x).

3.1F4step 1.1step 2.1step 2.2algebra∎

By step 1.1, ∣∇Ptg∣2=e−2t∣Pt(∇g)∣2; apply step 2.2, integrate using invariance of γd, and use ∫0∞e−2t dt=1/2 in the entropy representation of step 2.1. This gives Ent⁡γd(g)≤12∫∣∇g∣2g dγd.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

A countable norming family determines Borel laws

Statement

Let B be a separable Banach space, and let (ℓj)j≥1⊆B∗ satisfy the norming identity ∥x∥=sup⁡j≥1∣ℓj(x)∣ for every x∈B. If Borel probabilities μ,ν on B have equal finite-dimensional pushforwards under every finite subfamily of (ℓj), then μ=ν.

Facts & Assumptions

[F1]

Measures agreeing on a generating pi-system containing the whole space, with equal finite total masses, agree on the generated sigma-algebra (Measures agreeing on a generating pi-system are equal under an increasing finite-measure exhaustion from that pi-system). Here the full space is itself a finite-coordinate cylinder and both probabilities have mass one.

[F2]

Strictly between any two reals lies a rational; the rationals are countable, and a product of two countable sets is countable The rationals embed densely in the reals Q is countably infinite A product of two at most countable sets is at most countable.

[F3]

Separability supplies a countable dense subset of B (Separability: the existence of an at most countable dense subset).

Proof

Given: A separable Banach space B, a countable norming family (ℓj), and Borel probabilities μ,ν whose finite-coordinate pushforwards agree.

1.1givenF2F3

For every x∈B and r>0, the given norming identity gives the identity B(x,r)=⋃q∈Q0≤q<r ⋂j≥1{y:∣ℓj(y−x)∣≤q}. If ∥y−x∥<r, use [F2] to choose rational q between that norm and r; conversely, membership in one intersection implies ∥y−x∥≤q<r. Thus every open ball belongs to σ(ℓj:j≥1). By [F3], fix a countable dense set D⊆B. The balls B(d,s) with d∈D and positive rational s form a countable family by [F2]. For any open U and y∈U, take a>0 with B(y,a)⊆U, choose d∈D with ∥d−y∥<a/4, and choose rational s with a/4<s<a/2 by [F2]. Then y∈B(d,s)⊆B(y,a)⊆U. Thus this family is a base, and every open set is the union of its members contained in that set, a countable union. All those balls are in σ(ℓj) by the first part, so every open set is in that sigma-algebra. Conversely each continuous linear ℓj is Borel measurable, giving the reverse inclusion; hence it is the Borel sigma-algebra.

2.1F1step 1.1given∎

The finite-coordinate cylinder sets form a pi-system generating σ(ℓj:j≥1). The assumed equality of finite-dimensional pushforwards makes μ and ν agree on each such cylinder. The cylinder pi-system contains B, and both probabilities assign it mass one; the constant exhaustion by B meets [F1], which gives equality on the generated Borel sigma-algebra.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Lipschitz concentration for standard Gaussian measure

Statement

Assume AC, DC, and countable choice. Let Z∼γd be standard Gaussian on Rd and let f:Rd→R be L-Lipschitz. If L>0, then for every r>0, P{f(Z)≥Ef(Z)+r}≤e−r2/(2L2). If L=0, the probability on the left is zero.

Facts & Assumptions

[F1]

For g∈C2(Rd) bounded above and below by positive constants, with bounded first and second derivatives, Ent⁡γd(g)≤12∫∣∇g∣2/g dγd (Gross logarithmic Sobolev inequality for standard Gaussian measure).

[F2]

The standard d-dimensional Gaussian γd=Nd(0,Id) has Lebesgue density (2π)−d/2e−∣x∣2/2 (A positive-definite multivariate normal law has its Gaussian density).

[F3]

Dominated convergence passes limits through the Gaussian expectations used below (Dominated convergence).

[F4]

Differentiation under an integral is valid under a common integrable majorant for the parameter derivatives (Differentiation under the integral sign).

[F6]

For nonnegative random variables, Markov's inequality bounds P(X≥a) by EX/a when a>0 (Markov's inequality for random variables).

Proof

Given: AC, DC, countable choice, a standard Gaussian vector Z, and an L-Lipschitz function f.

1.1A1F1givenalgebra

First suppose f is smooth and bounded with bounded derivatives. For λ>0, apply [F1] to g=eλf. With ψ(λ)=log⁡Eeλ(f(Z)−Ef(Z)), the entropy identity and ∣∇f∣≤L give λψ′(λ)−ψ(λ)≤λ2L2/2.

2.1F5F6step 1.1algebra

Assume L>0. The function q(λ)=ψ(λ)/λ extends continuously to q(0)=0 because ψ(0)=ψ′(0)=0. Its derivative on (0,∞) is q′(λ)=(λψ′(λ)−ψ(λ))/λ2≤L2/2 by step 1.1. The mean value theorem [F5] on [0,λ] gives ψ(λ)≤λ2L2/2. Markov's inequality [F6] therefore gives P(f(Z)−Ef(Z)≥r)≤e−λr+λ2L2/2; choosing λ=r/L2 proves the displayed bound for this f.

3.1A1F2F3F4step 2.1construct

Suppose L>0. For a general Lipschitz f, clip its values to [−n,n] to obtain a bounded L-Lipschitz function fn. For s>0 set Psfn(x)=∫fn(e−sx+1−e−2sy) dγd(y). Equivalently, write this as an integral against the smooth Gaussian density ρs(y−e−sx). Every derivative of the kernel in x is a polynomial times a Gaussian density; on compact x-sets it has an integrable Gaussian majorant, so [F4] permits differentiation under the integral to every order. The global L1 norm of each kernel derivative is finite, hence the derivatives of Psfn are bounded by ∥fn∥∞ times finite constants. Using the same integration variable for two points shows Psfn is L-Lipschitz, so step 2.1 applies. For each fixed n, Psfn(x)→fn(x) as s↓0, and then fn(x)→f(x) as n→∞. Throughout, ∣Psfn(x)∣≤∣f(0)∣+L∣x∣+L∫∣y∣ dγd(y). For each fixed λ, λL∣x∣≤∣x∣2/4+(λL)2 and the density in [F2] give an integrable Gaussian majorant for eλ∣Psfn(x)∣. Dominated convergence [F3] passes the means and exponential moments first as s↓0 and then as n→∞, proving the bound for f.

4.1givenalgebra∎

If L=0, then f is constant on Rd, so P{f(Z)≥Ef(Z)+r}=0 for every r>0. This handles the zero-Lipschitz case and completes the theorem.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Uncorrelated jointly Gaussian Banach random elements are independent

Statement

Assume AC and countable choice. Let X and Y be jointly centered Gaussian Borel random elements taking values in real separable Banach spaces B1 and B2. Here jointly Gaussian means every finite family of continuous linear coordinates of (X,Y) has a multivariate normal law. If E[ℓ(X)m(Y)]=0 for every ℓ∈B1∗ and m∈B2∗, then X and Y are independent.

Facts & Assumptions

[A1]

AC and countable choice are hypotheses of the Statement (The Axiom of Choice, The Axiom of Countable Choice (ACω)). AC meets the finite Gaussian interfaces' choice hypothesis; countable choice and HB from [A2] meet the countable norming-family interface. The product-measure interface requires sigma-finiteness, which holds because both marginal laws are probabilities.

[A2]

Under AC, the real dominated-extension theorem supplies the Hahn–Banach principle HB used by the dual-norming interface (Hahn-Banach dominated extension theorem for real vector spaces, The real dominated-extension principle as an additional hypothesis over ZF).

[F1]

A centered multivariate normal vector has characteristic function u↦e−uTΣu/2, which determines its law (Multivariate normal law, including singular covariance, Characteristic function of a multivariate normal law).

[F2]

Countable norming coordinates determine a Borel probability law on a separable Banach space (A separable Banach space has a countable norming family, A countable norming family determines Borel laws).

[F3]

The product probability of two Borel probabilities on these Polish spaces exists and has the product values on measurable rectangles (For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique).

[F4]

Measures agreeing on a generating pi-system containing the whole space, with equal finite total masses, agree on the generated sigma-algebra (Measures agreeing on a generating pi-system are equal under an increasing finite-measure exhaustion from that pi-system). Here the joint law and product law both assign mass one to B1×B2.

[F5]

Independence is equivalent to the product identity on all measurable rectangles (Independent random elements, Independent random elements are characterized by finite rectangle probabilities).

Proof

Given: AC, countable choice, jointly centered Gaussian Borel random elements X,Y with values in B1,B2, and zero mixed covariance for every pair of continuous linear functionals.

1.1A1A2F1F2givenchoose

Choose countable norming families (ℓi) for B1 and (mj) for B2. For any finite subfamilies, the joint coordinate vector is centered multivariate normal. Its covariance matrix has zero off-diagonal block by the hypothesis, so the characteristic function in [F1] is the product of the two marginal characteristic functions. The product law has that same characteristic function, so uniqueness in [F1] proves the finite coordinate vectors are independent.

2.1A1A2F2F3F4F5step 1.1algebra∎

Finite-coordinate cylinder rectangles form a pi-system generating B(B1)⊗B(B2) by [F2]. The joint law of (X,Y) and the product of its marginal laws agree on every such rectangle by step 1.1; [F3] supplies that product measure. The cylinder pi-system contains B1×B2, and both laws have mass one, so the constant exhaustion meets [F4] and gives equality on the generated sigma-algebra. The rectangle criterion [F5] now gives independence of X and Y.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Fernique integrability for a separable Banach Gaussian law

Statement

Assume the Axiom of Choice. Let W be a centered Borel Gaussian random element in a real separable Banach space B. There is a constant a>0 such that Eexp⁡(a∥W∥2)<∞. In particular, E∥W∥2<∞.

Facts & Assumptions

[F1]

If two jointly centered Gaussian Banach-valued random elements have zero mixed covariance under every pair of continuous linear functionals, they are independent (Uncorrelated jointly Gaussian Banach random elements are independent).

[F2]

A centered multivariate normal vector is determined by its covariance matrix, including in the singular case (Multivariate normal law, including singular covariance, Characteristic function of a multivariate normal law).

[F3]

For a decreasing sequence of events, probability is continuous from above (Continuity from above when one set has finite measure).

[F4]

Under HB and countable choice, a separable Banach space has a countable norming family, and its finite-coordinate laws determine Borel laws (A separable Banach space has a countable norming family, A countable norming family determines Borel laws).

[F5]

A countable dense subset of the separable metric space B, together with positive rational radii, gives a countable base; for second-countable spaces the Borel sigma-algebra of the product is the product Borel sigma-algebra. Separability: the existence of an at most countable dense subset, Borel sigma-algebra of a product of second-countable spaces. Continuous maps have Borel preimages of Borel sets. A continuous map has Borel preimages of Borel sets

[F6]

A finite stack of independent multivariate Gaussian vectors is multivariate Gaussian, including singular covariance matrices. A finite stack of independent Gaussian vectors is jointly Gaussian.

Proof

Given: AC, a centered Borel Gaussian random element W in a real separable Banach space B.

1.1A1F5F6givenconstruct

On (B×B,B(B)⊗B(B),μ⊗μ) let W(x,y)=x and W′(x,y)=y be the coordinate copies. The product-measure rectangle formula makes them independent. A countable dense subset of B and rational-radius balls give a countable base, and products of base sets give one for B×B, so [F5] identifies the product sigma-algebra with B(B×B). The coordinate projections are continuous, hence Borel; the maps (x,y)↦(x+y)/2 and (x,y)↦(x−y)/2 are continuous as well, so [F5] makes U=(W+W′)/2 and V=(W−W′)/2 Borel random elements. For any finite list of functionals used on either U or V, the corresponding vectors from W and W′ are independent centered Gaussian vectors, so [F6] makes their stack multivariate Gaussian. The finite coordinate vector of (U,V) is a linear image of that stack, hence is also centered multivariate Gaussian.

2.1F2step 1.1givenalgebra

Centering and independence give, for all ℓ,m∈B∗, E[ℓ(U)m(V)]=12(E[ℓ(W)m(W)]−E[ℓ(W)m(W′)]+E[ℓ(W′)m(W)]−E[ℓ(W′)m(W′)])=0. Independence and centering give E[ℓ(U)m(U)]=E[ℓ(W)m(W)] and E[ℓ(V)m(V)]=E[ℓ(W)m(W)]. Thus each finite coordinate vector of U or V is centered Gaussian with the same covariance as the corresponding vector of W, so [F2] gives matching finite laws.

3.1A2F1F4step 1.1step 2.1

By [A2], the HB and countable-choice hypotheses of [F1] and [F4] hold. The zero mixed covariances from step 2.1 let [F1] make U,V independent, while [F4] upgrades their matching finite norming-coordinate laws to equality of Borel laws with W. Thus U,V are independent copies of W.

4.1F3step 1.1step 3.1givenalgebra

Let p(r)=P(∥W∥>r). By [F3] and ∥W∥<∞ almost surely, p(r)→0 as r→∞; choose s>0 with q:=1−p(s)>0. For r>s, the event {∥W∥>r, ∥W′∥≤s} has probability p(r)q. On it, 2 U=W+W′ and 2 V=W−W′ imply ∥U∥>(r−s)/2 and ∥V∥>(r−s)/2, by the reverse triangle inequality. Since U,V are independent copies by step 3.1, p(r)q≤p((r−s)/2)2.

5.1step 4.1algebra

Choose r0>s with p(r0)<q, and define rn+1=2 rn+s. If p(r0)=0, then W is bounded almost surely and the theorem follows immediately. Otherwise put θ=p(r0)/q∈(0,1). Iterating step 4.1 gives p(rn)≤q θ2n. The explicit recurrence solution is rn=(r0+c)2n/2−c, where c=s/(2−1). Hence for all sufficiently large n, rn is bounded below by a positive multiple of 2n/2 and rn+1≤2rn. If rn<t≤rn+1, then p(t)≤p(rn)≤qe−∣log⁡θ∣2n≤Ce−bt2 for constants C,b>0 independent of n. Thus P(∥W∥>t)≤Ce−bt2 for all sufficiently large t.

6.1step 5.1algebra∎

Choose 0<a<b/3. Partition according to ∥W∥≤rN and the intervals rn<∥W∥≤rn+1 for sufficiently large fixed N. On the nth interval, ea∥W∥2≤earn+12, while step 5.1 bounds its probability by Ce−brn2. Since rn+12/rn2→2, the resulting series is bounded for large n by a constant times e−(b−3a)rn2 and converges. The initial bounded interval contributes finitely. Therefore Eea∥W∥2<∞, and then ∥W∥2≤caea∥W∥2 for a finite constant ca proves the second claim.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Covariance operator and reproducing-kernel Hilbert space of a Banach Gaussian

Definition

Assume AC. Let W be a centered Borel Gaussian random element in a real separable Banach space B, with law μ. For ℓ∈B∗ define Cℓ=E[ℓ(W)W]∈B,Q(ℓ,m)=E[ℓ(W)m(W)](ℓ,m∈B∗). The Cameron–Martin reproducing-kernel Hilbert space H is the completion of B∗/N in the inner product induced by Q, where N={ℓ∈B∗:Q(ℓ,ℓ)=0}. The canonical map sends the class of ℓ to Cℓ and extends continuously to an injective map i:H→B; we identify H with its image in B and use the completed Hilbert norm ∥⋅∥H. The preceding construction is well-defined by The Banach Gaussian covariance and RKHS construction is well-defined ↗.

The term RKHS here denotes this covariance-induced Hilbert space of shifts inside B; it is not the space of all continuous functions on an arbitrary index set.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Borell concentration for the norm of a separable Banach Gaussian

Statement

Assume AC, DC, and countable choice. Let W be a centered Borel Gaussian random element in a real separable Banach space B. Define σ2=sup⁡∥ℓ∥B∗≤1E[ℓ(W)2]. For r≥0, if σ>0 then P{∥W∥>E∥W∥+r}≤e−r2/(2σ2). If σ=0, then W=0 almost surely and the tail probability is zero.

Facts & Assumptions

[A2]

Under AC, the real dominated-extension theorem supplies HB for the dual-norming interface (Hahn-Banach dominated extension theorem for real vector spaces, The real dominated-extension principle as an additional hypothesis over ZF).

[F1]

Fernique integrability gives E∥W∥2<∞, hence E∥W∥<∞ (Fernique integrability for a separable Banach Gaussian law).

[F2]

A countable norming family recovers ∥x∥ as the supremum of its absolute coordinates (A separable Banach space has a countable norming family).

[F3]

Every finite-dimensional centered Gaussian vector has a positive semidefinite covariance square root and is the image of a standard Gaussian vector under that square root (Multivariate normal law, including singular covariance, A non-negative operator has a unique non-negative square root, Characteristic function of a multivariate normal law).

[F4]

A σ-Lipschitz function of a standard Gaussian vector has upper tail at most e−r2/(2σ2) about its mean (Lipschitz concentration for standard Gaussian measure).

[F5]

Dominated convergence applies to Fn↑∥W∥ because Fn≤∥W∥ and [F1] gives an integrable majorant (Dominated convergence).

[F6]

Probability is continuous from below for increasing measurable events (Continuity from below for measures).

Proof

Given: AC, DC, countable choice, a centered Borel Gaussian random element W in B, and σ2 as in the Statement.

1.1A1A2F1F2F5givenchoose

By [F1], σ2≤E∥W∥2<∞. Choose a countable norming family (ℓj)j≥1 from [F2], and let Fn=max⁡1≤j≤n∣ℓj(W)∣. Then Fn↑∥W∥ and EFn→E∥W∥ by [F5].

1.2givenalgebra

If σ>0 and r=0, the probability is at most 1=e0, which is the required bound.

2.1A1F3F4step 1.1algebra

Suppose σ>0 and r>0. The vector (ℓ1(W),…,ℓn(W)) is centered Gaussian. By [F3] it has the law of AZ for a matrix A and a standard Gaussian vector Z. The function z↦max⁡j≤n∣(Az)j∣ is max⁡j∥row⁡j(A)∥2-Lipschitz, and ∥row⁡j(A)∥22=E[ℓj(W)2]≤σ2. Applying [F4] gives P(Fn>EFn+r)≤e−r2/(2σ2). Since EFn≤E∥W∥, the event {Fn>E∥W∥+r} is contained in that tail event.

3.1F6step 2.1algebra

If σ>0 and r>0, the events {Fn>E∥W∥+r} increase to {∥W∥>E∥W∥+r}. Continuity from below [F6] and step 2.1 give the claimed bound.

4.1F2givenalgebra∎

If σ=0, each ℓj(W) has zero variance, so countably many probability-one equalities give ℓj(W)=0 for every j almost surely; [F2] then gives W=0 almost surely. Hence the displayed tail probability is zero for every r≥0.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

The Banach Gaussian covariance and RKHS construction is well-defined

Statement

Assume AC. Under the hypotheses and notation of Covariance operator and reproducing-kernel Hilbert space of a Banach Gaussian, each Cℓ exists as a Bochner integral; Q is a finite positive-semidefinite bilinear form; N={ℓ:Q(ℓ,ℓ)=0} is its nullspace; and the induced map from the completion of B∗/N to B is continuous and injective. Thus the definition identifies a Hilbert space of shifts in B.

Facts & Assumptions

[F1]

Fernique integrability gives E∥W∥2<∞ (Fernique integrability for a separable Banach Gaussian law).

[F2]

A Borel map into a separable Banach space is strongly measurable (A Borel map into a separable Banach space is strongly measurable).

[F3]

A strongly measurable Banach-valued function is Bochner integrable when the integral of its norm is finite; its integral norm is bounded by that scalar integral (Bochner integrability criterion, Bochner integral norm inequality).

[F4]

Bounded linear maps commute with Bochner integration (Bounded linear maps commute with Bochner integration).

[F5]

Continuous linear functionals separate points of a normed space (Relative dual norming, point separation, and recovery of the norm).

[F6]

Cauchy–Schwarz bounds the product of two square-integrable real random variables (Cauchy-Schwarz for random variables).

Proof

Given: AC and a centered Borel Gaussian random element W in a real separable Banach space B, with C,Q,N,H as in the Definition.

1.1A1F1F2F3given

For ℓ∈B∗, the map ω↦ℓ(W(ω))W(ω) is Borel as the composition of W with the continuous map x↦ℓ(x)x. It is strongly measurable by [F2], and ∥ℓ(W)W∥≤∥ℓ∥∥W∥2 is integrable by [F1]. Hence [F3] defines Cℓ=E[ℓ(W)W] as a Bochner integral.

2.1F1F4F6step 1.1algebra

By [F1], E∣ℓ(W)∣2≤∥ℓ∥2E∥W∥2<∞ for every ℓ∈B∗; Cauchy–Schwarz [F6] therefore makes E∣m(W)ℓ(W)∣ finite. Applying m∈B∗ to the Bochner integral using [F4] gives m(Cℓ)=E[m(W)ℓ(W)]. Thus Q(ℓ,m)=m(Cℓ) is a finite symmetric bilinear form, nonnegative on the diagonal. Again by [F6], ∣Q(ℓ,m)∣≤Q(ℓ,ℓ)1/2Q(m,m)1/2, so Q(ℓ,ℓ)=0 implies Q(ℓ,m)=0 for every m; therefore N is the radical of Q and the quotient form is an inner product.

3.1A1F5step 2.1

If ℓ∈N, step 2.1 gives m(Cℓ)=0 for every m, so Cℓ=0 by [F5]. Conversely, if Cℓ=0, taking m=ℓ in step 2.1 gives Q(ℓ,ℓ)=0, hence ℓ∈N. Therefore [ℓ]↦Cℓ is well-defined and injective on B∗/N.

4.1F1F3F6step 2.1step 3.1algebra∎

By [F3] and [F6], ∥Cℓ∥≤E(∣ℓ(W)∣∥W∥)≤Q(ℓ,ℓ)1/2(E∥W∥2)1/2. So the map on the quotient is bounded and extends uniquely to its Hilbert completion because B is complete. For every m∈B∗, the identity m(Cℓ)=⟨[ℓ],[m]⟩H from step 2.1 extends by continuity to m(iu)=⟨u,[m]⟩H. If iu=0, then u is orthogonal to the dense subspace B∗/N, so u=0. The extension is injective, proving all claims.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Cameron–Martin translation formula for a separable Banach Gaussian

Statement

Assume AC and countable choice. Let W be a centered Borel Gaussian random element in a real separable Banach space B, with law μ and covariance RKHS H⊆B. For h∈H, let zh be the L2(μ)-limit of the coordinate functions ℓ(x) representing a sequence of classes [ℓ]→i−1h in the completion H. The limit has a Borel-measurable version and does not depend on the approximating sequence. If μh denotes the law of W+h, then dμhdμ(x)=exp⁡ ⁣(zh(x)−12∥h∥H2). In particular, μh and μ are equivalent. If h=Cℓ for ℓ∈B∗, then zh(x)=ℓ(x) μ-almost surely and ∥h∥H2=E[ℓ(W)2]; these formulas are independent of the choice of representative ℓ.

Facts & Assumptions

[A1]

AC and countable choice are the explicit Gaussian-construction and countable-coordinate assumptions (The Axiom of Choice, The Axiom of Countable Choice (ACω)).

[A2]

Under AC, the real dominated-extension theorem supplies the Hahn–Banach principle HB used by the dual-norming interface (Hahn-Banach dominated extension theorem for real vector spaces, The real dominated-extension principle as an additional hypothesis over ZF).

[F1]

The quotient completion H embeds injectively into B, and ℓ(iu)=⟨u,[ℓ]⟩H (The Banach Gaussian covariance and RKHS construction is well-defined).

[F2]

Finite families of continuous coordinates of W are multivariate Gaussian, with characteristic function determined by their covariance (Multivariate normal law, including singular covariance, Characteristic function of a multivariate normal law).

[F4]

The standard normal density is (2π)−1/2e−x2/2 and its characteristic function is e−t2/2 (Standard normal and normal laws, Characteristic function of a multivariate normal law).

[F5]

For square-integrable real random variables, E∣XY∣≤(EX2)1/2(EY2)1/2 (Cauchy-Schwarz for random variables).

[F6]

L2(μ) over the Borel probability space (B,B(B),μ) is complete, and its elements are classes of Borel-measurable functions (L2 with the integral pairing is a Hilbert space).

Proof

Given: AC, countable choice, a centered Borel Gaussian random element W in B, its law μ, covariance RKHS H, and an arbitrary h=i(u)∈H.

1.1A1F1F2F5F6givenconstructalgebra

On the dense quotient B∗/N⊂H, define J([ℓ])=ℓ(⋅) as an element of L2(μ). The definition of the inner product makes J an isometry, so it extends to an isometry J:H→L2(μ) by completeness [F6]. Let zh=J(u) and choose [ℓn]→u in the quotient completion; put Zn=ℓn(W). Since L2(μ) is formed from Borel-measurable functions on (B,B(B),μ), choose a Borel-measurable representative zh of its class. Approximation in L2 gives uniqueness up to μ-null sets, with ∥Zn−zh∥2→0. For fixed ℓ1,…,ℓm∈B∗, set Yn=(Zn,ℓ1(W),…,ℓm(W)) and Y=(zh,ℓ1(W),…,ℓm(W)). Each Yn is centered multivariate Gaussian by [F2]. Cauchy–Schwarz [F5] gives E∣Zn−zh∣≤∥Zn−zh∥2→0, ∣E[Znℓj(W)]−E[zhℓj(W)]∣≤∥Zn−zh∥2∥ℓj(W)∥2→0, and ∣E[Zn2]−E[zh2]∣≤∥Zn−zh∥2(∥Zn∥2+∥zh∥2)→0. Thus their covariance matrices Σn converge entrywise to the positive-semidefinite covariance matrix Σ of Y. For each t=(s,t1,…,tm), ∣Eeit⋅Yn−Eeit⋅Y∣≤∣s∣E∣Zn−zh∣→0. By [F2], Eeit⋅Yn=e−tTΣnt/2, so the characteristic function of Y is e−tTΣt/2, the characteristic function of N(0,Σ). Uniqueness in [F2] proves that Y is jointly Gaussian. Finally, its mixed covariances satisfy Cov⁡(zh,ℓj(W))=lim⁡n⟨[ℓn],[ℓj]⟩H=⟨u,[ℓj]⟩H=ℓj(h) by [F1].

2.1A1A2F2F3F4step 1.1algebra

Choose a countable norming family (ℓj)j≥1 for B using [A1, A2], and put D=exp⁡(zh−∥h∥H2/2). By [F2], for every finite subvector L=(ℓ1(W),…,ℓm(W)), the joint vector (zh,L) is a linear image of a finite standard Gaussian vector. For one standard coordinate G and real u,v, completing the square in [F4]'s density gives Ee(u+iv)G=eu2/2∫eivy(2π)−1/2e−(y−u)2/2 dy=e(u+iv)2/2. Multiplying these identities over the independent standard coordinates and using the covariances from step 1.1 gives Eμ[eit⋅LD]=exp⁡ ⁣(−12tTCov⁡(L)t+i∑j=1mtjℓj(h)). At t=0 this also gives EμD=1. Since zh is finite almost surely, D>0 almost surely, so D dμ is a probability equivalent to μ. The displayed function is the characteristic function of L+(ℓ1(h),…,ℓm(h)). Thus D dμ and the law μh of W+h have the same finite-dimensional pushforwards under a countable norming family.

3.1A1A2F1F3step 2.1∎

By [F3], equality of those pushforwards implies D dμ=μh on all Borel sets, proving the Radon–Nikodym identity. Positivity of D gives equivalence. If h=Cℓ, then u=[ℓ] and J(u)=ℓ(⋅); if Cℓ=Cℓ′, the well-definedness theorem gives [ℓ]=[ℓ′], so both the scalar representative and its variance agree almost surely.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

The Cameron–Martin unit ball is compact in the Banach norm

Statement

Assume AC. Let μ be a centered tight Borel Gaussian law on a real separable Banach space B, and let H⊂B be its covariance RKHS. The closed Hilbert unit ball H1={h∈H:∥h∥H≤1} is compact in the Banach norm.

Facts & Assumptions

[A1]

AC is inherited from the Gaussian translation and tightness suppliers. Under AC, the ultrafilter lemma follows from The ultrafilter lemma, from the Axiom of Choice: every filter extends to an ultrafilter, and DC and countable choice follow from AC implies DC implies countable choice.

[A2]

Under AC, the real dominated-extension theorem supplies the Hahn–Banach principle HB used by the dual-norming interface (Hahn-Banach dominated extension theorem for real vector spaces, The real dominated-extension principle as an additional hypothesis over ZF).

[F1]

For h∈H, the translated law has density Dh=exp⁡(zh−∥h∥H2/2), where zh is centered normal of variance ∥h∥H2 (Cameron–Martin translation formula for a separable Banach Gaussian, Standard normal and normal laws).

[F2]

A Borel probability on the separable Banach space is tight (Every borel probability on a polish space is tight, Prokhorov tightness theorem on polish spaces).

[F3]

Under the ultrafilter lemma, DC and HB, a Banach space is reflexive exactly when every bounded sequence has a weakly convergent subsequence; under countable choice, a Hilbert space is reflexive (Reflexivity is equivalent to weak subsequential compactness of bounded sequences, Hilbert spaces are reflexive by Riesz representation). The needed choice hypotheses follow from [A1] and [A2].

[F4]

The canonical embedding satisfies ℓ(ih)=⟨h,[ℓ]⟩H, and continuous linear functionals separate points (Covariance operator and reproducing-kernel Hilbert space of a Banach Gaussian, Relative dual norming, point separation, and recovery of the norm).

[F5]

Cauchy–Schwarz applies to the square-integrable density and event indicator (Cauchy-Schwarz for random variables).

Proof

Given: AC and a centered tight Borel Gaussian law μ on B, its covariance RKHS H, and H1.

1.1A1F1F2F5givenalgebra

If h∈H1, write v=∥h∥H2≤1. If v=0, then zh=0 almost surely and Dh=1. If v>0, completing the square in the normal density of zh gives Ee2zh=e2v. In both cases [F1] yields ∫Dh2 dμ=ev≤e. Choose compact K⊂B with μ(Kc)<1/(16e) using [F2]. Cauchy–Schwarz [F5] then gives μh(Kc)=∫KcDh dμ<1/4, uniformly for all h∈H1, while μ(K)>3/4. Hence μ(K∩(K−h))≥μ(K)+μh(K)−1>0. For each h∈H1 there is x∈K with x+h∈K, so h∈K−K. The difference K−K is compact; therefore H1 is relatively compact in B.

2.1A1A2F3F4step 1.1algebra∎

Let (hn) be any sequence in H1. By [F3], pass to a subsequence weakly converging in H to some h∈H1. Relative compactness from step 1.1 gives a further subsequence with ihn→y in B. For every ℓ∈B∗, [F4] gives ℓ(y)=lim⁡n⟨hn,[ℓ]⟩H=⟨h,[ℓ]⟩H=ℓ(ih). By [F4], y=ih. Thus every sequence in H1 has a norm-convergent subsequence whose limit lies in H1; in the metric space B, this is compactness.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

The support of a Banach Gaussian is the closure of its RKHS

Statement

Assume AC and countable choice. Let μ be a centered tight Borel Gaussian law on a real separable Banach space B, and let H⊆B be its covariance RKHS. Define supp⁡μ to be the set of x∈B for which every open neighborhood has positive μ-measure. Then supp⁡μ=H‾ B.

Facts & Assumptions

[F1]

Cameron–Martin translations by h∈H are equivalent to μ (Cameron–Martin translation formula for a separable Banach Gaussian).

[F2]

Tightness supplies a compact set of positive measure (Every borel probability on a polish space is tight).

[F3]

Centered multivariate normal vectors are determined by their covariance, and countable norming coordinates determine Borel laws on B (Multivariate normal law, including singular covariance, Characteristic function of a multivariate normal law, A countable norming family determines Borel laws).

[F4]

A point outside a closed linear subspace of a normed space can be separated from it by a continuous linear functional (Relative geometric Hahn–Banach with the exact open, closed, and compact hypotheses, The real dominated-extension principle as an additional hypothesis over ZF).

[A2]

Under AC, the real dominated-extension theorem supplies the Hahn–Banach principle HB used by geometric separation (Hahn-Banach dominated extension theorem for real vector spaces, The real dominated-extension principle as an additional hypothesis over ZF).

[F5]

Countable dense sets and rational-radius balls give countable bases for the separable Banach factors; their product Borel sigma-algebra is the product of the factor Borel sigma-algebras. Continuous maps have Borel preimages of Borel sets. (Separability: the existence of an at most countable dense subset, Borel sigma-algebra of a product of second-countable spaces, A continuous map has Borel preimages of Borel sets)

[F6]

A finite stack of independent multivariate Gaussian vectors is multivariate Gaussian, including singular covariance matrices. (A finite stack of independent Gaussian vectors is jointly Gaussian)

Proof

Given: AC, countable choice, a centered tight Borel Gaussian law μ on a real separable Banach space B and its covariance RKHS H.

1.1A1A2F2F3F5F6givenchoose

First, 0∈supp⁡μ. Fix ε>0. By [F2] choose compact K with μ(K)>1/2 and cover it by finitely many balls of radius ρ=ε/(22). One ball B(x,ρ) has positive μ-measure. On (B×B,B(B)⊗B(B),μ⊗μ) let W,W′ be the independent coordinate copies. By [F5], this product sigma-algebra is the Borel sigma-algebra of B×B; the maps (x,y)↦x−y and x↦2x are continuous, so W−W′ and 2W are Borel random elements. The event that both copies lie in B(x,ρ) has positive probability and implies ∥W−W′∥<2ρ. Choose a countable norming family using countable choice and HB from [A2]. For any finite subfamily, the coordinate vectors of W,W′ are independent centered multivariate normals with common covariance Σ; [F6] makes their stack multivariate Gaussian, so its linear image giving the difference is multivariate Gaussian. The vector for 2W is also multivariate Gaussian, and both vectors have covariance 2Σ. Thus [F3] makes their finite laws equal. Countable norming-law determination in [F3] gives W−W′=d2W. Hence μ(B(0,ε/2))>0, and therefore μ(B(0,ε))>0.

1.2A2F4givenalgebra

Suppose x∉H‾ B. By [F4] choose ℓ∈B∗ with ℓ(H)=0 and ℓ(x)≠0. For every m∈B∗, ℓ(Cm)=E[ℓ(W)m(W)]=0, since Cm∈H. Taking m=ℓ gives E[ℓ(W)2]=0, so ℓ(W)=0 almost surely. Hence μ(ker⁡ℓ)=1. Because ker⁡ℓ is closed and does not contain x, some open neighborhood of x is disjoint from ker⁡ℓ and has measure zero. Thus x∉supp⁡μ.

2.1F1step 1.1

For h∈H, [F1] gives equivalence of the law of W−h with μ. Thus its mass on B(0,ε) is positive by step 1.1. That mass is μ(B(h,ε)), so every h∈H lies in the support. Since the support is closed, H‾ B⊆supp⁡μ.

3.1step 2.1step 1.2∎

Step 2.1 gives H‾ B⊆supp⁡μ, and step 1.2 gives the reverse inclusion. Therefore the two sets are equal.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Concentration function of a Banach Gaussian prior

Definition

Assume AC and countable choice. Let μ be a centered tight Borel Gaussian law on a real separable Banach space B, with covariance RKHS H, and let w0∈H‾ B. For ε>0, write εB∘={x∈B:∥x∥B<ε} and define the concentration function ϕw0(ε)=inf⁡h∈H∥h−w0∥B<ε{∥h∥H2−log⁡μ(εB∘)}. The feasible set is nonempty because w0 lies in the Banach-norm closure of H. Also μ(εB∘)>0 because 0∈supp⁡μ; thus the logarithm is finite. The value is finite and nonnegative. The support assertion used here is The support of a Banach Gaussian is the closure of its RKHS.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Borell–Sudakov–Tsirelson expansion for a Banach Gaussian law

Statement

Assume AC and countable choice. Let μ be a centered tight Borel Gaussian law on a real separable Banach space B, with covariance RKHS H and unit ball H1. For every Borel set A⊆B and r≥0, μ∗(A+rH1)≥Φ ⁣(Φ−1(μ(A))+r), where μ∗(S)=sup⁡{μ(K):K⊆S, K compact} is the inner measure and Φ−1(0)=−∞, Φ−1(1)=+∞. When A+rH1 is Borel, its inner measure equals its ordinary μ-measure.

Facts & Assumptions

[A1]

AC and countable choice are assumed by the finite-dimensional Gaussian and countable-cylinder interfaces (The Axiom of Choice, The Axiom of Countable Choice (ACω)).

[A2]

Under AC, the real dominated-extension theorem supplies HB for the Hahn–Banach dual-norming interface (Hahn-Banach dominated extension theorem for real vector spaces, The real dominated-extension principle as an additional hypothesis over ZF).

[F1]

For Borel E⊆Rd and r≥0, Gaussian inner measure satisfies γd,∗(E+rB2d)≥Φ(Φ−1(γd(E))+r) (Finite-dimensional Gaussian isoperimetric expansion). This supplier proves the sharp finite-dimensional expansion locally.

[F2]

The covariance RKHS H is a Hilbert space continuously and injectively embedded in B, with ℓ(ih)=⟨h,[ℓ]⟩H (Covariance operator and reproducing-kernel Hilbert space of a Banach Gaussian, The Banach Gaussian covariance and RKHS construction is well-defined).

[F3]

The Hilbert unit ball H1 is compact in the Banach norm (The Cameron–Martin unit ball is compact in the Banach norm).

[F4]
[F5]

A separable metric space has a countable base, and countable choice selects one cover member for each relevant basis element (Separability: the existence of an at most countable dense subset, The Axiom of Countable Choice (ACω)).

[F6]

Probability is continuous from above on decreasing measurable sets (Continuity from above when one set has finite measure).

[F7]

Under HB, distinct points in a normed space are separated by a continuous linear functional (Relative dual norming, point separation, and recovery of the norm).

Proof

Given: AC, countable choice, a centered tight Borel Gaussian law μ on a real separable Banach space B, its covariance RKHS H, and H1={h∈H:∥h∥H≤1}.

1.1F2givenchoose

First let F=T−1(M) be a closed finite-coordinate cylinder, with T=(ℓ1,…,ℓk):B→Rk continuous and M closed. Let Q=span⁡{[ℓi]:1≤i≤k}⊂H, choose an orthonormal basis e1,…,em, and choose representatives φj∈B∗ for ej. Set G=∑j=1mφj(W)ej and S=T∘i∣Q. The vector of coefficients is standard Gaussian on Q because its covariance matrix is the identity. For each i, [ℓi]=∑j⟨[ℓi],ej⟩Hej; by the covariance quotient and [F2], the residual ℓi(W)−ℓi(iG) has variance ∥[ℓi]−∑j⟨[ℓi],ej⟩Hej∥H2=0. Hence T(W)=S(G) almost surely. The map S is injective: if S(q)=0, then ⟨q,[ℓi]⟩H=0 for every i, and these classes span Q, so q=0.

1.2A1A2F4F5F7givenchoose

Now let A⊆B be Borel with 0<μ(A)<1, and fix β<Φ−1(μ(A)). By [F4] choose compact K⊆A with μ(K)>Φ(β). For each x∉K and y∈K, [F7] gives ℓy∈B∗ with ℓy(x)≠ℓy(y). The open sets Uy={z:∣ℓy(z)−ℓy(y)∣<∣ℓy(x)−ℓy(y)∣/3} cover K; compactness gives a finite subcover Uy1,…,Uyq. For every z∈K, some i has z∈Uyi, which forces ℓyi(z)≠ℓyi(x). Thus the finite coordinate map Tx=(ℓy1,…,ℓyq) satisfies Tx(x)∉Tx(K). The cylinder Fx=Tx−1(Tx(K)) is closed, contains K, and excludes x, since Tx(K) is compact. The open complements B∖Fx cover B∖K. By [F5] this cover has a countable subcover: for every basis element meeting B∖K and contained in a cover member, countable choice selects one such member; every point is covered by one selected member. If the subcover is finite, repeat one member to index it by j≥1.

2.1A1F1F2F4step 1.1algebra

If m=0, then T(W)=0 almost surely, so μ(F) is zero or one; the endpoint convention, 0∈H1, and inner regularity [F4] give the claimed inequality. If m>0, define E=S−1(M)⊂Q. It is closed and μ(F)=γQ(E). For r≥0, Er=E+r(Q∩H1) is closed because its second summand is compact. Thus [F4] identifies its inner and ordinary Gaussian measures, and [F1] gives γQ(Er)≥Φ(Φ−1(γQ(E))+r). Let Cr=T−1(S(Er)), a closed finite-coordinate cylinder because S is a linear isomorphism from finite-dimensional Q onto the closed subspace S(Q); injectivity of S and T(W)=S(G) give μ(Cr)=γQ(Er). If y∈Cr, write T(y)=S(u+v) with u∈E and v∈r(Q∩H1). Then T(y−i(v))=S(u)∈M, so y−i(v)∈F and y∈F+rH1. Hence Cr⊆F+rH1, and inner regularity [F4] gives μ∗(F+rH1)≥μ(Cr)≥Φ(Φ−1(μ(F))+r).

3.1F3F4step 2.1step 1.2

Let Gn=⋂j≤nFxj for the countable subcover in step 1.2. Each Gn is a closed finite-coordinate cylinder because it is a finite intersection of such cylinders; the sequence decreases, ⋂nGn=K, and μ(Gn)≥μ(K)>Φ(β). Applying step 2.1 yields μ∗(Gn+rH1)≥Φ(β+r). The set Gn+rH1 is closed: if aj+hj converges with aj∈Gn and hj∈rH1, compactness [F3] gives a convergent subsequence of hj, after which closedness of Gn gives a limit representation. Thus [F4] gives equality of its inner and ordinary measures.

4.1F3F4F6step 3.1algebra∎

The closed sets Gn+rH1 decrease and their intersection is K+rH1. Indeed, if x=an+hn with an∈Gn and hn∈rH1 for every n, compactness [F3] gives a subsequence hnj→h∈rH1; then anj→x−h, and for each fixed N the tail belongs to the closed set GN, so x−h∈K. The reverse inclusion is immediate. Continuity from above [F6] gives μ(K+rH1)≥Φ(β+r). Since K⊆A, μ∗(A+rH1)≥Φ(β+r). Letting β↑Φ−1(μ(A)) proves the interior-probability case. If μ(A)=0 the right side is zero; if μ(A)=1, inner regularity [F4] and 0∈H1 give μ∗(A+rH1)=1.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Gaussian concentration-function sieve bounds

Statement

Assume AC and countable choice. Let μ be a centered tight Borel Gaussian law on a real separable Banach space B, with covariance RKHS H, and let w0∈H‾ B. Suppose n≥1, ε>0, C>1, e−Cnε2<1/2, and ϕw0(ε)≤nε2, where ϕw0 is the concentration function. Then there is a measurable set Bn⊆B such that log⁡N(3ε,Bn,∥⋅∥B)≤6Cnε2,μ(B∖Bn)≤e−Cnε2, and μ{∥W−w0∥B<2ε}≥e−nε2. These are prior-mass and sieve bounds only; they assert no posterior contraction without separate statistical-distance and Kullback–Leibler comparisons.

Facts & Assumptions

[A1]

AC and countable choice are inherited from the Gaussian translation and Banach expansion suppliers (The Axiom of Choice, The Axiom of Countable Choice (ACω)).

[A2]

Under AC, the real dominated-extension theorem supplies the Hahn–Banach principle HB used by the dual-norming interface (Hahn-Banach dominated extension theorem for real vector spaces, The real dominated-extension principle as an additional hypothesis over ZF).

[F1]

The concentration function satisfies ϕw0(ε)=inf⁡∥h−w0∥B<ε{∥h∥H2−log⁡μ(εB∘)} (Concentration function of a Banach Gaussian prior).

[F2]

For h∈H, the law of W+h has density exp⁡(zh−∥h∥H2/2) with respect to μ (Cameron–Martin translation formula for a separable Banach Gaussian).

[F3]

The Gaussian expansion inequality gives μ∗(A+rH1)≥Φ(Φ−1(μ(A))+r) for Borel A (Borell–Sudakov–Tsirelson expansion for a Banach Gaussian law).

[F4]

H1 is compact in the Banach norm (The Cameron–Martin unit ball is compact in the Banach norm).

[F5]

A standard normal has density (2π)−1/2e−z2/2 (Standard normal and normal laws).

[F6]

A Borel subset of a Polish space is inner regular, so its inner measure equals its probability (Assuming countable choice, Borel probability measures on Polish spaces are inner regular).

[F7]

Balls with rational radii and centers in a countable dense subset form a countable base for B; together with the countable base of R, this makes B×R second countable and its Borel sigma-algebra the product Borel sigma-algebra (Separability: the existence of an at most countable dense subset, The rationals embed densely in the reals, Q is countably infinite, A product of two at most countable sets is at most countable, Borel sigma-algebra of a product of second-countable spaces). The Borel version of zh from the Cameron–Martin theorem therefore gives a Borel joint law for (W,zh). Appending zh to a countable norming family for B gives a norming family for B×R, whose finite centered Gaussian coordinate laws are invariant under simultaneous negation (Cameron–Martin translation formula for a separable Banach Gaussian, A separable Banach space has a countable norming family, A countable norming family determines Borel laws, Multivariate normal law, including singular covariance).

[F8]

N(δ,A,∥⋅∥B) is the least number of closed radius-δ balls centered in A that cover A, and metric entropy is its logarithm (Covering, packing, bracketing numbers, and metric entropy).

Proof

Given: μ,B,H,w0,n,ε,C as in the Statement. Set t=nε2 and p=μ(εB∘).

1.1A1A2F1F2F7givenalgebra

The hypothesis [F1] implies p≥e−t>0, because every candidate h has ∥h∥H2≥0. Fix h∈H. Take a countable norming family for B and append the scalar coordinate zh; this is a countable norming family for B×R with the maximum product norm. By [F7], each finite coordinate vector is centered Gaussian and hence invariant under negation, so countable law determination makes the joint law symmetric under (x,z)↦(−x,−z). Thus, since εB∘ is symmetric, ∫εB∘e−zh(x) dμ(x)=∫εB∘cosh⁡(zh(x)) dμ(x)≥p. The Cameron–Martin identity [F2] for −h now gives μ(h+εB∘)≥e−∥h∥H2/2p.

2.1F1step 1.1choosealgebra

For each δ>0, choose h∈H with ∥h−w0∥B<ε and ∥h∥H2−log⁡p<ϕw0(ε)+δ≤t+δ. Since ∥h∥H2/2−log⁡p≤∥h∥H2−log⁡p<t+δ, and h+εB∘⊂w0+2εB∘, step 1.1 gives μ{∥W−w0∥B<2ε}≥e−t−δ. Letting δ↓0 proves the small-ball lower bound.

2.2F3F6step 1.1algebra

Let b=Φ−1(e−Ct)<0 and M=−2b>0, and set Bn=εB∘+MH1. This is open, hence measurable. Since p≥e−t and C>1, monotonicity of Φ−1 gives Φ−1(p)>b. By [F3], μ(Bn)≥Φ(Φ−1(p)+M)>Φ(−b)=1−e−Ct. The set Bn is open and therefore Borel, so [F6] identifies its inner measure with μ(Bn). Thus μ(B∖Bn)≤e−Ct.

2.3F1F2F4F8step 1.1construct

Choose a maximal finite set {h1,…,hN}⊂MH1 with pairwise distances greater than 2ε; such a set exists and covers MH1 by closed 2ε-balls because MH1 is compact by [F4]. The open balls hi+εB∘ are disjoint. Step 1.1 and ∥hi∥H≤M imply each has μ-measure at least e−M2/2p. Hence Ne−M2/2p≤1 and log⁡N≤M2/2−log⁡p≤M2/2+t. Every point of Bn is x+h with x∈εB∘ and h∈MH1, so it lies within 3ε of some hi. Also hi=0+hi∈Bn because 0∈εB∘. Thus these are admissible centers in the covering-number convention [F8], and N(3ε,Bn,∥⋅∥B)≤N.

3.1F5step 2.1step 2.2step 2.3algebra∎

Completing the square in the standard normal density [F5] gives Ee−λZ=eλ2/2. For x≥0, on {Z≤−x} one has e−xZ≥ex2, so Φ(−x)=P(Z≤−x)≤e−x2Ee−xZ=e−x2/2. With x=2Ct this gives Φ(−2Ct)≤e−Ct=Φ(b), hence −2Ct≤b<0 and b2≤2Ct. Consequently log⁡N(3ε,Bn,∥⋅∥B)≤2b2+t≤4Ct+t≤5Ct≤6Ct, using C>1. Step 2.2 supplies the complement bound and step 2.1 the small-ball bound. No posterior statement follows from these three prior inequalities alone.

5 · Examples, counterexamples and false statements

None yet.

Sources