Alphabeta Math
Pipeline-generated
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

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

DefinitionDefinition: AI-adaptedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Finite exponential Gibbs family for inverse inference

Definition

Let X be a finite nonempty set, let k∈N with k≥1, let w:X→(0,∞) be a positive reference weight, and let T:X→Rk. Here Rk consists of functions k→R, with k={0,…,k−1}. On this page use the one-based coordinate labels vj:=v(j−1) for 1≤j≤k and v∈Rk; in particular Tj(x):=T(x)(j−1). Thus the Euclidean inner product is θ⋅T(x):=∑j=1kθjTj(x)=∑i<kθ(i)T(x)(i). For θ∈Rk, define the partition sum and log-partition function by Z(θ):=∑x∈Xw(x)eθ⋅T(x),A(θ):=log⁡Z(θ), and define the finite exponential Gibbs family by πθ(x):=w(x)eθ⋅T(x)−A(θ)(x∈X). All objects here are mathematical; θ⋅T(x) is a real number. The representation is called minimal when there is no nonzero a∈Rk for which a⋅T(x) is constant over all x∈X.

For a finite set S⊆Rk, its convex hull is the set of sums ∑s∈Sλss with λs≥0 and ∑s∈Sλs=1. Its affine hull is the set of sums of the same form with real coefficients λs whose sum is 1. 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 T(X).

Facts & Assumptions

Given: A finite nonempty X, positive weights w(x), and a map T:X→Rk.

[F1]

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 C2, 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.

[F2]

Counting measure on finite X is sigma-finite, and a function on X is integrable exactly when its finite sum is finite.

[F3]

The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn: θ⋅T(x) is the ordinary Euclidean inner product, a finite sum of coordinate products.

[F4]

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.

[F5]

The real exponential function and the number e by a power series: exp⁡ is the real exponential power-series function defined for every real input.

[F6]

The natural logarithm as the inverse of the exponential function: log⁡ is the inverse of exp⁡ on (0,∞).

[F8]

The exponential is positive and satisfies exp⁡(−x)=1/exp⁡(x): exp⁡(t)>0 and exp⁡(−t)=1/exp⁡(t) for every real t.

[F9]

The exponential function is strictly increasing: exp⁡ is strictly increasing on R.

[F10]

The exponential addition formula exp⁡(x+y)=exp⁡(x)exp⁡(y): exp⁡(s+t)=exp⁡(s)exp⁡(t) for all real s,t.

Proof

Given: The finite family and the notation in the Definition.

1.1givenF1F2F3F4F5F7F8F9

For every nonempty compact C⊆Rk and every x∈X, [F3, F7] give ∣η⋅T(x)−η′⋅T(x)∣≤∥η−η′∥2∥T(x)∥2; hence η↦η⋅T(x) is continuous. It attains a finite maximum MC(x) on C by [F4]. Define GC(x):=w(x)exp⁡(MC(x))(1+∑j=1k∣Tj(x)∣2). The exponential is finite and positive at this real input by [F5, F8], and the sum is finite, so GC is finite and nonnegative at every x. It is integrable under counting measure by [F2]. Since η⋅T(x)≤MC(x) for every η∈C, monotonicity of exp⁡ [F9] shows that GC dominates w(x)eθ⋅T(x)(1+∑j∣Tj(x)∣2) for every θ∈C. Thus the counting-measure model satisfies the envelope hypotheses of [F1]. Applying [F1] gives 0<Z(θ)<∞, A∈C2(Rk), and the normalized probability mass function πθ.

2.1F1F5F6F8F10step 1.1algebra∎

Since every summand in Z(θ) is positive and finite [F5, F8], each πθ(x)>0. Also exp⁡(A(θ))=Z(θ) by [F6], so e−A(θ)=1/Z(θ) by [F8]. By [F10], πθ(x)=w(x)eθ⋅T(x)e−A(θ), which is exactly the normalized density supplied by [F1]. Summing over finite X gives ∑x∈Xπθ(x)=e−A(θ)Z(θ)=1. Hence the Definition gives a probability vector with full support for every finite θ.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Identifiability and covariance in a finite exponential Gibbs family

Statement

