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 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.

Depends on

Used by

Dependency tree · two levels

114 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