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.

Likelihood potentials and posterior propriety — Examples and Counterexamples

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

None yet.

4 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-adaptedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

A proper Gaussian likelihood gives a proper posterior

Example

Assume the Axiom of Choice. Let X=R with its usual real Banach norm, let U=D={0,1} with the Borel subspace structure, and let the forward map be F(u)=u. Give the parameter the Borel probability μ0(A)=121{0∈A}+121{1∈A} for Borel A⊆R. Let the data space be R with its usual metric and Borel sigma-algebra. Conditional on u∈D, let the observation have law N(u,1), with Lebesgue density

L(u;y)=12πexp⁡ ⁣(−(y−u)22),

and likelihood potential Φ(u;y)=12(y−u)2+12log⁡(2π). For every y∈R,

Z(y)=12L(0;y)+12L(1;y)∈(0,∞),

and the normalized update on A⊆D is

Πy(A)=L(0;y)1{0∈A}+L(1;y)1{1∈A}L(0;y)+L(1;y).

This is a data-indexed posterior-kernel version for the prior-predictive model; its values on any measurable data-marginal-null set may be changed without changing the conditional-law identities.

Facts & Assumptions

Given: AC; X=R, U=D={0,1}, the identity forward map, the stated two-atom prior, the observation law N(u,1) and its displayed Lebesgue density, and its likelihood potential.

[A1]

AC is the assertion that every family of nonempty sets has a choice function. The Axiom of Choice

[F1]

Under AC, N(m,σ2) is the affine image of N(0,1) and for σ>0 has Lebesgue density 12πσ2e−(y−m)2/(2σ2). Standard normal and normal laws, A positive-variance normal law has its location-scale density

[F2]

AC implies countable choice. AC implies DC implies countable choice

[F4]

A proper Bayesian model has a probability prior and a parameter-measurable probability sampling kernel. Bayesian model as a prior and sampling kernel

[F5]

For the displayed common lower envelope and continuity assumptions, the evidence is finite and strictly positive, and the normalized fiberwise update is a probability. Function-space posterior propriety from a common lower envelope

[F6]

For a proper prior and a jointly measurable sampling density over a sigma-finite dominating measure, the data marginal has density m(y) and the filled normalized kernel is a conditional law. Bayes formula for dominated kernels

[F7]

Replacing a data-indexed conditional kernel on a measurable data-marginal-null set preserves its conditional identities. Conditional law given a random element

[F8]

A prior on a forward domain is a Borel probability on X with full measure on D. A Borel prior concentrated on a forward-map domain

[F9]

An inverse-problem forward map has metric parameter and data spaces, a nonempty admissible truth set U, and a map F:U→Y. Inverse-problem models and solution classes

[F10]

A probability kernel has probability sections at every parameter and measurable evaluations. Measure kernel and probability kernel

[F11]

Every real square is nonnegative and a≥−∣a∣ for every real a. Squares of nonzero elements are positive, Basic properties of the absolute value

[F12]

A nonnegative simple function has its simple integral, and that equals its nonnegative integral. The integral of a nonnegative simple function, The nonnegative integral agrees with the simple integral on simple functions

[F13]

Joint measurability uses the product sigma-algebra, and measurability is defined by measurable preimages. The product sigma-algebra and its finite iterates, A measurable function between measurable spaces

[F14]

At a fixed datum, evidence is the prior integral of the likelihood section and the normalized update is defined only at positive finite evidence. Misfit evidence and the potential posterior law

[F15]

The natural logarithm has domain (0,∞) and satisfies exp⁡(log⁡a)=a for every a>0 (The natural logarithm as the inverse of the exponential function).

[F16]

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

[F17]

In the complete ordered field R, every nonnegative real has a unique nonnegative square root (Square roots exist: a unique a≥0 with (a)2=a; the positives are {x2:x≠0}).

[F18]

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

Verification

Given: The hypotheses and conventions in the Statement.

1.1F8F9givenconstructalgebra

The set D=U={0,1} is Borel and nonempty. The function μ0(A)=121{0∈A}+121{1∈A} is countably additive: in a disjoint sequence of Borel sets each of the two points occurs at most once, so the sum of assigned masses equals the mass of the union. Also μ0(R)=1 and μ0(D)=1, making it a prior on the stated domain by [F8]. The identity F:D→R is measurable because every subset of finite D is Borel, and it satisfies the forward-map interface [F9].

1.2F15F16F17F18givenalgebra