For the finite exponential family of the preceding Definition, write μθ:=∑x∈Xπθ(x)T(x). Define Cov⁡πθ(T) by entries Cov⁡πθ(T)ab:=∑x∈Xπθ(x)(Ta(x)−μθ,a)(Tb(x)−μθ,b). The gradient and Hessian mean ∇A(θ):=(∂jA(θ))j=1k and ∇2A(θ):=(∂i∂jA(θ))i,j=1k. A symmetric matrix is positive definite when its quadratic form is positive on every nonzero vector. The map θ↦πθ is injective when πθ(x)=πφ(x) for every x implies θ=φ. The following conditions are equivalent: the representation is minimal; no nonzero a∈Rk makes a⋅T(x) constant on X; the affine hull of T(X) is Rk; ∇2A(θ) is positive definite for every θ; and the map θ↦πθ is injective.

Facts & Assumptions

Given: The finite exponential family, its log-partition function A, and its full-support probability vectors πθ.

[F1]

Finite exponential Gibbs family for inverse inference: X is finite nonempty, w(x)>0, πθ(x)>0 for every x,θ, and the Definition calls the representation minimal exactly when no nonzero a makes a⋅T constant on X.

[F2]

Dominated exponential normalization and covariance: under a compact-parameter integrable envelope, ∂aA=Eθ[Ta] and ∂a∂bA=Cov⁡θ(Ta,Tb). The finite model satisfies that envelope by step 1.1 of [F1]'s Definition proof and [F1].

[F3]

Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T: for a linear map with finite-dimensional domain, domain dimension is kernel dimension plus image dimension.

[F4]

The affine hull of a finite set T(X) is T(x0)+D, where D is the span of the finitely many differences T(x)−T(x0); it is all of Rk exactly when D=Rk.

[F5]

The natural logarithm as the inverse of the exponential function: log⁡ is the inverse of exp⁡ on (0,∞), so log⁡(exp⁡t)=t.

[F6]

Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: log⁡ is strictly increasing and satisfies log⁡(ab)=log⁡a+log⁡b for positive a,b.

[F7]

The exponential addition formula exp⁡(x+y)=exp⁡(x)exp⁡(y): exp⁡(s+t)=exp⁡(s)exp⁡(t) for real s,t.

Proof

Given: The finite exponential family of the Statement.

1.1givenF1F2

The envelope verified in [F1] lets [F2] apply with counting measure, so ∇A(θ)=EπθT and ∇2A(θ)=Cov⁡πθ(T).

2.1F1step 1.1algebra

For any a∈Rk, the quadratic form is aT∇2A(θ)a=∑x∈Xπθ(x)(a⋅T(x)−Eπθ[a⋅T])2. Every weight is positive by [F1], so this sum is zero exactly when a⋅T(x) has the same value at every x∈X. Thus the Hessian is positive definite for every θ exactly when no nonzero a makes a⋅T constant, which is minimality by [F1].

2.2F1F5F6F7F8step 1.1algebra

If πθ=πφ as functions on X, positivity allows taking logarithms of their equal positive values. The product law and inverse identity [F5, F6] then give (θ−φ)⋅T(x)=A(θ)−A(φ) for every x. Under minimality this forces θ−φ=0. Conversely, if a nonzero a makes a⋅T(x)=c constant, the exponential addition formula [F7] gives Z(θ+ta)=exp⁡(tc)Z(θ). Since Z(θ)>0 and exp⁡(tc)>0 by [F1, F8], the logarithm laws [F5, F6] give A(θ+ta)=A(θ)+tc. Substitution in the family formula and another use of [F7] show πθ+ta=πθ for every real t; the parametrization is not injective.

3.1givenF1F3F4algebra∎

Let D=span⁡{T(x)−T(x0):x∈X} for a fixed x0∈X. If D is proper, choose a basis v1,…,vr of D, with r<k, and define L:Rk→Rr by L(a)=(a⋅v1,…,a⋅vr). Rank-nullity [F3] gives dim⁡ker⁡L≥k−r>0, so some nonzero a is orthogonal to every difference and a⋅T is constant. Conversely, if such a nonzero a exists, every difference lies in the proper hyperplane a⊥, so D is proper. By [F4], D=Rk exactly when the affine hull is Rk. This proves the stated equivalence with full affine dimension and completes the identifiability conditions.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Supporting direction at a boundary point of a finite full-dimensional polytope

