Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-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.

Gaussian-process posterior contraction in density and regression models

Statement

Let ϵn>0 satisfy ϵn→0 and nϵn2→∞. For the centered tight Gaussian prior in each branch, let μ be its law and let B be a separable closed Banach carrier with the norm inherited from that branch's stated function space, as supplied by A tight Gaussian law is carried by a separable closed subspace. Write H for the covariance RKHS of μ on B, and define ϕw0(ϵ)=inf⁡h∈H∥h−w0∥B<ϵ{∥h∥H2−log⁡μ(ϵB∘)},ϵB∘={u∈B:∥u∥B<ϵ}. Suppose ϕw0(ϵn)≤nϵn2.

In each branch, parameter-to-data densities are jointly measurable and the posterior Πn is the data-indexed normalization of the prior times the likelihood on fibers with finite positive evidence.

  1. Log-Gaussian density estimation. On a measurable space (X,A) with sigma-finite measure ν, let W be a tight centered Borel Gaussian random element in ℓ∞(X), and let w0 belong to its support. Assume path evaluation (w,x)↦w(x) is jointly measurable, Zw=∫ew dν∈(0,∞) for prior-almost every w and for w0, and set pw=ew/Zw, p0=pw0. For IID data X1,…,Xn∼P0, sufficiently large fixed M gives E0Πn{w:h(Pw,P0)>Mϵn∣Xn}⟶0. When 0<ν(X)<∞, bounded paths imply the required normalizers are finite and positive.

  2. Binary regression. Let (Xi,Yi) be IID, with Xi∼G, Yi∈{0,1} and P0(Y=1∣X=x)=f0(x)=Ψ(w0(x))∈(0,1). Assume Ψ:R→(0,1) is differentiable, sup⁡∣Ψ′∣<∞, and sup⁡∣Ψ′/[Ψ(1−Ψ)]∣<∞. Suppose the prior is either a tight centered Gaussian law in L2(G) with a jointly measurable evaluation version representing its L2(G) element almost everywhere, or a tight centered Gaussian law in ℓ∞(X) with jointly measurable evaluation and bounded w0; in either case w0 belongs to the prior support. Then for sufficiently large fixed M, E0Πn{∥Ψ(w)−f0∥L2(G)>Mϵn∣(Xi,Yi)i=1n}⟶0.

  3. Fixed-design Gaussian regression. For deterministic x1,…,xn, assume independent Yi∼N(w0(xi),σ02), a centered tight Borel Gaussian prior W in ℓ∞(X) with w0 in support, and an independent prior on the standard deviation σ supported on a fixed [a,b]⊂(0,∞) containing σ0, with Lebesgue density bounded below by a positive constant. Put ρn=max⁡{ϵn,log⁡n/n} for n≥2. Then for sufficiently large fixed M, E0Πn{∥w−w0∥n+∣σ−σ0∣>Mρn∣Y1:n}⟶0. The sharper conclusion with ϵn in place of ρn holds if the Gaussian law is not the point mass at zero. It also holds when W=0 almost surely and the scale-prior density is bounded above on a neighborhood of σ0; this extra upper bound is needed only for that sharper degenerate-prior alternative, not for the universal ρn conclusion. In the nondegenerate case ρn=O(ϵn), so the two formulations differ only by the fixed constant M. Here ∥w−w0∥n2=n−1∑i(w(xi)−w0(xi))2.

The concentration-function hypothesis is interpreted on a separable Banach space carrying the prior. For a tight Gaussian law initially given in nonseparable ℓ∞(X), the separable-support reduction is A tight Gaussian law is carried by a separable closed subspace; the norm and prior law are restricted to that support space.

Facts & Assumptions

Given: The three model contracts above, a common rate sequence satisfying ϵn→0 and nϵn2→∞, and the displayed Gaussian concentration-function inequality.

[F8]

The support of a Banach Gaussian is the closure of its RKHS: under AC and countable choice, a centered tight Borel Gaussian law on a real separable Banach space has support equal to the Banach-norm closure of its covariance RKHS.

