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.
Dirichlet normal-mixture posterior contraction
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Analyticity of Holomorphic Functions; Liouville and Morera
- Arc Length and Rectifiable Curves
- Areas of Elementary Plane Figures
- Bayesian models, priors, and posterior laws
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Variation and the Riemann–Stieltjes Integral
- Brownian Motion Construction and Continuity
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Coordinate and Path Transport
- Complex Differentiability and the Cauchy–Riemann Equations
- Complex Lp Spaces and Test-Function Conventions
- Complex Power Series and Analytic Functions
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- Conjugate families and Gaussian conditioning
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Contour Integration
- Convexity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Density Separability and Convolution in Lᵖ
- Detection and quantification limits
- Determinants of Matrices over a Commutative Ring
- Dirichlet-process priors and finite-partition updates
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Domination and Likelihood Ratios
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Empirical-Process Complexity
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Finite Probability Spaces and Random Variables
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Goursat's Theorem and Cauchy's Theorem in a Convex Domain
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Hausdorff via the Diagonal
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- IID posterior contraction by entropy and prior mass
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Line Integrals and the Gradient Theorem
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Loss, Risk and Decision Theory
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Minimax Lower Bounds
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Partitions of Unity and Paracompactness
- Plancherel Measure and Asymptotic Young Diagrams
- Pointwise Extended-Real Function Products
- Poisson and Cox point processes
- Polynomial Rings, the Division Algorithm and Roots
- Posterior propriety and dominated Bayes formula
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Radon Measures and the Riesz Markov Kakutani Theorem
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- SCM, DAGs, adjustment
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Standard-Borel Real Codings and Determining Classes
- Stationary Markov Chains and Ergodic Limits
- Statistical Experiments, Models and Identifiability
- Subspaces, Products, and Quotients
- Sufficiency, Completeness and Exponential Families
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Fundamental Theorems of Calculus
- The Identity Theorem, the Maximum Principle and the Open Mapping Theorem
- The Integral Logarithm and the Equivalence of Its Characterisations
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Real Gamma and Beta Functions
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
- Weak Laws and Series of Independent Random Variables
2 · Summary
Objective
This page builds the density, finite-mixture approximation, scale-band entropy, Dirichlet simplex mass and local KL-mass estimates needed for the compact-truth Dirichlet normal-mixture contraction theorem. It also proves the posterior sieve-tail bound from the DP update and latent Pólya urn. The main rate is a Hellinger contraction rate in sampling probability; it is neither an almost-sure nor a generic minimax claim. The middle term is omitted for a compactly supported scale hyperprior. Inverse-Gamma scale tails are outside the stated upper-tail condition; this page makes no inconsistency claim about them. The interval-mass refinement removes the Gaussian-bias logarithm. A local Gaussian semigroup estimate bounds KL and log-square smoothing bias, and a coarse-interval Dirichlet neighborhood controls its discrete perturbation. The DP-dependent estimates use the current BCS-17 DP definition, construction, update and predictive-law bodies; their current Step 1 records are checked in the batch evidence. Readiness records are authoring handoff only and do not constitute independent acceptance.
3 · Logical flowchart
4 · Definitions, theorems and proofs
The Dirichlet normal-mixture density is jointly measurable and normalized
Statement
Let be the probability measures on the Borel sets of , equipped with the evaluation sigma-algebra, and let . For define Then is jointly measurable, for every , and . In particular it is the Lebesgue density of the convolution of with .
Facts & Assumptions
Given: The evaluation sigma-algebra on , , and .
Assume AC for the library normal location-scale density interface. The Axiom of Choice
A positive-variance normal law has its location-scale density: is the Lebesgue density of and integrates to one.
Probability measures and probability spaces and Measure kernel and probability kernel: each is a probability measure, and the evaluation map makes a probability kernel from to .
Measurability of integration against a kernel: integrating a nonnegative product-measurable function against a probability kernel gives a measurable function of the kernel's input.
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: nonnegative measurable functions on product measure spaces may be integrated in either order.
Proof
Given: The hypotheses in the Statement.
The kernel in [F2] is a probability kernel because, for fixed , is a probability measure, while for fixed Borel , is measurable by the evaluation sigma-algebra. The integrand is continuous on and hence product-measurable. Therefore [F3] makes its integral against jointly measurable.
The integrand is strictly positive, so its integral against a probability measure is positive. It is bounded above by , so the integral is finite and has the stated upper bound.
By [F4], where the inner integral is one by [F1] and has total mass one. Thus is a probability density.
For every Borel set , Tonelli [F4] gives . The inner integral is by [F1], so the right side is the convolution measure by its definition. Hence this density represents the convolution law in the Statement.
A bounded likelihood ratio controls KL and log-square moments by Hellinger distance
Statement
Let be probability densities relative to one measure , assume , let , and suppose , with on . Then and for a universal constant , The logarithm is assigned value zero on ; the moment integrand is also set to zero there.
Facts & Assumptions
Given: Two probability densities relative to one measure, , and finite as in the Statement.
Assume AC for the library directional KL convention. The Axiom of Choice Kullback–Leibler divergence
Kullback–Leibler divergence: when , the directional KL divergence is the integral of against .
Proof
Given: The hypotheses in the Statement.
Put on . The absolute-continuity premise gives -almost everywhere on . Define and , for , with their limiting values at and . At zero, set ; for , [F3] gives . Hence and , so and . At one, by [F3], , and . Also , so ; therefore and . Thus are continuous on and bounded there.
For , , while and retain their displayed forms. Hence and for a universal . Combining with step 1.1, for every ,
Integrating the first inequality in step 2.1 against gives the KL bound, since by and [F2]. Integrating the second gives the log-square bound. Finally by [F1], so both right sides have the claimed factors of .
Gaussian convolution has second-order KL and log-square error
Statement
Assume AC. Let be a nonnegative compactly supported probability density and suppose For , set , where is the centered normal density with standard deviation . Then The logarithmic integrands are zero where . No unimodality or uniform bound on is assumed.
Facts & Assumptions
Given: AC and the density and integrability hypotheses of the Statement.
The normal kernel is and integrates to one. A positive-variance normal law has its location-scale density
Cauchy–Schwarz bounds an integral of a product by the product of its two norms. Cauchy-Schwarz inequality for
Nonnegative product integrals may be taken in either order. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
The directional KL divergence of two densities with absolute continuity is the integral of their log ratio under the first law. Kullback–Leibler divergence
A parameter derivative may pass under an integral when it is measurable and dominated locally by one integrable function. Differentiation under the integral sign
For differentiable functions with integrable derivatives on a compact interval, integration by parts holds. If are differentiable on with integrable, then
If a differentiable function has an integrable derivative on a compact interval, its derivative integrates to the endpoint difference. The second fundamental theorem: if is differentiable on with and is integrable, then
The natural logarithm is differentiable on with derivative . The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t
Pointwise-convergent integrands dominated by one integrable function have convergent integrals. Dominated convergence
Proof
At every zero of the nonnegative differentiable function , . At each accumulation point of its zero set, differentiation along zeros of gives ; isolated zeros form a countable set. Thus almost everywhere on . Put on and zero elsewhere. Then almost everywhere, , and [F2] gives . Both and are continuous and compactly supported.
Let for . Direct differentiation of [F1] gives . For fixed and , the differentiated integrand in is bounded on and the compact support of by ; differentiation under the integral [F5] and two integrations by parts [F6] therefore give . The boundary terms vanish because have compact support. Dominated convergence [F9] makes continuous on , so [F7] integrates the derivative there. Gaussian approximate identities converge uniformly on continuous compactly supported functions: split their convolution integral at , where uniform continuity controls the integrand difference, and its complement, whose normal mass tends to zero by scaling and integrability of [F1]. Letting consequently yields pointwise; the omitted integral over tends to zero because .
Fix and put . It is positive everywhere because is a nonzero nonnegative density and the Gaussian kernel is positive; Tonelli [F3] and show integrates to one. For , the Gaussian formula gives for every , hence . Applying [F2] inside the convolution and then [F3] gives and therefore . These inequalities remain valid if one of the pointwise nonnegative integrals is infinite.
Apply [F2] to the time integral in step 2.1 with weights . Since , it gives . Divide by , integrate and use [F3] and step 2.2. The result is . In particular all these weighted integrals are finite.
For , the function has value zero at and derivative , so and . For , has value zero at and derivative ; replacing by gives also for . With , this yields . At , use the conventions , for which both inequalities hold. Apply these pointwise bounds to and integrate against . Since integrate to one, [F4] identifies the first integral as KL; its negative part is integrable because . Both requested logarithmic quantities are at most the chi-square integral from step 3.1. Taking proves the Statement.
Compactly supported Gaussian mixtures admit logarithmic-size finite approximations
Statement
There is a universal constant such that, for , , and every probability measure supported on , there is a discrete probability measure on with at most support points and
Facts & Assumptions
Given: , , and a probability measure on .
The Dirichlet normal-mixture density is jointly measurable and normalized: is the mixture integral of the normal location-scale density.
A positive-variance normal law has its location-scale density: the standard normal density is and .
The monic probabilists' Hermite polynomials: is monic of degree and .
Cauchy--Schwarz bounds an integral of a product by the product of its norms. Cauchy-Schwarz inequality for
For a standard normal random variable , . Location-scale normal laws have their stated mean and variance
Nonnegative product integrals may be interchanged. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
Integration by parts holds for continuously differentiable functions on compact intervals. If are differentiable on with integrable, then
A differentiable function with integrable derivative on a compact interval has endpoint difference equal to the integral of its derivative. The second fundamental theorem: if is differentiable on with and is integrable, then
Assume AC for the normal-density interface. The Axiom of Choice
Proof
Given: The hypotheses in the Statement.
Partition into consecutive Borel intervals of length at most , with left endpoints . Ignore intervals of zero -mass and let be the law of conditional on . Let be the length of and put , so is supported on . Approximate the moment vector by finite sums obtained from partitions of ; it is therefore in the closure of the convex hull of the compact moment curve on that interval. Every finite convex combination with more than points can be reduced: affine dependence supplies coefficients , not all zero, with and ; moving the weights along this relation until one becomes zero preserves nonnegativity and the represented point, so iteration gives at most points. Thus the convex hull is the continuous image of a compact set consisting of curve points and simplex weights; it is compact and closed. The moment vector belongs to it, giving a probability on at most points of matching the first moments of .
The Hermite recurrence [F3] and differentiation of give for every integer . The case is immediate. If it holds at orders and , differentiating 's recurrence gives ; the base cases and start this induction. Thus differentiating gives . Since is monic, . Apply integration by parts [F7] repeatedly on and let ; the boundary terms vanish because each derivative is a polynomial times the Gaussian. This gives . Cauchy--Schwarz [F4] therefore gives . Also tends to zero at , so [F8] on , followed by , gives and .
Repeated application of [F8] gives the Taylor integral remainder for through degree : . By translation invariance and Tonelli [F6], ; the same formula gives by step 1.2. Moment matching in step 1.1 cancels the polynomial terms after integration against . Integrating the remainder bounds against these two probability laws gives . The bound shows this error is at most when for a sufficiently large universal , with absorbed by increasing .
Let and be the pushforwards of and , respectively, under , and set . Since is supported on , every is supported in the closure of , so is a discrete probability measure on with at most support points. Translation and scaling give and the same identity for and . Summing these component errors with weights shows the error is at most and the supremum error at most .
Countably partitioned sieves yield posterior contraction by weighted entropy
Statement
Assume AC. For each , let be a prior on a measurable parameter space , and let be a jointly measurable family of finite-valued densities against one sigma-finite measure, and let be the true density for IID data . Let satisfy , , and . Suppose for a constant that Let be a measurable sieve with in -probability. Partition it into countably many measurable sets , put , and let be the finite covering number as defined in Covering, packing, bracketing numbers, and metric entropy, with centers in that density class, whenever . If then for every sufficiently large fixed , the posterior mass of converges to zero in -probability.
Facts & Assumptions
Given: A dominated IID model with a jointly measurable density family, AC, the displayed local prior mass, a measurable sieve with vanishing posterior complement, and a countable measurable partition satisfying the weighted entropy condition.
Assume AC for the directional KL convention. The Axiom of Choice Kullback–Leibler divergence
KL prior mass gives a posterior denominator lower bound in probability: if the local KL and log-square set has prior mass at least , then, except with probability at most , the normalized likelihood denominator is at least .
Hellinger distance is a metric and controls L1 and total variation: Hellinger distance is a metric and event-supremum total variation is bounded by Hellinger distance, including for finite product laws.
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: nonnegative measurable likelihood-ratio integrands may be integrated in either order.
Dominated statistical experiments and Likelihood densities: all densities are relative to the same fixed sigma-finite measure; the supplied family is jointly measurable, so likelihood-ratio integrals are measurable.
Identical distribution and IID families and Expectations factor over finite products of independent random variables: disjoint finite blocks of an IID sample are independent, and expectations of products of nonnegative functions of those blocks factor.
Markov's inequality for random variables: for a nonnegative random variable and , .
Probability measures and probability spaces and The measure with density relative to : and each model law are probability measures represented by their displayed densities; integrating under gives .
Covering, packing, bracketing numbers, and metric entropy: is the least finite number of centers from whose closed Hellinger balls of radius cover .
Proof
Given: The hypotheses in the Statement.
Put , , and let be the likelihood denominator relative to . By [F1], on an event with , .
Write and , so . Fix and split indices into active and small-mass . Since , . For active , , hence for all sufficiently large .
Fix a sufficiently large constant . If , then the alternative is empty because Hellinger distance is at most , and the desired posterior mass is zero for this . For the remaining , choose, by [A1], a finite -cover with centers in each active stratum's density image, as allowed by [F9]. Discard centers whose closed -ball meets no density in the stratum with ; at most centers remain, and they cover that alternative. For every retained center , the triangle inequality gives . Set . On a block of observations define . On rejection, , so its type-I error is at most the product affinity; on acceptance, , so its type-II error under has the same bound. By [F2], this affinity is .
If , product affinity gives , using for ; [F3] bounds their total variation by . Since , and for sufficiently large . The total variation is then at most . Therefore the block test in step 1.3 rejects with probability at least under every in the alternative and at most under .
Divide disjoint blocks and let be their block-test indicators. Under each IID law the indicators are independent by [F6]; their means are at most under and at least under every alternative by step 2.1. For independent Bernoulli variables with means at most , exponential Markov [F7] gives ; with means at least , the negative-exponential bound gives , where . These bounds follow by bounding each moment generating function by (using for , for ) and optimizing over .
The function is affine and strictly increasing on , is negative at , and equals at . Let be its unique zero. By AC [A1], for each active choose such that . This is possible after increasing : writing , implies for sufficiently large , so the ceiling in costs at most a fixed factor; since , the floor in also costs at most a fixed factor eventually. Hence for a universal , while step 1.2 bounds the right side by . Define as the maximum of the block-majority tests over its retained centers (or zero if there are none), using threshold . Continuity on and positivity of both divergences at give a constant such that there. The null union bound and step 3.1 give ; the same Chernoff bound for a center within of each alternative gives by step 2.1.
Let be one on the countable union of the rejection events of over and zero otherwise; it is measurable as a countable union of measurable events. The union bound and step 4.1 give . For the tested likelihood numerator on an active stratum, Tonelli [F4], the jointly measurable likelihood interface [F5] and change of density give
Write . For the active numerator , step 5.1 gives and . Thus, for every fixed , . This tends to zero for sufficiently large , since , , , and . For the small-mass numerator , [F8] and Tonelli give ; hence its posterior mass tends to zero in probability by Markov and the denominator event, because when .
The posterior outside the -ball is the union of its active-stratum part, its small-mass-stratum part, and the sieve complement. Step 6.1 sends the first two parts to zero in probability, and the sieve-complement term tends to zero by hypothesis.
Hellinger entropy for compact-location normal mixtures in a scale band
Statement
For , , and , let There is a universal constant such that The same bound, with a changed universal constant, holds for whenever for a sufficiently small universal . Here is the covering number in the stated metric.
Facts & Assumptions
Given: , , , AC, and the mixture density of The Dirichlet normal-mixture density is jointly measurable and normalized.
Assume AC for the normal-density and finite-support approximation interfaces. The Axiom of Choice
Compactly supported Gaussian mixtures admit logarithmic-size finite approximations: a mixture with mixing law on is within error of a discrete mixture with at most atoms.
Hellinger distance is a metric and controls L1 and total variation: for probability densities, Hellinger distance is a metric and .
A positive-variance normal law has its location-scale density: , with the standard normal density.
Root-L2 Hellinger distance between density laws: the Hellinger metric used here is the root-L2 distance between square-root densities.
For a standard normal random variable , . Location-scale normal laws have their stated mean and variance
Nonnegative product integrals may be interchanged. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
A differentiable function with integrable derivative on a compact interval has endpoint difference equal to the integral of its derivative. The second fundamental theorem: if is differentiable on with and is integrable, then
Proof
Given: The hypotheses in the Statement.
Put . By [F1], every is within distance of a mixture with at most atoms, for a fixed sufficiently large . Pad shorter mixtures by zero-weight atoms.
Differentiating the density in [F3] gives , since and by [F5], and for . Integrating these derivatives along the location and scale segments by [F7] yields and . For the first class use a scale grid in ; for an actual band, instead grid , omitting when that endpoint is excluded. In either case choose grid mesh at most , with every grid point admitted by the corresponding scale constraint. Use a location grid in with mesh at most and an grid on the -simplex of mesh at most . Replacing the scale, locations and weights changes the mixture density in by at most : integrate the componentwise location and scale bounds against the finite mixing weights, and use Tonelli [F6] for the componentwise integrals. Choose so this plus the approximation from step 1.1 is at most . Thus the resulting finite set, with centers in the class being covered, is an cover of radius , hence an -cover of radius by [F2].
The scale grid has at most points and the location grid at most points. Rounding each of the first weights down to a mesh proportional to leaves the last weight nonnegative after setting it to make the sum one, gives at most weight vectors, and changes their distance by at most . Therefore the logarithm of the cover size is at most The constructed finite set is an -net of radius , hence also a net of radius ; its cardinality therefore bounds the covering number and proves the first bound.
If , then already belongs to the compact-location class. If , let and be the normalized restrictions to and its complement. Then , so by integrating the mixture densities (Tonelli [F6]). By [F2], ; the triangle inequality in [F4] then transfers the cover to the tail-constrained class. The scale grid is restricted as in step 2.1, so every center has and satisfies the band and cutoff constraints. For sufficiently small universal , makes the truncation error at most , so the radius- cover from steps 2.1 and 3.1 becomes a radius- cover after the constant rescaling used in the entropy bound.
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 .
A Dirichlet process assigns exponential mass to a finite-partition simplex neighborhood
Statement
Assume AC, let be a finite nonzero measure of total mass , and let . Consider a finite partition with or . Write for , and assume for fixed . For every in the probability simplex, there are constants depending only on such that For any compact , the constants may instead depend only on and are uniform over . When , the zero-base cell has almost surely and is omitted from the Dirichlet vector.
Facts & Assumptions
Given: Full AC, a finite nonzero base measure, the stated finite partition, and in the -simplex.
Full AC supplies the normalized-gamma Dirichlet-process existence interface and implies Countable Choice for the finite-dimensional Dirichlet density. The Axiom of Choice
Dirichlet process and Existence of a Dirichlet process by normalized gamma Poisson random measure: the finite-partition mass vector has the Dirichlet law with parameters ; zero-base cells have mass zero.
Dirichlet distribution, including the one-category case: with positive parameters , the simplex density is , where ; the zero-coordinate case is omitted.
The Euler Gamma values are positive and finite for positive arguments, and for . The real Gamma function by Euler's integral Euler's Gamma integral converges exactly for positive real parameters The real Gamma functional equation
The real Gamma function is continuous on . The real Gamma function is smooth and its derivatives are logarithmic moments
Proof
Given: The hypotheses in the Statement.
If and , [F1]–[F2] give and almost surely, so the event has probability one. In all remaining cases there are at least two positive-parameter cells. By [F1]–[F2], if the vector has the displayed Dirichlet density; if , set and use the -coordinate Dirichlet density. Choose an index with . For every restrict to , an interval of length at least . If , also restrict to and define ; if , define . The deviations of the coordinates other than sum to at most , so . Consequently the total event deviation is at most ; and because . These choices lie in the simplex, satisfy the event, and their integration region has coordinate volume at least when and when .
For , split the Euler integral for at . On , , and on , , so . The functional equation in [F3] gives . Put . When , the normalizing coefficient in [F2] is at least ; when and , it is at least . These Gamma factors are positive by [F3]. On the region from step 1.1, each interval coordinate satisfies . If , its factor is at least ; if , it is at least one. For , integrating the density over that region is therefore at least , multiplied by when . For and , the coordinate volume gives a lower bound . If ranges in a compact , [F4] bounds above uniformly, so is uniformly bounded below; all other Gamma factors here are fixed and positive. Since are fixed, for some . When present, the residual factor is at least because is fixed and . Combining these bounds gives with constants depending only on , uniformly when . The probability-one case in step 1.1 also satisfies the claimed bound after taking . The resulting probability is the one in the Statement by [F1].
The mixture prior places local KL and log-square mass near a compact smooth truth
Statement
Assume AC. Let be a bounded probability density supported on a compact set . Let be a finite nonzero measure with a continuous density bounded below by a positive constant on a neighborhood of . Assume for all sufficiently small , where is the centered normal density with standard deviation . Let and let be independent, where is any probability measure on . Suppose for . Set and Then, for some constant and all sufficiently large , Here is the density of The Dirichlet normal-mixture density is jointly measurable and normalized, and all logarithmic integrands are set to zero on .
Facts & Assumptions
Given: AC; the compactly supported bounded density ; the stated Gaussian-convolution Hellinger bound; the finite base measure with a positive continuous density near ; the independent priors and ; and the polynomial bounds on .
AC supplies and the directional KL convention. The Axiom of Choice Existence of a Dirichlet process by normalized gamma Poisson random measure Kullback–Leibler divergence
The Dirichlet normal-mixture density is jointly measurable and normalized: is a positive finite-valued jointly measurable density.
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 and supremum mixture errors.
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 , a DP vector has probability at least of being within of any target weight vector while every interval-cell mass is at least . 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 .
A bounded likelihood ratio controls KL and log-square moments by Hellinger distance: if is small and , then and .
Dirichlet process and Existence of a Dirichlet process by normalized gamma Poisson random measure: the finite evaluation vector of on a measurable partition has the Dirichlet law with parameters given by .
Root-L2 Hellinger distance between density laws and Hellinger distance is a metric and controls L1 and total variation: is the root-L2 distance between square-root densities, satisfies the triangle inequality, and .
A positive-variance normal law has its location-scale density: for the standard normal density .
For a standard normal random variable , . Location-scale normal laws have their stated mean and variance
Nonnegative product integrals may be interchanged. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
Proof
Given: The hypotheses in the Statement.
Since is a probability on , choose with . Put . Apply the moment-matching proof of [F2] to the law at scale , restricting each compact moment curve to intersected with the closure of its partition interval. The same convex-hull reduction and remainder bounds then give a finite discrete probability supported on with at most atoms and , where .
Choose an open neighborhood of on which the density of is bounded above and below by positive constants. By compactness, choose a fixed finite union of disjoint compact intervals with . Move each atom of to a nearest point of a lattice of mesh , merge coincident atoms, and call the resulting law . Each atom moves by at most ; for every this changes the mixture in by at most , since , using and [F8]. The relocated locations are separated by at least . Around each take a centered cell of length . In each component of , split every intervening or end gap of length into equal subintervals. For large , the end gaps have length at least because , and gaps between atom-cells have length at least by lattice separation. If , the subinterval length lies in ; if , then and , so each subinterval has length in . The resulting Borel partition of has every cell length between and , every atom-cell diameter at most , and , where is the number of atoms. Let , so . For all large , and . Also . The residual cell is , so is fixed, possibly zero. Apply [F3] with , , and ; its constant may depend on this fixed residual mass. We obtain an event with , on which , , and for every .
For in , compare with , uniformly for . On atom cells, replacing by its mass at the center costs at most in by the [F7] location derivative bound and cell diameter. The event bounds make the total mass on gap cells and at most and the sum of weight discrepancies at most . Since each normal density has norm one, . For every such , the relocation estimate in step 1.2 also gives . If , completing the square gives for ; at the identity is immediate. Convolution by a probability density contracts by Tonelli [F9], so . Thus [F6] gives , and the assumed bias bound gives .
For every , the interval contains a full cell because contains a fixed neighborhood of and all cells have length at most . On this interval for . Thus [F1] and the cell-mass lower bound in step 1.2 give . Since is bounded and vanishes outside , . Step 2.1 gives , and the polynomial lower bound on gives . Apply [F4] to and to obtain both local KL quantities at most .
The scale event has probability and is independent of . Thus the subset is contained in the displayed local KL/log-square set and has prior probability at least . By the definition of , , so increasing absorbs and proves the required lower bound.
Interval masses give a log-free local KL neighborhood for the mixture prior
Statement
Assume AC. Let be a probability density with compact support , a finite union of intervals. Suppose and there are such that for every interval . Let , where is a finite nonzero measure with continuous strictly positive density on a neighborhood of , and independently let for any probability measure on . Suppose for , and put . Then for constants and all sufficiently large , Consequently, for , the same two local quantities are at most on a set of prior mass at least . Logarithmic integrands vanish where .
Facts & Assumptions
Given: AC and all hypotheses of the Statement.
Gaussian convolution of this truth has KL and log-square error at most . Gaussian convolution has second-order KL and log-square error
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 atoms, error at most and supremum error at most . Compactly supported Gaussian mixtures admit logarithmic-size finite approximations
For a finite partition with interval-cell base masses in and , a DP finite vector has probability at least of having total target-weight discrepancy plus residual mass at most ; the constants are uniform when the residual-cell base mass ranges in a fixed compact subset of . A Dirichlet process assigns exponential mass to a finite-partition simplex neighborhood
The mixture density is jointly measurable, positive and finite. The Dirichlet normal-mixture density is jointly measurable and normalized
The Gaussian kernel has formula . A positive-variance normal law has its location-scale density
The natural logarithm is differentiable on with derivative . The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t
Proof
Choose with , possible because these compact intervals exhaust . Set , , and . For all large , partition each nondegenerate component of into equal consecutive Borel intervals of lengths in : use pieces for a component of length . Endpoints can be assigned arbitrarily because has a density. The support of a continuous density has no isolated points, so there are no isolated support components to treat. There are coarse cells , each of mass at least . Translate the conditional probability to an interval centered at zero, apply [F2] at scale , and translate back. Multiplying by and summing gives a finite probability with at most atoms in the closures of these cells, each carrying its original coarse-cell label, and . The total weight of atoms with label is exactly .
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 are separated by at least , with weights summing to one, and still number . Let and . These are disjoint partition cells. The base density is bounded above and below on a fixed compact neighborhood of , so eventually. Since , and . Also , so, writing , we have eventually.
Apply [F3] with tolerance to get an event on which and . Its constants can be taken uniform in : in the proof of [F3] the only residual-parameter factors are and a lower bound for the residual power. The gamma ratio is bounded below on the fixed compact interval , and the latter power already has fixed exponent . The remaining constants use only the fixed bound . Finally by the polynomial lower bandwidth bound.
For , the original discrete approximation still satisfies . Indeed the Gaussian convolution identity follows by completing the square and integrating; convolution with a probability kernel contracts the supremum norm by the triangle inequality. Use , , treating equality by the original approximation. Differentiating [F5] gives . Atom relocation by at most therefore changes the mixture by at most . For , replacing each by its mass at costs at most the same derivative bound times ; the weight discrepancies and residual mass cost at most . Consequently, uniformly over and , one has .
For any choose a coarse cell whose closure contains . Its length is at most , so every original atom with that label, and every associated relocated atom-cell, lies in eventually. Let be the set of relocated atom indices carrying a positive fraction of this label's weight. Merging preserves the full label weight, so . The vector discrepancy on implies . On this neighborhood, [F5] is at least for every . Thus . The same argument directly with the coarse-cell mass under gives , after decreasing the constant.
Put and . The mean-value theorem for the logarithm, whose derivative is given by [F6], and steps 4.1, 4.2 give . By [F1], and uniformly in these scales. Adding the bounded log perturbation proves . The inequality similarly gives . All integrals exist by the displayed bounds, and integrands vanish off .
The scale event has fixed probability and is independent of . Therefore times this event is contained in the displayed KL/log-square set and has probability at least . Increase to absorb . Since and , the consequent local-radius form follows as well. This proves all assertions without a unimodality hypothesis.
The posterior excludes large scales and mixing mass far from compact data
Statement
Assume AC. Let be supported on a compact interval with , let for a finite nonzero base measure whose density is bounded below by a positive constant on a neighborhood of , and let be independent with . Put and, for , . Observe IID data from under the location-mixture density . Let with and . Suppose the local KL and log-square prior-mass condition gives a denominator event where . Choose and put , where is the standard normal distribution function. If then the posterior complement of converges to zero in -probability.
Facts & Assumptions
Given: Full AC; compactly supported truth; base density bounded below by a positive constant on a neighborhood of ; the DP normal-mixture model and independent scale prior; the denominator event; and the two displayed asymptotic conditions.
Full AC supplies the DP construction and the directional KL convention. The Axiom of Choice Existence of a Dirichlet process by normalized gamma Poisson random measure Kullback–Leibler divergence
Dirichlet-process posterior update: conditionally on latent IID locations , the posterior law of is .
Dirichlet-process Pólya-urn predictive law: conditionally on all latent locations except , the prior predictive law of is , by exchangeability.
Dirichlet-process posterior update and Dirichlet-process Pólya-urn predictive law: under the posterior , the next latent location has predictive probability ; because its conditional law given is , this is the posterior mean of .
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 with probability tending to one.
A positive-variance normal law has its location-scale density: the latent observation likelihood is .
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: nonnegative likelihood numerators may be integrated in either order.
Markov's inequality for random variables: for a nonnegative random variable and , .
Dirichlet process and Existence of a Dirichlet process by normalized gamma Poisson random measure: is an evaluation-measurable random probability measure with the stated Dirichlet finite-partition laws.
The integral function of a continuous integrand is differentiable with derivative equal to the integrand. The first fundamental theorem: if is integrable on and continuous at , then ; in particular a continuous has as a primitive
Proof
Given: The hypotheses in the Statement.
The latent representation is and independently. Use the test . Its type-I error is zero. Write ; [F9] gives . The normal formula [F5] is even and satisfies , so it decreases on . For fixed and , set . Then . For , , so ; for the inequality reverses and . Thus is maximized at the midpoint, where the component leakage is . Every component with therefore puts probability at least outside , and .
By [F8] the latent DP model is a measurable prior law. Introduce the latent locations . Given these locations, and , the observation likelihood is independent of , so [F1] gives the conditional law . Given this updated , the next latent location has conditional law ; applying [F3] to that predictive draw gives for every Borel set . With , conditional Markov inequality yields
Fix an index and condition on . The latent vector is exchangeable because its conditional law given is IID. Reordering last and applying [F2] shows its prior predictive law given is . Bayes' formula multiplies this measure by the likelihood . Almost surely . On , , so the likelihood numerator is at most . For , the denominator is at least the base-measure contribution because the base density is bounded below near and lies there for all sufficiently large . Consequently where is increasing on .
Let be the likelihood-ratio numerator integrated over . By change of density and [F6], . On the denominator event, [F7] therefore gives, for every ,
Substitute the step 1.3 bound into step 1.2 and use . The resulting upper bound is which tends to zero by , the second premise, and step 2.1. Thus the posterior probability of tends to zero. Combining with step 2.1 proves the sieve-complement claim.
Dirichlet normal-mixture posterior contraction
Statement
Assume AC. Let be a finite-valued probability density on with compact support. Assume and, with the integrands set to zero on , and assume there is such that for all sufficiently small . Here is the root-L2 Hellinger distance of Root-L2 Hellinger distance between density laws, and is the centered normal density with standard deviation . Let , where is a finite nonzero measure with a continuous, strictly positive Lebesgue density on an open interval containing , and independently let on . For , define and observe IID from . Suppose and, for some and , Here means eventually for a fixed constant . For every fixed , put Then for every sufficiently large fixed , in -probability. If is compactly supported in , the middle term may be omitted. The conclusion is only in probability; it supplies no almost-sure contraction or generic minimax-optimality assertion.
Facts & Assumptions
Given: Full AC; the compactly supported smooth truth and displayed smoothness/convolution conditions; the finite DP base measure with its density condition; independent scale law; polynomial bandwidth and scale-tail hypotheses; and an IID sample from .
Full AC supplies the normalized-gamma DP construction and the directional KL convention. The Axiom of Choice Existence of a Dirichlet process by normalized gamma Poisson random measure Kullback–Leibler divergence
Dirichlet process and Existence of a Dirichlet process by normalized gamma Poisson random measure: is a measurable random probability measure with the stated Dirichlet finite-partition laws.
The Dirichlet normal-mixture density is jointly measurable and normalized: is jointly measurable, positive, finite, and integrates to one.
The mixture prior places local KL and log-square mass near a compact smooth truth: for , the local KL and log-square neighborhood has mass at least , with both quantities at most .
KL prior mass gives a posterior denominator lower bound in probability: local KL/log-square mass at least gives, with probability at least , a likelihood denominator at least .
The posterior excludes large scales and mixing mass far from compact data: given that denominator bound, for any compact interval containing the truth, put and . If , for , where is the standard normal distribution function, and , then the posterior complement of vanishes, provided and the DP base density is bounded below near .
The dyadic scale bands satisfy the weighted entropy condition: for a fixed and dyadic scale bands whose sieve satisfies , the weighted entropy condition holds when dominates the displayed first and middle rate terms; for compact scale support it holds with only the first term.
Countably partitioned sieves yield posterior contraction by weighted entropy: local KL/log-square mass, a sieve with vanishing posterior complement, and the weighted countable-band entropy condition imply contraction in the same Hellinger metric at every sufficiently large fixed multiple of the target radius.
Dominated statistical experiments and Likelihood densities: the sampling experiment is dominated by Lebesgue measure, and the supplied jointly measurable mixture densities define its likelihoods.
Root-L2 Hellinger distance between density laws: in the conclusion is the root-L2 Hellinger distance between square-root densities.
Proof
Given: The hypotheses in the Statement.
Put . By [F3], choose so the prior mass is at least on a set where both local quantities are at most . Set . Then the mass is at least and both quantities are at most . By [F4], except on an event of probability at most , the likelihood denominator is at least . Also .
Choose a compact interval containing in its interior and contained in the open interval where the density of is continuous and strictly positive. Such an interval exists because the support is compact; its base density is bounded below on . Put and . The polynomial bandwidth bounds give . Choose with large enough that for some , eventually: integrating the standard normal density on gives the claimed lower bound once . Hence . Set for a fixed sufficiently large , and . We have and : if , use for all large , and otherwise is fixed. Choose with and large enough that . Then . Applying [F5] gives posterior concentration on . Since , the larger sieve also has .
Partition into dyadic scale bands for . Their prior masses are bounded by . Since , [F6] applies at radius and gives For compactly supported , only finitely many bands have positive prior mass and the first rate term suffices.
If is compactly supported, put , and . Since , and . Thus and . Also . Retain from step 1.2: its denominator, leakage bound, and exponential factor do not depend on the target radius, so the hypotheses of [F5] hold with and in place of and . It yields posterior sieve complement convergence for . The compact branch of [F6] supplies the weighted entropy condition at radius using only the first rate term.
The prior is the measurable DP law from [F1], and [F2], [F8] give its jointly measurable density likelihoods. We have , so increasing if necessary ensures ; also . Thus [F3] supplies the local prior-mass condition for [F7]. For general , steps 1.2 and 1.3 provide a sieve with vanishing posterior complement and its weighted entropy condition. If is compactly supported, step 2.1 instead provides these two conditions at radius , and its bound allows to be chosen so . Apply [F7] with local radius and target radius in the general case, or in the compact case. It follows that for every sufficiently large fixed , the posterior outside (respectively ) tends to zero in -probability. Since can be any sufficiently large fixed constant, this proves the stated rates. The measurability and dominated-likelihood requirements are supplied by [F1], [F2], and [F8], and [F9] fixes the conclusion's metric convention.
An interval-mass condition removes the Gaussian-bias logarithm
Statement
Under the hypotheses of Dirichlet normal-mixture posterior contraction, assume additionally that is a finite union of intervals and there are such that for every interval contained in the support. Then the source's sharpened Hellinger contraction rate is If is compactly supported in , 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.
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
With , the local KL and log-square set at radius a constant multiple of has prior mass at least . Interval masses give a log-free local KL neighborhood for the mixture prior
A local set with both quantities at most and mass at least gives a denominator at least except on an event of probability at most . KL prior mass gives a posterior denominator lower bound in probability
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
For a fixed , 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 . The dyadic scale bands satisfy the weighted entropy condition
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
The mixture densities are jointly measurable, positive, finite and normalized. The Dirichlet normal-mixture density is jointly measurable and normalized
Proof
The compact truth in [F1] satisfies the 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 large enough that, with , the local set has both quantities at most and mass at least . By [F3], its denominator is at least with probability tending to one, since .
Let denote the displayed improved rate, omitting its middle term if is compactly supported. Put for a sufficiently large fixed and . Then after increasing , and : use eventually when , while otherwise is fixed. Choose a compact interval containing the truth support in its interior, within the interval on which the base density is positive. Put and . The bandwidth bounds give . Choose with large enough that eventually for some . This follows by integrating the standard normal density over once . Thus .
Choose with and a fixed large enough that . Then , by the inverse-radius bound in step 2.1. With denominator coefficient , all hypotheses of [F4] hold at local radius and location-tail tolerance . It follows that the posterior complement of vanishes in sampling probability: [F4] first gives the smaller location sieve using , and .
Partition into the measurable dyadic scale bands . Their prior masses are bounded by . We have , and matches the tail tolerance in [F5]. Thus [F5] supplies . For compactly supported , its compact branch applies with the first term alone. The preceding steps used only and the retained first term, so they also apply unchanged to this improved compact-scale rate.
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 . Both and diverge, and . Apply [F6] to obtain posterior contraction at every sufficiently large fixed multiple of , in -probability. Absorbing 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.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Subhashis Ghosal and Aad W. van der Vaart, Posterior convergence rates of Dirichlet mixtures at smooth densities, §1.1
- Subhashis Ghosal and Aad W. van der Vaart, Fundamentals of Nonparametric Bayesian Inference, §6.3
- Subhashis Ghosal and Aad W. van der Vaart, Posterior convergence rates of Dirichlet mixtures at smooth densities, Lemma 8
- Subhashis Ghosal and Aad W. van der Vaart, Fundamentals of Nonparametric Bayesian Inference, Lemma 6.13
- Ghosal and van der Vaart, Posterior convergence rates of Dirichlet mixtures at smooth densities (2007), Section 9 and Lemma 4
- Subhashis Ghosal and Aad W. van der Vaart, Posterior convergence rates of Dirichlet mixtures at smooth densities, Lemma 2
- Subhashis Ghosal and Aad W. van der Vaart, Fundamentals of Nonparametric Bayesian Inference, Lemma 6.8
- Subhashis Ghosal and Aad W. van der Vaart, Posterior convergence rates of Dirichlet mixtures at smooth densities, Theorem 5 and proof
- Subhashis Ghosal, Jayanta K. Ghosh and Aad W. van der Vaart, Convergence rates of posterior distributions, Theorem 2.1 and Lemma 8.1
- Subhashis Ghosal and Aad W. van der Vaart, Posterior convergence rates of Dirichlet mixtures at smooth densities, §5 Theorem 6
- Subhashis Ghosal and Aad W. van der Vaart, Fundamentals of Nonparametric Bayesian Inference, §6.3, proof of Theorem 6.6
- Subhashis Ghosal and Aad W. van der Vaart, Posterior convergence rates of Dirichlet mixtures at smooth densities, §9 proof of Theorem 1
- Subhashis Ghosal and Aad W. van der Vaart, Fundamentals of Nonparametric Bayesian Inference, §6.3.1 proof of Theorem 6.6
- Subhashis Ghosal and Aad W. van der Vaart, Posterior convergence rates of Dirichlet mixtures at smooth densities, Lemma 10
- Subhashis Ghosal and Aad W. van der Vaart, Fundamentals of Nonparametric Bayesian Inference, Lemma 6.12
- Subhashis Ghosal and Aad W. van der Vaart, Posterior convergence rates of Dirichlet mixtures at smooth densities, §§6–9
- Subhashis Ghosal and Aad W. van der Vaart, Fundamentals of Nonparametric Bayesian Inference, §6.3.1
- Ghosal and van der Vaart, Posterior convergence rates of Dirichlet mixtures at smooth densities (2007), Theorem 1 and Section 9
- Subhashis Ghosal and Aad W. van der Vaart, Posterior convergence rates of Dirichlet mixtures at smooth densities, §8 Lemma 11
- Subhashis Ghosal and Aad W. van der Vaart, Posterior convergence rates of Dirichlet mixtures at smooth densities, Theorem 1 and complete proof
- Subhashis Ghosal and Aad W. van der Vaart, Fundamentals of Nonparametric Bayesian Inference, Chapter 5 Theorem 5.19 and Chapter 6 Theorem 6.6
- Subhashis Ghosal, The Dirichlet Process, Related Priors and Posterior Asymptotics, §§2.5.2–2.5.3
- Subhashis Ghosal and Aad W. van der Vaart, Posterior convergence rates of Dirichlet mixtures at smooth densities, Theorem 1, equation (2.2), and §9 proof