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.

Dirichlet normal-mixture posterior contraction

1 · Prerequisites

2 · Summary

Objective

This page builds the density, finite-mixture approximation, scale-band entropy, Dirichlet simplex mass and local KL-mass estimates needed for the compact-truth Dirichlet normal-mixture contraction theorem. It also proves the posterior sieve-tail bound from the DP update and latent Pólya urn. The main rate is a Hellinger contraction rate in sampling probability; it is neither an almost-sure nor a generic minimax claim. The middle term is omitted for a compactly supported scale hyperprior. Inverse-Gamma scale tails are outside the stated upper-tail condition; this page makes no inconsistency claim about them. The interval-mass refinement removes the Gaussian-bias logarithm. A local Gaussian semigroup estimate bounds KL and log-square smoothing bias, and a coarse-interval Dirichlet neighborhood controls its discrete perturbation. The DP-dependent estimates use the current BCS-17 DP definition, construction, update and predictive-law bodies; their current Step 1 records are checked in the batch evidence. Readiness records are authoring handoff only and do not constitute independent acceptance.

3 · Logical flowchart

4 · Definitions, theorems and proofs

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

The Dirichlet normal-mixture density is jointly measurable and normalized

Statement

Let P(R) be the probability measures on the Borel sets of R, equipped with the evaluation sigma-algebra, and let σ>0. For F∈P(R) define pF,σ(x):=∫R1σ2πexp⁡ ⁣(−(x−z)22σ2)F(dz). Then (F,σ,x)↦pF,σ(x) is jointly measurable, 0<pF,σ(x)≤(σ2π)−1 for every (F,σ,x), and ∫RpF,σ(x) dx=1. In particular it is the Lebesgue density of the convolution of F with N(0,σ2).

Facts & Assumptions

Given: The evaluation sigma-algebra on P(R), F∈P(R), and σ>0.

[A1]

Assume AC for the library normal location-scale density interface. The Axiom of Choice

[F1]

A positive-variance normal law has its location-scale density: z↦(σ2π)−1exp⁡(−(x−z)2/(2σ2)) is the Lebesgue density of N(x,σ2) and integrates to one.

[F2]

Probability measures and probability spaces and Measure kernel and probability kernel: each F is a probability measure, and the evaluation map (F,A)↦F(A) makes K((F,σ,x),A):=F(A) a probability kernel from P(R)×(0,∞)×R to R.

[F3]

Measurability of integration against a kernel: integrating a nonnegative product-measurable function against a probability kernel gives a measurable function of the kernel's input.

[F4]

Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: nonnegative measurable functions on product measure spaces may be integrated in either order.

Proof

Given: The hypotheses in the Statement.

1.1A1F2F3given

The kernel K in [F2] is a probability kernel because, for fixed (F,σ,x), A↦F(A) is a probability measure, while for fixed Borel A, (F,σ,x)↦F(A) is measurable by the evaluation sigma-algebra. The integrand (σ,x,z)↦(σ2π)−1exp⁡(−(x−z)2/(2σ2)) is continuous on (0,∞)×R2 and hence product-measurable. Therefore [F3] makes its integral against K jointly measurable.

1.2F1givenalgebra

The integrand is strictly positive, so its integral against a probability measure is positive. It is bounded above by (σ2π)−1, so the integral is finite and has the stated upper bound.

1.3F1F4givenalgebra

By [F4], ∫RpF,σ(x) dx=∫R(∫R1σ2πe−(x−z)2/(2σ2) dx)F(dz)=∫R1 F(dz)=1, where the inner integral is one by [F1] and F has total mass one. Thus pF,σ is a probability density.

2.1F1F4givenalgebra∎

For every Borel set B⊆R, Tonelli [F4] gives ∫BpF,σ(x) dx=∫R(∫B1σ2πe−(x−z)2/(2σ2) dx)F(dz). The inner integral is N(z,σ2)(B) by [F1], so the right side is the convolution measure (F∗N(0,σ2))(B) by its definition. Hence this density represents the convolution law in the Statement.

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

A bounded likelihood ratio controls KL and log-square moments by Hellinger distance

Statement

Let p,q be probability densities relative to one measure μ, assume p dμ≪q dμ, let h2:=∫(p−q)2dμ, and suppose R:=ess,sup⁡q dμ(p/q)<∞, with p/q=0 on {q=0,p=0}. Then p≪q and for a universal constant C, KL(p dμ∥q dμ)≤Ch2(1+log⁡+R),∫p[log⁡(p/q)]2dμ≤Ch2(1+log⁡+R)2. The logarithm is assigned value zero on {p=0}; the moment integrand is also set to zero there.

Facts & Assumptions

Given: Two probability densities p,q relative to one measure, p dμ≪q dμ, and finite R as in the Statement.

[A1]

Assume AC for the library directional KL convention. The Axiom of Choice Kullback–Leibler divergence

[F1]

Root-L2 Hellinger distance between density laws: h2=∫(p−q)2dμ.

[F2]

Kullback–Leibler divergence: when p dμ≪q dμ, the directional KL divergence is the integral of log⁡(p/q) against p dμ.

Proof

Given: The hypotheses in the Statement.

1.1A1F3givenalgebra

Put u=p/q on {q>0}. The absolute-continuity premise gives p=0 μ-almost everywhere on {q=0}. Define g(u)=(u−1)2 and a(u)=(ulog⁡u−u+1)/g(u), b(u)=u(log⁡u)2/g(u) for u≠1, with their limiting values at u=1 and u=0. At zero, set s=1/u; for s≥1, [F3] gives 0≤log⁡s≤∫1st−3/4dt≤4s1/4. Hence ulog⁡u=−(log⁡s)/s→0 and u(log⁡u)2=(log⁡s)2/s≤16s−1/2→0, so a(0)=1 and b(0)=0. At one, log⁡u/(u−1)→1 by [F3], g(u)/(u−1)2=1/(u+1)2→1/4, and u(log⁡u)2/(u−1)2→1. Also ulog⁡u−u+1=∫1ulog⁡t dt, so [ulog⁡u−u+1]/(u−1)2→1/2; therefore a(1)=2 and b(1)=4. Thus a,b are continuous on [0,2] and bounded there.

2.1F3step 1.1algebra

For u≥2, g(u)=u(1−u−1/2)2≥u(1−2−1/2)2, while 0≤ulog⁡u−u+1≤ulog⁡u and u(log⁡u)2 retain their displayed forms. Hence a(u)≤Clog⁡u and b(u)≤C(log⁡u)2 for a universal C. Combining with step 1.1, for every 0≤u≤R, ulog⁡u−u+1≤Cg(u)(1+log⁡+R),u(log⁡u)2≤Cg(u)(1+log⁡+R)2.

3.1A1F1F2step 2.1algebra∎

Integrating the first inequality in step 2.1 against q dμ gives the KL bound, since ∫q(ulog⁡u−u+1)dμ=∫plog⁡(p/q)dμ by ∫p=∫q=1 and [F2]. Integrating the second gives the log-square bound. Finally ∫qg dμ=h2 by [F1], so both right sides have the claimed factors of h2.

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

Gaussian convolution has second-order KL and log-square error

Statement

Assume AC. Let p∈C2(R) be a nonnegative compactly supported probability density and suppose J:=∫{p>0}(p′′(x))2p(x) dx<∞. For σ>0, set qσ=p∗ϕσ, where ϕσ is the centered normal density with standard deviation σ. Then ∫(p−qσ)2qσ dx≤49σ4J,KL(p∥qσ)≤49σ4J,∫p[log⁡pqσ]2dx≤49σ4J. The logarithmic integrands are zero where p=0. No unimodality or uniform bound on p/qσ is assumed.

Facts & Assumptions

Given: AC and the density and integrability hypotheses of the Statement.

[F1]

The normal kernel is ϕσ(x)=(σ2π)−1e−x2/(2σ2) and integrates to one. A positive-variance normal law has its location-scale density

[F2]

Cauchy–Schwarz bounds an integral of a product by the product of its two L2 norms. Cauchy-Schwarz inequality for L2

[F3]

Nonnegative product integrals may be taken in either order. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product

[F4]

The directional KL divergence of two densities with absolute continuity is the integral of their log ratio under the first law. Kullback–Leibler divergence

[F5]

A parameter derivative may pass under an integral when it is measurable and dominated locally by one integrable function. Differentiation under the integral sign

[F7]

If a differentiable function has an integrable derivative on a compact interval, its derivative integrates to the endpoint difference. The second fundamental theorem: if G is differentiable on [a,b] with G′=f and f is integrable, then ∫abf=G(b)−G(a)

[F8]

The natural logarithm is differentiable on (0,∞) with derivative 1/x. The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t

[F9]

Pointwise-convergent integrands dominated by one integrable function have convergent integrals. Dominated convergence

Proof

1.1F2givenalgebra

At every zero of the nonnegative differentiable function p, p′=0. At each accumulation point of its zero set, differentiation along zeros of p′ gives p′′=0; isolated zeros form a countable set. Thus p′′=0 almost everywhere on {p=0}. Put r=p′′/p on {p>0} and zero elsewhere. Then p′′=rp almost everywhere, ∫r2p=J, and [F2] gives ∫∣p′′∣≤J. Both p and p′′ are continuous and compactly supported.

2.1F1F5F6F7F9step 1.1algebra

Let Ptf=f∗ϕt for t>0. Direct differentiation of [F1] gives ∂tϕt=12∂x2ϕt. For fixed x and 0<ε<t, the differentiated integrand in Psp(x) is bounded on s∈[ε,t] and the compact support of p by Cx,ε,t∣p(z)∣; differentiation under the integral [F5] and two integrations by parts [F6] therefore give ∂sPsp=12Psp′′. The boundary terms vanish because p,p′ have compact support. Dominated convergence [F9] makes s↦Psp′′(x) continuous on [ε,t], so [F7] integrates the derivative there. Gaussian approximate identities converge uniformly on continuous compactly supported functions: split their convolution integral at ∣z∣≤δ, where uniform continuity controls the integrand difference, and its complement, whose normal mass tends to zero by scaling and integrability of [F1]. Letting ε↓0 consequently yields p−Ptp=−12∫0tPsp′′ ds pointwise; the omitted integral over [0,ε] tends to zero because ∣Psp′′(x)∣≤∥p′′∥∞.