[F9]

Concentration function of a Banach Gaussian prior: the current definition uses inf⁡∥h−w0∥B<ϵ{∥h∥H2−log⁡μ(ϵB∘)} for w0∈H‾ B.

[F10]

Gaussian concentration-function sieve bounds: under AC and countable choice, the full-squared concentration hypothesis supplies measurable sieves with log⁡N(3r,Bn,∥⋅∥B)≤6Cnr2, prior tail at most e−Cnr2, and mass at least e−nr2 in the 2r-ball about the truth. Its sharp finite-dimensional expansion and Banach expansion suppliers have local proofs.

[F11]

Centered Borel Gaussian random element on a separable Banach space: a centered Borel Gaussian random element is a Borel-measurable map into a real separable Banach space whose continuous linear images are centered normal.

[F12]

Covariance operator and reproducing-kernel Hilbert space of a Banach Gaussian: under AC, the covariance RKHS is the completed covariance-form quotient embedded as a Hilbert space of shifts in the Banach space.

[A2]

In the fixed-design branch the scale prior has density at least c>0 on [a,b]. For r↓0, including when σ0 is an endpoint, its r-neighborhood therefore has prior mass at least cr once r<b−a. An upper density bound is assumed only in the sharper degenerate-prior alternative stated above.

[A3]

Assume AC and countable choice for the Gaussian concentration-sieve interface The Axiom of Choice, The Axiom of Countable Choice (ACω). The separate Hahn–Banach extension principle used in [F5] is not inferred from these assumptions.

[A4]

Assume the separate relative Hahn–Banach extension principle The real dominated-extension principle as an additional hypothesis over ZF for the separable-support reduction [F5]; it is not silently deduced from AC.

[F1]

KL prior mass gives a posterior denominator lower bound in probability: for a jointly measurable dominated IID model, local prior mass at least e−Cnδn2 on a set with directional KL and log-square at most δn2 gives a denominator lower bound e−(C+2)nδn2 except with probability at most (nδn2)−1.

[F2]

Sieve metric entropy produces uniform exponential tests: same-metric packing entropy at radius δn bounded by nδn2 gives tests with exponentially small null and uniform alternative errors outside a sufficiently large multiple of δn; for density L2 the densities must be uniformly bounded.

[F4]

Local KL and log-square mass bounds a non-IID posterior denominator and Tests and a sieve tail imply posterior contraction from a denominator bound give the non-IID denominator bound and the tested-numerator/sieve-tail split used in the IID and fixed-design arguments.

[F5]

A tight Gaussian law is carried by a separable closed subspace: a tight Borel Gaussian law in a Banach space is carried by a separable closed subspace without changing its support or inherited norm.

[F6]

Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: joint measurability and Tonelli make the log-Gaussian normalizer a measurable function of the path.

[F7]

A nonzero Gaussian direction forces logarithmic small-ball cost: if the prior has a nonzero Gaussian direction, ϕw0(ϵ)≤nϵ2 implies log⁡(1/ϵ)≤nϵ2+C for a fixed constant.

[F13]

A separable Banach space has a countable norming family under the declared Hahn–Banach and countable-choice assumptions. Thus a centered Gaussian law different from δ0 has a continuous linear functional with positive variance. A separable Banach space has a countable norming family.

[F14]

A supremum-norm sieve with covering entropy at radius 3rn bounded by 6Cnrn2 supplies fixed-design Gaussian tests outside a sufficiently large empirical-mean-plus-scale ball, with arbitrarily prescribed fixed exponential error exponent. Supremum sieves admit tests in fixed-design Gaussian regression.

[F15]

The centered Gaussian residual-energy statistic has an exponential tail at deviations of order R/n for fixed R. Linear and quadratic Gaussian statistics have exponential tails.

Proof

Given: The hypotheses of the Statement and its three distinct model branches.

1.1A3A4F5F8F9F11F12givenalgebra

