Alphabeta Math
LemmaStatement: 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.

Finite priors approximate Gaussian-shift Bayes values

Statement

Assume AC. Let Qh=Nd(h,S) with S≻0 and let g:Rd→[0,M] have Lipschitz constant B<∞. For every Borel probability prior π on Rd and ϵ>0, there is a finite-support prior πf whose Bayes value for loss g(a−h) differs from that of π by less than ϵ. The comparison is uniform over all measurable randomized rules. In particular this applies to every diffuse Gaussian prior; no posterior selector assumption is needed.

Facts & Assumptions

Given: AC, the Gaussian shift, bounded Lipschitz loss, prior and accuracy.

[F1]

Multivariate normal law, including singular covariance: For positive finite dimension, Nd(h,S) is realized as h+S1/2G with independent standard-normal coordinates. For S≻0, the square root is invertible.

[F2]

Dominated convergence passes pointwise limits under an integrable envelope through an integral.

[F3]

Bayes risk and minimax risk defines the prior risk rπ(δ) of a rule, and Measure kernel and probability kernel defines randomized rules. Here the Bayes value means inf⁡δrπ(δ) over those rules; this infimum is the local value under comparison, not a separate definition supplied by the linked item.

[F4]

Total variation distance for probability laws and Tonelli's theorem for nonnegative measurable functions on a sigma-finite product give the bound ∣EPf−EQf∣≤M∥P−Q∥TV for 0≤f≤M. The event-supremum distance satisfies the triangle inequality by the triangle inequality for each event difference.

[F6]

Continuity from below for measures: If Br↑Rd, then π(Br)↑1.

[F7]

The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn: ∥h−h′∥2 is the Euclidean distance used for the ball cover and Lipschitz bound.

[F8]

Measurability of integration against a kernel: Integrating a jointly measurable nonnegative function against a probability kernel gives a measurable function of the parameter.

[F9]

A definite quadratic form has a uniform signed bound on the Euclidean unit sphere: A positive definite quadratic form on Rd has a positive lower bound on the Euclidean unit sphere.

[A1]

The Axiom of Choice is retained for the Gaussian construction.

[F10]

Standard normal and normal laws, Independent random elements have product joint law, and On Borel subsets of R^{m+n}, the product lambda_m times lambda_n agrees with lambda_{m+n}: Standard-normal coordinates have scalar density ϕ(t)=(2π)−1/2e−t2/2 and product joint law; product Lebesgue measure agrees with Euclidean Lebesgue measure on Borel sets. Tonelli [F4] therefore permits repeated integration of their product density.

[F11]

A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions: Under countable choice, a C1 diffeomorphism transforms a nonnegative Lebesgue integral with the absolute Jacobian determinant. AC supplies countable choice here and in [F10].

Proof

1.1givenconstructalgebra

If dimension zero is admitted with the singleton empty-tuple Gaussian convention, there is only one parameter, observation and action. Every prior is the point mass at that parameter and is already finitely supported; every rule has risk g(0). Taking πf=π gives zero discrepancy. No positive-dimension density, sphere or compactness theorem is needed. Henceforth let d≥1.

2.1F1F2F4F5F7F9F10F11A1step 1.1givenalgebra

Write A=S1/2. By [F1] and [F10], Qh is the law of h+AG, and repeated scalar integration gives G density (2π)−d/2e−∥z∥22/2. Applying [F11] to z↦h+Az gives the density qh(y)=(2π)−d/2∣det⁡A∣−1exp⁡[−(y−h)TS−1(y−h)/2]. The map h↦Qh is continuous in total variation: when hj→h, these densities converge pointwise. The matrix S−1 is positive definite because xTS−1x=(S−1x)TS(S−1x)>0 for x≠0. By [F9], yTS−1y≥c∥y∥22 for some c>0. On a fixed bounded set of shifts, the density formula and ∥y−h∥22≥∥y∥22/2−∥h∥22 bound all these densities by Cexp⁡(−c′∥y∥22) for constants C,c′>0. This envelope is integrable by repeated scalar Gaussian integration [F4, F10, F11], so [F2] gives L1 convergence; for every event, its probability difference is at most that L1 distance. On a compact ball this continuity is uniform: otherwise there are hj,hj′ in the ball with ∥hj−hj′∥2→0 but TV distances bounded below. Compactness gives a subsequence with both converging to the same h; pointwise continuity and the event-supremum triangle inequality from [F4] contradict that lower bound.

3.1F1F3F4F8step 2.1algebra

For a randomized rule δy(da), write Rδ(h)=∫∫g(a−h)δy(da)Qh(dy). Change the loss argument first and the sampling law second. [F4] yields ∣Rδ(h)−Rδ(h′)∣≤B∥h−h′∥2+M∥Qh−Qh′∥TV, independently of the rule. Each risk is between zero and M. The inner kernel integral is jointly measurable in (h,y) by [F8]; multiplying by the jointly measurable Gaussian density and integrating in y makes Rδ(h) measurable.

4.1F3F5F6step 2.1step 3.1constructalgebra∎

The balls Br={h:∥h∥2≤r} increase to Rd, so [F6] lets us choose a closed ball with discarded prior mass less than τ. Cover this compact ball by open balls of radius η/2; [F5] gives a finite subcover. Intersect the first ball with the closed ball, then successively remove the previous covering sets from each later intersection. This makes a finite Borel partition whose cells have diameter at most η. Assign one point to each nonempty cell and send points outside the closed ball to zero. The resulting finite-valued map q is Borel, and πf=π∘q−1. On the ball, step 3.1 bounds ∣Rδ(h)−Rδ(q(h))∣ by Bη+Mω(η), where the compact-ball TV modulus satisfies ω(η)→0 by step 2.1. Outside, use M. Thus prior risks differ uniformly over rules by at most Bη+Mω(η)+Mτ. Choose the ball first for small tail, then the cell diameter small on that fixed ball. This makes the bound less than ϵ; taking infima over the same rules preserves it.

Depends on

Used by

Dependency tree · two levels

110 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