Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Existence of a Dirichlet process by normalized gamma Poisson random measure

Statement

Assume the Axiom of Choice. Let (X,A) be a standard Borel space and let α be a finite nonzero measure on it. Then there is a measurable random probability measure G whose law on the evaluation sigma-algebra of P(X) is DP(α). For every finite measurable partition (A1,…,Ak), the unnormalized increments are independent with Γ(Aj)∼Gamma⁡(α(Aj),1) when α(Aj)>0, and Γ(Aj)=0 almost surely when α(Aj)=0. Consequently the normalized masses have the finite-partition Dirichlet laws in Dirichlet process. These laws determine the probability law on P(X) uniquely.

The construction uses the Poisson random measure with intensity μ(dx,dt)=α(dx)t−1e−t dton X×(0,∞), and normalizes its weighted projection onto X. It does not assume a gamma-process existence theorem.

Facts & Assumptions

Given: Full AC, a standard Borel space (X,A), and a finite measure α with 0<α(X)<∞.

[A1]

The Axiom of Choice is assumed. The Axiom of Choice.

[A2]

Full AC implies Countable Choice, which is the choice strength required by the local Gamma and Dirichlet normalization interfaces. AC implies DC implies countable choice The Axiom of Countable Choice (ACω).

[F1]

Countable products of standard Borel coordinate spaces admit the consistent product law under AC, and finite products remain standard Borel. The countable discrete space N0 is standard Borel. Assuming the Axiom of Choice, Kolmogorov extension for arbitrary families of standard Borel coordinate spaces Standard Borel spaces Finite products of standard Borel spaces are standard Borel A countable discrete measurable space is standard Borel.

[F2]

A Poisson count with finite mean c has mass e−ccj/j! and mean c, including the degenerate c=0 case. Exposure-parameterized Poisson law Normalization, moments, and generating function of the Poisson count law.

[F3]

Finite product measures satisfy the rectangle product formula, and Tonelli applies to nonnegative functions on their sigma-finite products. For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique Tonelli's theorem for nonnegative measurable functions on a sigma-finite product.

[F4]

Under Countable Choice, the shape-rate Gamma law has density x↦xa−1e−x/Γ(a) at rate 1, normalized for a>0. Shape-rate Gamma distribution The shape-rate Gamma density is normalized.

[F5]

For nonnegative measurable functions, Lebesgue change of variables holds under Countable Choice. A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions.

[F6]

The exponential integral and natural logarithm satisfy ∫0∞e−ctdt=1/c for c>0 and ∫0s(1−v)−1dv=−log⁡(1−s) for s<1. The integral exponential E is the published exponential function The exponential tends to +∞ at +∞ and to 0 at −∞ The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t.

[F7]

A finite complex measure on Rk with an exponential moment is determined by its Laplace transform on a real neighborhood of zero under AC. Uniqueness of a multivariate exponential transform.

[F8]

A countable nonnegative weighted sum of measures is a measure, and each δx is a probability measure. Nonnegative scalar multiples and countable weighted sums of measures are measures The Dirac set function at a point A Dirac set function is a probability measure.

[F9]

For positive Dirichlet parameters, the simplex density is normalized; the one-category law is the point mass at one. Dirichlet distribution, including the one-category case Dirichlet simplex density kernel Dirichlet density normalization by iterated Beta integrals.

[F10]

Finite measures agreeing on a generating pi-system and the whole space are equal by finite-measure uniqueness and Dynkin's pi-lambda theorem. Pi-systems Finite measures agreeing on a generating pi-system and on the whole space are equal Dynkin's pi-lambda theorem.

[F11]

Expectations of measurable functions are integrals against the random element's law. Change of variables for expectation Law or distribution of a random element Expectation of a nonnegative or integrable random variable.

[F12]

Measurability of random elements is tested against the target sigma-algebra, and their laws are probability measures. Random elements and real random variables A measurable function between measurable spaces Probability measures and probability spaces.

[F13]

Finite families of mutually independent random elements have the product joint law. Independent random elements have product joint law.

[F14]

A finite measure is one with finite total mass, and sigma-finiteness is exhaustion by countably many finite-measure sets. Measures on sigma-algebras Finite, sigma-finite, and semifinite measures.

[F15]

A law with the finite-partition Dirichlet conditions, when it exists, is denoted DP(α), and there is at most one such law. Dirichlet process.

[F16]

Monotone convergence passes increasing nonnegative limits through the integral, and dominated convergence applies under an integrable bound. Monotone convergence for the integral Dominated convergence.

[F17]

The Poisson mass formula and the exponential series give E[cN]=eλ(c−1) for c≥0 when N∼Pois⁡(λ). Exposure-parameterized Poisson law The real exponential function and the number e by a power series The exponential addition formula exp⁡(x+y)=exp⁡(x)exp⁡(y).

[F18]

The binomial theorem gives ∑h=0k(kh)ahbk−h=(a+b)k. The binomial theorem in R: (x+y)n=∑k<n+1ι ⁣(nk) xky n−k.