2.2F1F2F3step 1.1algebra

Fix t>0 and put q=Ptp. It is positive everywhere because p is a nonzero nonnegative density and the Gaussian kernel is positive; Tonelli [F3] and ∫ϕt=1 show q integrates to one. For 0<s≤t, the Gaussian formula gives ϕt(z)≥s/t ϕs(z) for every z, hence q≥s/tPsp. Applying [F2] inside the convolution and then [F3] gives ∣Psp′′∣2≤(Psp)Ps(r2p) and therefore ∫∣Psp′′∣2/q≤t/s∫Ps(r2p)=t/sJ. These inequalities remain valid if one of the pointwise nonnegative integrals is infinite.

3.1F2F3step 2.1step 2.2algebra

Apply [F2] to the time integral in step 2.1 with weights w(s)=(t/s)1/4. Since ∫0tw(s)ds=4t/3, it gives ∣p−q∣2≤14(4t/3)∫0tw(s)−1∣Psp′′∣2ds. Divide by q, integrate and use [F3] and step 2.2. The result is ∫(p−q)2/q≤14(4t/3)J∫0t(t/s)1/4ds=(4/9)t2J. In particular all these weighted integrals are finite.

4.1F4F8step 3.1algebra∎

For u>0, the function u−1−log⁡u has value zero at 1 and derivative (u−1)/u, so log⁡u≤u−1 and ulog⁡u−u+1≤(u−1)2. For t≥1, t−t−1−2log⁡t has value zero at 1 and derivative (t−1)2/t2≥0; replacing t by 1/t gives 2∣log⁡t∣≤∣t−t−1∣ also for 0<t<1. With u=t2, this yields u(log⁡u)2≤(u−1)2. At u=0, use the conventions ulog⁡u=u(log⁡u)2=0, for which both inequalities hold. Apply these pointwise bounds to u=p/q and integrate against q. Since p,q integrate to one, [F4] identifies the first integral as KL; its negative part is integrable because ulog⁡u≥−e−1. Both requested logarithmic quantities are at most the chi-square integral from step 3.1. Taking t=σ2 proves the Statement.

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

Compactly supported Gaussian mixtures admit logarithmic-size finite approximations

Statement

There is a universal constant C such that, for A,σ>0, 0<η<1/2, and every probability measure F supported on [−A,A], there is a discrete probability measure F′ on [−A,A] with at most C(A/σ∨1)log⁡(e/η) support points and ∥pF,σ−pF′,σ∥1≤η,∥pF,σ−pF′,σ∥∞≤η/σ.

Facts & Assumptions

Given: A,σ>0, 0<η<1/2, and a probability measure F on [−A,A].

[F1]

The Dirichlet normal-mixture density is jointly measurable and normalized: pF,σ is the mixture integral of the normal location-scale density.

[F2]

A positive-variance normal law has its location-scale density: the standard normal density is ϕ(x)=(2π)−1/2e−x2/2 and ϕσ(x)=σ−1ϕ(x/σ).

[F3]

The monic probabilists' Hermite polynomials: Hm is monic of degree m and Hm+1=xHm−mHm−1.

[F4]

Cauchy--Schwarz bounds an L1 integral of a product by the product of its L2 norms. Cauchy-Schwarz inequality for L2

[F5]

For a standard normal random variable Z, E[Z2]=1. Location-scale normal laws have their stated mean and variance

[F6]
[F8]

A differentiable function with integrable derivative on a compact interval has endpoint difference equal to the integral of its derivative. The second fundamental theorem: if G is differentiable on [a,b] with G′=f and f is integrable, then ∫abf=G(b)−G(a)

[A1]

Assume AC for the normal-density interface. The Axiom of Choice

Proof

Given: The hypotheses in the Statement.

1.1A1F1givenconstruct

Partition [−A,A] into K≤2A/σ+1 consecutive Borel intervals Ii of length at most σ, with left endpoints ai. Ignore intervals of zero F-mass and let Gi be the law of Wi=(Z−ai)/σ conditional on Z∈Ii. Let ℓi be the length of Ii and put bi=ℓi/σ≤1, so Gi is supported on [0,bi]. Approximate the moment vector (∫w dGi,…,∫wmdGi) by finite sums obtained from partitions of [0,bi]; it is therefore in the closure of the convex hull of the compact moment curve w↦(w,…,wm) on that interval. Every finite convex combination with more than m+1 points can be reduced: affine dependence supplies coefficients cj, not all zero, with ∑cj=0 and ∑cjxj=0; moving the weights along this relation until one becomes zero preserves nonnegativity and the represented point, so iteration gives at most m+1 points. Thus the convex hull is the continuous image of a compact set consisting of m+1 curve points and simplex weights; it is compact and closed. The moment vector belongs to it, giving a probability Gi′ on at most m+1 points of [0,bi] matching the first m moments of Gi.

1.2A1F2F3F4F5F7F8algebra

The Hermite recurrence [F3] and differentiation of ϕ give ϕ(r)=(−1)rHrϕ for every integer r≥0. The case r=0 is immediate. If it holds at orders r and r−1, differentiating Hr's recurrence gives Hr+1′=Hr+xHr′−rHr−1′=Hr+r(xHr−1−(r−1)Hr−2)=(r+1)Hr; the base cases H0′=0 and H1′=1 start this induction. Thus differentiating (−1)rHrϕ gives (−1)r+1Hr+1ϕ. Since Hr is monic, Hr(r)=r!. Apply integration by parts [F7] repeatedly on [−T,T] and let T→∞; the boundary terms vanish because each derivative is a polynomial times the Gaussian. This gives ∫Hr2ϕ=(−1)r∫Hrϕ(r)=∫Hr(r)ϕ=r!. Cauchy--Schwarz [F4] therefore gives ∥ϕ(r)∥1≤r!. Also ϕ(r) tends to zero at −∞, so [F8] on [−T,x], followed by T→∞, gives ∣ϕ(r)(x)∣≤∫−∞x∣ϕ(r+1)(t)∣dt≤(r+1)! and ∥ϕ(r)∥∞≤(r+1)!.

2.1F1F6F8step 1.1step 1.2algebra

Repeated application of [F8] gives the Taylor integral remainder for w↦ϕ(x−w) through degree m−1: Rm(x,w)=(−w)m(m−1)!∫01(1−t)m−1ϕ(m)(x−tw) dt. By translation invariance and Tonelli [F6], ∥Rm(⋅,w)∥1≤wm∥ϕ(m)∥1/m!≤1/m!; the same formula gives ∥Rm(⋅,w)∥∞≤wm∥ϕ(m)∥∞/m!≤m+1/m! by step 1.2. Moment matching in step 1.1 cancels the polynomial terms after integration against Gi−Gi′. Integrating the remainder bounds against these two probability laws gives ∥pGi,1−pGi′,1∥1,∥pGi,1−pGi′,1∥∞≤2m+1/m!. The bound log⁡(m!)=∑k=1mlog⁡k≥∫1mlog⁡x dx=mlog⁡m−m+1 shows this error is at most η when m=⌈clog⁡(e/η)⌉ for a sufficiently large universal c, with η∈(0,1/2) absorbed by increasing c.

3.1F1step 1.1step 2.1algebra∎

Let νi and νi′ be the pushforwards of Gi and Gi′, respectively, under w↦ai+σw, and set F′=∑iF(Ii)νi′. Since Gi′ is supported on [0,bi], every νi′ is supported in the closure of Ii, so F′ is a discrete probability measure on [−A,A] with at most K(m+1)≤C(A/σ∨1)log⁡(e/η) support points. Translation and scaling give pνi,σ(x)=σ−1pGi,1((x−ai)/σ) and the same identity for νi′ and Gi′. Summing these component errors with weights F(Ii) shows the L1 error is at most η and the supremum error at most η/σ.

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

Countably partitioned sieves yield posterior contraction by weighted entropy

Statement

Assume AC. For each n, let Πn be a prior on a measurable parameter space Θn∗, and let pθ be a jointly measurable family of finite-valued densities against one sigma-finite measure, and let p0 be the true density for IID data X1,…,Xn. Let ϵn,δn>0 satisfy δn≤ϵn, nδn2→∞, and nϵn2→∞. Suppose for a constant C0>0 that Πn ⁣{θ:KL(P0∥Pθ)≤δn2,P0[log⁡p0pθ]2≤δn2}≥e−C0nδn2. Let Sn⊆Θn∗ be a measurable sieve with Πn(Snc∣X1:n)→0 in P0n-probability. Partition it into countably many measurable sets Sn,j, put πn,j=Πn(Sn,j), and let Nn,j=N(ϵn,{pθ:θ∈Sn,j},h) be the finite covering number as defined in Covering, packing, bracketing numbers, and metric entropy, with centers in that density class, whenever πn,j>0. If e−nϵn2∑j:πn,j>0Nn,jπn,j⟶0, then for every sufficiently large fixed M, the posterior mass of {θ:h(pθ,p0)>Mϵn} converges to zero in P0n-probability.

Facts & Assumptions

Given: A dominated IID model with a jointly measurable density family, AC, the displayed local prior mass, a measurable sieve with vanishing posterior complement, and a countable measurable partition satisfying the weighted entropy condition.

[A1]

Assume AC for the directional KL convention. The Axiom of Choice Kullback–Leibler divergence

[F1]

KL prior mass gives a posterior denominator lower bound in probability: if the local KL and log-square set has prior mass at least e−C0nδn2, then, except with probability at most (nδn2)−1, the normalized likelihood denominator is at least e−(C0+2)nδn2.

[F2]

Root-L2 Hellinger distance between density laws: h2(P,Q)=∫(p−q)2dμ and ∫pqdμ=1−h2(P,Q)/2.

[F3]

Hellinger distance is a metric and controls L1 and total variation: Hellinger distance is a metric and event-supremum total variation is bounded by Hellinger distance, including for finite product laws.

[F4]

Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: nonnegative measurable likelihood-ratio integrands may be integrated in either order.

[F5]

Dominated statistical experiments and Likelihood densities: all densities are relative to the same fixed sigma-finite measure; the supplied family is jointly measurable, so likelihood-ratio integrals are measurable.