Statement

Let X={x1,…,xm} be finite and nonempty, let k≥1, and let T:X→Rk have full affine hull, meaning that the affine combinations ∑j=1majT(xj) with ∑jaj=1 fill Rk. Define the finite convex hull K:={∑j=1mλjT(xj):λj≥0, ∑j=1mλj=1}. If μ∈K is not an interior point of K in Rk, then there is a Euclidean unit vector u∈Rk such that u⋅(T(x)−μ)≤0 for every x∈X.

Facts & Assumptions

Given: The finite set X, statistic T, full affine hull, finite convex hull K, and a point μ∈K that is not interior to K.

[F1]
[F3]

A compact subset of a metric space is closed and bounded: compact subsets of metric spaces are closed and bounded.

[F4]

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.

[F5]

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.

[F6]

Q is countably infinite: Q 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 N: every nonempty at most countable set has a surjection from N, and each nonempty fiber has a least index.

[F7]

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.

[F8]

For n≥1 every bounded sequence in Rn has a convergent subsequence: every bounded sequence in Rk has a convergent subsequence, and this corollary uses no choice principle.

[F9]

The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn: Rk consists of functions on {0,…,k−1}, the Euclidean inner product is a⋅b=∑i<ka(i)b(i), and the Euclidean norm is ∥a∥2=a⋅a.

[F10]

Cauchy-Schwarz ∣⟨x,y⟩∣≤∥x∥2∥y∥2 with its equality case, the triangle inequality for ∥⋅∥2, the parallelogram law and polarisation: ∣a⋅b∣≤∥a∥2∥b∥2; the Euclidean norm is a norm, in particular it satisfies the triangle inequality, and for k≥1 its induced metric is the Euclidean metric.

Proof

Given: The finite polytope and boundary point in the Statement.

1.1givenF1F2F3F4F9F10algebra

Enumerate X as x1,…,xm and, for λ∈Rm, write λj:=λ(j−1) for 1≤j≤m. Let Δ={λ∈[0,1]m:∑j=1mλj=1}. The set Δ is nonempty (take λ1=1 and all other coordinates zero) and bounded. Its coordinate maps and sum map are continuous, since each coordinate inequality ∣λj−λj′∣≤∥λ−λ′∥2 follows from the norm formula [F9], while ∣∑j(λj−λj′)∣≤m∥λ−λ′∥2 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 ∥∑jλjT(xj)−∑jλj′T(xj)∥2≤∑j∣λj−λj′∣ ∥T(xj)∥2≤∥λ−λ′∥2∑j∥T(xj)∥2, so the map λ↦∑jλjT(xj) is continuous. Thus [F2] makes its image K compact; [F3] makes K closed.

1.2givenF6F7F9algebra

For each natural r≤k, define Pr:={f:r→Q}. The set P0={∅} is finite. Restriction and the last coordinate give a bijection Pr+1→Pr×Q, namely f↦(f∣r,f(r)); its inverse extends g:r→Q by the specified last value. By induction on r, the binary-product result [F6] makes every Pr at most countable. Since Pk contains the zero function, [F6] supplies one surjection q:N→Pk=Qk. Embed its values coordinatewise in Rk using [F7] and write them as qj. These vectors are dense: for p∈Rk and ε>0, each interval (p(i)−ε/(2k),p(i)+ε/(2k)), i<k, contains a rational by [F7]. Select these finitely many coordinates by induction on i<k, obtaining a∈Pk. Then ∥a−p∥22<k(ε/(2k))2<ε2 by [F9], so some qj=a lies in B(p,ε). Only finite induction and a single enumeration are used; no countable family of selections is made.

2.1givenF6F9F10step 1.1step 1.2algebra

Fix an integer n≥1. Noninteriority of μ gives a point p∉K with ∥p−μ∥2<1/(2n). Since K is closed, its complement is open, so some ball B(p,ρ) of radius ρ>0 lies outside K. Set r=12min⁡{ρ,1/n−∥p−μ∥2}>0. Step 1.2 gives a rational vector qj∈B(p,r); then qj∉K and ∥qj−μ∥2<1/n. Thus Jn={j∈N:qj∉K, ∥qj−μ∥2<1/n} is nonempty. This argument proves nonemptiness separately for each n without choosing a sequence of p,ρ,r. Let jn be the least member of Jn and set yn=qjn. This least-index construction uses no choice and yn→μ.