[F19]

The Euler integral defines Γ(a) and is finite and positive for a>0. The real Gamma function by Euler's integral Euler's Gamma integral converges exactly for positive real parameters.

[F20]

Independence means mutual factorization on measurable rectangles. Independent random elements.

[F23]

Every Borel subset of a Polish space, with its trace Borel sigma-algebra, is standard Borel under AC. The set (0,∞) is open in the usual real line, hence Borel; apply [F21]. Borel subspaces admit polish presentations.

Proof

Given: The hypotheses in the Statement.

1.1givenA2F3F6F14F22construct

Put ρ(dt)=t−1e−tdt on (0,∞); [A2] and [F22] make this a measure on the Borel sigma-algebra with a nonnegative density relative to Lebesgue measure, and partition the mark axis into I0=[1,∞) and Im=[1/(m+1),1/m) for m≥1. These disjoint strips cover (0,∞). For m≥1, ρ(Im)≤1/m because t−1≤m+1 and e−t≤1 there, while ρ(Im)≥1/(e(m+1))>0 because t−1≥m, e−t≥e−1, and the interval length is 1/(m(m+1)). Also ρ(I0)≤∫1∞e−tdt<∞ and ρ(I0)≥e−2/2>0 by restricting to [1,2]. Thus every strip has finite positive mass. By [F3] and [F14], μ=α⊗ρ is sigma-finite and μm:=μ∣X×Im has finite positive total λm=α(X)ρ(Im). Let Qm=μm/λm.

2.1A1F1F3F13F20F21F23step 1.1construct

Index count coordinates by m≥0 and mark coordinates by (m,ℓ) with m≥0,ℓ≥1. Their spaces are N0 and X×(0,∞), respectively, hence standard Borel by [F1], [F21], and [F23]. Assign every finite set of coordinates the product of the laws Pois⁡(λm) and Qm. These finite-dimensional laws are consistent because coordinate projections of a finite product recover the corresponding marginal products. By [F1] and [A1] they extend to one probability law. The product rectangle formula gives mutual independence of each finite coordinate family by [F20], and [F13] identifies its joint law with the product. Thus it supports mutually independent Nm∼Pois⁡(λm) and Zmℓ=(Xmℓ,Tmℓ)∼Qm.

3.1F8F12step 2.1construct

Define N=∑m≥0∑ℓ≥11{ℓ≤Nm}δZmℓ. Each Nm is finite, so this is a countable sum of Dirac measures and is a counting measure by [F8]. For every measurable B, its evaluation is the increasing limit of finite sums of measurable functions of the coordinates; hence N(B) is measurable. Thus N is a random counting measure.

3.2F2F17F22step 1.1step 2.1algebra

Fix pairwise-disjoint measurable sets B1,…,Br with μ(Bj)<∞. Within strip m, put qjm=Qm(Bj) and q0m=1−∑j=1rqjm. Conditional on Nm=n, independent marks assign counts (k0,k1,…,kr) with n=k0+⋯+kr. There are n!/∏j=0rkj! assignments of the n mark indices to these cells, and each assignment has probability ∏j=0rqjmkj, so the count vector has mass n!∏j=0rqjmkj/∏j=0rkj! (with 00=1). Summing over k0 and using the Poisson mass in [F2] gives Pr⁡{Nm(Bj)=kj, 1≤j≤r}=e−λm(∏j=1r(λmqjm)kj/kj!)eλmq0m=∏j=1re−μm(Bj)μm(Bj)kj/kj!; here λmqjm=μm(Bj) and λm(1−q0m)=∑jμm(Bj). Thus the strip counts are independent Poisson variables with means μm(Bj). The series over k0 is the exponential series [F17].

3.3F2F3F6F8F11F13F16step 1.1step 2.1

Define Γ(A)=∑m≥0∑ℓ≥11{ℓ≤Nm}Tmℓ1{Xmℓ∈A} for A∈A. This is a measurable nonnegative weighted sum of Dirac measures, hence a measure by [F8]. For each strip, independence of Nm and its marks [F13], expectation against their law [F11], and ENm=λm from [F2] give E∑ℓ=1NmTmℓ1{Xmℓ∈A}=λm∫t1A(x) Qm(dx,dt)=∫A×Imt μ(dx,dt). Monotone convergence [F16] then gives EΓ(A)=∑m∫A×Imt μ(dx,dt)=α(A)∫0∞e−tdt=α(A) by [F3] and [F6].

3.4F2F17F22step 1.1step 2.1algebra

Let A1,…,Ar be pairwise disjoint and choose ∣uj∣<δ<1. On strip m, define gm(x,t)=∑j=1reujt1Aj(x)+1X∖∪jAj(x). Conditional on Nm=n, the independent marks give the exponential factor (∫gm dQm)n. Summing its Poisson series yields Eexp⁡(∑jujΓM(Aj))=exp⁡(∑jα(Aj)∫∪m≤MIm(eujt−1)ρ(dt)), where ΓM sums the first M+1 strips. The mark integral is finite on each strip because the strips are bounded away from zero and uj<1; the Poisson series is [F17].