[F6]

Identical distribution and IID families and Expectations factor over finite products of independent random variables: disjoint finite blocks of an IID sample are independent, and expectations of products of nonnegative functions of those blocks factor.

[F7]

Markov's inequality for random variables: for a nonnegative random variable Y and a>0, P(Y≥a)≤E[Y]/a.

[F8]

Probability measures and probability spaces and The measure with density f relative to μ: P0 and each model law are probability measures represented by their displayed densities; integrating pθ/p0 under P0 gives ∫{p0>0}pθ dμ≤1.

[F9]

Covering, packing, bracketing numbers, and metric entropy: N(ϵ,F,h) is the least finite number of centers from F whose closed Hellinger balls of radius ϵ cover F.

Proof

Given: The hypotheses in the Statement.

1.1A1F1given

Put xn=nϵn2, yn=nδn2, and let Dn be the likelihood denominator relative to p0n. By [F1], on an event Ωn with P0n(Ωnc)≤yn−1, Dn≥e−(C0+2)yn.

1.2givenalgebra

Write Tn=∑jNn,jπn,j and sn=e−xnTn, so sn→0. Fix K>2(C0+3) and split indices into active Jn+={j:πn,j≥e−Kxn} and small-mass Jn−. Since Nn,j≥1, ∑Jn−πn,j≤e−Kxn/2Tn=e(1−K/2)xnsn. For active j, Nn,jπn,j≤Tn=exnsn, hence log⁡(Nn,j/πn,j)≤(2+2K)xn for all sufficiently large n.

1.3A1F2F9givenconstruct

Fix a sufficiently large constant M. If Mϵn≥2, then the alternative is empty because Hellinger distance is at most 2, and the desired posterior mass is zero for this n. For the remaining n, choose, by [A1], a finite ϵn-cover with centers in each active stratum's density image, as allowed by [F9]. Discard centers whose closed ϵn-ball meets no density in the stratum with h(pθ,p0)>Mϵn; at most Nn,j centers remain, and they cover that alternative. For every retained center q, the triangle inequality gives h(q,p0)>(M−1)ϵn. Set mn=⌈2log⁡8(M−1)2ϵn2⌉. On a block of mn observations define Tq=1{∏iq(Xi)>∏ip0(Xi)}. On rejection, p0⊗mn≤p0⊗mnq⊗mn, so its type-I error is at most the product affinity; on acceptance, q⊗mn≤p0⊗mnq⊗mn, so its type-II error under q has the same bound. By [F2], this affinity is (1−h2(q,p0)/2)mn≤e−mnh2(q,p0)/2≤1/8.

2.1F2F3step 1.3algebra

If h(pθ,q)≤ϵn, product affinity gives h2(Pθmn,Qmn)=2[1−(1−h2(pθ,q)/2)mn]≤mnϵn2, using 1−(1−u)m≤mu for u∈[0,1]; [F3] bounds their total variation by mnϵn. Since Mϵn<2, ϵn2<2/M2 and mnϵn2≤2log⁡8(M−1)2+2M2≤1/64 for sufficiently large M. The total variation is then at most 1/8. Therefore the block test in step 1.3 rejects with probability at least 3/4 under every pθ in the alternative and at most 1/8 under p0.

3.1F6F7step 2.1algebra

Divide Ln=⌊n/mn⌋ disjoint blocks and let Yk be their block-test indicators. Under each IID law the indicators are independent by [F6]; their means are at most a=1/8 under P0 and at least b=3/4 under every alternative by step 2.1. For independent Bernoulli variables with means at most a, exponential Markov [F7] gives P0(Ln−1∑Yk≥t)≤e−LnD(t∥a); with means at least b, the negative-exponential bound gives Pθ(Ln−1∑Yk<t)≤e−LnD(t∥b), where D(t∥u)=tlog⁡(t/u)+(1−t)log⁡((1−t)/(1−u)). These bounds follow by bounding each moment generating function by 1−u+ueλ (using u=a for λ>0, u=b for λ<0) and optimizing over λ.

4.1A1step 1.2step 2.1step 3.1algebra

The function D(t∥a)−D(t∥b) is affine and strictly increasing on [a,b], is negative at a, and equals D(b∥a)>0 at b. Let t∗ be its unique zero. By AC [A1], for each active j choose tj∈[t∗,b] such that Ln{D(tj∥a)−D(tj∥b)}=log⁡(Nn,j/πn,j). This is possible after increasing M: writing A=2log⁡8, Mϵn<2 implies A/((M−1)2ϵn2)>2 for sufficiently large M, so the ceiling in mn costs at most a fixed factor; since nϵn2→∞, the floor in Ln also costs at most a fixed factor eventually. Hence Ln≥cM2xn for a universal c>0, while step 1.2 bounds the right side by (2+2K)xn. Define ϕn,j as the maximum of the block-majority tests over its retained centers (or zero if there are none), using threshold tj. Continuity on [t∗,b] and positivity of both divergences at t∗ give a constant c∗>0 such that (D(t∥a)+D(t∥b))/2≥c∗ there. The null union bound and step 3.1 give P0n(ϕn,j=1)≤Nn,jπn,je−c∗Ln; the same Chernoff bound for a center within ϵn of each alternative gives sup⁡θ∈Sn,j:h(pθ,p0)>MϵnPθn(ϕn,j=0)≤Nn,j/πn,je−c∗Ln by step 2.1.

5.1F4F5step 4.1algebra

Let ϕn be one on the countable union of the rejection events of ϕn,j over j∈Jn+ and zero otherwise; it is measurable as a countable union of measurable events. The union bound and step 4.1 give P0n(ϕn=1)≤Tne−c∗Ln. For the tested likelihood numerator on an active stratum, Tonelli [F4], the jointly measurable likelihood interface [F5] and change of density give E0[(1−ϕn)∫{θ∈Sn,j:h(pθ,p0)>Mϵn}∏ipθ(Xi)p0(Xi) Πn(dθ)]≤πn,jsup⁡θ in the setPθn(1−ϕn,j)≤Nn,jπn,je−c∗Ln.

6.1F7F8step 1.1step 1.2step 5.1algebra

Write dn=e−(C0+2)yn. For the active numerator Rn+, step 5.1 gives P0n(ϕn=1)≤Tne−c∗Ln and E0[(1−ϕn)Rn+]≤Tne−c∗Ln. Thus, for every fixed ζ>0, P0n(Rn+/Dn>ζ)≤P0n(Dn<dn)+Tne−c∗Ln+ζ−1dn−1Tne−c∗Ln. This tends to zero for sufficiently large M, since Tn=exnsn, yn≤xn, Ln≥cM2xn, and sn→0. For the small-mass numerator Rn−, [F8] and Tonelli give E0[Rn−]≤∑Jn−πn,j≤e−Kxn/2Tn; hence its posterior mass tends to zero in probability by Markov and the denominator event, because e(C0+2)yne−Kxn/2Tn≤sne(C0+3−K/2)xn→0 when K>2(C0+3).

7.1givenstep 6.1∎

The posterior outside the Mϵn-ball is the union of its active-stratum part, its small-mass-stratum part, and the sieve complement. Step 6.1 sends the first two parts to zero in probability, and the sieve-complement term tends to zero by hypothesis.

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

Hellinger entropy for compact-location normal mixtures in a scale band

Statement

For A≥1, τ>0, and 0<ϵ<1/4, let PA,τ:={pF,σ:F([−A,A])=1, τ≤σ≤2τ}. There is a universal constant C such that log⁡N(ϵ,PA,τ,h)≤C(A/τ∨1)[log⁡ ⁣(C(A/τ∨1)ϵ)]2. The same bound, with a changed universal constant, holds for PA,τ,ρ:={pF,σ:F([−A,A]c)≤ρ, τ≤σ≤2τ} whenever 0≤ρ≤cϵ2 for a sufficiently small universal c>0. Here N is the covering number in the stated metric.

Facts & Assumptions

Given: A≥1, τ>0, 0<ϵ<1/4, AC, and the mixture density of The Dirichlet normal-mixture density is jointly measurable and normalized.

[A1]

Assume AC for the normal-density and finite-support approximation interfaces. The Axiom of Choice

[F1]

Compactly supported Gaussian mixtures admit logarithmic-size finite approximations: a mixture with mixing law on [−A,A] is within L1 error η of a discrete mixture with at most C(A/σ∨1)log⁡(e/η) atoms.

[F2]

Hellinger distance is a metric and controls L1 and total variation: for probability densities, Hellinger distance is a metric and h2(p,q)≤∫∣p−q∣dλ.

[F3]

A positive-variance normal law has its location-scale density: ϕσ(x−z)=σ−1ϕ((x−z)/σ), with ϕ the standard normal density.

[F4]

Root-L2 Hellinger distance between density laws: the Hellinger metric used here is the root-L2 distance between square-root densities.

[F5]

For a standard normal random variable Z, E[Z2]=1. Location-scale normal laws have their stated mean and variance

[F6]
[F7]

A differentiable function with integrable derivative on a compact interval has endpoint difference equal to the integral of its derivative. The second fundamental theorem: if G is differentiable on [a,b] with G′=f and f is integrable, then ∫abf=G(b)−G(a)

Proof

Given: The hypotheses in the Statement.

1.1A1F1givenchoose

Put K:=⌈C0(A/τ∨1)log⁡(e/ϵ)⌉. By [F1], every pF,σ∈PA,τ is within L1 distance ϵ2/C1 of a mixture with at most K atoms, for a fixed sufficiently large C1. Pad shorter mixtures by zero-weight atoms.

2.1A1F2F3F4F5F6F7step 1.1givenconstruct