The separable-support reduction [F5] leaves the inherited norm, law and support point unchanged. For the first two branches use the rate rn=ϵn; for the universal fixed-design branch use rn=ρn. The concentration function is nonincreasing in its radius, because its feasible RKHS approximation set grows and centered small-ball probabilities increase. Thus ϕw0(rn)≤ϕw0(ϵn)≤nϵn2≤nrn2. Both choices satisfy rn→0 and nrn2→∞. By [F8], the support point lies in the RKHS closure.

1.2F3F15givenalgebra

Now suppose W=0 almost surely and its scale density g is bounded above by U<∞ on ∣σ−σ0∣<δ within [a,b]. The support assumption forces w0=0. Put Sn=∑iYi2, q=Sn/(nσ02), and Ln(σ)=(σ0/σ)nexp⁡[(1−σ02/σ2)Sn/(2σ02)]. On ER={∣Sn−nσ02∣≤Rn}, write z=(σ−σ0)/σ0. Compactness of the positive scale interval and Taylor's formula give constants c,C>0 independent of n,R with −Cn(σ−σ0)2−CRn∣σ−σ0∣≤log⁡Ln(σ)≤−cn(σ−σ0)2+CRn∣σ−σ0∣. For verification, its deterministic part is n[−log⁡(1+z)+(1−(1+z)−2)/2], negative away from zero, with second derivative −2 at zero; the remaining term is (Sn−nσ02)(1−(1+z)−2)/(2σ02), bounded by CRn∣z∣. The residual-energy tail in [F15] with zero mean shift gives lim sup⁡nP0(ERc)≤2e−c0R2 for fixed R.

2.1F1F3F6F10step 1.1givenchoose

In log-Gaussian density estimation, evaluation measurability and Tonelli [F6] make w↦Zw measurable. On its full-prior positive-finite set, (w,x)↦ew(x)/Zw is a jointly measurable density family. The 2rn supremum ball has directional KL at most 2e4rnrn2 and log-square at most 16rn2 by [F3]. Choose a fixed sufficiently large k. Its prior mass is at least e−nrn2 by [F10], so [F1] at radius krn gives a denominator at least e−Anrn2 for fixed A=1+2k2 except with probability tending to zero.

2.2F1F2F3F10step 1.1givenchoose

In binary regression, [F3] places the 2rn prior ball in a directional KL/log-square set of radius k2rn2 for a fixed sufficiently large k. Its mass is at least e−nrn2 by [F10], so [F1] gives the same type of denominator bound. The joint Bernoulli densities relative to G⊗# are bounded by one, as required for the density-L2 tests in [F2].

2.3A2F3F4F10step 1.1givenalgebra

For the universal fixed-design branch take rn=ρn. On ∥w−w0∥∞<2rn and ∣σ−σ0∣<rn, [F3] bounds average directional KL and log-square by Krn2 for fixed K. Independence and [A2], together with [F10], give joint local prior mass at least crne−nrn2. Since rn≥log⁡n/n, eventually log⁡(1/rn)≤12log⁡n≤12nrn2; hence this mass is at least e−C0nrn2 for fixed C0. The independent-observation denominator lemma in [F4] applies.

2.4A3F8F9F10step 1.1givenchoose

For each branch choose C>1 larger than its denominator exponent; eventually e−Cnrn2<1/2. Apply the prior sieve theorem [F10] using step 1.1 to get measurable Bn with entropy at radius 3rn at most 6Cnrn2 and tail at most e−Cnrn2. The same theorem supplies the local prior mass used in steps 2.1, 2.2, 2.3.

2.5A2step 1.2givenalgebra