For any u∈D and y∈R, put a:=2π; since log⁡a occurs in the real-valued potential, [F15] gives a>0. Put b:=12(y−u)2 and c:=12log⁡a. By [F15], exp⁡(2c)=a. By [F16], exp⁡(c)2=exp⁡(2c)=a; by [F18], exp⁡(c)>0. Thus uniqueness of the nonnegative square root [F17] gives exp⁡(c)=2π, and [F18] gives exp⁡(−c)=1/2π. Applying [F16] again, e−Φ(u;y)=exp⁡(−(b+c))=exp⁡(−b)exp⁡(−c)=12πexp⁡ ⁣(−(y−u)22)=L(u;y). The last expression is the displayed Gaussian density, so the likelihood and potential agree pointwise.

2.1A1F1F2F3F4F8F9F10F13step 1.1givenalgebra

By [A1] and [F1], each N(u,1) is a probability law with the displayed density; since D is finite, every evaluation u↦N(u,1)(B) is measurable, so [F10] gives a probability kernel. By [F2] and [F3], Lebesgue measure is sigma-finite. The potential and likelihood are jointly Borel: for each of the two u values their data sections are continuous, each singleton {u} is Borel in D, and each preimage of a Borel set is a finite union of rectangles {u}×Bu in B(D)⊗B(R) by [F13]. Thus [F4] gives a proper Bayesian model with the stated prior and sampling kernel.

3.1F5F8F11F12step 2.1givenalgebra

The finite subspace D={0,1} is discrete: the open balls of radius 1/2 about 0 and 1 isolate the two points, so every real-valued function on D is continuous. For every u∈D and y∈R, Φ(u;y) is finite. By [F11], (y−u)2≥0 and a≥−∣a∣ for a:=12log⁡(2π), so Φ(u;y)≥−C where C:=∣a∣≥0. The constant envelope M1(r)=C is Borel, and [F12] gives ∫DeM1(∥u∥) μ0(du)=eCμ0(D)=eC<∞. Applying [F5] with Y0=R proves 0<Z(y)<∞ and propriety of the normalized update for every datum.

4.1F12F14step 1.2step 3.1givenalgebra

By [F14], integrate the likelihood section against the prior. Step 1.2 gives L(u;y)=e−Φ(u;y) for both atoms, so this likelihood evidence equals ZΦ(y); using the two prior atoms gives Z(y)=12L(0;y)+12L(1;y). Step 3.1 gives 0<Z(y)<∞. Since D is finite, the likelihood section is simple, so [F12] gives the numerator for any A⊆D as 12L(0;y)1{0∈A}+12L(1;y)1{1∈A}. Dividing by Z(y) yields the stated posterior weights.

5.1F4F6F7step 2.1step 4.1∎

Apply [F6] with parameter u∈D, prior μ0, dominating measure Lebesgue, and the jointly Borel density L(u;y). Its evidence is exactly the Z(y) computed in step 4.1, so the displayed Πy is a data-indexed posterior-kernel version. By [F7], changing its values on a data-marginal-null set leaves the conditional identities unchanged.

ExampleConstruction: AI-generatedVerification: AI-adaptedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

A zero-evidence fiber has no normalized fiberwise update

Example

Let X=R with its usual real Banach norm, let U=D={0,1} with the Borel subspace structure, and let the forward map be the constant map F(u)=0. Give the parameter the Borel probability μ0(A)=121{0∈A}+121{1∈A} for Borel A⊆R. Take data space Y={0,1} with the usual subspace metric, its power-set sigma-algebra and counting measure, and deterministic sampling kernel Q(u,⋅)=δF(u)=δ0. Its density is L(u;y)=1 for y=0 and L(u;y)=0 for y=1, with potential Φ(u;0)=0 and Φ(u;1)=+∞. Thus Z(0)=1 but Z(1)=0. At y=1 no normalized fiberwise update is defined; the data law assigns {1} probability zero, so a posterior-kernel version may use the prior filler there or any other probability measure on D. The finite-potential propriety theorem does not apply at y=1.

Facts & Assumptions

Given: The finite parameter domain D={0,1}, the half-half prior, the constant forward map, the deterministic sampling kernel and its counting-measure density.

[F1]

A prior on a forward domain is a Borel probability on X with full mass on D. A Borel prior concentrated on a forward-map domain

[F2]

