Alphabeta Math
Pipeline-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.

Dirichlet-process priors and finite-partition updates — Examples

1 · Prerequisites

2 · Summary

The examples compute a finite-partition posterior and Pólya-urn draws, then separate a base-null observation event from the version choice of a data-indexed posterior kernel. A diffuse base may give every fixed singleton zero predictive mass while the usual update formula remains a valid measurable posterior version.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Finite-partition posterior and Pólya-urn draws

Example

Assume AC. Let X={a,b,c} with its discrete sigma-algebra and base masses α({a})=2, α({b})=1, and α({c})=1. For G∼DP(α), consider two conditionally IID draws with observed values X1=a, X2=b.

Facts & Assumptions

Given: The finite space and base measure in the Example.

[A1]

Assume AC, as required by the normalized-gamma and posterior results. The Axiom of Choice.

[F1]

The finite-partition masses under DP(α) have the Dirichlet law. Dirichlet process Existence of a Dirichlet process by normalized gamma Poisson random measure.

[F2]

After data with cell counts yj, the finite-partition posterior is Dirichlet with parameters αj+yj. Dirichlet-process posterior update.

[F3]

The next-draw probability in a measurable cell is its base mass plus its observed count, divided by total base mass plus sample size. Dirichlet-process Pólya-urn predictive law.

[F4]

Every nonempty finite discrete space is standard Borel. Dirac set functions are probability measures; finite nonnegative weighted sums of them are measures. A countable discrete measurable space is standard Borel A Dirac set function is a probability measure Nonnegative scalar multiples and countable weighted sums of measures are measures.

Verification

Given: The specified three-cell partition, its base masses, and the observed cell sequence (a,b).

1.1A1F1F2F4given

The nonempty finite discrete space X is standard Borel by [F4]. Define α=2δa+δb+δc, equivalently α(B)=21B(a)+1B(b)+1B(c). By [F4] it is a measure with total mass 4, hence finite and nonzero, so [F1] and [F2] apply. The prior vector (G({a}),G({b}),G({c})) has law Dirichlet⁡(2,1,1) by [F1]. The observed counts are (1,1,0), so [F2] gives posterior Dirichlet⁡(3,2,1), whose parameters sum to 6.

2.1F3step 1.1algebra

Applying [F3] after the two observations gives next-draw probabilities 3/6=1/2 for a, 2/6=1/3 for b, and 1/6 for c; they sum to one.

3.1F3algebra∎

Before any draw, [F3] gives Pr⁡(X1=a)=2/4=1/2. After observing X1=a, the same rule gives Pr⁡(X2=a∣X1=a)=3/5. Therefore Pr⁡(X1=a,X2=a)=(1/2)(3/5)=3/10: the first draw increases the next draw's mass for its cell from 2/4 to 3/5.

ExampleConstruction: AI-adaptedVerification: AI-adaptedOpen item page →

A base-null observation is a prior-predictive null fiber

Example

Assume AC. Let X={a,b} with the discrete sigma-algebra and let α=δa, so α({b})=0. In the model G∼DP(α) and X1∣G∼G, examine the data event {X1=b}.

Separately, let (Y,B) be any standard Borel space, let γ be a finite nonzero diffuse measure (meaning γ({z})=0 for every z∈Y), and fix one y∈Y. The verification also checks the posterior-version freedom on this fixed singleton data fiber.

Facts & Assumptions

Given: The finite space and base measure in the Example.

[A1]

Assume AC, as required by the process existence and posterior results. The Axiom of Choice.

[F1]

A cell with zero base mass has G-mass zero almost surely under DP(α). Dirichlet process Existence of a Dirichlet process by normalized gamma Poisson random measure.

[F2]

Under AC, for every finite nonzero base measure γ on a standard Borel space, the normalized-Gamma theorem defines DP(γ) and the one-observation posterior update gives the measurable kernel z↦DP(γ+δz) satisfying disintegration. Existence of a Dirichlet process by normalized gamma Poisson random measure Dirichlet-process posterior update Bayesian posterior as a regular conditional law.

[F3]

Under AC, in a one-draw model on a standard Borel space with finite nonzero base measure β, Pr⁡(X1∈A)=β(A)/β(X) for every measurable A. Dirichlet-process Pólya-urn predictive law.

[F4]

In a standard Borel space every singleton is measurable: under a Polish presentation it corresponds to a closed singleton. Standard Borel spaces.

[F5]

A probability kernel has probability-measure sections and measurable evaluations; its disintegration identity is checked on measurable rectangles. Measure kernel and probability kernel Probability measures and probability spaces Bayesian posterior as a regular conditional law.

[F6]

Every nonempty finite discrete space is standard Borel. Dirac set functions are probability measures; A countable discrete measurable space is standard Borel A Dirac set function is a probability measure.

Verification

Given: The finite two-point model in the Example and, separately, the standard Borel diffuse-base model (Y,B,γ) with fixed y∈Y.

1.1A1F1F3F6givenalgebra

The nonempty two-point discrete space X is standard Borel by [F6], and α=δa is a probability measure by [F6], hence a finite nonzero base measure of total mass 1. Thus [F1] applies: G({b})=0 almost surely. Since Pr⁡(X1=b∣G)=G({b}), integration over the prior gives Pr⁡(X1=b)=0, also agreeing with [F3].

2.1F2step 1.1construct

The formula in [F2] assigns K(b)=DP(δa+δb) at the null data value. Define another kernel by K′(a)=K(a) and K′(b)=DP(δa). Both sections are probability measures, and K′ is measurable because {b} is measurable in the discrete data space. For any measurable event C in P(X), the disintegration integrals for K and K′ differ only at b, which has data-marginal mass zero by step 1.1. Thus both are posterior versions; the update formula at b is a version choice, not evidence-supported learning.

3.1F2F3F4F5algebraconstruct∎

In the separate diffuse-base model, [F3] gives data-marginal mass M({y})=γ({y})/γ(Y)=0. Let K(z)=DP(γ+δz) be the posterior kernel from [F2] and set K′(z)=K(z) for z≠y, K′(y)=DP(γ). By [F4], {y} is measurable. For every measurable C⊆P(Y), z↦K′(z,C)=1Y∖{y}(z)K(z,C)+1{y}(z)DP(γ)(C) is measurable; each section is a probability measure, so [F5] makes K′ a probability kernel. The disintegration integrals for K and K′ agree on every measurable rectangle because the kernels differ only on {y} and M({y})=0. Thus K′ is also a posterior version, proving that the displayed update value at this fixed null fiber is not uniquely determined.

Sources