3.1givenF5F9F10step 1.1step 2.1algebra

For z,z′∈K, the triangle inequality gives ∥yn−z∥2≤∥yn−z′∥2+∥z−z′∥2, and exchanging z,z′ gives ∣∥yn−z∥2−∥yn−z′∥2∣≤∥z−z′∥2. Hence z↦∥yn−z∥2 is continuous on K in its Euclidean metric. The nonempty compact set K therefore has a minimizer zn∈K by [F5]. It is unique: if distinct z,z′∈K both minimize, convexity puts (z+z′)/2 in K and ∥yn−(z+z′)/2∥22=(∥yn−z∥22+∥yn−z′∥22)/2−∥z−z′∥22/4 is strictly smaller. For any v∈K and 0<s≤1, convexity gives zn+s(v−zn)∈K. Minimality then implies ∥yn−zn∥22≤∥yn−zn−s(v−zn)∥22; expanding the inner products, dividing by s, and letting s↓0 gives (yn−zn)⋅(v−zn)≤0.

4.1givenF8F9F10step 2.1step 3.1algebra∎

Since μ∈K, minimality gives ∥yn−zn∥2≤∥yn−μ∥2, so the triangle inequality gives ∥zn−μ∥2≤2∥yn−μ∥2→0. Put un=(yn−zn)/∥yn−zn∥2; the denominator is positive because yn∉K, and homogeneity of the norm gives ∥un∥2=1. Thus (un) is bounded in the Euclidean metric; [F8] gives a subsequence unj converging to u. The reverse triangle inequality, obtained by applying the triangle inequality in both orders, gives ∣∥unj∥2−∥u∥2∣≤∥unj−u∥2, hence ∥u∥2=1. For every v∈K, step 3.1 gives unj⋅(v−znj)≤0. By [F10], ∣unj⋅(v−znj)−u⋅(v−μ)∣≤∥unj−u∥2 ∥v−znj∥2+∥u∥2 ∥μ−znj∥2⟶0, since znj→μ and hence (v−znj) is bounded. Passing to the limit gives u⋅(v−μ)≤0. Taking v=T(x)∈K proves the claimed support inequality.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

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 Xn with product mass ∏i=1nπθ(xi), which is the IID sampling model; n≥1. For a realized tuple x1,…,xn∈X, set Tˉ=n−1∑i=1nT(xi) and K=conv⁡(T(X)). A finite MLE is a parameter θ^∈Rk attaining the maximum of that likelihood. Then a finite MLE exists if and only if Tˉ∈ri⁡K, and when it exists it is unique.

Facts & Assumptions

Given: The finite family, minimality, n≥1, and the realized IID sample in the Statement.

[A1]

The sampling model is IID with mass function πθ; the likelihood of the realized sample is ∏i=1nπθ(xi).

[F1]

Finite exponential Gibbs family for inverse inference: πθ(x)=w(x)eθ⋅T(x)−A(θ) with w(x)>0; its proof verifies 0<Z(θ)<∞, normalization and full support, and K is the finite convex hull of T(X).

[F2]

Identifiability and covariance in a finite exponential Gibbs family: for a minimal family, ∇2A(θ) is positive definite for every finite θ, and the affine hull of T(X) is Rk.

[F3]

Dominated exponential normalization and covariance: for the finite family, A∈C2(Rk), ∇A(θ)=EπθT, and ∇2A(θ)=Cov⁡πθ(T); its compact-envelope hypothesis is verified in the finite-family Definition.

[F4]

Supporting direction at a boundary point of a finite full-dimensional polytope: if Tˉ is a boundary point of the full-dimensional finite convex hull K, a unit vector u satisfies u⋅(T(x)−Tˉ)≤0 for every x∈X.

[F5]

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.

[F6]

For n≥1, every Euclidean closed ball and every Euclidean sphere of positive radius is compact: every Euclidean closed ball in Rk of positive radius is compact.

