Alphabeta Math
DefinitionDefinition: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)
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.

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.

Depends on

Dependency tree · 2 levels

Sources