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.
Inverse Gibbs models, identifiability and correlated uncertainty
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
- Classical configuration, phase and reference spaces
- Cm Math Canonical
- 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
- 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
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Hereditary and Productive Behaviour of the Separation Axioms
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- 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
- 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
- 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
- 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
- Rank Theorems and Embedded Submanifolds
- 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
- Smooth Manifolds and Smooth Maps
- Smooth Partitions of Unity and Exhaustions
- Smooth Vector Bundles and Sections
- 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
- Symplectic Manifolds, Moser Stability, and Darboux–Weinstein Theory
- Tangent Cotangent and the Differential
- Tensor Fields Exterior Algebra and Differential Forms
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Exterior Derivative and Cartan Calculus
- The Fundamental Theorems of Calculus
- The Inverse and Implicit Function Theorems
- The Inverse Function Theorem Completed
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- 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 Fields Flows and Lie Derivatives
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
This page develops exact inverse inference for finite Gibbs families. It defines the canonical exponential family and derives the covariance, identifiability, and affine-support relations. For a minimal family, the finite IID likelihood has a unique finite maximizer exactly when the observed sufficient-statistic mean lies in the relative interior of the finite convex support; boundary data can send the field estimate to infinity.
The latent-observation definition sums hidden configurations through a parameter-measurable observation kernel. The posterior theorem separates standard-Borel posterior-kernel existence under the stated Axiom of Choice from the dominated Bayes formula, which is defined only where its predictive normalizer is finite and positive. The page also defines finite-volume Gibbs pseudo-likelihood and keeps it separate from the exact joint likelihood. Statements about IID data are conditional model deductions; MCMC output is not treated as IID, and no experiment, posterior concentration, or sampling efficiency claim is made.
3 · Logical flowchart
4 · Definitions, postulates, theorems and proofs
Finite exponential Gibbs family for inverse inference
Definition
Let be a finite nonempty set, let with , let be a positive reference weight, and let . Here consists of functions , with . On this page use the one-based coordinate labels for and ; in particular . Thus the Euclidean inner product is . For , define the partition sum and log-partition function by and define the finite exponential Gibbs family by All objects here are mathematical; is a real number. The representation is called minimal when there is no nonzero for which is constant over all .
For a finite set , its convex hull is the set of sums with and . Its affine hull is the set of sums of the same form with real coefficients whose sum is . The relative interior of a convex set is its interior in its affine hull with the Euclidean subspace topology. These definitions will be used for the sufficient-statistic support .
Definition references
Facts & Assumptions
Given: A finite nonempty , positive weights , and a map .
Dominated exponential normalization and covariance: on a sigma-finite measure space, if a positive exponential weight has one integrable envelope on each compact parameter set for its zeroth, first, and second moments, then its partition function is finite, strictly positive, and , its normalized density is a probability density, and the gradient and Hessian of the log partition function are the mean and covariance of the statistic.
Counting measure on finite is sigma-finite, and a function on is integrable exactly when its finite sum is finite.
The Euclidean inner product on : is the ordinary Euclidean inner product, a finite sum of coordinate products.
A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value: a continuous real-valued function on a nonempty compact metric space attains a finite maximum and minimum.
The real exponential function and the number by a power series: is the real exponential power-series function defined for every real input.
The natural logarithm as the inverse of the exponential function: is the inverse of on .
Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation: the Euclidean norm is a norm and satisfies .
The exponential is positive and satisfies : and for every real .
The exponential function is strictly increasing: is strictly increasing on .
The exponential addition formula : for all real .
Proof
Given: The finite family and the notation in the Definition.
For every nonempty compact and every , [F3, F7] give ; hence is continuous. It attains a finite maximum on by [F4]. Define The exponential is finite and positive at this real input by [F5, F8], and the sum is finite, so is finite and nonnegative at every . It is integrable under counting measure by [F2]. Since for every , monotonicity of [F9] shows that dominates for every . Thus the counting-measure model satisfies the envelope hypotheses of [F1]. Applying [F1] gives , , and the normalized probability mass function .
Since every summand in is positive and finite [F5, F8], each . Also by [F6], so by [F8]. By [F10], , which is exactly the normalized density supplied by [F1]. Summing over finite gives . Hence the Definition gives a probability vector with full support for every finite .
Identifiability and covariance in a finite exponential Gibbs family
Statement
For the finite exponential family of the preceding Definition, write . Define by entries . The gradient and Hessian mean and . A symmetric matrix is positive definite when its quadratic form is positive on every nonzero vector. The map is injective when for every implies . The following conditions are equivalent: the representation is minimal; no nonzero makes constant on ; the affine hull of is ; is positive definite for every ; and the map is injective.
Statement references
Facts & Assumptions
Given: The finite exponential family, its log-partition function , and its full-support probability vectors .
Finite exponential Gibbs family for inverse inference: is finite nonempty, , for every , and the Definition calls the representation minimal exactly when no nonzero makes constant on .
Dominated exponential normalization and covariance: under a compact-parameter integrable envelope, and . The finite model satisfies that envelope by step 1.1 of [F1]'s Definition proof and [F1].
Rank-nullity: : for a linear map with finite-dimensional domain, domain dimension is kernel dimension plus image dimension.
The affine hull of a finite set is , where is the span of the finitely many differences ; it is all of exactly when .
The natural logarithm as the inverse of the exponential function: is the inverse of on , so .
Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: is strictly increasing and satisfies for positive .
The exponential addition formula : for real .
The exponential is positive and satisfies : for every real .
Proof
Given: The finite exponential family of the Statement.
The envelope verified in [F1] lets [F2] apply with counting measure, so and .
For any , the quadratic form is . Every weight is positive by [F1], so this sum is zero exactly when has the same value at every . Thus the Hessian is positive definite for every exactly when no nonzero makes constant, which is minimality by [F1].
If as functions on , positivity allows taking logarithms of their equal positive values. The product law and inverse identity [F5, F6] then give for every . Under minimality this forces . Conversely, if a nonzero makes constant, the exponential addition formula [F7] gives . Since and by [F1, F8], the logarithm laws [F5, F6] give . Substitution in the family formula and another use of [F7] show for every real ; the parametrization is not injective.
Let for a fixed . If is proper, choose a basis of , with , and define by . Rank-nullity [F3] gives , so some nonzero is orthogonal to every difference and is constant. Conversely, if such a nonzero exists, every difference lies in the proper hyperplane , so is proper. By [F4], exactly when the affine hull is . This proves the stated equivalence with full affine dimension and completes the identifiability conditions.
Supporting direction at a boundary point of a finite full-dimensional polytope
Statement
Let be finite and nonempty, let , and let have full affine hull, meaning that the affine combinations with fill . Define the finite convex hull If is not an interior point of in , then there is a Euclidean unit vector such that for every .
Facts & Assumptions
Given: The finite set , statistic , full affine hull, finite convex hull , and a point that is not interior to .
Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line: in with its Euclidean metric, a subset is compact exactly when it is closed and bounded; the proof uses no choice principle.
The image of a compact metric space under a continuous map is compact, and so is the image of any compact subset: a continuous image of a compact metric space is compact.
A compact subset of a metric space is closed and bounded: compact subsets of metric spaces are closed and bounded.
Metric continuity characterisations, with countable choice for the sequential converse: a map between metric spaces is continuous exactly when preimages of open sets are open; in particular preimages of closed sets are closed.
A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value: a continuous real function on a nonempty compact metric space attains its minimum.
is countably infinite: is countably infinite. A product of two at most countable sets is at most countable: a product of two at most countable sets is at most countable, without choice. A nonempty set is at most countable iff it is a surjective image of : every nonempty at most countable set has a surjection from , and each nonempty fiber has a least index.
The rationals embed densely in the reals: the rationals embed as an ordered subfield of the reals, and every nonempty open real interval contains a rational.
For every bounded sequence in has a convergent subsequence: every bounded sequence in has a convergent subsequence, and this corollary uses no choice principle.
The Euclidean inner product on : consists of functions on , the Euclidean inner product is , and the Euclidean norm is .
Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation: ; the Euclidean norm is a norm, in particular it satisfies the triangle inequality, and for its induced metric is the Euclidean metric.
Proof
Given: The finite polytope and boundary point in the Statement.
Enumerate as and, for , write for . Let . The set is nonempty (take and all other coordinates zero) and bounded. Its coordinate maps and sum map are continuous, since each coordinate inequality follows from the norm formula [F9], while follows from the real triangle inequality; hence , an intersection of their closed inverse images, is closed. By [F1], is compact. For , the triangle inequality and coordinate bound give so the map is continuous. Thus [F2] makes its image compact; [F3] makes closed.
For each natural , define . The set is finite. Restriction and the last coordinate give a bijection , namely ; its inverse extends by the specified last value. By induction on , the binary-product result [F6] makes every at most countable. Since contains the zero function, [F6] supplies one surjection . Embed its values coordinatewise in using [F7] and write them as . These vectors are dense: for and , each interval , , contains a rational by [F7]. Select these finitely many coordinates by induction on , obtaining . Then by [F9], so some lies in . Only finite induction and a single enumeration are used; no countable family of selections is made.
Fix an integer . Noninteriority of gives a point with . Since is closed, its complement is open, so some ball of radius lies outside . Set . Step 1.2 gives a rational vector ; then and . Thus is nonempty. This argument proves nonemptiness separately for each without choosing a sequence of . Let be the least member of and set . This least-index construction uses no choice and .
For , the triangle inequality gives , and exchanging gives . Hence is continuous on in its Euclidean metric. The nonempty compact set therefore has a minimizer by [F5]. It is unique: if distinct both minimize, convexity puts in and is strictly smaller. For any and , convexity gives . Minimality then implies ; expanding the inner products, dividing by , and letting gives .
Since , minimality gives , so the triangle inequality gives . Put ; the denominator is positive because , and homogeneity of the norm gives . Thus is bounded in the Euclidean metric; [F8] gives a subsequence converging to . The reverse triangle inequality, obtained by applying the triangle inequality in both orders, gives , hence . For every , step 3.1 gives . By [F10], since and hence is bounded. Passing to the limit gives . Taking proves the claimed support inequality.
Exact finite-MLE criterion for a minimal finite exponential Gibbs family
Statement
Use the finite exponential family, minimality, convex hull, affine hull, and relative-interior definitions from the A-page finite-family Definition. Assume the representation is minimal. The sample space is with product mass , which is the IID sampling model; . For a realized tuple , set and . A finite MLE is a parameter attaining the maximum of that likelihood. Then a finite MLE exists if and only if , and when it exists it is unique.
Statement references
Facts & Assumptions
Given: The finite family, minimality, , and the realized IID sample in the Statement.
The sampling model is IID with mass function ; the likelihood of the realized sample is .
Finite exponential Gibbs family for inverse inference: with ; its proof verifies , normalization and full support, and is the finite convex hull of .
Identifiability and covariance in a finite exponential Gibbs family: for a minimal family, is positive definite for every finite , and the affine hull of is .
Dominated exponential normalization and covariance: for the finite family, , , and ; its compact-envelope hypothesis is verified in the finite-family Definition.
Supporting direction at a boundary point of a finite full-dimensional polytope: if is a boundary point of the full-dimensional finite convex hull , a unit vector satisfies for every .
A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value: a continuous real-valued function on a nonempty compact metric space attains its minimum.
For , every Euclidean closed ball and every Euclidean sphere of positive radius is compact: every Euclidean closed ball in of positive radius is compact.
The natural logarithm as the inverse of the exponential function: is the inverse of on , so for every real .
Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: is strictly increasing on and satisfies for positive reals .
The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with : if a real function is continuous on a closed interval and differentiable on its interior, then its derivative equals the interval's average rate of change at some interior point.
Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation: the Euclidean norm is a norm, with positive definiteness and absolute homogeneity; in particular for and for .
The Euclidean inner product on : , so implies .
For a convex set , a function is strictly concave when for every distinct and every .
The exponential is positive and satisfies : for every real .
Proof
Given: The IID model and realized finite sample in the Statement.
Since every , the likelihood is positive. Repeated application of the logarithm product law [F8], followed by [F7], gives the log likelihood Because is strictly increasing [F8], maximizing this log likelihood is equivalent to maximizing the likelihood. Also is the convex combination with weights of , so .
Suppose . Minimality makes full-dimensional, so there is such that the open ball of radius about lies in ; set , so the closed ball of radius lies in that open ball and hence in . For every unit , is a convex combination of the vectors ; since by [F11], at least one satisfies . Put . If , write and ; [F10] gives and . For some as above, . Since the th summand is part of and is positive by [F13], monotonicity and the product law of [F8], together with [F7], give and hence . Thus tends to as .
Let and put and for . By [F3], is twice continuously differentiable; by [F2] its second derivative is . Thus is strictly decreasing: for , the mean value theorem [F9] applied to gives for some . Fix . Applying [F9] to on and gives and such that Rearranging yields . By [F12], is strictly concave on .
The function is continuous: is continuous by [F3], and the linear form is continuous by the Cauchy–Schwarz bound [F10]. It tends to by step 1.2. Choose large enough that whenever . The closed ball is nonempty and compact by [F6], so [F5] gives a minimizer on it. Since lies in the ball and every point outside has value greater than , is a global minimizer on . The log-likelihood formula in step 1.1 and show that it is a finite MLE. If two distinct finite MLEs existed, their midpoint would have a strictly larger log likelihood by step 2.1, a contradiction; hence it is unique.
Suppose . Since by step 1.1 and is full-dimensional, is a boundary point. By [F4] choose a unit with for every . Full affine span implies at least one of these inequalities is strict; otherwise would be constant on . Every is positive, so for every finite . Therefore the directional derivative of along is at every finite . By the definition of a positive derivative, a sufficiently small positive step along increases , and therefore increases the likelihood by [F8]. No finite MLE exists. This proves both directions.
Remarks
This is an exact finite IID model statement. It does not assert that a finite dataset is typical, that an estimator is consistent or concentrated, or that any algorithm computes the MLE. No MCMC output is treated as IID data; a dependent-chain analysis would require its own finite-state Markov-chain central limit theorem and autocorrelation-aware variance conditions, which are not used here.
Finite latent Gibbs observation model
Definition
Let be a nonempty measurable parameter space and let be measurable. Let be the finite state set of the finite exponential Gibbs family from the A-page Definition, evaluated at canonical parameter ; write its mass as . A finite latent Gibbs observation model consists of a prior probability measure on and a probability kernel from to a nonempty measurable data space , where is the full power-set sigma-algebra on and is the product sigma-algebra. The kernel is the observation law for data event when parameter and latent configuration are fixed. Define the marginal sampling kernel Thus the latent configuration is summed out before the data likelihood is evaluated.
In a dominated observation model, a specified measure on is sigma-finite, meaning that is a countable union of measurable sets of finite -measure. A density is given by a map measurable from to with its Borel sigma-algebra. Writing its value as , for every and it satisfies The marginal data density, or likelihood density at , is then The general kernel model does not require a pointwise likelihood density.
Definition references
Facts & Assumptions
Given: The finite exponential family, measurable parameter and data spaces, the proper prior, and the observation kernel in the Definition.
Finite exponential Gibbs family for inverse inference: is finite and, for each , with ; its proof establishes , positivity, and normalization.
Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation: for , and the Euclidean norm is a norm.
The exponential function is strictly increasing: is continuous.
The product sigma-algebra and its finite iterates: is generated by measurable rectangles; for each fixed , the section map is measurable because the preimage of a rectangle is if and empty otherwise.
Measure kernel and probability kernel: a probability kernel is a pointwise probability measure in its data argument and is measurable in its source argument for each fixed data event.
Bayesian model as a prior and sampling kernel: a proper Bayesian model consists of a prior probability measure and a parameter-measurable probability kernel from parameter space to data space.
Proof
Given: The ingredients of the Definition.
Fix and define and . By [F2], , so is continuous. The function is continuous by [F1], hence is continuous: at any and for any , intersect neighborhoods on which and . By continuity of [F3], its composition with is continuous (choose the continuity neighborhood of first, then use continuity of ); multiplying by the fixed scalar preserves continuity by rescaling by . Thus the displayed formula makes continuous. A continuous real-valued function is Borel measurable because preimages of open sets are open and open sets generate the Borel sigma-algebra. Therefore composing with the measurable makes measurable.
For each fixed , every summand in is nonnegative. For pairwise disjoint events , countable additivity of each and the finiteness of let the finite sum over commute with the nonnegative series over , so is countably additive. Also .
For each , is measurable by [F5]; composing with each measurable section from [F4] makes measurable. Also is measurable by step 1.1. Therefore is a finite sum of products of measurable functions and is measurable in . Thus is a probability kernel and, with the proper prior , is a Bayesian model in the sense of [F6].
In the dominated case, each term is jointly measurable and nonnegative by the Definition and step 1.1. Its finite sum is jointly measurable; integrating it over gives . For , this integral is by step 1.2, so is exactly a density for the marginal sampling kernel, with latent states already summed out.
Remarks
A product of one-site conditional probabilities is a pseudo-likelihood, as defined separately on this page. It is a different inferential input from the joint-data kernel above. The B-page finite counterexample shows that treating it as the exact likelihood can give a different posterior; the pseudo-likelihood product is therefore not substituted for in this definition.
Posterior kernel and dominated formula for a latent Gibbs observation
Statement
Assume the Axiom of Choice. Let the parameter and data spaces and of a finite latent Gibbs observation model both be standard Borel, and let be its proper prior. Let be the joint prior-predictive probability determined by and the marginal sampling kernel , and let be its data marginal. There exists a data-indexed probability kernel satisfying and any two such posterior kernels agree as probability measures for -almost every .
In the dominated case with data measure and joint likelihood density from the Definition, define Then is measurable, , and for -almost every with the posterior has the version The prior-predictive law gives zero mass to the set where or ; the conditional identities do not determine pointwise posterior values there.
Statement references
Facts & Assumptions
Given: A proper prior , the measurable canonical-parameter map and finite latent Gibbs sampling kernel in the Definition, standard-Borel parameter and data spaces, AC, and, for the dominated clause, a sigma-finite measure and jointly measurable normalized density .
The Axiom of Choice: every family of nonempty sets has a choice function; AC is an explicit hypothesis of the posterior-kernel result used below.
Finite latent Gibbs observation model: summing the finite latent state law with weights against the observation kernel gives a parameter-measurable probability kernel ; in the dominated case the finite sum is its joint likelihood density.
Standard Borel spaces: a measurable space is standard Borel when it is measurably isomorphic to the Borel space of a Polish topology; both parameter and data measurable structures are assumed to have this property.
Standard-Borel Bayesian posterior kernel exists: under AC, a proper prior and parameter-measurable probability kernel on standard-Borel parameter and data spaces give a data-indexed posterior probability kernel satisfying the rectangle identity, unique as a probability measure outside one data-marginal null set.
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: for a nonnegative product-measurable function on two sigma-finite measure spaces, section integrals are measurable and either iterated integral equals the product integral.
Measure kernel and probability kernel: a probability kernel is a measurable family of probability measures, with total mass one at every source point.
Proof
Given: The hypotheses and notation in the Statement.
By [F1], the prior and form a proper Bayesian model. The parameter and data spaces are standard Borel by [F2], and AC holds by [A1]. Therefore [F3] supplies the posterior probability kernel and its -almost-everywhere uniqueness, with the exact rectangle identity in the Statement.
In the dominated case, is nonnegative and jointly measurable by its finite-sum definition. The prior is finite and hence sigma-finite; is sigma-finite by the Definition. Apply [F4] to on their product. It gives measurability of and . For each , the same calculation with gives . Here the finite sum and each normalized observation density are those of [F1].
The set has -measure zero because has integral one, and the set has zero data-marginal mass because by step 1.2. For each , the numerator is measurable by [F4]. Define when , and set otherwise. On valid , the measure induced on by the nonnegative density with respect to has total mass , so after division it is a probability measure; on the exceptional set it is the prior. Thus each section is a probability measure, and its evaluations are measurable, so it is a probability kernel by [F5].
For every and , Tonelli and the data-marginal density established in step 1.2 give ; the exceptional values contribute zero because their -measure is zero. Thus the displayed ratio is a posterior version on its stated domain, and the general uniqueness assertion remains only -almost everywhere.
Remarks
The prior is part of this mathematical model, and the posterior is conditional on it and on the stated likelihood kernel. This theorem proves neither posterior concentration nor computational efficiency. It does not report data or establish that any Gibbs model describes a physical system.
Finite-volume Gibbs pseudo-likelihood with fixed boundary
Definition
Let , let be a finite nonempty subset of , let be a finite nonempty spin set, let be a nonempty measurable parameter space, and fix a boundary configuration . Let be a finite collection of finite subsets with . For each , let be finite-valued and measurable in for each spin assignment. For , let equal on and outside , and define the finite-volume energy Its normalized Gibbs law is For site , define its finite interaction neighborhood For and , write for the configuration obtained by replacing only its th spin with . The one-site conditional and finite-volume pseudo-likelihood are Every conditional uses the same fixed exterior boundary and is determined by the specified finite neighborhood . The product is a finite conditional objective; it is not defined as a probability law on .
Definition references
Facts & Assumptions
Given: The finite volume, finite spin set, finite interaction collection, finite-valued potentials, parameter measurability, and fixed boundary in the Definition.
The real exponential function and the number by a power series: is the real exponential power-series function defined for every real input.
The exponential is positive and satisfies : the real exponential is finite and strictly positive at every finite real input.
The exponential function is strictly increasing: the real exponential is continuous, hence Borel measurable.
Proof
Given: The ingredients of the Definition.
For each and each , is a finite sum of finite real values. Thus every weight is positive and finite by [F1, F2], and the partition denominator is a finite nonempty sum of positive finite terms. This makes a probability vector on the finite nonempty set .
Fix and . The denominator in is likewise a finite nonempty sum of positive finite terms. Dividing the corresponding joint Gibbs masses by their sum over the possible value at site cancels the joint partition function and gives exactly the displayed ratio; summing that ratio over gives one. Hence it is the conditional probability vector of site given the other spins. Since is finite and each is finite, is finite. In the ratio, every potential indexed by a set not containing is the same for all values of and cancels; hence only potentials meeting , and therefore only spins in and the fixed boundary values there, affect this conditional.
Each is measurable in because it is a finite sum of the stipulated measurable potentials. The exponential is Borel measurable by continuity [F3], so composition with these potentials preserves measurability. The finite partition and conditional denominators are positive by [F2], so and each are measurable in . Their finite product is therefore a measurable, positive finite real-valued objective. This does not assert that its sum over configurations is one.
Remarks
The product in this Definition is a pseudo-likelihood in the sense of Besag: it multiplies one-site conditional probabilities with the boundary and neighborhood fixed. It generally differs from the joint Gibbs likelihood and does not define an exact posterior for the joint Gibbs observation model. The B-page counterexample Two-spin pseudo-likelihood is not the exact joint posterior input ↗ verifies this distinction in a two-spin model. A consistency or concentration theorem for pseudo-likelihood would require additional, explicitly proved identifiability and spatial mixing or ergodicity inputs; none is asserted here.
5 · Examples, experiments and counterexamples
None yet.
Sources
- Martin J. Wainwright and Michael I. Jordan, Graphical Models, Exponential Families, and Variational Inference
- Charles J. Geyer, Stat 8931 (Exponential Families) Lecture Notes: Two Examples of Agresti
- Alicia A. Johnson, Miles Q. Ott, and Mine Dogucu, Bayes Rules!, Chapter 2
- Julian Besag, Statistical Analysis of Non-Lattice Data, The Statistician 24(3) (1975), 179–195