Differentiating the density in [F3] gives ∥∂zϕσ(⋅−z)∥1=σ−1E∣Z∣≤σ−1, since 2∣Z∣≤1+Z2 and EZ2=1 by [F5], and ∥∂σϕσ(⋅−z)∥1=σ−1E∣Z2−1∣≤2σ−1 for Z∼N(0,1). Integrating these derivatives along the location and scale segments by [F7] yields ∥ϕσ(⋅−z)−ϕσ(⋅−z′)∥1≤∣z−z′∣/σ and ∥ϕσ−ϕσ′∥1≤2∣σ−σ′∣/(σ∧σ′). For the first class use a scale grid in [τ,2τ]; for an actual band, instead grid [τ,min⁡{2τ,sn}], omitting 2τ when that endpoint is excluded. In either case choose grid mesh at most c2τϵ2, with every grid point admitted by the corresponding scale constraint. Use a location grid in [−A,A] with mesh at most c2τϵ2 and an L1 grid on the K-simplex of mesh at most c2ϵ2. Replacing the scale, locations and weights changes the mixture density in L1 by at most Cc2ϵ2: integrate the componentwise location and scale bounds against the finite mixing weights, and use Tonelli [F6] for the componentwise integrals. Choose c2 so this plus the approximation from step 1.1 is at most ϵ2/4. Thus the resulting finite set, with centers in the class being covered, is an L1 cover of radius ϵ2/4, hence an h-cover of radius ϵ/2 by [F2].

3.1step 2.1algebra

The scale grid has at most Cϵ−2 points and the location grid at most C(1+A/(τϵ2)) points. Rounding each of the first K−1 weights down to a mesh proportional to ϵ2/K leaves the last weight nonnegative after setting it to make the sum one, gives at most (CK/ϵ2)K weight vectors, and changes their L1 distance by at most 2c2ϵ2. Therefore the logarithm of the cover size is at most Clog⁡(e/ϵ)+K[log⁡ ⁣(C(A/τ∨1)ϵ2)+log⁡ ⁣(CKϵ2)]≤C(A/τ∨1)[log⁡ ⁣(C(A/τ∨1)ϵ)]2. The constructed finite set is an h-net of radius ϵ/2, hence also a net of radius ϵ; its cardinality therefore bounds the covering number and proves the first bound.

4.1A1F2F4F6step 2.1step 3.1givenalgebra∎

If r:=F([−A,A]c)=0, then F already belongs to the compact-location class. If 0<r≤ρ<1, let FA and FAc be the normalized restrictions to [−A,A] and its complement. Then pF,σ=(1−r)pFA,σ+rpFAc,σ, so ∥pF,σ−pFA,σ∥1≤2r by integrating the mixture densities (Tonelli [F6]). By [F2], h(pF,σ,pFA,σ)≤2r; the triangle inequality in [F4] then transfers the cover to the tail-constrained class. The scale grid is restricted as in step 2.1, so every center has F([−A,A]c)=0 and satisfies the band and cutoff constraints. For sufficiently small universal c, ρ≤cϵ2 makes the truncation error at most ϵ/2, so the radius-ϵ/2 cover from steps 2.1 and 3.1 becomes a radius-ϵ cover after the constant rescaling used in the entropy bound.

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

The dyadic scale bands satisfy the weighted entropy condition

Statement

Fix A≥1 independently of n. The constants in the entropy estimates and the required fixed M0 may depend on A. Let 0<a2<a1<1, n−a1≲σn≲n−a2, and γ>1. Suppose G is a probability measure on (0,∞) satisfying G((0,s])≤Ce−βs−γ for all sufficiently small s>0. Let sn→0 with sn/σn→∞. For integers j with 2jσn≤sn, put r~n:=min⁡{rn,1/4} and Pn,j:={pF,σ:F([−A,A]c)≤r~n2/8,2jσn≤σ<2j+1σn,σ≤sn}, and let πn,j be the prior mass of the corresponding parameter band, so πn,j≤G([2j,2j+1)). Suppose rn>0 and, for some fixed sufficiently large M0 (allowed to depend on A) and fixed η>γ/[2(γ−1)], rn≥M0max⁡{(nσn)−1/2log⁡n,n−1/2σn−η}. With Nn,j=N(rn,Pn,j,h), one has e−nrn2∑j:2jσn≤snNn,jπn,j⟶0. If instead G is supported on a compact subset of (0,∞), the same conclusion holds under the first rate term alone.

Facts & Assumptions

Given: The fixed cutoff A≥1, AC, the polynomial bounds on σn, the lower scale-tail bound on G, the dyadic scale bands, and the compact-location entropy estimate.

[A1]

Assume AC for the compact-location entropy and mixture-density interfaces. The Axiom of Choice

[F1]

Hellinger entropy for compact-location normal mixtures in a scale band: for compactly supported mixing laws on [−A,A], 0<u<1/4, and τ≤σ≤2τ, log⁡N(u,{pF,σ},h)≤C(A/τ∨1)[log⁡(C(A/τ∨1)/u)]2.

[F2]

Hellinger distance is a metric and controls L1 and total variation: for probability densities, Hellinger distance is a metric and h2(p,q)≤∫∣p−q∣dλ.

Proof

Given: The hypotheses in the Statement.

1.1A1F1F2givenalgebra

Write xn=nrn2 and Jn=max⁡{j:2jσn≤sn}. Since sn→0 and σn≥cn−a1, Jn=O(log⁡n). Put un:=min⁡{rn/2,1/8}. If rn≤1/4, truncate a mixing law to [−A,A] and normalize it there; the removed mass is at most rn2/8, so its mixture changes by L1 at most rn2/4 and by Hellinger at most rn/2 using [F2]. The compact cover at radius un=rn/2 then covers Pn,j at radius rn. If rn>1/4, the sieve tail is at most 1/128, so truncation changes Hellinger distance by at most 1/8; the compact cover at radius un=1/8 then covers the class at radius at most 1/4<rn. Thus in both cases Nn,j≤N(un,PA,2jσn,h). The rate lower bound implies log⁡(1/un)≤Clog⁡n and xn≥M02σn−1(log⁡n)2,xn≥M02σn−2η. For 0≤j≤Jn, [F1] bounds log⁡Nn,j≤Cσn−1(log⁡n)2, because the band lower scale is at least σn. Since πn,j≤1, these terms contribute at most Clog⁡nexp⁡{Cσn−1(log⁡n)2/2−xn}, which tends to zero for sufficiently large M0.

1.2A1F1givenalgebra

For negative indices write j=−k, k≥1. For all sufficiently large k, the scale-tail premise gives πn,−k≤Cexp⁡(−c2γk). Also [F1] and un≥cn−1/2log⁡n imply log⁡Nn,−k≤Cσn−12k(log⁡n+k)2. Choose θ>0 and γ0<γ sufficiently close to 0 and γ, respectively, so q:=1+θ<γ0 and ρ:=γ0/(γ0−q)<2η. Since (log⁡n+k)2≤Cθ(log⁡n)22θk and e−c2γk≤e−c′2γ0k, the logarithm of each summand is at most CKn2qk−c′2γ0k,Kn:=σn−1(log⁡n)2. Enlarging C handles the finitely many smaller k.

2.1step 1.2givenalgebra

Put p=γ0/q>1. As a function of v=2qk≥1, the exponent CKnv−c′vp has maximum at most C′Knp/(p−1)=C′Knρ, by differentiation. The maximizing scale is a constant multiple of Kn1/(p−1), so there are O(log⁡Kn) indices up to any fixed multiple of that scale; their sum has logarithm at most C′′Knρ. Choose a fixed multiple L large enough that for v≥LKn1/(p−1) the negative term is at least twice the positive term. Grouping the subsequent dyadic v values gives a convergent geometric tail, also bounded by exp⁡(C′′Knρ). Therefore log⁡∑k≥1Nn,−kπn,−k≤C′′σn−ρ(log⁡n)2ρ. Because ρ<2η and σn≤Cn−a2, this is o(σn−2η)=o(xn). The negative-index contribution therefore vanishes after multiplication by e−xn.

3.1A1F1step 1.1givenalgebra∎

If G is supported on [g−,g+] with g−>0, only a fixed finite number of dyadic indices have positive mass. Their lower scales are at least g−σn/2, so [F1] at radius un bounds each log covering number by Cσn−1(log⁡n)2. The first rate term gives xn≥M02σn−1(log⁡n)2, and the finite weighted sum tends to zero for sufficiently large M0.

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

A Dirichlet process assigns exponential mass to a finite-partition simplex neighborhood

Statement

Assume AC, let α be a finite nonzero measure of total mass m, and let F∼DP(α). Consider a finite partition (U0,U1,…,UN) with α(U0)=0 or 0<α(U0)≤m. Write αj=α(Uj) for j≥1, and assume aηb≤αj≤1(1≤j≤N),0<η<1/4,Nη≤1/4, for fixed a,b>0. For every w=(w1,…,wN) in the probability simplex, there are constants c,C>0 depending only on a,b,m,α(U0) such that Pr⁡ ⁣{∑j=1N∣F(Uj)−wj∣+F(U0)≤3η,min⁡1≤j≤NF(Uj)≥η2/2}≥Cexp⁡{−cNlog⁡(e/η)}. For any compact J⊂(0,m], the constants may instead depend only on a,b,m,J and are uniform over α(U0)∈J. When α(U0)=0, the zero-base cell has F(U0)=0 almost surely and is omitted from the Dirichlet vector.

Facts & Assumptions

Given: Full AC, a finite nonzero base measure, the stated finite partition, and w in the N-simplex.

[A1]

Full AC supplies the normalized-gamma Dirichlet-process existence interface and implies Countable Choice for the finite-dimensional Dirichlet density. The Axiom of Choice

[F1]

Dirichlet process and Existence of a Dirichlet process by normalized gamma Poisson random measure: the finite-partition mass vector has the Dirichlet law with parameters α(Uj); zero-base cells have mass zero.

[F2]

Dirichlet distribution, including the one-category case: with positive parameters (a0,a1,…,aN), the simplex density is Γ(m)∏j=0Nxjaj−1/∏j=0NΓ(aj), where m=∑jaj; the zero-coordinate case is omitted.

[F3]

The Euler Gamma values are positive and finite for positive arguments, and Γ(s+1)=sΓ(s) for s>0. The real Gamma function by Euler's integral Euler's Gamma integral converges exactly for positive real parameters The real Gamma functional equation Γ(s+1)=sΓ(s)

[F4]

The real Gamma function is continuous on (0,∞). The real Gamma function is smooth and its derivatives are logarithmic moments

Proof

Given: The hypotheses in the Statement.

