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

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

48 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