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.
Posterior propriety and dominated Bayes formula — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Areas of Elementary Plane Figures
- Bayesian models, priors, and posterior laws
- Binary Operations, Monoids, Groups and Subgroups
- Compactness
- Compactness in Metric Spaces
- 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
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Domination and Likelihood Ratios
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- 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
- 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
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- 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
- Statistical Experiments, Models and Identifiability
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Radon Nikodym Theorem and Lebesgue Decomposition
- 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 ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
2 · Summary
A finite model illustrates a valid positive evidence normalizer. A separate finite dominated model has a prior-predictive null fiber, where the quotient is undefined and a conditional-law version supplies only a filler value. With a flat Lebesgue prior, at least one known-variance normal observation yields a proper normal posterior; the improper Beta(0,0) prior instead has an infinite binomial posterior normalizer at either all-failure or all-success data. The last two examples are fiberwise updates under sigma-finite improper priors and make no prior-predictive probability claim.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A finite model with positive finite evidence
Example
Take with its full power-set sigma-algebra and prior masses and . Let the observation space be with its full power-set sigma-algebra and counting measure. At parameter , assign probabilities to ; at parameter , assign probabilities to . For the observed value , the evidence is positive and finite, and the posterior gives equal mass to and .
Facts & Assumptions
Evidence normalizer and fiberwise posterior update: for a fixed observation, and the fiberwise update divides the unnormalized measure by only when that value is finite and positive.
Fiberwise posterior propriety is equivalent to finite positive evidence: a finite positive evidence normalizer gives a probability update after division by that normalizer.
Given: The finite parameter space, prior, observation probabilities, and observed value in the Example.
Verification
The prior has total mass , and both conditional probability vectors sum to one. The likelihood at is and , so the evidence is .
The unnormalized masses are at and at . Dividing each by gives posterior mass at each point, a probability update by [F2].
A prior-predictive null fiber has no quotient posterior
Example
Let have its full power-set sigma-algebra and prior mass at each point. Let the data space be with its full power-set sigma-algebra and counting measure. Conditional on , the observation is with probability one; conditional on , it is with probability one. The sampling kernel has density and ; it is jointly measurable on these finite power-set spaces. Then , so the quotient formula is undefined at ; the prior-predictive probability of that observation is zero.
Facts & Assumptions
Evidence normalizer and fiberwise posterior update: at a fixed data value, the evidence is the integral of the nonnegative likelihood section against the prior measure, and a quotient update is defined only for finite positive evidence.
Fiberwise posterior propriety is equivalent to finite positive evidence: zero evidence cannot be made into a probability by finite positive scaling.
Bayes formula for dominated kernels: for a proper prior and a jointly measurable normalized sampling-kernel density, the evidence is the data marginal density; the kernel uses the quotient where and the prior as the stated filler where or . The filled fibers have zero prior-predictive marginal mass.
Given: The finite prior, data space, conditional laws, and likelihood density specified in the Example.
Verification
The likelihood sections are normalized: , , and all other parameter-data pairs have likelihood zero. Therefore , , and .
By [F3], the prior-predictive mass at is times its counting measure, hence zero. At this fiber every numerator is also zero, so the displayed quotient is and is not defined; the theorem's chosen filler is . This filler is a version value on a prior-predictive null event, not an update inferred from the observation.
A flat prior gives a proper known-variance normal-mean posterior
Example
Let , let the observed real values be , and let the known variance be , with . The parameter space is with Lebesgue measure . Equip the data space with the finite product of and the recursively defined product measure . For each parameter , define the one-observation law by the density relative to and take the -observation sampling law to be the product of these one-coordinate laws. Its likelihood density at is . Take the flat prior measure on . Writing , the evidence is finite and positive, and the fiberwise posterior has Lebesgue density Its restriction to Borel sets is the normal law .
Facts & Assumptions
The Axiom of Choice: the Axiom of Choice is assumed for the stated choice-dependent Lebesgue-measure, standard-normal, and change-of-variables suppliers.
Evidence normalizer and fiberwise posterior update: the fiberwise update divides the likelihood section times the prior measure by its evidence only on a finite positive fiber.
Fiberwise posterior propriety is equivalent to finite positive evidence: a finite positive evidence normalizer yields a probability after division by that normalizer.
Lebesgue measure is sigma-finite, and every metrically bounded subset of has finite outer measure: assuming countable choice, Lebesgue measure on is sigma-finite, and the boxes have measure and cover the space.
Measures are monotone: if are measurable, then .
The standard normal density has total mass one: under the Axiom of Choice, is positive and Borel measurable with .
AC implies DC implies countable choice: the Axiom of Choice implies the Axiom of Countable Choice.
A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions: under countable choice, a diffeomorphism between open Euclidean sets obeys the change-of-variables formula for every nonnegative Lebesgue-measurable integrand.
The product sigma-algebra and its finite iterates: the finite product sigma-algebra is defined recursively from measurable rectangles.
The product measure of two sigma-finite measure spaces: for sigma-finite factors, the product measure is defined by integrating section measures.
For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique: for sigma-finite factors, the product measure exists, satisfies the rectangle formula, and is sigma-finite.
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: a nonnegative product-measurable function on a sigma-finite product has equal iterated and product integrals.
Continuous functions on Euclidean spaces are Borel measurable: under countable choice, a continuous map between finite-dimensional Euclidean spaces is Borel measurable.
The Borel sigma-algebra of a topological space: is the sigma-algebra generated by the open subsets of .
Standard normal and normal laws: has density and for is the pushforward of by .
Assuming countable choice, every Borel subset of is Lebesgue measurable: under countable choice, every Borel subset of a Euclidean space is Lebesgue measurable.
The indefinite integral of a nonnegative measurable function is a measure: the set function is a measure for every nonnegative measurable .
Probability measures and probability spaces: a probability measure is a measure of total mass one.
Given: The model and data in the Example, the Axiom of Choice, and Lebesgue measure on the indicated real spaces.
Verification
By [A1] and [F6], countable choice is available for [F3]. The boxes have finite measure and cover by [F3], so is sigma-finite. Since , [F4] gives for every , hence and the flat prior is improper.
Fix and set . This is a diffeomorphism of with inverse and . The formula for is continuous in , hence Borel by [F12] and Lebesgue measurable by [F15]. Since is also Lebesgue measurable by [F5, F15], [F7] gives . The set function is a measure by [F16], and its total mass one makes it a probability by [F17]. For a Borel , apply [F7] to and : since and [F14] defines as this affine pushforward. Thus each coordinate law has the stated density.
Put . Expanding and using gives . Hence . This is continuous in , hence Borel by [F12] and -measurable by [F15]; therefore its evidence integral is defined by [F1].
For , recursively form the finite product data measure on using [F8] and [F9]. Starting from the sigma-finite , [F10] ensures that each exists and is sigma-finite. The coordinate projections are measurable by [F8], so each pullback of is measurable by step 1.2; finite multiplication is continuous, making product-measurable. Step 1.2 gives . If , the recursive product definition and Tonelli [F11] give . Thus is a measure by [F16] and a probability by [F17]. For measurable rectangles , repeated Tonelli gives . The product measure theorem [F10], iterated over the finite factors, identifies as the product of the one-coordinate laws. Therefore these coordinates are independent and is their joint density.
Set , a diffeomorphism of with inverse and derivative . Since is nonnegative and Lebesgue measurable by [F5, F15], [F7] gives . Integrating the factorization in step 1.3 against the flat prior gives , which is strictly positive and finite for every finite data vector.
Dividing step 1.3 by the finite positive evidence in step 2.2 gives , the displayed Lebesgue density. Put ; is a diffeomorphism with inverse . For every Borel , [F14] defines as this pushforward; [F7] applied to , which is Lebesgue measurable by [F12, F13, F15], gives The update on the full Lebesgue sigma-algebra is a probability by [F2]. If were allowed, its empty-product likelihood would be and the evidence would be by step 1.1, so no normalized update would exist.
The improper Beta(0,0) prior has a divergent binomial endpoint posterior
Example
Let and suppose for , equipped with the restricted Lebesgue sigma-algebra . Use the prior measure with density relative to Lebesgue measure restricted to : Equivalently, for an observed count the likelihood is . For an observed count , the posterior normalizer diverges as ; for , it diverges as . In either endpoint case, this likelihood and prior do not define a posterior probability by normalization.
Facts & Assumptions
Evidence normalizer and fiberwise posterior update: a fiberwise update is defined only when its likelihood integral against the prior is finite and positive.
Fiberwise posterior propriety is equivalent to finite positive evidence: when the normalizer is infinite, no finite positive constant makes the integrated likelihood a probability measure.
The Axiom of Choice: the Axiom of Choice is assumed only to obtain the countable-choice premise used by the Lebesgue-measure, box-measure, and Borel-measurability suppliers.
Finite, sigma-finite, and semifinite measures: a measure is sigma-finite if the space is a countable union of measurable sets of finite measure.
A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included: assuming countable choice, each interval with finite endpoints is Lebesgue measurable and has measure its length.
The indefinite integral of a nonnegative measurable function is a measure: for a nonnegative measurable density, integration over measurable sets defines a measure.
Monotonicity and nonnegative homogeneity of the nonnegative integral: the nonnegative integral is monotone and homogeneous for finite positive scalars.
AC implies DC implies countable choice: in particular, the Axiom of Choice implies countable choice.
For every in a complete ordered field there is a natural with : for every there is an integer with .
The Borel sigma-algebra of a topological space: the Borel sigma-algebra is generated by the open sets.
Assuming countable choice, every Borel subset of is Lebesgue measurable: assuming countable choice, every Borel subset of is Lebesgue measurable.
Lebesgue measure is sigma-finite, and every metrically bounded subset of has finite outer measure: under countable choice, Lebesgue measure on is sigma-finite.
Given: An integer , a count , the binomial likelihood, and the prior measure in the Example.
Verification
By [A1] and [F7], countable choice is available for [F3], [F4], [F10], and [F11]. Write on . For any continuous and open , continuity makes open in the subspace , so for some open . This intersection is open in , hence Borel by [F9] and Lebesgue measurable by [F10]. Thus is measurable for the restricted Lebesgue sigma-algebra. This applies to and to every binomial likelihood section, which is a polynomial. By [F11], Lebesgue measure on is a measure; its restriction to the measurable interval is a measure as well. Thus [F5] defines the prior measure . For each , let ; by [F8] choose with . Then and , so these sets cover . On , . Their Lebesgue lengths are at most one by [F4], so homogeneity and monotonicity [F6] give ; [F3] makes this a sigma-finite prior. It is not finite: on each disjoint interval , , one has and by [F4]. Homogeneity and monotonicity [F6] give . By [F5], is a measure, so the prior mass of the union of the first such intervals is at least for every . Hence and the prior is improper.
For , put ; it is a measure by [F5], and by [F1]. The likelihood is , so on each from step 1.1, gives . Also by step 1.1. Monotonicity and homogeneity [F6] therefore give . The intervals are pairwise disjoint, so measure additivity gives ; since this union is contained in , countable additivity gives for every . Thus and [F1] leaves the quotient undefined.
For , put ; it is a measure by [F5], and by [F1]. Here . On each reflected interval , , one has , so . Also there and by [F4], so by [F6]. Monotonicity and homogeneity [F6] give . The intervals are pairwise disjoint, and additivity followed by nonnegativity on their complement gives for every . Thus and [F1] leaves this quotient undefined. By [F2], neither endpoint fiber admits a normalized posterior probability.