1.1A1F1F2givenchooseconstruct

If α(U0)=0 and N=1, [F1]–[F2] give F(U0)=0 and F(U1)=w1=1 almost surely, so the event has probability one. In all remaining cases there are at least two positive-parameter cells. By [F1]–[F2], if α(U0)>0 the vector (X0,X1,…,XN):=(F(U0),F(U1),…,F(UN)) has the displayed Dirichlet density; if α(U0)=0, set X0=0 and use the N-coordinate Dirichlet density. Choose an index i∗ with wi∗=max⁡jwj≥1/N. For every j≠i∗ restrict xj to [max⁡(wj−η2,η2/2),min⁡(wj+η2,1)], an interval of length at least η2/2. If α(U0)>0, also restrict x0 to [η2/2,η2] and define xi∗=1−x0−∑j≠i∗xj; if α(U0)=0, define xi∗=1−∑j≠i∗xj. The deviations of the coordinates other than i∗ sum to at most Nη2, so ∣xi∗−wi∗∣≤Nη2. Consequently the total event deviation is at most 2Nη2+η2≤3η; and xi∗≥1/N−Nη2≥η2/2 because Nη≤1/4. These choices lie in the simplex, satisfy the event, and their integration region has coordinate volume at least (η2/2)N when α(U0)>0 and (η2/2)N−1 when α(U0)=0.

2.1A1F1F2F3F4step 1.1algebracases∎

For 0<aj≤1, split the Euler integral for Γ(1+aj) at 1. On (0,1], taj≤1, and on [1,∞), taj≤t, so Γ(1+aj)≤1+∫1∞te−t dt=1+2/e. The functional equation in [F3] gives Γ(aj)≤(1+2/e)/aj. Put cΓ=(1+2/e)−1. When α(U0)>0, the normalizing coefficient in [F2] is at least [Γ(m)/Γ(α(U0))]cΓN∏j=1Naj; when α(U0)=0 and N≥2, it is at least Γ(m)cΓN∏j=1Naj. These Gamma factors are positive by [F3]. On the region from step 1.1, each interval coordinate satisfies xjaj−1≥1. If α(U0)>1, its factor is at least (η2/2)m; if 0<α(U0)≤1, it is at least one. For α(U0)>0, integrating the density over that region is therefore at least [Γ(m)/Γ(α(U0))](cΓa/2)Nη(b+2)N, multiplied by (η2/2)m when α(U0)>1. For α(U0)=0 and N≥2, the coordinate volume (η2/2)N−1≥(η2/2)N gives a lower bound Γ(m)(cΓa/2)Nη(b+2)N. If α(U0) ranges in a compact J⊂(0,m], [F4] bounds Γ(α(U0)) above uniformly, so Γ(m)/Γ(α(U0)) is uniformly bounded below; all other Gamma factors here are fixed and positive. Since a,b are fixed, (cΓa/2)Nη(b+2)N≥exp⁡{−c1Nlog⁡(e/η)} for some c1>0. When present, the residual factor (η2/2)m is at least exp⁡{−c2Nlog⁡(e/η)} because m is fixed and N≥1. Combining these bounds gives Cexp⁡{−cNlog⁡(e/η)} with constants depending only on a,b,m,α(U0), uniformly when α(U0)∈J. The probability-one case in step 1.1 also satisfies the claimed bound after taking C≤1. The resulting probability is the one in the Statement by [F1].

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

The mixture prior places local KL and log-square mass near a compact smooth truth

Statement

Assume AC. Let p0 be a bounded probability density supported on a compact set K⊂R. Let α be a finite nonzero measure with a continuous density bounded below by a positive constant on a neighborhood of K. Assume h(p0,p0∗ϕσ)≤Cσ2 for all sufficiently small σ>0, where ϕσ is the centered normal density with standard deviation σ. Let F∼DP(α) and let S∼G be independent, where G is any probability measure on (0,∞). Suppose n−a1≲σn≲n−a2 for 0<a2<a1<1. Set σ=σnS and δn:=max⁡{(nσn)−1/2log⁡n, σn2log⁡n}. Then, for some constant C1>0 and all sufficiently large n, Πn ⁣{(F,σ):KL(P0∥PF,σ)≤C1δn2,P0[log⁡p0pF,σ]2≤C1δn2}≥e−C1nδn2. Here pF,σ is the density of The Dirichlet normal-mixture density is jointly measurable and normalized, and all logarithmic integrands are set to zero on {p0=0}.

Facts & Assumptions

Given: AC; the compactly supported bounded density p0; the stated Gaussian-convolution Hellinger bound; the finite base measure α with a positive continuous density near K; the independent priors F∼DP(α) and S∼G; and the polynomial bounds on σn.

[F1]

The Dirichlet normal-mixture density is jointly measurable and normalized: pF,σ(x)=∫ϕσ(x−z)F(dz) is a positive finite-valued jointly measurable density.

[F2]

Compactly supported Gaussian mixtures admit logarithmic-size finite approximations: a probability mixing law on a compact interval has a discrete approximation with logarithmically many atoms and controlled L1 and supremum mixture errors.

[F3]

A Dirichlet process assigns exponential mass to a finite-partition simplex neighborhood: for a finite partition whose interval-cell base masses are bounded below by cη2, a DP vector has probability at least e−c′Nlog⁡(e/η) of being within O(η) of any target weight vector while every interval-cell mass is at least η2/2. The residual-cell mass may be zero (then that coordinate is omitted); for fixed positive residual mass the constants may depend on its value, uniformly on compact subsets of (0,m].

[F4]

A bounded likelihood ratio controls KL and log-square moments by Hellinger distance: if h2(p,q) is small and ∥p/q∥∞≤R<∞, then KL(p∥q)≤Ch2(1+log⁡+R) and P[(log⁡(p/q))2]≤Ch2(1+log⁡+R)2.

[F5]

Dirichlet process and Existence of a Dirichlet process by normalized gamma Poisson random measure: the finite evaluation vector of F on a measurable partition has the Dirichlet law with parameters given by α.

[F6]

Root-L2 Hellinger distance between density laws and Hellinger distance is a metric and controls L1 and total variation: h is the root-L2 distance between square-root densities, satisfies the triangle inequality, and h2(p,q)≤∫∣p−q∣dλ.

[F7]

A positive-variance normal law has its location-scale density: ϕσ(x−z)=σ−1ϕ((x−z)/σ) for the standard normal density ϕ.

[F8]

For a standard normal random variable Z, E[Z2]=1. Location-scale normal laws have their stated mean and variance

[F9]

Proof

Given: The hypotheses in the Statement.

1.1F2givenchoose

Since G is a probability on (0,∞)=⋃m≥1[1/m,m], choose 0<s−<s+<∞ with g:=G([s−,s+])>0. Put σ−=s−σn. Apply the moment-matching proof of [F2] to the law P0 at scale σ−, restricting each compact moment curve to K intersected with the closure of its partition interval. The same convex-hull reduction and remainder bounds then give a finite discrete probability Fn supported on K with at most Cσn−1log⁡n atoms and ∥pFn,σ−−pP0,σ−∥1≤ηn, where ηn:=σn8.

1.2A1F3F5F7F8givenconstruct

Choose an open neighborhood V of K on which the density of α is bounded above and below by positive constants. By compactness, choose a fixed finite union D of disjoint compact intervals with K⊂int⁡D⊂D⊂V. Move each atom of Fn to a nearest point of a lattice of mesh ηnσ−, merge coincident atoms, and call the resulting law F~n. Each atom moves by at most ηnσ−/2; for every σ≥σ− this changes the mixture in L1 by at most ηn/2, since ∥∂zϕσ(⋅−z)∥1=E∣Z∣/σ≤1/σ≤1/σ−, using 2∣Z∣≤1+Z2 and [F8]. The relocated locations are separated by at least ηnσ−. Around each take a centered cell of length ℓn=ηnσ−/2. In each component of D, split every intervening or end gap of length g≥ℓn into q=⌈2g/σ−⌉ equal subintervals. For large n, the end gaps have length at least ℓn because K⊂int⁡D, and gaps between atom-cells have length at least ℓn by lattice separation. If q=1, the subinterval length lies in [ℓn,σ−/2]; if q≥2, then g>σ−/2 and q≤4g/σ−, so each subinterval has length in [σ−/4,σ−/2]. The resulting Borel partition U1,…,UN of D has every cell length between cηnσ− and σ−/2, every atom-cell diameter at most 2ηnσ−, and N≤C(mn+σ−−1)≤Cσn−1log⁡n, where mn is the number of atoms. Let wj=F~n(Uj), so ∑jwj=1. For all large n, cηnσn≤α(Uj)≤1 and cηnσn≥c′ηn2. Also Nηn≤Cσn7log⁡n→0. The residual cell is U0=R∖D, so α(U0) is fixed, possibly zero. Apply [F3] with a=c′, b=2, and η=ηn; its constant may depend on this fixed residual mass. We obtain an event En with ΠDP(En)≥e−CNlog⁡(e/ηn)≥e−Cσn−1(log⁡n)2, on which F(U0)≤3ηn, ∑j∣F(Uj)−wj∣≤3ηn, and F(Uj)≥ηn2/2 for every j.

2.1F1F2F6F7F9givenstep 1.1step 1.2algebra

For F in En, compare pF,σ with pF~n,σ, uniformly for s−σn≤σ≤s+σn. On atom cells, replacing F∣Uj by its mass at the center costs at most Cηn in L1 by the [F7] location derivative bound and cell diameter. The event bounds make the total mass on gap cells and U0 at most Cηn and the sum of weight discrepancies at most Cηn. Since each normal density has L1 norm one, ∥pF,σ−pF~n,σ∥1≤Cηn. For every such σ, the relocation estimate in step 1.2 also gives ∥pF~n,σ−pFn,σ∥1≤Cηn. If σ>σ−, completing the square gives ϕσ−∗ϕv=ϕσ for v=σ2−σ−2; at σ=σ− the identity is immediate. Convolution by a probability density contracts L1 by Tonelli [F9], so ∥pFn,σ−pP0,σ∥1≤∥pFn,σ−−pP0,σ−∥1≤ηn. Thus [F6] gives h(pF,σ,pP0,σ)≤Cηn, and the assumed bias bound gives h(p0,pF,σ)≤C(σn2+ηn)≤Cσn2.