On ER integrate the likelihood over ∣σ−σ0∣≤1/n within [a,b]. This interval has length at least 1/n for large n, even at an endpoint; [A2] and step 1.2 bound its integral below by cR/n for some cR>0. On the local neighborhood where g≤U, substitute u=n(σ−σ0) in the numerator outside Mϵn. Dividing by that lower bound gives at most CR∫∣u∣>Mnϵne−cu2+CR∣u∣du→0, since nϵn2→∞. Outside the local neighborhood, step 1.2 bounds Ln by e−c′n for large n, whose integral against the entire probability prior is at most e−c′n; after dividing by the denominator this also tends to zero. First let n→∞ and then R→∞. This proves the sharper degenerate-prior contraction in probability for every fixed M>0.

3.1F2F3F4F6F10step 2.1step 2.4givenchoose

In the density branch intersect Bn with the measurable positive-finite-normalizer set, changing its prior tail by zero. From a radius-3rn cover, select a valid center for every cover ball meeting that intersection; finite selection doubles the radius to 6rn without increasing the number. The pairwise norm comparison [F3] sends this to a Hellinger cover of radius at most 7rn for large n. Thus any 14rn-separated set has size at most e6Cnrn2. Taking packing radius at least max⁡{14,6C}rn, [F2] gives tests with null and uniform sieve alternative errors at most e−Tnrn2 for any fixed desired T>A, by increasing the alternative multiple. The denominator and sieve tail now satisfy the posterior split in [F4], proving contraction in probability.

3.2F2F3F4F10step 2.2step 2.4choosealgebra

In binary regression the norm-ball and sieve cover map by [F3] to density-L2 balls and covers of constant times rn. Taking packing radius at least twice the cover radius and at least 6Crn gives packing entropy at most its squared radius times n. By [F2] and [F4], the tests, denominator and sieve tail prove contraction in probability. Since the joint Bernoulli densities satisfy d2(qw,qw0)=2∥Ψ(w)−f0∥L2(G), this is the stated binary distance.

3.3F4F10F14step 2.3step 2.4givenchoose

In fixed-design regression take the product sieve Bn×[a,b]. Its prior tail is at most e−Cnrn2, and its function component has the radius-3rn cover from step 2.4. The local fixed-design testing lemma [F14] gives tests outside ∥w−w0∥n+∣σ−σ0∣>Mrn with errors at most e−Tnrn2 for any fixed T by choosing fixed M large. Choose T and C above the denominator exponent in step 2.3. The posterior split [F4] proves the universal ρn contraction in probability.

4.1A3A4F7F13step 3.3givenalgebra

If the Gaussian law is not δ0, [F13] supplies a continuous linear functional with nonzero Gaussian variance. Indeed, otherwise every member of a countable norming family would vanish almost surely, forcing ∥W∥=0 almost surely. By [F7] there is a fixed constant D such that log⁡(1/ϵn)≤nϵn2+D. Put tn=nϵn2→∞; then log⁡n=log⁡tn+2log⁡(1/ϵn)≤3tn+2D eventually, since log⁡tn≤tn. Consequently ρn≤C1ϵn for fixed C1. The universal conclusion in step 3.3 therefore proves the sharper ϵn conclusion after enlarging M by C1.

5.1step 3.1step 3.2step 3.3step 4.1step 2.5givenalgebra∎

In each proved branch the posterior tail is a random variable Tn∈[0,1] converging to zero in probability. For η>0, ETn≤η+P(Tn>η); first take the limit superior and then η↓0. Thus all asserted expectation limits follow. The universal fixed-design rate requires no upper bound on the scale density; the sharper degenerate alternative uses only the explicitly local upper bound.

Remarks

A scale density bounded below supplies interval mass of order its radius, but the Gaussian concentration condition does not bound the logarithm of that radius when W=0. An unrestricted scale density can have spikes that make the originally proposed arbitrary ϵn rate false; A spiky scale prior defeats an arbitrary degenerate-Gaussian concentration rate ↗ gives an explicit counterexample. The universal ρn rate retains every allowed prior. A nonzero Gaussian direction or a local upper scale-density bound in the degenerate case supplies the sharper alternative by separate proved arguments.

Depends on

Used by

Dependency tree · two levels

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

Sources