[F7]

The natural logarithm as the inverse of the exponential function: log⁡ is the inverse of exp⁡ on (0,∞), so log⁡(exp⁡t)=t for every real t.

[F8]

Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: log⁡ is strictly increasing on (0,∞) and satisfies log⁡(ab)=log⁡a+log⁡b for positive reals a,b.

[F9]

The mean value theorem, as the case g(x)=x of Cauchy's: for f continuous on [a,b] with a<b and differentiable on (a,b) there is c∈(a,b) with f(b)−f(a)=f′(c)(b−a): 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.

[F10]

Cauchy-Schwarz ∣⟨x,y⟩∣≤∥x∥2∥y∥2 with its equality case, the triangle inequality for ∥⋅∥2, the parallelogram law and polarisation: the Euclidean norm is a norm, with positive definiteness and absolute homogeneity; in particular ∥θ∥2>0 for θ≠0 and ∥θ/r∥2=∥θ∥2/r for r>0.

[F11]

The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn: ∥u∥2=u⋅u, so ∥u∥2=1 implies u⋅u=1.

[F12]

For a convex set C, a function f:C→R is strictly concave when f((1−t)θ+tφ)>(1−t)f(θ)+tf(φ) for every distinct θ,φ∈C and every t∈(0,1).

Proof

Given: The IID model and realized finite sample in the Statement.

1.1givenA1F1F7F8algebra

Since every πθ(xi)>0, the likelihood is positive. Repeated application of the logarithm product law [F8], followed by log⁡(exp⁡t)=t [F7], gives the log likelihood ℓ(θ)=log⁡∏i=1nπθ(xi)=∑i=1nlog⁡w(xi)+n(θ⋅Tˉ−A(θ)). Because log⁡ is strictly increasing [F8], maximizing this log likelihood is equivalent to maximizing the likelihood. Also Tˉ is the convex combination with weights 1/n of T(xi), so Tˉ∈K.

1.2givenF1F2F7F8F10F11F13algebra

Suppose Tˉ∈ri⁡K. Minimality makes K full-dimensional, so there is ϵ>0 such that the open ball of radius ϵ about Tˉ lies in K; set δ=ϵ/2, so the closed ball of radius δ lies in that open ball and hence in K. For every unit u, Tˉ+δu is a convex combination of the vectors T(x); since u⋅u=1 by [F11], at least one x satisfies u⋅(T(x)−Tˉ)≥δ. Put wmin⁡=min⁡x∈Xw(x)>0. If θ≠0, write r=∥θ∥2 and u=θ/r; [F10] gives r>0 and ∥u∥2=1. For some x as above, θ⋅(T(x)−Tˉ)≥rδ. Since the xth summand is part of Z(θ) and is positive by [F13], monotonicity and the product law of log⁡ [F8], together with [F7], give A(θ)=log⁡Z(θ)≥log⁡(wmin⁡eθ⋅T(x))=log⁡wmin⁡+θ⋅T(x), and hence A(θ)−θ⋅Tˉ≥rδ+log⁡wmin⁡. Thus θ↦A(θ)−θ⋅Tˉ tends to +∞ as ∥θ∥2→∞.

2.1F2F3F9F12step 1.1algebra

Let θ≠φ and put v=φ−θ and g(s)=ℓ(θ+sv) for s∈[0,1]. By A∈C2 [F3], g is twice continuously differentiable; by [F2] its second derivative is g′′(s)=−n vT∇2A(θ+sv)v<0. Thus g′ is strictly decreasing: for 0≤a<b≤1, the mean value theorem [F9] applied to g′ gives g′(b)−g′(a)=g′′(c)(b−a)<0 for some c∈(a,b). Fix t∈(0,1). Applying [F9] to g on [0,t] and [t,1] gives α∈(0,t) and β∈(t,1) such that g(t)−g(0)t=g′(α)>g′(β)=g(1)−g(t)1−t. Rearranging yields g(t)>(1−t)g(0)+tg(1). By [F12], ℓ is strictly concave on Rk.

3.1F3F5F6F10step 1.1step 2.1step 1.2algebra