3.1F1F4F6F7givenstep 1.2step 2.1algebra

For every x∈K, the interval [x−σ−,x+σ−] contains a full cell Uj because D contains a fixed neighborhood of K and all cells have length at most σ−/2. On this interval ϕσ(x−z)≥c/σ for s−σn≤σ≤s+σn. Thus [F1] and the cell-mass lower bound in step 1.2 give pF,σ(x)≥cηn2/σn. Since p0 is bounded and vanishes outside K, Rn:=∥p0/pF,σ∥∞≤Cσnηn−2=Cσn−15. Step 2.1 gives h(p0,pF,σ)≤Cσn2, and the polynomial lower bound on σn gives 1+log⁡+Rn≤Clog⁡n. Apply [F4] to p=p0 and q=pF,σ to obtain both local KL quantities at most Cσn4(log⁡n)2≤Cδn2.

4.1givenstep 1.2step 3.1algebra∎

The scale event S∈[s−,s+] has probability g>0 and is independent of F. Thus the subset En×{S∈[s−,s+]} is contained in the displayed local KL/log-square set and has prior probability at least ge−Cσn−1(log⁡n)2. By the definition of δn, nδn2≥σn−1(log⁡n)2, so increasing C1 absorbs g and proves the required lower bound.

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

Interval masses give a log-free local KL neighborhood for the mixture prior

Statement

Assume AC. Let p0∈C2(R) be a probability density with compact support K, a finite union of intervals. Suppose J=∫{p0>0}(p0′′)2/p0<∞ and there are a,c>0 such that P0(I)≥cλ(I)a for every interval I⊆K. Let F∼DP(α), where α is a finite nonzero measure with continuous strictly positive density on a neighborhood of K, and independently let S∼G for any probability measure G on (0,∞). Suppose n−a1≲σn≲n−a2 for 0<a2<a1<1, and put σ=σnS. Then for constants C1,C2>0 and all sufficiently large n, Πn{KL(P0∥PF,σ)≤C1σn4,P0[log⁡p0pF,σ]2≤C1σn4}≥exp⁡{−C2σn−1(log⁡n)2}. Consequently, for dn=max⁡{(nσn)−1/2log⁡n,σn2}, the same two local quantities are at most C1dn2 on a set of prior mass at least e−C3ndn2. Logarithmic integrands vanish where p0=0.

Facts & Assumptions

Given: AC and all hypotheses of the Statement.

[F1]

Gaussian convolution of this truth has KL and log-square error at most (4/9)σ4J. Gaussian convolution has second-order KL and log-square error

[F2]

A compactly supported mixing law in an interval of length at most a fixed multiple of τ has a discrete normal-mixture approximation at scale τ with O(log⁡(e/η)) atoms, L1 error at most η and supremum error at most η/τ. Compactly supported Gaussian mixtures admit logarithmic-size finite approximations

[F3]

For a finite partition with interval-cell base masses in [cη2,1] and Nη≤1/4, a DP finite vector has probability at least Cexp⁡{−c′Nlog⁡(e/η)} of having total target-weight discrepancy plus residual mass at most 3η; the constants are uniform when the residual-cell base mass ranges in a fixed compact subset of (0,m]. A Dirichlet process assigns exponential mass to a finite-partition simplex neighborhood

[F4]

The mixture density is jointly measurable, positive and finite. The Dirichlet normal-mixture density is jointly measurable and normalized

[F5]

The Gaussian kernel has formula ϕσ(x)=(σ2π)−1e−x2/(2σ2). A positive-variance normal law has its location-scale density

[F6]

The natural logarithm is differentiable on (0,∞) with derivative 1/x. The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t

Proof

1.1F2givenchooseconstruct

Choose 0<s−<s+<∞ with g:=G([s−,s+])>0, possible because these compact intervals exhaust (0,∞). Set bn=σn, τ=s−bn, B=a+6 and η=bnB. For all large n, partition each nondegenerate component of K into equal consecutive Borel intervals of lengths in [τ/8,τ/4]: use ⌈4ℓ/τ⌉ pieces for a component of length ℓ. Endpoints can be assigned arbitrarily because P0 has a density. The support of a continuous density has no isolated points, so there are no isolated support components to treat. There are O(bn−1) coarse cells Ik, each of mass at least c′bna. Translate the conditional probability P0(⋅∣Ik) to an interval centered at zero, apply [F2] at scale τ, and translate back. Multiplying by P0(Ik) and summing gives a finite probability Fn with at most Cbn−1log⁡(e/η) atoms in the closures of these cells, each carrying its original coarse-cell label, and ∥pFn,τ−pP0,τ∥∞≤η/τ. The total weight of atoms with label k is exactly P0(Ik).

2.1givenstep 1.1constructalgebra

Put δ=ητ. Move each atom to a nearest point of the global lattice of mesh δ and merge atoms at the same location. Preserve its fractional label weights when merging. The resulting distinct locations zj are separated by at least δ, with weights wj summing to one, and still number N≤Cbn−1log⁡(e/η). Let Uj=[zj−δ/4,zj+δ/4) and U0=R∖⋃j=1NUj. These are disjoint partition cells. The base density is bounded above and below on a fixed compact neighborhood of K, so c0ητ≤α(Uj)≤C0ητ≤1 eventually. Since B>1, ητ≥c1η2 and Nη→0. Also ∑jα(Uj)≤CNδ→0, so, writing m=α(R)>0, we have α(U0)∈[m/2,m] eventually.

3.1F3step 2.1algebra

Apply [F3] with tolerance η to get an event En on which ∑j∣F(Uj)−wj∣+F(U0)≤3η and ΠDP(En)≥exp⁡{−Cbn−1(log⁡n)2}. Its constants can be taken uniform in n: in the proof of [F3] the only residual-parameter factors are Γ(m)/Γ(α(U0)) and a lower bound (η2/2)m for the residual power. The gamma ratio is bounded below on the fixed compact interval [m/2,m], and the latter power already has fixed exponent m. The remaining constants use only the fixed bound c1η2≤α(Uj)≤1. Finally log⁡(e/η)≤Clog⁡n by the polynomial lower bandwidth bound.

4.1F4F5step 1.1step 2.1step 3.1algebra

For τ≤σ≤s+bn, the original discrete approximation still satisfies ∥pFn,σ−pP0,σ∥∞≤Cη/bn. Indeed the Gaussian convolution identity ϕu∗ϕv=ϕu2+v2 follows by completing the square and integrating; convolution with a probability kernel contracts the supremum norm by the triangle inequality. Use u=τ, v=σ2−τ2, treating equality by the original approximation. Differentiating [F5] gives ∥ϕσ′∥∞≤Cσ−2. Atom relocation by at most δ/2 therefore changes the mixture by at most Cδ/σ2≤Cη/bn. For F∈En, replacing each F∣Uj by its mass at zj costs at most the same derivative bound times δ/4; the weight discrepancies and residual mass cost at most 3η∥ϕσ∥∞. Consequently, uniformly over F∈En and τ≤σ≤s+bn, one has ∥pF,σ−pP0,σ∥∞≤Cη/bn.

4.2F4F5step 1.1step 2.1step 3.1algebra

For any x∈K choose a coarse cell whose closure contains x. Its length is at most τ/4, so every original atom with that label, and every associated relocated atom-cell, lies in [x−τ,x+τ] eventually. Let Jx be the set of relocated atom indices carrying a positive fraction of this label's weight. Merging preserves the full label weight, so ∑j∈Jxwj≥P0(Ik)≥c′bna. The vector discrepancy on En implies F([x−τ,x+τ])≥∑j∈JxF(Uj)≥c′bna−3η≥c′bna/2. On this neighborhood, [F5] is at least c′′/bn for every τ≤σ≤s+bn. Thus pF,σ(x)≥c′′′bna−1. The same argument directly with the coarse-cell mass under P0 gives pP0,σ(x)≥c′′′bna−1, after decreasing the constant.

5.1F1F6step 4.1step 4.2algebra

Put q=pP0,σ and r=pF,σ. The mean-value theorem for the logarithm, whose derivative is given by [F6], and steps 4.1, 4.2 give sup⁡x∈K∣log⁡(q(x)/r(x))∣≤Cηbn−a=Cbn6. By [F1], KL(P0∥Q)≤Cbn4 and P0[log⁡(p0/q)]2≤Cbn4 uniformly in these scales. Adding the bounded log perturbation proves KL(P0∥PF,σ)≤Cbn4+Cbn6≤C′bn4. The inequality (u+v)2≤2u2+2v2 similarly gives P0[log⁡(p0/r)]2≤C′bn4. All integrals exist by the displayed bounds, and integrands vanish off {p0>0}.

6.1givenstep 3.1step 5.1algebra∎

The scale event S∈[s−,s+] has fixed probability g>0 and is independent of F. Therefore En times this event is contained in the displayed KL/log-square set and has probability at least gexp⁡{−Cbn−1(log⁡n)2}. Increase C2 to absorb g. Since ndn2≥bn−1(log⁡n)2 and dn2≥bn4, the consequent local-radius form follows as well. This proves all assertions without a unimodality hypothesis.

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

The posterior excludes large scales and mixing mass far from compact data

Statement

Assume AC. Let p0 be supported on a compact interval I=[L,U] with L<U, let F∼DP(α) for a finite nonzero base measure whose density is bounded below by a positive constant on a neighborhood of I, and let S∼G be independent with σ=σnS. Put R=(U−L)/2 and, for d>0, Id=[L−d,U+d]. Observe IID data from p0 under the location-mixture density pF,σ. Let ϵn,δn>0 with nϵn2→∞ and nδn2→∞. Suppose the local KL and log-square prior-mass condition gives a denominator event P0n{Dn≥e−C0nδn2}⟶1, where Dn=∫∏ipF,σ(Xi)/p0(Xi) Πn(dF,dσ). Choose sn→0 and put qn=2Φ(−R/sn), where Φ is the standard normal distribution function. If nqn−(C0+2)nδn2→∞,nϵn−2sn−1e−d2/(2sn2)→0, then the posterior complement of Sn:={(F,σ):σ≤sn, F(Idc)≤ϵn2} converges to zero in P0n-probability.