Evidence is the integral of the nonnegative likelihood section; the normalized update is defined only when that evidence is positive and finite. Misfit evidence and the potential posterior law

[F3]

A proper Bayesian model consists of a probability prior and a parameter-measurable probability kernel. Bayesian model as a prior and sampling kernel

[F4]

The Dirac set function gives mass one to sets containing its point and zero otherwise, and is a probability measure. The Dirac set function at a point, A Dirac set function is a probability measure

[F5]

Counting measure on P(X) assigns finite sets their cardinality and infinite sets +∞. Counting measure on an arbitrary set

[F6]

Counting measure is a measure on the power-set sigma-algebra. Counting measure is a measure

[F7]

A probability kernel has probability sections at every parameter and measurable evaluations. Measure kernel and probability kernel

[F8]

In a dominated model, the evidence is the data-marginal density and the kernel with prior fillers on zero and infinite fibers is a conditional law version. Bayes formula for dominated kernels

[F9]

A finite positive scaling of the zero likelihood measure cannot be a probability. Fiberwise posterior propriety is equivalent to finite positive evidence

[F10]

Changing a data-indexed conditional kernel on a measurable data-marginal-null set preserves its conditional identities. Conditional law given a random element

[F11]

The propriety theorem assumes every potential section in its specified data set is finite and continuous. Function-space posterior propriety from a common lower envelope

[F12]

An inverse-problem forward map has metric parameter and data spaces, a nonempty admissible truth set, and a map defined on it. Inverse-problem models and solution classes

[F13]

The product sigma-algebra is generated by measurable rectangles, and a map is measurable when preimages of target-measurable sets are measurable. The product sigma-algebra and its finite iterates, A measurable function between measurable spaces

Verification

Given: The hypotheses and conventions in the Statement.

1.1givenF1F3F4F7F12construct

The half-half set function μ0 is a probability: in any disjoint Borel sequence each of 0 and 1 occurs in at most one member, so the mass of the union equals the sum of the masses, and μ0(R)=1. Since μ0(D)=1, it is a prior on D by [F1]. The constant map F(u)=0 is a forward map on the nonempty truth set U=D by [F12], and its restriction is measurable because every preimage is D or ∅. For each u∈D, Q(u,⋅)=δ0 is a probability measure by [F4], and every evaluation u↦Q(u,B) is measurable on finite D; hence [F7] makes Q a probability kernel. Thus [F3] gives a proper Bayesian model.

2.1F2F5F6F9F11F13step 1.1givenalgebra

With counting measure on Y, the density is L(u,y)=1{y=0} for both parameter values; its sum over y∈{0,1} is one, so it represents the stated kernel. The potential and density are jointly measurable: each singleton rectangle {u}×{y} is measurable, so every subset of finite D×Y is a finite union of measurable rectangles by [F13]. Integrating the kernel against the half-half prior gives data law concentrated at 0, and the same density gives Z(0)=12+12=1 and Z(1)=0. At y=1, [F9] rules out any finite positive scaling of the zero likelihood measure as a probability. The potential equals +∞ on D at this datum, so the finite-section hypothesis in [F11] fails.

3.1F4F8F10step 2.1given∎

The explicit dominated kernel from [F8] uses the normalized update at y=0 and prior filler μ0 at y=1. The data law gives {1} probability zero by step 2.1, so [F10] allows replacing that filler by δ1 without changing the conditional identities. Both fillers are probability measures on D by [F4], but neither is obtained by normalizing the zero-evidence fiber.

ExampleConstruction: AI-generatedVerification: AI-adaptedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

An improper counting prior can have finite evidence at one datum

Example

Assume the Axiom of Choice. Let X=R with its usual real Banach norm, and let N={0,1,2,…} with its power-set sigma-algebra and counting measure μ. Let U=D=N⊆X and take the forward map F(n)=n into data space R with its usual metric and Borel sigma-algebra. The measure μ is sigma-finite and has μ(N)=+∞. For parameter n, use the proper Gaussian observation law Y∣n∼N(n,1), with Lebesgue density

Ly(n)=12πexp⁡ ⁣(−(y−n)22).

At datum y=0 its evidence is

Z(0)=12π∑n=0∞e−n2/2∈(0,∞),

and the normalized fiberwise update is the probability

Π0({n})=e−n2/2∑j=0∞e−j2/2(n∈N).

Because μ has infinite total mass, this is a fixed-data update only and does not define a prior-predictive probability.

Example references

Facts & Assumptions