The function Φ(θ):=A(θ)−θ⋅Tˉ is continuous: A is continuous by [F3], and the linear form is continuous by the Cauchy–Schwarz bound [F10]. It tends to +∞ by step 1.2. Choose R>0 large enough that Φ(θ)>Φ(0) whenever ∥θ∥2>R. The closed ball B‾2(0,R) is nonempty and compact by [F6], so [F5] gives a minimizer θ^ on it. Since 0 lies in the ball and every point outside has value greater than Φ(0), θ^ is a global minimizer on Rk. The log-likelihood formula in step 1.1 and n≥1 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.

4.1givenA1F1F2F3F4F8step 1.1algebra∎

Suppose Tˉ∉ri⁡K. Since Tˉ∈K by step 1.1 and K is full-dimensional, Tˉ is a boundary point. By [F4] choose a unit u with u⋅(T(x)−Tˉ)≤0 for every x. Full affine span implies at least one of these inequalities is strict; otherwise u⋅T would be constant on X. Every πθ(x) is positive, so u⋅(∇A(θ)−Tˉ)=∑xπθ(x)u⋅(T(x)−Tˉ)<0 for every finite θ. Therefore the directional derivative of ℓ along u is n u⋅(Tˉ−∇A(θ))>0 at every finite θ. By the definition of a positive derivative, a sufficiently small positive step along u 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.

DefinitionDefinition: AI-adaptedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Finite latent Gibbs observation model

Definition

Let (Θ,T) be a nonempty measurable parameter space and let ϑ:(Θ,T)→(Rk,B(Rk)) be measurable. Let X be the finite state set of the finite exponential Gibbs family from the A-page Definition, evaluated at canonical parameter ϑ(θ); write its mass as πϑ(θ)(x). A finite latent Gibbs observation model consists of a prior probability measure Π on (Θ,T) and a probability kernel K from (Θ×X,T⊗2X) to a nonempty measurable data space (Y,Y), where 2X is the full power-set sigma-algebra on X and T⊗2X is the product sigma-algebra. The kernel K((θ,x),B) is the observation law for data event B when parameter θ and latent configuration x are fixed. Define the marginal sampling kernel Q(θ,B):=∑x∈Xπϑ(θ)(x)K((θ,x),B)(B∈Y). Thus the latent configuration is summed out before the data likelihood is evaluated.

In a dominated observation model, a specified measure ν on (Y,Y) is sigma-finite, meaning that Y is a countable union of measurable sets of finite ν-measure. A density is given by a map k:Θ×X×Y→[0,∞] measurable from (Θ×X×Y,(T⊗2X)⊗Y) to [0,∞] with its Borel sigma-algebra. Writing its value as k(y∣θ,x), for every (θ,x)∈Θ×X and B∈Y it satisfies K((θ,x),B)=∫Bk(y∣θ,x) ν(dy),∫Yk(y∣θ,x) ν(dy)=1. The marginal data density, or likelihood density at y, is then L(θ,y):=∑x∈Xπϑ(θ)(x)k(y∣θ,x). The general kernel model does not require a pointwise likelihood density.

Facts & Assumptions

Given: The finite exponential family, measurable parameter and data spaces, the proper prior, and the observation kernel in the Definition.

[F1]

Finite exponential Gibbs family for inverse inference: X is finite and, for each x∈X, πu(x)=w(x)exp⁡(u⋅T(x)−A(u)) with w(x)>0; its proof establishes A∈C2(Rk), positivity, and normalization.

[F2]

Cauchy-Schwarz ∣⟨x,y⟩∣≤∥x∥2∥y∥2 with its equality case, the triangle inequality for ∥⋅∥2, the parallelogram law and polarisation: ∣(u−v)⋅T(x)∣≤∥u−v∥2∥T(x)∥2 for u,v∈Rk, and the Euclidean norm is a norm.

[F3]

The exponential function is strictly increasing: exp⁡:R→(0,∞) is continuous.

[F4]

The product sigma-algebra and its finite iterates: T⊗2X is generated by measurable rectangles; for each fixed x∈X, the section map θ↦(θ,x) is measurable because the preimage of a rectangle A×D is A if x∈D and empty otherwise.

[F5]

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.

[F6]

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.

1.1givenF1F2F3algebra

