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.
Likelihood potentials and posterior propriety — Examples and Counterexamples
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
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- Conjugate families and Gaussian conditioning
- 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
- Determinants of Matrices over a Commutative Ring
- 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
- Fubini and Change of Variables
- Function-space priors and sample regularity
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Inverse maps, identifiability, and stability
- Lebesgue Measure on Euclidean Space
- Lebesgue-Stieltjes Measures and Distribution Functions
- Likelihood potentials and posterior propriety
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- 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
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- 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
- Rejection sampling
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- 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
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- 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 Logarithm and General Powers
- 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 · Logical flowchart
3 · Definitions, theorems and proofs
None yet.
4 · Examples, counterexamples and false statements
A proper Gaussian likelihood gives a proper posterior
Example
Assume the Axiom of Choice. Let with its usual real Banach norm, let with the Borel subspace structure, and let the forward map be . Give the parameter the Borel probability for Borel . Let the data space be with its usual metric and Borel sigma-algebra. Conditional on , let the observation have law , with Lebesgue density
and likelihood potential . For every ,
and the normalized update on is
This is a data-indexed posterior-kernel version for the prior-predictive model; its values on any measurable data-marginal-null set may be changed without changing the conditional-law identities.
Example references
The likelihood-potential evidence and its normalized fiberwise update.
A common lower envelope and continuity at a support point imply positive finite evidence.
A forward map is defined on an admissible truth set.
The prior is a Borel probability concentrated on the stated forward domain.
A proper Bayesian model consists of a probability prior and a probability sampling kernel.
A normal law has its location-scale density for positive variance.
Conditional-kernel values on a measurable data-marginal-null set may be changed.
Dashti and Stuart, §3.2 and §4.1, full lecture notes
Latz, §2.2, Theorem 2.5 and its proof in Appendix B (printed p. 23), full paper
Facts & Assumptions
Given: AC; , , the identity forward map, the stated two-atom prior, the observation law and its displayed Lebesgue density, and its likelihood potential.
AC is the assertion that every family of nonempty sets has a choice function. The Axiom of Choice
Under AC, is the affine image of and for has Lebesgue density . Standard normal and normal laws, A positive-variance normal law has its location-scale density
AC implies countable choice. AC implies DC implies countable choice
Lebesgue measure on is sigma-finite under countable choice. Lebesgue measure is sigma-finite, and every metrically bounded subset of has finite outer measure
A proper Bayesian model has a probability prior and a parameter-measurable probability sampling kernel. Bayesian model as a prior and sampling kernel
For the displayed common lower envelope and continuity assumptions, the evidence is finite and strictly positive, and the normalized fiberwise update is a probability. Function-space posterior propriety from a common lower envelope
For a proper prior and a jointly measurable sampling density over a sigma-finite dominating measure, the data marginal has density and the filled normalized kernel is a conditional law. Bayes formula for dominated kernels
Replacing a data-indexed conditional kernel on a measurable data-marginal-null set preserves its conditional identities. Conditional law given a random element
A prior on a forward domain is a Borel probability on with full measure on . A Borel prior concentrated on a forward-map domain
An inverse-problem forward map has metric parameter and data spaces, a nonempty admissible truth set , and a map . Inverse-problem models and solution classes
A probability kernel has probability sections at every parameter and measurable evaluations. Measure kernel and probability kernel
Every real square is nonnegative and for every real . Squares of nonzero elements are positive, Basic properties of the absolute value
A nonnegative simple function has its simple integral, and that equals its nonnegative integral. The integral of a nonnegative simple function, The nonnegative integral agrees with the simple integral on simple functions
Joint measurability uses the product sigma-algebra, and measurability is defined by measurable preimages. The product sigma-algebra and its finite iterates, A measurable function between measurable spaces
At a fixed datum, evidence is the prior integral of the likelihood section and the normalized update is defined only at positive finite evidence. Misfit evidence and the potential posterior law
The natural logarithm has domain and satisfies for every (The natural logarithm as the inverse of the exponential function).
For all real , (The exponential addition formula ).
In the complete ordered field , every nonnegative real has a unique nonnegative square root (Square roots exist: a unique with ; the positives are ).
For every real , and (The exponential is positive and satisfies ).
Verification
Given: The hypotheses and conventions in the Statement.
The set is Borel and nonempty. The function is countably additive: in a disjoint sequence of Borel sets each of the two points occurs at most once, so the sum of assigned masses equals the mass of the union. Also and , making it a prior on the stated domain by [F8]. The identity is measurable because every subset of finite is Borel, and it satisfies the forward-map interface [F9].
For any and , put ; since occurs in the real-valued potential, [F15] gives . Put and . By [F15], . By [F16], ; by [F18], . Thus uniqueness of the nonnegative square root [F17] gives , and [F18] gives . Applying [F16] again, . The last expression is the displayed Gaussian density, so the likelihood and potential agree pointwise.
By [A1] and [F1], each is a probability law with the displayed density; since is finite, every evaluation is measurable, so [F10] gives a probability kernel. By [F2] and [F3], Lebesgue measure is sigma-finite. The potential and likelihood are jointly Borel: for each of the two values their data sections are continuous, each singleton is Borel in , and each preimage of a Borel set is a finite union of rectangles in by [F13]. Thus [F4] gives a proper Bayesian model with the stated prior and sampling kernel.
The finite subspace is discrete: the open balls of radius about and isolate the two points, so every real-valued function on is continuous. For every and , is finite. By [F11], and for , so where . The constant envelope is Borel, and [F12] gives . Applying [F5] with proves and propriety of the normalized update for every datum.
By [F14], integrate the likelihood section against the prior. Step 1.2 gives for both atoms, so this likelihood evidence equals ; using the two prior atoms gives . Step 3.1 gives . Since is finite, the likelihood section is simple, so [F12] gives the numerator for any as . Dividing by yields the stated posterior weights.
Apply [F6] with parameter , prior , dominating measure Lebesgue, and the jointly Borel density . Its evidence is exactly the computed in step 4.1, so the displayed is a data-indexed posterior-kernel version. By [F7], changing its values on a data-marginal-null set leaves the conditional identities unchanged.
A zero-evidence fiber has no normalized fiberwise update
Example
Let with its usual real Banach norm, let with the Borel subspace structure, and let the forward map be the constant map . Give the parameter the Borel probability for Borel . Take data space with the usual subspace metric, its power-set sigma-algebra and counting measure, and deterministic sampling kernel . Its density is for and for , with potential and . Thus but . At no normalized fiberwise update is defined; the data law assigns probability zero, so a posterior-kernel version may use the prior filler there or any other probability measure on . The finite-potential propriety theorem does not apply at .
Example references
The sufficient propriety theorem requires finite continuous potential sections.
A forward map is a map on an admissible truth set.
A prior on the forward domain has full measure on that domain.
A proper model uses a probability prior and sampling kernel.
A point mass assigns mass one to sets containing its point and zero otherwise.
The dominated formula fills zero-evidence fibers with the prior and gives a conditional law version.
A conditional kernel may be changed on a measurable data-marginal-null set.
Facts & Assumptions
Given: The finite parameter domain , the half-half prior, the constant forward map, the deterministic sampling kernel and its counting-measure density.
A prior on a forward domain is a Borel probability on with full mass on . A Borel prior concentrated on a forward-map domain
Evidence is the integral of the nonnegative likelihood section; the normalized update is defined only when that evidence is positive and finite. Misfit evidence and the potential posterior law
A proper Bayesian model consists of a probability prior and a parameter-measurable probability kernel. Bayesian model as a prior and sampling kernel
The Dirac set function gives mass one to sets containing its point and zero otherwise, and is a probability measure. The Dirac set function at a point, A Dirac set function is a probability measure
Counting measure on assigns finite sets their cardinality and infinite sets . Counting measure on an arbitrary set
Counting measure is a measure on the power-set sigma-algebra. Counting measure is a measure
A probability kernel has probability sections at every parameter and measurable evaluations. Measure kernel and probability kernel
In a dominated model, the evidence is the data-marginal density and the kernel with prior fillers on zero and infinite fibers is a conditional law version. Bayes formula for dominated kernels
A finite positive scaling of the zero likelihood measure cannot be a probability. Fiberwise posterior propriety is equivalent to finite positive evidence
Changing a data-indexed conditional kernel on a measurable data-marginal-null set preserves its conditional identities. Conditional law given a random element
The propriety theorem assumes every potential section in its specified data set is finite and continuous. Function-space posterior propriety from a common lower envelope
An inverse-problem forward map has metric parameter and data spaces, a nonempty admissible truth set, and a map defined on it. Inverse-problem models and solution classes
The product sigma-algebra is generated by measurable rectangles, and a map is measurable when preimages of target-measurable sets are measurable. The product sigma-algebra and its finite iterates, A measurable function between measurable spaces
Verification
Given: The hypotheses and conventions in the Statement.
The half-half set function is a probability: in any disjoint Borel sequence each of and occurs in at most one member, so the mass of the union equals the sum of the masses, and . Since , it is a prior on by [F1]. The constant map is a forward map on the nonempty truth set by [F12], and its restriction is measurable because every preimage is or . For each , is a probability measure by [F4], and every evaluation is measurable on finite ; hence [F7] makes a probability kernel. Thus [F3] gives a proper Bayesian model.
With counting measure on , the density is for both parameter values; its sum over is one, so it represents the stated kernel. The potential and density are jointly measurable: each singleton rectangle is measurable, so every subset of finite is a finite union of measurable rectangles by [F13]. Integrating the kernel against the half-half prior gives data law concentrated at , and the same density gives and . At , [F9] rules out any finite positive scaling of the zero likelihood measure as a probability. The potential equals on at this datum, so the finite-section hypothesis in [F11] fails.
The explicit dominated kernel from [F8] uses the normalized update at and prior filler at . The data law gives probability zero by step 2.1, so [F10] allows replacing that filler by without changing the conditional identities. Both fillers are probability measures on by [F4], but neither is obtained by normalizing the zero-evidence fiber.
An improper counting prior can have finite evidence at one datum
Example
Assume the Axiom of Choice. Let with its usual real Banach norm, and let with its power-set sigma-algebra and counting measure . Let and take the forward map into data space with its usual metric and Borel sigma-algebra. The measure is sigma-finite and has . For parameter , use the proper Gaussian observation law , with Lebesgue density
At datum its evidence is
and the normalized fiberwise update is the probability
Because has infinite total mass, this is a fixed-data update only and does not define a prior-predictive probability.
Example references
A forward map is a function on a nonempty admissible truth set between metric spaces.
A finite positive evidence normalizes a nonnegative likelihood section to a probability measure.
Counting measure assigns cardinality to finite sets and infinite mass to infinite sets.
A sampling probability kernel has pointwise probability sections and measurable evaluations.
A normal law has its location-scale density for positive variance.
The geometric series with ratio of absolute value less than one converges.
Latz, §2.2, Theorem 2.5 and its proof in Appendix B (printed p. 23), full paper
Facts & Assumptions
Given: The counting measure on , the Gaussian sampling likelihood , the fixed datum , and AC for the repository's standard-normal definition.
AC selects from every family of nonempty sets. The Axiom of Choice
Counting measure assigns finite sets their cardinality and infinite sets measure . Counting measure on an arbitrary set
The counting set function is a measure on the power-set sigma-algebra. Counting measure is a measure
Sigma-finiteness means a countable measurable cover by sets of finite measure. Finite, sigma-finite, and semifinite measures
Under AC, is the affine image of the standard normal law and has Lebesgue density . Standard normal and normal laws, A positive-variance normal law has its location-scale density
AC implies countable choice. AC implies DC implies countable choice
On with counting measure, for nonnegative measurable . Counting-measure integration is a nonnegative series
For , is finite. For , , and for the series diverges
The exponential is positive, satisfies , is continuous and strictly increasing, and has . The exponential is positive and satisfies , The exponential function is strictly increasing, The real exponential function and the number by a power series
For a sigma-finite measure and measurable likelihood section, evidence is the fixed-data normalizer; for an improper prior it does not define a prior-predictive probability or conditional law. Evidence normalizer and fiberwise posterior update
A finite positive evidence normalizes the likelihood section to a probability measure. Fiberwise posterior propriety is equivalent to finite positive evidence
A proper Bayesian model requires a probability prior; an infinite counting measure is not such a prior. Bayesian model as a prior and sampling kernel
The function-space propriety theorem assumes a Borel probability on a separable real Banach parameter space, so it does not apply to this infinite counting measure on . Function-space posterior propriety from a common lower envelope
A probability kernel has probability sections at every parameter and measurable evaluations. Measure kernel and probability kernel
A forward map is defined on a nonempty admissible truth set between metric parameter and data spaces. Inverse-problem models and solution classes
A function on is measurable because every preimage is a subset of . A measurable function between measurable spaces
is countably infinite by its identity bijection, and no finite set is equinumerous with . Finite, countably infinite, countable, uncountable, The pigeonhole principle on
Verification
Given: The hypotheses and conventions in the Statement.
For each , the initial set has counting measure by [F1] and [F2], and . Thus is sigma-finite by [F3]. By [F16], is infinite, so [F1] gives .
The counting-integral formula [F6] gives . Its term is by [F8].
AC implies countable choice by [F5], so the normal-density interface [F4] applies: for each , is a probability law with the displayed Gaussian density. Since the parameter sigma-algebra is , every evaluation is measurable, and the likelihood section is measurable by [F15]; thus the sampling family satisfies [F13]. The map on the nonempty admissible set satisfies the forward-map interface [F14]. By [F11] this is not a proper Bayesian model with prior , because [step 1.1] shows the prior mass is infinite.
For every , , since and are nonnegative; hence . Monotonicity of the exponential [F8] gives . Let . By [F8], , and [F7] makes finite. Comparison of nonnegative partial sums now bounds the evidence series in step 1.2 by . Hence .
Applying [F10] to and the sigma-finite measure gives the probability with singleton masses , as stated. Its fixed-data meaning and lack of a prior-predictive probability follow from [F9]; [F11] confirms that no proper Bayesian model is supplied by this prior. The function-space propriety theorem [F12] does not apply because its prior is a probability, whereas [step 1.1] gives .