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

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.

Depends on

Used by

Dependency tree · two levels

136 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