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.
Hierarchical Bayes and partial pooling
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
- Central Limit Theorems
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- 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
- 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
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Lebesgue Measure on Euclidean Space
- Lebesgue-Stieltjes Measures and Distribution Functions
- 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
- Markov Kernels and Markov Chains
- 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
- Pointwise Extended-Real Function Products
- 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
- 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
- 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 Lᵖ Spaces Holder Minkowski and Riesz Fischer
- 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 ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
2 · Summary
This page develops a finite-group hierarchical Bayesian model from its probability kernels. A proper hyperprior and conditionally independent group parameters induce a joint prior and a product likelihood; the posterior is normalized only on observation fibers with positive finite evidence. The known-variance normal specialization gives conditional shrinkage toward the population mean, while the full posterior continues to integrate uncertainty in unknown hyperparameters. Current-group prediction uses that group's posterior parameter; new-group prediction first draws from the population kernel. The product-kernel structure is an explicit modeling assumption; no finite de Finetti representation is asserted.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Finite products of dominated kernels have the product density
Statement
Let and let be a measurable space. For each , let be a probability kernel from to , let be sigma-finite on , and let be a specified jointly measurable function such that On the finite product spaces, let be the product probability kernel, let , and put using the extended-product convention . Then is jointly measurable and, for every , it is a density of with respect to on the entire product sigma-algebra.
Facts & Assumptions
Given: A positive finite number of probability kernels , sigma-finite measures , and specified nonnegative jointly measurable densities as in the Statement.
Finite products of probability kernels exist, are probability kernels, and have the product rectangle formula. Finite products of probability kernels are probability kernels
Finite products of sigma-finite measures exist, are sigma-finite, and have the product rectangle formula. For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique
For a nonnegative product-measurable function, Tonelli gives measurable section integrals and identifies the product integral with either iterated integral. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
Integrating a nonnegative measurable function over measurable sets defines a measure. The indefinite integral of a nonnegative measurable function is a measure
Measures agreeing on a generating pi-system are equal when that pi-system supplies an increasing finite-measure exhaustion. Measures agreeing on a generating pi-system are equal under an increasing finite-measure exhaustion from that pi-system
Extended nonnegative measurability is determined by strict superlevel sets; between any two distinct real numbers there is a rational. Extended-real-valued measurable functions, Both and are dense in , and every nonempty open subset of is uncountable
The finite product sigma-algebra is generated by measurable rectangles, and its coordinate projections are measurable. The product sigma-algebra and its finite iterates
Proof
Given: The hypotheses and conventions in the Statement.
The product kernel is a probability kernel by [F1]. Construct the finite product measure recursively: the one-factor case is , and each next product is sigma-finite by [F2] applied to the preceding sigma-finite product and the next . By [F7], each coordinate pullback is measurable on . For two nonnegative extended-measurable functions and , when , one can choose a positive rational with , with the evident choice of any when ; this also covers infinite factors and excludes a zero factor under the stated convention. For the superlevel set is the whole domain. Thus finite multiplication preserves measurability by [F6], and is jointly measurable.
Fix and define . By [F4], is a measure. Repeated Tonelli [F3] and the probability-kernel density identities give Hence is a probability measure.
For a measurable rectangle , repeated Tonelli and the density identities yield where the last equality is [F1]. Rectangles form a generating pi-system containing the whole product. Both measures are probabilities by step 1.2 and [F1], so the constant exhaustion by the whole product has common finite mass one. [F5] therefore gives on the full product sigma-algebra. This holds for every , proving the density assertion.
Finite-group hierarchical Bayesian model
Definition
Fix a finite group count , a standard Borel hyperparameter space , and a standard Borel parameter space . Let be a probability measure on and let be a probability kernel. For each , let be a measurable observation space, let be a sigma-finite measure on it, and let be a probability kernel from to with a specified jointly measurable density :
The finite-group hierarchical model is the following specified kernel construction. First draw . Conditional on , draw from the finite product kernel Thus the group parameters are conditionally independent and have the same conditional law . Conditional on the parameter tuple, draw the group observations from the product kernel . The product-kernel laws are probability kernels by Finite products of probability kernels are probability kernels. For each fixed , the coordinate maps under are independent random elements, so their joint law is the finite product law (Independent random elements have product joint law).
Put with its finite product sigma-algebra. The proper latent prior on is well-defined by A prior and model kernel define a joint law. For , lift each observation kernel to the common source by The coordinate projection is measurable, so the kernel definition shows that each is a probability kernel. Its specified jointly measurable density is , by composition with the same measurable coordinate projection. Let , , and . The observation kernel from has jointly measurable density with respect to , by Finite products of dominated kernels have the product density. Its evidence is the possibly extended nonnegative number The normalized likelihood measure is called a pointwise joint posterior on a fiber only when ; no quotient is formed at zero or infinite evidence.
For each group, is a parametric statistical model in the sense of Parametric statistical models, with its parameter-measurable kernel representation as in Parameter-measurable statistical models as kernels. Here “conditionally independent given ” is shorthand for the explicit finite product-kernel specification above. The library's random-element conditional-independence terminology is defined in Conditional independence given a sigma-algebra; its conditional-expectation-class convention assumes AC. The finite product-kernel definition here does not use that class convention or any choice axiom.
Remarks
The product-kernel assumption is part of this model. An arbitrary finitely exchangeable law need not be a mixture of iid laws; no finite de Finetti theorem is claimed here. When is unknown, the joint posterior retains its uncertainty and induces dependence between group parameters after is integrated out.
A finite-group hierarchical model has a conditional law of its latent tuple
Statement
Assume the Axiom of Choice and the hypotheses of Finite-group hierarchical Bayesian model. On the canonical joint probability space, the latent tuple has a regular conditional distribution given the sigma-algebra generated by the observed data . The conditional law is a probability kernel at every sample point, including exceptional points. This existence conclusion alone does not assign a normalized likelihood posterior to a fixed observation fiber on which the evidence is zero or infinite.
Facts & Assumptions
Given: The finite-group hierarchical model and AC.
The model supplies a proper hyperprior, a finite product group-parameter kernel, and a finite product observation kernel, all with the stated measurable spaces. Finite-group hierarchical Bayesian model
A proper prior and probability model kernel define a joint probability law on their product, with the iterated-integral identity. A prior and model kernel define a joint law
A finite product of standard-Borel spaces with its finite product sigma-algebra is standard Borel. Finite products of standard Borel spaces are standard Borel
Under AC, a random element with standard-Borel target has a regular conditional distribution given any sub-sigma-algebra, with probability sections at every sample point. Existence of regular conditional distributions for standard borel targets
Coordinate projections from a product measurable space are measurable. The product sigma-algebra and its finite iterates
AC holds; it is used to apply [F4]. The Axiom of Choice
Proof
Given: The hypotheses in the Statement.
Put with its finite product sigma-algebra. The model definition supplies the proper latent prior on and the probability kernel from to the product observation space ; apply [F2] to obtain the joint probability law on . Let with this law and let and be the coordinate projections. By [F5], both projections are measurable.
The target is standard Borel by [F3], since and are standard Borel and there are finitely many factors. The coordinate map is a measurable random element, and is a sub-sigma-algebra of the canonical product sigma-algebra. By [F4] under [A1], has a regular conditional distribution given . The definition of a regular conditional distribution requires every section to be a probability measure, including at exceptional sample points. The theorem asserts no normalization formula on a fixed observation fiber.
Hierarchical posterior normalization on positive finite evidence
Statement
Assume the finite-group hierarchical model of Finite-group hierarchical Bayesian model. Write for its proper prior on , let be its specified product likelihood density with respect to the finite product measure , and define For every observation with , the measure is the joint posterior law of the latent tuple. Defining when or gives a regular conditional distribution under the prior-predictive law; no quotient is formed on either exceptional fiber.
Facts & Assumptions
Given: A proper hyperprior, finite product group and observation kernels, and their specified jointly measurable likelihood densities.
The finite-group model defines a proper latent prior and the product observation kernel with likelihood section . Finite-group hierarchical Bayesian model
The finite product of the group observation kernels has jointly measurable product density relative to the sigma-finite product measure . Finite products of dominated kernels have the product density
A proper prior and probability model kernel define a joint probability law with the corresponding iterated-integral identity. A prior and model kernel define a joint law
For a proper prior and a dominated probability kernel with a specified jointly measurable density, the posterior kernel is the normalized density on fibers and uses the prior as filler on zero or infinite normalizer fibers. Bayes formula for dominated kernels
Proof
Given: The hypotheses in the Statement.
By [F1] and [F3], the latent prior is a probability measure and the model kernel gives a joint probability law for the latent tuple and the observations. By [F2], that observation kernel is dominated by the sigma-finite product measure with the specified jointly measurable density . Thus all hypotheses of [F4] apply with prior and likelihood density .
The resulting evidence is . On every fiber with , [F4] gives the probability measure and the conditional-event identities. On fibers with zero or infinite evidence [F4] uses the probability filler , so its kernel remains a regular conditional distribution there without dividing by zero or infinity. The same theorem says these filled fibers have prior-predictive measure zero.
Conditional normal shrinkage in a finite hierarchy
Statement
Assume the normal specialization of Finite-group hierarchical Bayesian model with parameter space and hyperparameter space . Fix and . Conditional on , let the group parameters be independent with . Let the observed group summaries be conditionally independent with , where each known . In this normal specialization, the supplied likelihood-density version is the canonical normal density at every parameter and observation value: Then, conditional on , the are independent and If is unknown with a proper hyperprior supported on , let be the full posterior kernel from Hierarchical posterior normalization on positive finite evidence and, on each positive finite evidence fiber, define its hyperparameter marginal on Borel by . The posterior law of is the mixture of these conditional normal laws over ; replacing by point estimates need not give this posterior. No normalized hyperparameter posterior is asserted on a zero or infinite evidence fiber.
Facts & Assumptions
Given: The normal hierarchical model, known positive sampling variances , positive conditional prior variance , and the stated observed group summaries.
Conditional on the hyperparameters, the model uses the normal prior and group observation kernels with the canonical normal density factors specified pointwise in the Statement; these factors are jointly measurable, and distinct groups factor under the specified product kernels. Finite-group hierarchical Bayesian model
The finite product observation kernel has its specified product density. Finite products of dominated kernels have the product density
On a positive finite evidence fiber, the posterior of the full latent tuple is the normalized joint likelihood density. Hierarchical posterior normalization on positive finite evidence
Tonelli passes nonnegative integrals through the finite product likelihood and the hyperparameter integral. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
For a proper normal prior and IID observations from with known positive variance, the evidence is finite positive and the posterior has precision and precision-weighted mean. Known-variance Normal-Normal conjugate update
Measures agreeing on a generating pi-system are equal when that pi-system has an increasing finite-measure exhaustion. Measures agreeing on a generating pi-system are equal under an increasing finite-measure exhaustion from that pi-system
Integrating a nonnegative product-measurable function against a finite probability kernel gives a measurable function of its source parameter. Measurability of integration against a kernel
Sections and coordinate projections in finite product measurable spaces are measurable, and measurable rectangles generate the product sigma-algebra. Every section of a product-measurable function is measurable, The product sigma-algebra and its finite iterates
Finite products of probability kernels with a common source are probability kernels and satisfy the product rectangle formula. Finite products of probability kernels are probability kernels
AC is assumed for the library normal-law and conditional-expectation-class conventions. The Axiom of Choice
and all .
Proof
Given: The stated fixed hyperparameters, group summaries, and variances.
Fix a group and specialize [F5] to one observation: identify its parameter with , set , , , , and . The model and pointwise density specification in [F1] supply this normal prior and the canonical normal likelihood density used by [F5], while [A1] and [A2] verify the choice and positive-variance hypotheses of [F5]. The theorem gives a finite positive group evidence and posterior variance and mean , as stated.
For each group put and let . By [F5] and step 1.1, . Apply [F3] to the hierarchy with the proper point-mass hyperprior at the fixed . Its latent prior on is the product of the group priors by [F1], and its likelihood density is by [F2]. Repeated Tonelli [F4] shows that the normalized posterior assigns each measurable rectangle mass , the rectangle mass of by [F9]. By [F8], rectangles form a generating pi-system. Both are probability measures agreeing on it; the constant exhaustion by the full space has common finite mass one, so [F6] makes them equal. This proves conditional independence and the displayed formula for every group.
Now suppose is random with a proper hyperprior supported on . For fixed observed summaries, put . The factor is measurable by the section fact [F8]; composing it with the parameter-coordinate projection shows that is product-measurable. Since is a probability kernel, [F7] makes measurable. Hence and are measurable, with by step 1.1. Repeated Tonelli [F4] and the full-posterior formula [F3] give, for measurable and , . Taking every shows . Taking only and all other sets equal to therefore gives . By [F5] and step 1.1, , so the group posterior is its conditional normal law averaged over the full hyperparameter posterior. If is a point mass, this mixture equals its single conditional normal component; in general it need not equal a plug-in law.
Current-group and new-group posterior prediction
Definition
Let be the data space and its measurable subset of positive finite evidence fibers. Write for the full latent probability kernel supplied by Hierarchical posterior normalization on positive finite evidence, and set for every . On this is the normalized joint posterior; off it is the prior filler , so no likelihood quotient is formed there. For an already observed group , its current-group posterior predictive law for a future observation with the same conditional observation kernel is
For a new group, specify a probability kernel from to a future observation space . Its new-group posterior predictive law is For , if denotes the hyperparameter marginal of , the joint posterior law of used here is . Thus the new-group prediction first draws a new latent parameter from and then draws its observation from . On both formulas average over the joint posterior and retain uncertainty about unknown hyperparameters. On exceptional fibers they reduce to prior-predictive laws because .
Current-group and new-group posterior predictions are probability kernels
Statement
Under Finite-group hierarchical Bayesian model, the current-group and new-group predictive assignments of Current-group and new-group posterior prediction are probability kernels from the full data space to for current group , and to for a new group, with their specified sigma-algebras. On every positive finite evidence fiber they are the stated posterior-predictive laws. On zero or infinite evidence fibers, the posterior kernel uses its prior filler, so the predictions are the corresponding prior-predictive laws. For the conditional-law interpretation, extend the model by the following product-kernel construction. Given the latent tuple , draw the observed data from its original observation kernel and independently draw either a future current-group observation from , or a fresh new-group parameter from followed by its observation from . Under this extension, the predictive kernels are conditional laws of the future observations given the observed data. This is a posterior-predictive statement under the specified model, not a frequentist coverage claim.
Facts & Assumptions
Given: A proper hierarchical model, its posterior kernel on , and the future observation kernels specified in the predictive definition.
For every , is a probability measure and conditional law of the latent tuple; it is the normalized posterior on positive finite evidence fibers and equals on zero or infinite evidence fibers. The evidence-positive set is measurable and has prior-predictive probability one. Hierarchical posterior normalization on positive finite evidence
, each current-group , and are probability kernels. Finite-group hierarchical Bayesian model, Current-group and new-group posterior prediction
Integrating a nonnegative measurable function against a kernel gives a measurable function. Measurability of integration against a kernel
Increasing nonnegative limits pass through integrals. Monotone convergence for the integral
Integrating a nonnegative measurable function against a regular conditional law gives the conditional integral on every conditioning event. Conditional integration through a regular conditional law
A proper prior and a probability model kernel define a joint probability law with the iterated-integral identity. A prior and model kernel define a joint law
The finite product of probability kernels with a common source is a probability kernel. Finite products of probability kernels are probability kernels
Proof
Given: The hypotheses in the Statement.
Fix a current group and . For each measurable future-event set , the formula gives zero on and one on the full observation space by [F1] and [F2]. If are disjoint, then ; [F4] passes this increasing limit through the integral and gives countable additivity. The integrand is measurable in by the kernel definition and coordinate projection, so [F3] makes measurable against the posterior kernel . Thus each is a probability kernel from to .
For a new group, define . The empty-set and whole-space evaluations are zero and one. For disjoint , countable additivity of each and [F4] pass the increasing partial sums through the integral; hence is a probability measure. [F3] makes measurable, so is a probability kernel. Mixing over through the measurable coordinate and repeating the countable-additivity argument shows that is a probability measure and [F3] makes its evaluations measurable in . Thus is a probability kernel from to . Its integral through the marginal is the same iterated-kernel law.
For either prediction let be its conditional future-event probability given the latent tuple: for a current group, or for a new group. Steps 1.1–1.2 make a probability kernel. In the stipulated extension, [F7] ensures that the product of the observation kernel and this future kernel is a probability kernel from to the product of data and future-observation spaces; applying [F6] with prior gives a joint probability law on . Because every section of has total mass one, marginalizing out leaves the original joint law of , so [F1] still supplies its posterior conditional law . For data event and future event , the triple law gives . Applying the event identity in [F5] to turns the right side into . This verifies the conditional-event identity for every data event and proves that both predictive kernels are the conditional laws of the future observations. Since off , their exceptional-fiber predictions are the prior-predictive laws.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Andrew Gelman, John B. Carlin, Hal S. Stern, David B. Dunson, Aki Vehtari, and Donald B. Rubin, Bayesian Data Analysis, 3rd ed., §5.3
- Alicia A. Johnson, Miles Q. Ott, and Mine Dogucu, Bayes Rules!, Chapters 15–16
- Andrew Gelman, John B. Carlin, Hal S. Stern, David B. Dunson, Aki Vehtari, and Donald B. Rubin, Bayesian Data Analysis, 3rd ed., §§5.1–5.4
- Andrew Gelman, John B. Carlin, Hal S. Stern, David B. Dunson, Aki Vehtari, and Donald B. Rubin, Bayesian Data Analysis, 3rd ed., §§5.2–5.3
- Alicia A. Johnson, Miles Q. Ott, and Mine Dogucu, Bayes Rules!, Chapter 16
- Andrew Gelman, John B. Carlin, Hal S. Stern, David B. Dunson, Aki Vehtari, and Donald B. Rubin, Bayesian Data Analysis, 3rd ed., §5.4
- Alicia A. Johnson, Miles Q. Ott, and Mine Dogucu, Bayes Rules!, Chapter 16, §16.5