Facts & Assumptions

Given: Full AC; compactly supported truth; base density bounded below by a positive constant on a neighborhood of I; the DP normal-mixture model and independent scale prior; the denominator event; and the two displayed asymptotic conditions.

[F1]

Dirichlet-process posterior update: conditionally on latent IID locations θ1:n∣F∼F⊗n, the posterior law of F is DP(α+∑iδθi).

[F2]

Dirichlet-process Pólya-urn predictive law: conditionally on all latent locations except θi, the prior predictive law of θi is (α+∑k≠iδθk)/(α(R)+n−1), by exchangeability.

[F3]

Dirichlet-process posterior update and Dirichlet-process Pólya-urn predictive law: under the posterior DP(α+∑iδθi), the next latent location has predictive probability (α(A)+∑i1A(θi))/(α(R)+n); because its conditional law given F is F, this is the posterior mean of F(A).

[F4]

KL prior mass gives a posterior denominator lower bound in probability: the local KL/log-square prior-mass condition gives the displayed lower bound for Dn with probability tending to one.

[F5]

A positive-variance normal law has its location-scale density: the latent observation likelihood is ϕσ(x−θ)=(σ2π)−1e−(x−θ)2/(2σ2).

[F6]

Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: nonnegative likelihood numerators may be integrated in either order.

[F7]

Markov's inequality for random variables: for a nonnegative random variable Y and a>0, P(Y≥a)≤E[Y]/a.

[F8]

Dirichlet process and Existence of a Dirichlet process by normalized gamma Poisson random measure: DP(α) is an evaluation-measurable random probability measure with the stated Dirichlet finite-partition laws.

Proof

Given: The hypotheses in the Statement.

1.1A1F5F9givenconstruct

The latent representation is θi∣F∼iidF and Xi∣θi,σ∼N(θi,σ2) independently. Use the test φn=1{some Xi∉I}. Its type-I error is zero. Write Φ(t)=∫−∞tϕ(z) dz; [F9] gives Φ′(t)=ϕ(t). The normal formula [F5] is even and satisfies ϕ′(t)=−tϕ(t), so it decreases on [0,∞). For fixed θ and σ, set g(θ)=P(θ+σZ∈I)=Φ((U−θ)/σ)−Φ((L−θ)/σ). Then g′(θ)=σ−1[ϕ((L−θ)/σ)−ϕ((U−θ)/σ)]. For θ≤(L+U)/2, ∣L−θ∣≤∣U−θ∣, so g′(θ)≥0; for θ≥(L+U)/2 the inequality reverses and g′(θ)≤0. Thus g is maximized at the midpoint, where the component leakage is 2Φ(−R/σ). Every component with σ>sn therefore puts probability at least qn=2Φ(−R/sn) outside I, and PF,σn(φn=0)≤(1−qn)n≤e−nqn.

1.2F1F3F7F8givenalgebra

By [F8] the latent DP model is a measurable prior law. Introduce the latent locations θ1:n. Given these locations, X1:n and σ, the observation likelihood is independent of F, so [F1] gives the conditional law DP(α+∑iδθi). Given this updated F, the next latent location has conditional law F; applying [F3] to that predictive draw gives E[F(A)∣θ1:n,X1:n,σ]=α(A)+∑i1A(θi)α(R)+n for every Borel set A. With A=Idc, conditional Markov inequality yields Πn(F(A)>ϵn2,σ≤sn∣X1:n)≤α(A)+∑iP(θi∈A,σ≤sn∣X1:n)ϵn2(α(R)+n).

1.3A1F2F5givenalgebra

Fix an index i and condition on θ−i,X1:n,σ. The latent vector is exchangeable because its conditional law given F is IID. Reordering θi last and applying [F2] shows its prior predictive law given θ−i is Hi=(α+∑k≠iδθk)/(α(R)+n−1). Bayes' formula multiplies this measure by the likelihood ϕσ(Xi−t). Almost surely Xi∈I. On A=Idc, ∣Xi−t∣≥d, so the likelihood numerator is at most Cσ−1e−d2/(2σ2). For σ≤sn, the denominator is at least the base-measure contribution 1α(R)+n−1∫Xi−σXi+σϕσ(Xi−t) α(dt)≥cα(R)+n−1, because the base density is bounded below near I and [Xi−σ,Xi+σ] lies there for all sufficiently large n. Consequently P(θi∈A∣θ−i,X1:n,σ)≤Cnσ−1e−d2/(2σ2)≤Cnsn−1e−d2/(2sn2), where s−1e−d2/(2s2) is increasing on 0<s<d.

2.1F4F6F7step 1.1algebra

Let NnH be the likelihood-ratio numerator integrated over {σ>sn}. By change of density and [F6], E0[(1−φn)NnH]≤e−nqn. On the denominator event, [F7] therefore gives, for every ζ>0, P0n{Πn(σ>sn∣X1:n)>ζ}≤o(1)+ζ−1e(C0+2)nδn2−nqn⟶0.

3.1F4F7step 2.1step 1.2step 1.3givenalgebra∎

Substitute the step 1.3 bound into step 1.2 and use α(A)≤α(R). The resulting upper bound is α(R)ϵn2(α(R)+n)+Cnϵn−2sn−1e−d2/(2sn2)+Πn(σ>sn∣X1:n), which tends to zero by nϵn2→∞, the second premise, and step 2.1. Thus the posterior probability of F(Idc)>ϵn2 tends to zero. Combining with step 2.1 proves the sieve-complement claim.

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

Dirichlet normal-mixture posterior contraction

Statement

Assume AC. Let p0 be a finite-valued probability density on R with compact support. Assume p0∈C2(R) and, with the integrands set to zero on {p0=0}, ∫{p0>0}[(p0′′p0)2+(p0′p0)4]p0 dx<∞, and assume there is C<∞ such that h(p0,p0∗ϕσ)≤Cσ2 for all sufficiently small σ>0. Here h is the root-L2 Hellinger distance of Root-L2 Hellinger distance between density laws, and ϕσ is the centered normal density with standard deviation σ. Let F∼DP(α), where α is a finite nonzero measure with a continuous, strictly positive Lebesgue density on an open interval containing supp⁡(p0), and independently let S∼G on (0,∞). For σ=σnS, define pF,σ(x)=∫ϕσ(x−z)F(dz), and observe X1,…,Xn IID from p0. Suppose n−a1≲σn≲n−a2,0<a2<a1<1,a2≥(4+γ)−1, and, for some β>0 and γ>1, G((0,s])≲e−βs−γ (s↓0),G((s,∞))≲e−βsγ (s→∞). Here un≲vn means un≤Cvn eventually for a fixed constant C. For every fixed η>γ/[2(γ−1)], put ϵn=max⁡{(nσn)−1/2log⁡n,n−1/2σn−η, σn2log⁡n}. Then for every sufficiently large fixed M, Πn ⁣(h(pF,σ,p0)>Mϵn∣X1:n)⟶0 in P0n-probability. If G is compactly supported in (0,∞), the middle term n−1/2σn−η may be omitted. The conclusion is only in probability; it supplies no almost-sure contraction or generic minimax-optimality assertion.

Facts & Assumptions

Given: Full AC; the compactly supported smooth truth and displayed smoothness/convolution conditions; the finite DP base measure with its density condition; independent scale law; polynomial bandwidth and scale-tail hypotheses; and an IID sample from p0.

[A1]

Full AC supplies the normalized-gamma DP construction and the directional KL convention. The Axiom of Choice Existence of a Dirichlet process by normalized gamma Poisson random measure Kullback–Leibler divergence

[F1]

Dirichlet process and Existence of a Dirichlet process by normalized gamma Poisson random measure: DP(α) is a measurable random probability measure with the stated Dirichlet finite-partition laws.

[F2]

The Dirichlet normal-mixture density is jointly measurable and normalized: (F,σ,x)↦pF,σ(x) is jointly measurable, positive, finite, and integrates to one.

[F3]

The mixture prior places local KL and log-square mass near a compact smooth truth: for dn=max⁡{(nσn)−1/2log⁡n,σn2log⁡n}, the local KL and log-square neighborhood has mass at least e−Cndn2, with both quantities at most Cdn2.

[F4]

KL prior mass gives a posterior denominator lower bound in probability: local KL/log-square mass at least e−ndˉn2 gives, with probability at least 1−(ndˉn2)−1, a likelihood denominator at least e−3ndˉn2.

[F5]

The posterior excludes large scales and mixing mass far from compact data: given that denominator bound, for any compact interval I=[L,U] containing the truth, put R=(U−L)/2 and Id=[L−d,U+d]. If sn→0, nqn−5ndˉn2→∞ for qn=2Φ(−R/sn), where Φ is the standard normal distribution function, and nξn−2sn−1e−d2/(2sn2)→0, then the posterior complement of {F(Idc)≤ξn2,σ≤sn} vanishes, provided nξn2→∞ and the DP base density is bounded below near I.

[F6]

The dyadic scale bands satisfy the weighted entropy condition: for a fixed A≥1 and dyadic scale bands whose sieve satisfies F([−A,A]c)≤min⁡{rn,1/4}2/8, the weighted entropy condition holds when rn dominates the displayed first and middle rate terms; for compact scale support it holds with only the first term.

[F7]

Countably partitioned sieves yield posterior contraction by weighted entropy: local KL/log-square mass, a sieve with vanishing posterior complement, and the weighted countable-band entropy condition imply contraction in the same Hellinger metric at every sufficiently large fixed multiple of the target radius.

[F8]

Dominated statistical experiments and Likelihood densities: the sampling experiment is dominated by Lebesgue measure, and the supplied jointly measurable mixture densities define its likelihoods.

[F9]

Root-L2 Hellinger distance between density laws: h in the conclusion is the root-L2 Hellinger distance between square-root densities.

Proof

Given: The hypotheses in the Statement.

1.1A1F3F4givenalgebra