Given: The counting measure on N, the Gaussian sampling likelihood Ly(n), the fixed datum y=0, and AC for the repository's standard-normal definition.

[A1]

AC selects from every family of nonempty sets. The Axiom of Choice

[F1]

Counting measure assigns finite sets their cardinality and infinite sets measure +∞. Counting measure on an arbitrary set

[F2]

The counting set function is a measure on the power-set sigma-algebra. Counting measure is a measure

[F3]

Sigma-finiteness means a countable measurable cover by sets of finite measure. Finite, sigma-finite, and semifinite measures

[F4]

Under AC, N(m,1) is the affine image of the standard normal law and has Lebesgue density 12πe−(y−m)2/2. Standard normal and normal laws, A positive-variance normal law has its location-scale density

[F5]

AC implies countable choice. AC implies DC implies countable choice

[F6]

On N with counting measure, ∫f dμ=∑n=0∞f(n) for nonnegative measurable f. Counting-measure integration is a nonnegative series

[F9]

For a sigma-finite measure and measurable likelihood section, evidence is the fixed-data normalizer; for an improper prior it does not define a prior-predictive probability or conditional law. Evidence normalizer and fiberwise posterior update

[F10]

A finite positive evidence normalizes the likelihood section to a probability measure. Fiberwise posterior propriety is equivalent to finite positive evidence

[F11]

A proper Bayesian model requires a probability prior; an infinite counting measure is not such a prior. Bayesian model as a prior and sampling kernel

[F12]

The function-space propriety theorem assumes a Borel probability on a separable real Banach parameter space, so it does not apply to this infinite counting measure on N. Function-space posterior propriety from a common lower envelope

[F13]

A probability kernel has probability sections at every parameter and measurable evaluations. Measure kernel and probability kernel

[F14]

A forward map is defined on a nonempty admissible truth set between metric parameter and data spaces. Inverse-problem models and solution classes

[F15]

A function on (N,P(N)) is measurable because every preimage is a subset of N. A measurable function between measurable spaces

[F16]

N is countably infinite by its identity bijection, and no finite set is equinumerous with N. Finite, countably infinite, countable, uncountable, The pigeonhole principle on N

Verification

Given: The hypotheses and conventions in the Statement.

1.1F1F2F3F16givenconstruct

For each m∈N, the initial set Em={0,1,…,m} has counting measure m+1<∞ by [F1] and [F2], and ⋃mEm=N. Thus μ is sigma-finite by [F3]. By [F16], N is infinite, so [F1] gives μ(N)=+∞.

1.2F4F6F8F15givenalgebra

The counting-integral formula [F6] gives Z(0)=∫Ne−n2/22π μ(dn)=12π∑n=0∞e−n2/2. Its n=0 term is 1/2π>0 by [F8].

2.1A1F4F5F11F13F14F15step 1.1given

AC implies countable choice by [F5], so the normal-density interface [F4] applies: for each n, N(n,1) is a probability law with the displayed Gaussian density. Since the parameter sigma-algebra is P(N), every evaluation n↦N(n,1)(B) is measurable, and the likelihood section n↦Ly(n) is measurable by [F15]; thus the sampling family satisfies [F13]. The map F(n)=n on the nonempty admissible set U=N satisfies the forward-map interface [F14]. By [F11] this is not a proper Bayesian model with prior μ, because [step 1.1] shows the prior mass is infinite.

2.2F7F8step 1.2givenalgebra

For every n≥1, n2−n=n(n−1)≥0, since n and n−1 are nonnegative; hence n2≥n. Monotonicity of the exponential [F8] gives e−n2/2≤e−n/2. Let r=e−1/2. By [F8], 0<r<1, and [F7] makes ∑n=1∞rn finite. Comparison of nonnegative partial sums now bounds the evidence series in step 1.2 by 1+∑n=1∞rn<∞. Hence 0<Z(0)<∞.

3.1F9F10F11F12step 1.1step 1.2step 2.1step 2.2∎

Applying [F10] to L0 and the sigma-finite measure μ gives the probability with singleton masses L0(n)/Z(0)=e−n2/2/∑je−j2/2, as stated. Its fixed-data meaning and lack of a prior-predictive probability follow from [F9]; [F11] confirms that no proper Bayesian model is supplied by this prior. The function-space propriety theorem [F12] does not apply because its prior is a probability, whereas [step 1.1] gives μ(N)=+∞.

Sources