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

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.

Depends on

Used by

Dependency tree · two levels

39 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