Fix x∈X and define fx(u)=u⋅T(x) and gx(u)=fx(u)−A(u). By [F2], ∣fx(u)−fx(v)∣≤∥u−v∥2∥T(x)∥2, so fx is continuous. The function A is continuous by [F1], hence gx is continuous: at any u0 and for any ε>0, intersect neighborhoods on which ∣fx(u)−fx(u0)∣<ε/2 and ∣A(u)−A(u0)∣<ε/2. By continuity of exp⁡ [F3], its composition with gx is continuous (choose the continuity neighborhood of gx(u0) first, then use continuity of gx); multiplying by the fixed scalar w(x) preserves continuity by rescaling ε by w(x)>0. Thus the displayed formula makes u↦πu(x) 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 u↦πu(x) with the measurable ϑ makes θ↦πϑ(θ)(x) measurable.

1.2givenF1F5algebra

For each fixed θ, every summand in Q(θ,B) is nonnegative. For pairwise disjoint events Bj, countable additivity of each K((θ,x),⋅) and the finiteness of X let the finite sum over x commute with the nonnegative series over j, so Q(θ,⋅) is countably additive. Also Q(θ,Y)=∑xπϑ(θ)(x)=1.

2.1givenF1F4F5F6step 1.1step 1.2algebra

For each B∈Y, (θ,x)↦K((θ,x),B) is measurable by [F5]; composing with each measurable section from [F4] makes θ↦K((θ,x),B) measurable. Also θ↦πϑ(θ)(x) is measurable by step 1.1. Therefore Q(θ,B) is a finite sum of products of measurable functions and is measurable in θ. Thus Q is a probability kernel and, with the proper prior Π, is a Bayesian model in the sense of [F6].

3.1givenF1step 1.1step 1.2algebra∎

In the dominated case, each term πϑ(θ)(x)k(y∣θ,x) is jointly measurable and nonnegative by the Definition and step 1.1. Its finite sum L(θ,y) is jointly measurable; integrating it over B gives ∫BL(θ,y)ν(dy)=∑xπϑ(θ)(x)K((θ,x),B)=Q(θ,B). For B=Y, this integral is 1 by step 1.2, so L 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 Q 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 Q in this definition.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Posterior kernel and dominated formula for a latent Gibbs observation

Statement

Assume the Axiom of Choice. Let the parameter and data spaces (Θ,T) and (Y,Y) of a finite latent Gibbs observation model both be standard Borel, and let Π be its proper prior. Let J be the joint prior-predictive probability determined by Π and the marginal sampling kernel Q, and let JY be its data marginal. There exists a data-indexed probability kernel y↦Πy satisfying J(A×B)=∫BΠy(A) JY(dy)(A∈T, B∈Y), and any two such posterior kernels agree as probability measures for JY-almost every y.

In the dominated case with data measure ν and joint likelihood density L(θ,y)=∑x∈Xπϑ(θ)(x)k(y∣θ,x) from the Definition, define m(y):=∫ΘL(θ,y) Π(dθ). Then m is measurable, ∫Ym dν=1, and for ν-almost every y with 0<m(y)<∞ the posterior has the version Πy(A)=∫AL(θ,y) Π(dθ)m(y)(A∈T). The prior-predictive law gives zero mass to the set where m=0 or m=∞; the conditional identities do not determine pointwise posterior values there.

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 k.

[A1]

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.

[F1]

Finite latent Gibbs observation model: summing the finite latent state law with weights πϑ(θ)(x) against the observation kernel gives a parameter-measurable probability kernel Q; in the dominated case the finite sum L(θ,y)=∑xπϑ(θ)(x)k(y∣θ,x) is its joint likelihood density.

[F2]

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.

[F3]

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.

[F4]

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.

[F5]

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.

1.1givenA1F1F2F3

By [F1], the prior and Q 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 JY-almost-everywhere uniqueness, with the exact rectangle identity in the Statement.

1.2givenF1F4algebra

In the dominated case, L 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 L on their product. It gives measurability of m(y)=∫ΘL(θ,y)Π(dθ) and ∫Ym(y)ν(dy)=∫Θ∑xπϑ(θ)(x)(∫Yk(y∣θ,x)ν(dy))Π(dθ)=∫Θ∑xπϑ(θ)(x)Π(dθ)=1. For each B∈Y, the same calculation with 1B(y)L(θ,y) gives JY(B)=∫Bm(y)ν(dy). Here the finite sum and each normalized observation density are those of [F1].

