Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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

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.

Depends on

Used by

Dependency tree · two levels

120 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