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 dyadic scale bands satisfy the weighted entropy condition
Statement
Fix independently of . The constants in the entropy estimates and the required fixed may depend on . Let , , and . Suppose is a probability measure on satisfying for all sufficiently small . Let with . For integers with , put and and let be the prior mass of the corresponding parameter band, so . Suppose and, for some fixed sufficiently large (allowed to depend on ) and fixed , With , one has If instead is supported on a compact subset of , the same conclusion holds under the first rate term alone.
Facts & Assumptions
Given: The fixed cutoff , AC, the polynomial bounds on , the lower scale-tail bound on , the dyadic scale bands, and the compact-location entropy estimate.
Assume AC for the compact-location entropy and mixture-density interfaces. The Axiom of Choice
Hellinger entropy for compact-location normal mixtures in a scale band: for compactly supported mixing laws on , , and ,
Hellinger distance is a metric and controls L1 and total variation: for probability densities, Hellinger distance is a metric and .
Proof
Given: The hypotheses in the Statement.
Write and . Since and , . Put . If , truncate a mixing law to and normalize it there; the removed mass is at most , so its mixture changes by at most and by Hellinger at most using [F2]. The compact cover at radius then covers at radius . If , the sieve tail is at most , so truncation changes Hellinger distance by at most ; the compact cover at radius then covers the class at radius at most . Thus in both cases . The rate lower bound implies and For , [F1] bounds , because the band lower scale is at least . Since , these terms contribute at most which tends to zero for sufficiently large .
For negative indices write , . For all sufficiently large , the scale-tail premise gives . Also [F1] and imply Choose and sufficiently close to and , respectively, so and . Since and , the logarithm of each summand is at most Enlarging handles the finitely many smaller .
Put . As a function of , the exponent has maximum at most , by differentiation. The maximizing scale is a constant multiple of , so there are indices up to any fixed multiple of that scale; their sum has logarithm at most . Choose a fixed multiple large enough that for the negative term is at least twice the positive term. Grouping the subsequent dyadic values gives a convergent geometric tail, also bounded by . Therefore Because and , this is . The negative-index contribution therefore vanishes after multiplication by .
If is supported on with , only a fixed finite number of dyadic indices have positive mass. Their lower scales are at least , so [F1] at radius bounds each log covering number by . The first rate term gives , and the finite weighted sum tends to zero for sufficiently large .
Depends on
Used by
Dependency tree · two levels
20 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
- Subhashis Ghosal and Aad W. van der Vaart, Posterior convergence rates of Dirichlet mixtures at smooth densities, §9 proof of Theorem 1 (standard reference, not scraped)
- Subhashis Ghosal and Aad W. van der Vaart, Fundamentals of Nonparametric Bayesian Inference, §6.3.1 proof of Theorem 6.6 (standard reference, not scraped)