2.1givenF1F4F5step 1.2

The set {m=∞} has ν-measure zero because m≥0 has integral one, and the set {m=0} has zero data-marginal mass because JY(dy)=m(y)ν(dy) by step 1.2. For each A∈T, the numerator nA(y)=∫AL(θ,y)Π(dθ) is measurable by [F4]. Define Π^y(A)=nA(y)/m(y) when 0<m(y)<∞, and set Π^y=Π otherwise. On valid y, the measure induced on Θ by the nonnegative density L(⋅,y) with respect to Π has total mass nΘ(y)=m(y), 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].

3.1F1F3F4step 1.2step 2.1algebra∎

For every A∈T and B∈Y, Tonelli and the data-marginal density established in step 1.2 give ∫BΠ^y(A)JY(dy)=∫BnA(y)ν(dy)=∫A×BL(θ,y)(Π×ν)(dθ,dy)=J(A×B); the exceptional values contribute zero because their JY-measure is zero. Thus the displayed ratio is a posterior version on its stated domain, and the general uniqueness assertion remains only JY-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.

DefinitionDefinition: AI-adaptedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Finite-volume Gibbs pseudo-likelihood with fixed boundary

Definition

Let d≥1, let Λ be a finite nonempty subset of Zd, let S be a finite nonempty spin set, let (Θ,T) be a nonempty measurable parameter space, and fix a boundary configuration η∈SZd∖Λ. Let C be a finite collection of finite subsets C⊆Zd with C∩Λ≠∅. For each C∈C, let ΦC:SC×Θ→R be finite-valued and measurable in θ for each spin assignment. For σ∈SΛ, let σˉ equal σ on Λ and η outside Λ, and define the finite-volume energy Hθη(σ):=∑C∈CΦC(σˉ∣C;θ). Its normalized Gibbs law is πθη(σ):=e−Hθη(σ)∑τ∈SΛe−Hθη(τ). For site i∈Λ, define its finite interaction neighborhood Ni:=(⋃C∈Ci∈CC)∖{i}. For σ∈SΛ and s∈S, write σi=s for the configuration obtained by replacing only its ith spin with s. The one-site conditional and finite-volume pseudo-likelihood are qi,θη(s∣σΛ∖{i}):=e−Hθη(σi=s)∑a∈Se−Hθη(σi=a),PLθη(σ):=∏i∈Λqi,θη(σi∣σΛ∖{i}). Every conditional uses the same fixed exterior boundary and is determined by the specified finite neighborhood Ni. The product is a finite conditional objective; it is not defined as a probability law on SΛ.

Facts & Assumptions

Given: The finite volume, finite spin set, finite interaction collection, finite-valued potentials, parameter measurability, and fixed boundary in the Definition.

[F1]

The real exponential function and the number e by a power series: exp⁡ is the real exponential power-series function defined for every real input.

[F2]

The exponential is positive and satisfies exp⁡(−x)=1/exp⁡(x): the real exponential is finite and strictly positive at every finite real input.

[F3]

The exponential function is strictly increasing: the real exponential is continuous, hence Borel measurable.

Proof

Given: The ingredients of the Definition.

1.1givenF1F2algebra

For each θ and each σ, Hθη(σ) is a finite sum of finite real values. Thus every weight e−Hθη(σ) 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 SΛ.

2.1givenF1F2step 1.1algebra

Fix i∈Λ and σΛ∖{i}. The denominator in qi,θη 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 i cancels the joint partition function and gives exactly the displayed ratio; summing that ratio over s∈S gives one. Hence it is the conditional probability vector of site i given the other spins. Since C is finite and each C is finite, Ni is finite. In the ratio, every potential indexed by a set C not containing i is the same for all values of s and cancels; hence only potentials meeting i, and therefore only spins in Ni and the fixed boundary values there, affect this conditional.

3.1givenF2F3step 1.1step 2.1algebra∎

Each Hθη(σ) 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 qi,θη are measurable in θ. Their finite product PLθη(σ) 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