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
- 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
- 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
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Density Separability and Convolution in Lᵖ
- 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
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- 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
- 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
- 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
- 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
- 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 Laws and Series of Independent Random Variables
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
Finite-partition posterior and Pólya-urn draws
Example
Assume AC. Let with its discrete sigma-algebra and base masses , , and . For , consider two conditionally IID draws with observed values , .
Facts & Assumptions
Given: The finite space and base measure in the Example.
Assume AC, as required by the normalized-gamma and posterior results. The Axiom of Choice.
The finite-partition masses under have the Dirichlet law. Dirichlet process Existence of a Dirichlet process by normalized gamma Poisson random measure.
After data with cell counts , the finite-partition posterior is Dirichlet with parameters . Dirichlet-process posterior update.
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.
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 .
The nonempty finite discrete space is standard Borel by [F4]. Define , equivalently . By [F4] it is a measure with total mass , hence finite and nonzero, so [F1] and [F2] apply. The prior vector has law by [F1]. The observed counts are , so [F2] gives posterior , whose parameters sum to .
Applying [F3] after the two observations gives next-draw probabilities for , for , and for ; they sum to one.
Before any draw, [F3] gives . After observing , the same rule gives . Therefore : the first draw increases the next draw's mass for its cell from to .
A base-null observation is a prior-predictive null fiber
Example
Assume AC. Let with the discrete sigma-algebra and let , so . In the model and , examine the data event .
Separately, let be any standard Borel space, let be a finite nonzero diffuse measure (meaning for every ), and fix one . 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.
Assume AC, as required by the process existence and posterior results. The Axiom of Choice.
A cell with zero base mass has -mass zero almost surely under . Dirichlet process Existence of a Dirichlet process by normalized gamma Poisson random measure.
Under AC, for every finite nonzero base measure on a standard Borel space, the normalized-Gamma theorem defines and the one-observation posterior update gives the measurable kernel satisfying disintegration. Existence of a Dirichlet process by normalized gamma Poisson random measure Dirichlet-process posterior update Bayesian posterior as a regular conditional law.
Under AC, in a one-draw model on a standard Borel space with finite nonzero base measure , for every measurable . Dirichlet-process Pólya-urn predictive law.
In a standard Borel space every singleton is measurable: under a Polish presentation it corresponds to a closed singleton. Standard Borel spaces.
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.
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 with fixed .
The nonempty two-point discrete space is standard Borel by [F6], and is a probability measure by [F6], hence a finite nonzero base measure of total mass . Thus [F1] applies: almost surely. Since , integration over the prior gives , also agreeing with [F3].
The formula in [F2] assigns at the null data value. Define another kernel by and . Both sections are probability measures, and is measurable because is measurable in the discrete data space. For any measurable event in , the disintegration integrals for and differ only at , which has data-marginal mass zero by step 1.1. Thus both are posterior versions; the update formula at is a version choice, not evidence-supported learning.
In the separate diffuse-base model, [F3] gives data-marginal mass . Let be the posterior kernel from [F2] and set for , . By [F4], is measurable. For every measurable , is measurable; each section is a probability measure, so [F5] makes a probability kernel. The disintegration integrals for and agree on every measurable rectangle because the kernels differ only on and . Thus is also a posterior version, proving that the displayed update value at this fixed null fiber is not uniquely determined.
Sources
- Thomas S. Ferguson, A Bayesian Analysis of Some Nonparametric Problems, 1973, Sections 2 and 3
- Günter Last and Mathew Penrose, Lectures on the Poisson Process, 2017, Chapter 1
- Thomas S. Ferguson, A Bayesian Analysis of Some Nonparametric Problems, 1973, Section 3
- Günter Last and Mathew Penrose, Lectures on the Poisson Process, 2017, Chapter 3