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.
Bayesian models, priors, and posterior laws — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Bayesian models, priors, and posterior laws
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- 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
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Infinite Product Measures and Kolmogorov Extension
- Lebesgue-Stieltjes Measures and Distribution Functions
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Loss, Risk and Decision Theory
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- 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
- Polynomial Rings, the Division Algorithm and Roots
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- 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
- Standard-Borel Real Codings and Determining Classes
- Statistical Experiments, Models and Identifiability
- Subspaces, Products, and Quotients
- Suprema and Infima
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Lebesgue Integral and the Convergence Theorems
- The Topology of Euclidean Space
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
2 · Summary
The examples compute a finite posterior and show why a null-data posterior version is not unique; realize a posterior RCD as a sample-point-indexed random probability measure; construct a standard-Borel posterior kernel for countable data; and verify the dominated-density formula on a nonstandard-Borel observation space. The last example uses a separate, choice-free construction and does not rely on standard-Borel factorization.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A finite Bayesian update and a null-data posterior version
Example
Let with prior , and let have its power-set sigma-algebra. Given , assign probabilities to ; given , assign probabilities . The posterior probability of is after data and after data . Data value has prior-predictive probability zero, so two versions may assign different posterior laws there.
Facts & Assumptions
Given: The finite parameter and data spaces and the prior and sampling probabilities specified in the example.
A proper Bayesian model consists of a prior probability and a parameter-measurable sampling probability kernel. Bayesian model as a prior and sampling kernel
A data-indexed posterior kernel satisfies the rectangle conditional-law identity; its values on prior-predictive null data may vary by version. Bayesian posterior as a regular conditional law
A proper prior and sampling kernel define the joint law by . A prior and model kernel define a joint law
Verification
Given: The assumptions and finite model in the example.
The joint masses are , , , and , while both masses at data are zero. Therefore , , and .
Define , , and choose any probability law for ; set . Each is a probability, and measurability is automatic on the finite power-set data space. The displayed ratios give and ; subtraction from the marginal gives the same identities for parameter value .
For any and , summing the singleton identities in step 2.1 over gives ; the zero-mass term at contributes zero for every choice of . Thus every such kernel is a data-indexed posterior version by [F2]. In particular, and , with the same values at , are distinct versions of the same posterior law.
A Bayesian posterior RCD indexed by the sample point
Example
Let , give each parameter prior probability , and set when and otherwise. On the canonical joint space , the posterior RCD is the random probability measure , where and . The RCD is evaluated at a sample point ; the data-indexed version is the separate kernel .
Facts & Assumptions
Given: The finite model and the canonical joint probability specified in the example.
A proper Bayesian model supplies a prior probability and a parameter-measurable sampling probability kernel. Bayesian model as a prior and sampling kernel
A posterior RCD is indexed by the sample point, while a data-indexed posterior is a kernel on the data space whose composition with satisfies the conditional-law identity. Bayesian posterior as a regular conditional law
The prior and sampling kernel define the joint probability on the product space. A prior and model kernel define a joint law
Verification
Given: The assumptions and finite model in the example.
The joint law assigns mass to each diagonal point and to each off-diagonal point; hence .
For each , has masses at and at , so it is a probability, with and . Define . Since the spaces are finite, both and are measurable for every .
Every event is for some . For any , . Thus is an RCD of given , and by [F2] it is the posterior RCD.
A dominated posterior on a nonstandard-Borel observation space
Example
Let the data set be a disjoint union of three uncountable sets, with sigma-algebra consisting of all unions of these three atoms and reference probability . This measurable space is not standard Borel: distinct points of cannot be separated by a measurable set, whereas every standard-Borel space separates distinct points. Let have prior probabilities . With respect to , use sampling densities and . The dominated formula gives posterior mass on , on , and the prior filler on the zero-evidence atom .
Facts & Assumptions
Given: The measurable data space, reference probability , finite parameter space, prior, and sampling densities specified in the example.
The proper model is a prior probability together with a parameter-measurable sampling probability kernel. Bayesian model as a prior and sampling kernel
The posterior is a conditional law; a data-indexed posterior version must satisfy the rectangle identity. Bayesian posterior as a regular conditional law
A proper prior and a sampling kernel with a specified jointly measurable density against a sigma-finite data measure have the displayed posterior kernel on fibres where the marginal density is finite and positive. The formula fills zero or infinite marginal-density fibres with the prior and does not require a standard-Borel data space. Bayes formula for dominated kernels
A standard-Borel space is measurably isomorphic to a Polish space. Standard Borel spaces
In a Polish space the topology is induced by a metric, so singleton sets are closed and Borel. Polish spaces are separable completely metrizable spaces
The product sigma-algebra contains measurable rectangles; on the finite parameter space, simple functions constant on such rectangles are jointly measurable. The product sigma-algebra and its finite iterates
Verification
Given: The assumptions and finite model in the example.
The eight unions of form a sigma-algebra. Assigning mass to each disjoint atom defines a probability measure : a pairwise disjoint family has at most three nonempty members, so countable additivity reduces to finite additivity on the atoms. Distinct have the same membership in every measurable set. If were standard Borel, [F4] would give a bimeasurable bijection to a Polish space. Let be a compatible metric. For every , the ball about of radius misses , so is closed and Borel. Its inverse image under would be a measurable set separating and , a contradiction.
The joint density is , a finite sum of indicators of measurable rectangles by [F6]. Its parameter sections are , with integrals and . Thus the sections define sampling probabilities, and the finite reference measure is sigma-finite, so [F3] applies.
The marginal density is , hence on , on , and on . Thus , , and . The normalized formula gives on and on ; on the theorem fills the zero-evidence fibre with the prior, so .
For , the rectangle identities on are , , and . For they are , , and . Adding over atoms gives the identity for every and , so this is a data-indexed posterior kernel despite the nonstandard-Borel data space.
A standard-Borel posterior kernel for countable data
Example
Let have prior probabilities , and let the data space be with its power-set sigma-algebra. For , set and . These are two geometric sampling laws. The prior-predictive mass is , and a data-indexed posterior is
Facts & Assumptions
Given: AC, the finite parameter space, prior, and countable data model in the example.
The Axiom of Choice (AC), as required by the general standard-Borel RCD route. The Axiom of Choice
The prior probability and sampling kernel define the proper Bayesian model. Bayesian model as a prior and sampling kernel
A data-indexed posterior kernel is a probability kernel whose composition with the observation is a posterior RCD. Bayesian posterior as a regular conditional law
When both the parameter and data spaces are standard Borel, the posterior RCD factors through the data coordinate as a measurable posterior kernel. Standard-Borel Bayesian posterior kernel exists
For , the geometric series satisfies . For , , and for the series diverges
A standard-Borel space is measurably isomorphic to a Polish space. Standard Borel spaces
A Polish space is a separable space whose topology is induced by a complete metric. Polish spaces are separable completely metrizable spaces
Verification
Given: The assumptions and countable model in the example.
The discrete metric on is complete because every Cauchy sequence is eventually constant; itself is a countable dense subset. Its topology is discrete, so its Borel sigma-algebra is the power set. The finite discrete parameter space has the same properties. Thus both spaces are standard Borel by [F5]–[F6]. By [F4], and , so they define probability sampling laws and the prior in [F1] gives a Bayesian model.
Since both spaces are standard Borel and AC holds, [F3] supplies a data-indexed posterior kernel. For every , both and are positive and finite, so and the displayed values are in and sum to one. Every function on the discrete data space is measurable, hence is a probability kernel.
For and every , . Adding the identities for proves the rectangle identity for every and every data event . Thus the explicit kernel is a data-indexed posterior version; all its data values have positive prior-predictive mass.
Sources
- Alicia A. Johnson, Miles Q. Ott, and Mine Dogucu, Bayes Rules!, Chapter 2 §§2.1.1–2.1.4
- Andrew Gelman, John B. Carlin, Hal S. Stern, David B. Dunson, Aki Vehtari, and Donald B. Rubin, Bayesian Data Analysis, 3rd ed., Chapter 1 §1.3
- Alicia A. Johnson, Miles Q. Ott, and Mine Dogucu, Bayes Rules!, Chapter 2 §§2.3.1–2.3.6