4.1step 1.1step 2.1step 3.2F2F16F18algebra

For each finite M, the sums over m≤M are independent Poisson counts: convolution and [F18] give ∑h=0ke−aah/h! e−bbk−h/(k−h)!=e−(a+b)(a+b)k/k!, and iteration handles M. By [F16], their increasing total counts have EN(Bj)=lim⁡M→∞∑m≤Mμm(Bj)=μ(Bj)<∞. Thus the full counts are finite almost surely and the truncated integer counts eventually stabilize. Their joint point probabilities converge both to the point probabilities of the full count vector (by eventual stabilization) and to the product Poisson masses with means μ(Bj) (by continuity of the Poisson mass formula in its mean). Hence the full counts are independent Poisson variables with means μ(Bj). Therefore N satisfies Poisson random measure on a standard Borel space.

4.2givenF11F12step 3.3

Since EΓ(X)=α(X)<∞, Γ(X)<∞ almost surely: if it were infinite on a set of positive probability, its expectation would exceed every finite bound. Also, Γ(A) is measurable for every A as a monotone limit of finite coordinate sums.

4.3F3F6F16F22step 1.1step 3.3step 3.4algebra

For u<1, ∫0∞(eut−1)t−1e−tdt=∫0u(1−v)−1dv=−log⁡(1−u): use (eut−1)/t=∫0uevtdv, Tonelli on the positive or negative part, and [F6]. In particular EeδΓ(X)=(1−δ)−α(X)<∞, by monotone convergence [F16] on the nonnegative truncations. For general ∣uj∣<δ, the truncated exponentials are dominated by eδΓ(X); [F16] therefore gives Ee∑jujΓ(Aj)=∏j(1−uj)−α(Aj).

5.1A1A2F3F4F5F7F19step 3.3step 4.3casesalgebra

Let J+={j:α(Aj)>0}. For j∈J+, [F4], [F5], and the Euler integral [F19], with t=(1−u)y, give EeuY=Γ(a)−1∫0∞ya−1e−(1−u)ydy=(1−u)−a for Y∼Gamma⁡(a,1) and u<1. Thus the vector (Γ(Aj))j∈J+ and the product of the corresponding Gamma laws have the same moment-generating transform near zero by step 4.3; [F3] supplies that finite product law, and [F7] identifies the distributions when J+ is nonempty; if J+ is empty this clause is vacuous. For each j∉J+, step 3.3 gives EΓ(Aj)=0. If Γ(Aj)>0 with positive probability, some event {Γ(Aj)≥1/q} has positive probability, forcing its nonnegative expectation to be positive; hence Γ(Aj)=0 almost surely. Since there are finitely many cells, these zero coordinates are simultaneously zero almost surely. Their events in any measurable rectangle have probability zero or one, so adjoining these constants preserves the product law and independence.

6.1A2F5F4F9step 5.1algebra

For a partition with r≥2 positive cells and parameters a1,…,ar, the independent Gamma increments have product density ∏jzjaj−1e−zj/Γ(aj). Change variables to s=∑jzj and pj=zj/s for j<r, with pr=1−∑j<rpj. Its Jacobian has absolute value sr−1: factor s from each of the r−1 proportion columns, then add the first r−1 rows of the remaining matrix to its last row, whose first entry becomes ∑jpj=1 and whose other entries become zero. The inverse map is s=∑jzj, pj=zj/s, so this is a C1 diffeomorphism on the positive orthant and open simplex. The joint density factors as the Gamma(∑jaj,1) density in s times Γ(∑jaj)∏jpjaj−1/∏jΓ(aj) on the simplex. Integrating the normalized Gamma factor in s, which has total mass one by [F4], leaves the second factor as the marginal density of p. By [F9] this is the Dirichlet law. With one positive cell the normalized mass is one, and zero-base cells have zero mass by step 5.1.

7.1givenF8F12step 4.2step 5.1step 6.1chooseconstruct

The total Γ(X) is Gamma(α(X),1) by step 5.1, so it is strictly positive almost surely; step 4.2 gives finiteness. Since α(X)>0, the space X is nonempty; choose x0∈X and set G(A)=Γ(A)/Γ(X) on that probability-one event, assigning δx0 on its null complement. The event is measurable and each evaluation G(A) is measurable, so [F12] makes G a random probability measure with the partition laws from step 6.1.

8.1F10F15step 6.1algebra∎

Finite evaluation cylinders form a generating pi-system for the evaluation sigma-algebra. For any A1,…,As∈A, the nonempty intersections of Ai and Aic form a finite partition, and each G(Ai) is the sum of the corresponding cell masses. Hence its joint law is fixed by step 6.1. Two probability laws with those partition laws therefore agree on the generating pi-system; [F10] gives equality on the entire evaluation sigma-algebra. By [F15], this is uniqueness of DP(α).

Depends on

Used by

Dependency tree · two levels

247 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