Put dn=max⁡{(nσn)−1/2log⁡n,σn2log⁡n}. By [F3], choose C1≥1 so the prior mass is at least e−C1ndn2 on a set where both local quantities are at most C1dn2. Set dˉn=C1dn. Then the mass is at least e−ndˉn2 and both quantities are at most dˉn2. By [F4], except on an event of probability at most (ndˉn2)−1, the likelihood denominator is at least e−3ndˉn2. Also ndˉn2≥C1σn−1(log⁡n)2→∞.

1.2F5givenconstructalgebra

Choose a compact interval I=[L,U] containing supp⁡(p0) in its interior and contained in the open interval where the density of α is continuous and strictly positive. Such an interval exists because the support is compact; its base density is bounded below on I. Put R=(U−L)/2>0 and κ=max⁡{a1,1−4a2,0}<1. The polynomial bandwidth bounds give ndˉn2≤Cnκ(log⁡n)2. Choose sn=c0(log⁡n)−1/2 with c0 large enough that for some θ<1−κ, qn:=2Φ(−R/sn)≥n−θ eventually: integrating the standard normal density on [R/sn,R/sn+1] gives the claimed lower bound once R2/(2c02)<θ. Hence nqn−5ndˉn2→∞. Set rn=M0ϵn for a fixed sufficiently large M0, and ξn=min⁡{rn,1/4}/8. We have nξn2→∞ and ξn−2≤Cn: if rn<1/4, use ϵn≥n−1/2log⁡n for all large n, and otherwise ξn is fixed. Choose d>0 with d2/(2c02)>4 and A≥1 large enough that Id=[L−d,U+d]⊆[−A,A]. Then nξn−2sn−1e−d2/(2sn2)→0. Applying [F5] gives posterior concentration on {F(Idc)≤ξn2,σ≤sn}. Since [−A,A]c⊆Idc, the larger sieve Sn={F([−A,A]c)≤ξn2,σ≤sn} also has Πn(Snc∣X1:n)→0.

1.3F2F6givenalgebra

Partition Sn into dyadic scale bands Sn,j=Sn∩{2jσn≤σ<2j+1σn} for 2jσn≤sn. Their prior masses are bounded by G([2j,2j+1)). Since ξn2=min⁡{rn,1/4}2/8, [F6] applies at radius rn and gives e−nrn2∑jN(rn,{pF,σ:(F,σ)∈Sn,j},h) Πn(Sn,j)⟶0. For compactly supported G, only finitely many bands have positive prior mass and the first rate term suffices.

2.1F5F6givenstep 1.1step 1.2algebra

If G is compactly supported, put ϵnc=max⁡{(nσn)−1/2log⁡n,σn2log⁡n}, rnc=M0ϵnc and ξnc=min⁡{rnc,1/4}/8. Since σn→0, n(ϵnc)2≥σn−1(log⁡n)2→∞ and (ϵnc)−2≤Cn. Thus n(ξnc)2→∞ and (ξnc)−2≤Cn. Also dˉn≤C1ϵnc. Retain I,sn,d,A from step 1.2: its denominator, leakage bound, and exponential factor do not depend on the target radius, so the hypotheses of [F5] hold with ϵnc and ξnc in place of ϵn and ξn. It yields posterior sieve complement convergence for Snc={F([−A,A]c)≤(ξnc)2,σ≤sn}. The compact branch of [F6] supplies the weighted entropy condition at radius rnc using only the first rate term.

3.1A1F1F2F3F6F7F8F9step 1.1step 1.2step 1.3step 2.1algebra∎

The prior is the measurable DP law from [F1], and [F2], [F8] give its jointly measurable density likelihoods. We have dˉn≤C1ϵn, so increasing M0 if necessary ensures dˉn≤rn; also ndˉn2,nrn2→∞. Thus [F3] supplies the local prior-mass condition for [F7]. For general G, steps 1.2 and 1.3 provide a sieve with vanishing posterior complement and its weighted entropy condition. If G is compactly supported, step 2.1 instead provides these two conditions at radius rnc, and its bound dˉn≤C1ϵnc allows M0 to be chosen so dˉn≤rnc. Apply [F7] with local radius dˉn and target radius rn in the general case, or rnc in the compact case. It follows that for every sufficiently large fixed M1, the posterior outside M1M0ϵn (respectively M1M0ϵnc) tends to zero in P0n-probability. Since M1M0 can be any sufficiently large fixed constant, this proves the stated rates. The measurability and dominated-likelihood requirements are supplied by [F1], [F2], and [F8], and [F9] fixes the conclusion's metric convention.

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

An interval-mass condition removes the Gaussian-bias logarithm

Statement

Under the hypotheses of Dirichlet normal-mixture posterior contraction, assume additionally that supp⁡(p0) is a finite union of intervals and there are a,c>0 such that P0(I)≥cλ(I)a for every interval I contained in the support. Then the source's sharpened Hellinger contraction rate is max⁡{(nσn)−1/2log⁡n, n−1/2σn−η, σn2},η>γ2(γ−1). If G is compactly supported in (0,∞), the middle term is omitted.

Facts & Assumptions

Given: AC and the exact hypotheses of Dirichlet normal-mixture posterior contraction, together with the finite-union interval-mass condition in the Statement.

[F1]

The main theorem fixes the smooth compact truth, the finite DP base measure, the independent scale law, the polynomial bandwidth bounds and both scale-tail assumptions. Dirichlet normal-mixture posterior contraction

[F2]

With dn=max⁡{(nσn)−1/2log⁡n,σn2}, the local KL and log-square set at radius a constant multiple of dn has prior mass at least e−Cndn2. Interval masses give a log-free local KL neighborhood for the mixture prior

[F3]

A local set with both quantities at most dˉn2 and mass at least e−ndˉn2 gives a denominator at least e−3ndˉn2 except on an event of probability at most (ndˉn2)−1. KL prior mass gives a posterior denominator lower bound in probability

[F4]

The posterior sieve-complement bound applies when its denominator, Gaussian leakage and distant-location conditions hold. The posterior excludes large scales and mixing mass far from compact data

[F5]

For a fixed A≥1, the dyadic scale-band weighted entropy condition holds at a sufficiently large multiple of the first and middle terms of the stated rate, or of the first term alone for compactly supported G. The dyadic scale bands satisfy the weighted entropy condition

[F6]

Local KL/log-square mass, a vanishing posterior sieve complement and the weighted countable-band entropy condition imply posterior contraction at every sufficiently large fixed multiple of the target radius. Countably partitioned sieves yield posterior contraction by weighted entropy

[F7]

The mixture densities are jointly measurable, positive, finite and normalized. The Dirichlet normal-mixture density is jointly measurable and normalized

Proof

1.1F1F2F3givenchoosealgebra

The C2 compact truth in [F1] satisfies the J hypothesis of [F2] by the stated derivative integrability condition. All other hypotheses of [F2] are either in [F1] or the interval-mass premise. Choose a fixed C≥1 large enough that, with dˉn=Cdn, the local set has both quantities at most dˉn2 and mass at least e−ndˉn2. By [F3], its denominator is at least e−3ndˉn2 with probability tending to one, since ndˉn2≥Cσn−1(log⁡n)2→∞.

2.1F1step 1.1choosealgebra

Let ϵn denote the displayed improved rate, omitting its middle term if G is compactly supported. Put rn=M0ϵn for a sufficiently large fixed M0 and ξn=min⁡{rn,1/4}/8. Then dˉn≤rn after increasing M0, nξn2→∞ and ξn−2≤C′n: use ϵn≥(nσn)−1/2log⁡n≥n−1/2log⁡n eventually when rn<1/4, while otherwise ξn is fixed. Choose a compact interval I=[L,U] containing the truth support in its interior, within the interval on which the base density is positive. Put R=(U−L)/2>0 and κ=max⁡{a1,1−4a2,0}<1. The bandwidth bounds give ndˉn2≤C′nκ(log⁡n)2. Choose sn=c0(log⁡n)−1/2 with c0 large enough that qn=2Φ(−R/sn)≥n−θ eventually for some 0<θ<1−κ. This follows by integrating the standard normal density over [R/sn,R/sn+1] once R2/(2c02)<θ. Thus nqn−5ndˉn2→∞.

3.1F4step 1.1step 2.1choosealgebra

Choose d>0 with d2/(2c02)>4 and a fixed A≥1 large enough that Id=[L−d,U+d]⊆[−A,A]. Then nξn−2sn−1e−d2/(2sn2)→0, by the inverse-radius bound in step 2.1. With denominator coefficient 3, all hypotheses of [F4] hold at local radius dˉn and location-tail tolerance ξn. It follows that the posterior complement of Sn={σ≤sn,F([−A,A]c)≤ξn2} vanishes in sampling probability: [F4] first gives the smaller location sieve using Id, and [−A,A]c⊆Idc.

4.1F1F5step 2.1step 3.1algebra

Partition Sn into the measurable dyadic scale bands Sn,j=Sn∩{2jσn≤σ<2j+1σn}. Their prior masses are bounded by G([2j,2j+1)). We have sn/σn→∞, and ξn2=min⁡{rn,1/4}2/8 matches the tail tolerance in [F5]. Thus [F5] supplies e−nrn2∑jN(rn,{pF,σ:(F,σ)∈Sn,j},h)Πn(Sn,j)→0. For compactly supported G, its compact branch applies with the first term alone. The preceding steps used only dn and the retained first term, so they also apply unchanged to this improved compact-scale rate.

5.1F2F6F7step 1.1step 2.1step 3.1step 4.1algebra∎

By [F7] the model has the jointly measurable density likelihood required in [F6]. Step 1.1 gives the local mass condition, step 3.1 gives the sieve complement, and step 4.1 gives the weighted entropy condition at target radius rn. Both ndˉn2 and nrn2 diverge, and dˉn≤rn. Apply [F6] to obtain posterior contraction at every sufficiently large fixed multiple of rn=M0ϵn, in P0n-probability. Absorbing M0 into the final constant proves the Statement, including its compact-scale branch.

Remarks

The source proof invokes a uniform convolution likelihood-ratio bound through its unimodality lemma. Here the local Gaussian semigroup argument bounds KL and log-square bias directly from the original second-derivative integrability hypothesis. The interval-mass condition then controls only the discretization perturbation. This proves the stated refinement without adding a unimodality assumption.

5 · Examples, counterexamples and false statements

None yet.

Sources