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.

✓ 4 results · all verified · 4 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 4 also cleared it.

Posterior propriety and dominated Bayes formula — Examples

1 · Prerequisites

2 · Summary

A finite model illustrates a valid positive evidence normalizer. A separate finite dominated model has a prior-predictive null fiber, where the quotient is undefined and a conditional-law version supplies only a filler value. With a flat Lebesgue prior, at least one known-variance normal observation yields a proper normal posterior; the improper Beta(0,0) prior instead has an infinite binomial posterior normalizer at either all-failure or all-success data. The last two examples are fiberwise updates under sigma-finite improper priors and make no prior-predictive probability claim.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

A finite model with positive finite evidence

Example

Take Θ={a,b} with its full power-set sigma-algebra and prior masses Π({a})=1/3 and Π({b})=2/3. Let the observation space be {0,1} with its full power-set sigma-algebra and counting measure. At parameter a, assign probabilities 1/2,1/2 to 0,1; at parameter b, assign probabilities 3/4,1/4 to 0,1. For the observed value y=1, the evidence is positive and finite, and the posterior gives equal mass to a and b.

Facts & Assumptions

[F1]

Evidence normalizer and fiberwise posterior update: for a fixed observation, ZΠ(y)=∫Ly dΠ and the fiberwise update divides the unnormalized measure by ZΠ(y) only when that value is finite and positive.

[F2]

Fiberwise posterior propriety is equivalent to finite positive evidence: a finite positive evidence normalizer gives a probability update after division by that normalizer.

Given: The finite parameter space, prior, observation probabilities, and observed value y=1 in the Example.

Verification

1.1givenF1algebra

The prior has total mass 1/3+2/3=1, and both conditional probability vectors sum to one. The likelihood at y=1 is L1(a)=1/2 and L1(b)=1/4, so the evidence is ZΠ(1)=(1/3)(1/2)+(2/3)(1/4)=1/3∈(0,+∞).

2.1step 1.1F1F2algebra∎

The unnormalized masses are (1/3)(1/2)=1/6 at a and (2/3)(1/4)=1/6 at b. Dividing each by ZΠ(1)=1/3 gives posterior mass 1/2 at each point, a probability update by [F2].

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

A prior-predictive null fiber has no quotient posterior

Example

Let Θ={a,b} have its full power-set sigma-algebra and prior mass 1/2 at each point. Let the data space be Y={0,1,2} with its full power-set sigma-algebra and counting measure. Conditional on a, the observation is 0 with probability one; conditional on b, it is 1 with probability one. The sampling kernel has density ℓ(a,y)=1{0}(y) and ℓ(b,y)=1{1}(y); it is jointly measurable on these finite power-set spaces. Then Z(2)=0, so the quotient formula is undefined at 2; the prior-predictive probability of that observation is zero.

Facts & Assumptions

[F1]

Evidence normalizer and fiberwise posterior update: at a fixed data value, the evidence is the integral of the nonnegative likelihood section against the prior measure, and a quotient update is defined only for finite positive evidence.

[F2]

Fiberwise posterior propriety is equivalent to finite positive evidence: zero evidence cannot be made into a probability by finite positive scaling.

[F3]

Bayes formula for dominated kernels: for a proper prior and a jointly measurable normalized sampling-kernel density, the evidence m is the data marginal density; the kernel uses the quotient where 0<m<∞ and the prior as the stated filler where m=0 or m=∞. The filled fibers have zero prior-predictive marginal mass.

Given: The finite prior, data space, conditional laws, and likelihood density specified in the Example.

Verification

1.1givenF1algebra

The likelihood sections are normalized: L0(a)=1, L1(b)=1, and all other parameter-data pairs have likelihood zero. Therefore Z(0)=1/2, Z(1)=1/2, and Z(2)=0.

2.1step 1.1F2F3algebra∎

By [F3], the prior-predictive mass at 2 is Z(2) times its counting measure, hence zero. At this fiber every numerator ∫AL2 dΠ is also zero, so the displayed quotient is 0/0 and is not defined; the theorem's chosen filler is K(2,A)=Π(A). This filler is a version value on a prior-predictive null event, not an update inferred from the observation.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

A flat prior gives a proper known-variance normal-mean posterior

Example

Let n≥1, let the observed real values be y1,…,yn, and let the known variance be σ2>0, with σ=σ2. The parameter space is (R,L(R)) with Lebesgue measure λ. Equip the data space Rn with the finite product of L(R) and the recursively defined product measure λ⊗n. For each parameter μ, define the one-observation law by the density qμ(x)=1σ2πexp⁡ ⁣(−(x−μ)22σ2) relative to λ and take the n-observation sampling law to be the product of these one-coordinate laws. Its likelihood density at y=(y1,…,yn) is Ly(μ)=∏i=1nqμ(yi). Take the flat prior measure λ on R. Writing yˉ=n−1∑i=1nyi, the evidence is finite and positive, and the fiberwise posterior has Lebesgue density (n2πσ2)1/2exp⁡ ⁣(−n(μ−yˉ)22σ2). Its restriction to Borel sets is the normal law N(yˉ,σ2/n).

Facts & Assumptions

[A1]

The Axiom of Choice: the Axiom of Choice is assumed for the stated choice-dependent Lebesgue-measure, standard-normal, and change-of-variables suppliers.

[F1]

Evidence normalizer and fiberwise posterior update: the fiberwise update divides the likelihood section times the prior measure by its evidence only on a finite positive fiber.

[F2]

Fiberwise posterior propriety is equivalent to finite positive evidence: a finite positive evidence normalizer yields a probability after division by that normalizer.

[F3]

Lebesgue measure is sigma-finite, and every metrically bounded subset of Rn has finite outer measure: assuming countable choice, Lebesgue measure on Rd is sigma-finite, and the boxes (−k,k]d have measure (2k)d and cover the space.

[F4]

Measures are monotone: if A⊆B are measurable, then λ(A)≤λ(B).

[F5]

The standard normal density has total mass one: under the Axiom of Choice, ϕ(t)=(2π)−1/2e−t2/2 is positive and Borel measurable with ∫Rϕ dλ=1.

[F6]

AC implies DC implies countable choice: the Axiom of Choice implies the Axiom of Countable Choice.

[F7]

A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions: under countable choice, a C1 diffeomorphism between open Euclidean sets obeys the change-of-variables formula for every nonnegative Lebesgue-measurable integrand.

[F8]

The product sigma-algebra and its finite iterates: the finite product sigma-algebra is defined recursively from measurable rectangles.

[F9]

The product measure of two sigma-finite measure spaces: for sigma-finite factors, the product measure is defined by integrating section measures.

[F10]

For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique: for sigma-finite factors, the product measure exists, satisfies the rectangle formula, and is sigma-finite.

[F11]

Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: a nonnegative product-measurable function on a sigma-finite product has equal iterated and product integrals.

[F12]

Continuous functions on Euclidean spaces are Borel measurable: under countable choice, a continuous map between finite-dimensional Euclidean spaces is Borel measurable.

[F13]

The Borel sigma-algebra of a topological space: B(R) is the sigma-algebra generated by the open subsets of R.

[F14]

Standard normal and normal laws: N(0,1) has density ϕ and N(m,s2) for s>0 is the pushforward of N(0,1) by z↦m+sz.

[F15]

Assuming countable choice, every Borel subset of Rn is Lebesgue measurable: under countable choice, every Borel subset of a Euclidean space is Lebesgue measurable.

[F16]

The indefinite integral of a nonnegative measurable function is a measure: the set function A↦∫Af dμ is a measure for every nonnegative measurable f.

[F17]

Probability measures and probability spaces: a probability measure is a measure of total mass one.

Given: The model and data in the Example, the Axiom of Choice, and Lebesgue measure on the indicated real spaces.

Verification

1.1givenA1F3F4F6algebra

By [A1] and [F6], countable choice is available for [F3]. The boxes Ek=(−k,k] have finite measure 2k and cover R by [F3], so λ is sigma-finite. Since Ek⊆R, [F4] gives λ(R)≥2k for every k, hence λ(R)=+∞ and the flat prior is improper.

1.2givenA1F5F6F7F12F13F14F15F16F17algebra

Fix μ and set T(x)=(x−μ)/σ. This is a C1 diffeomorphism of R with inverse t↦μ+σt and ∣T′(x)∣=1/σ. The formula for qμ is continuous in x, hence Borel by [F12] and Lebesgue measurable by [F15]. Since ϕ is also Lebesgue measurable by [F5, F15], [F7] gives ∫Rqμ dλ=∫Rϕ dλ=1. The set function Pμ(A)=∫Aqμ dλ is a measure by [F16], and its total mass one makes it a probability by [F17]. For a Borel A, apply [F7] to f=1Aqμ and S(z)=μ+σz: N(μ,σ2)(A)=∫1A(S(z))ϕ(z) dλ(z)=∫Aqμ(x) dλ(x), since σqμ(S(z))=ϕ(z) and [F14] defines N(μ,σ2) as this affine pushforward. Thus each coordinate law has the stated density.

1.3givenA1F1F6F12F15algebra

Put S=∑i=1n(yi−yˉ)2. Expanding and using ∑i(yi−yˉ)=0 gives ∑i(yi−μ)2=S+n(μ−yˉ)2. Hence Ly(μ)=(2πσ2)−n/2e−S/(2σ2)e−n(μ−yˉ)2/(2σ2). This is continuous in μ, hence Borel by [F12] and L(R)-measurable by [F15]; therefore its evidence integral is defined by [F1].

2.1givenA1F3F6F8F9F10F11F16F17step 1.2

For k≥1, recursively form the finite product data measure νk=λ⊗k on L(R)⊗k using [F8] and [F9]. Starting from the sigma-finite λ, [F10] ensures that each νk exists and is sigma-finite. The coordinate projections are measurable by [F8], so each pullback of qμ is measurable by step 1.2; finite multiplication is continuous, making fk(y1,…,yk)=∏i=1kqμ(yi) product-measurable. Step 1.2 gives ∫f1 dν1=1. If ∫fk dνk=1, the recursive product definition and Tonelli [F11] give ∫fk+1 dνk+1=∫fk dνk∫qμ dλ=1. Thus Pμ,n(E):=∫Efn dνn is a measure by [F16] and a probability by [F17]. For measurable rectangles E=A1×⋯×An, repeated Tonelli gives Pμ,n(E)=∏i=1nPμ(Ai). The product measure theorem [F10], iterated over the finite factors, identifies Pμ,n as the product of the one-coordinate laws. Therefore these coordinates are independent and Ly(μ) is their joint density.

2.2givenA1F1F5F6F7F15step 1.3algebra

Set T(μ)=n(μ−yˉ)/σ, a C1 diffeomorphism of R with inverse u↦yˉ+σu/n and derivative n/σ. Since e−u2/2=2π ϕ(u) is nonnegative and Lebesgue measurable by [F5, F15], [F7] gives ∫Re−n(μ−yˉ)2/(2σ2) dλ(μ)=σn2π. Integrating the factorization in step 1.3 against the flat prior gives Z(y)=(2πσ2)−n/2e−S/(2σ2)σ2πn, which is strictly positive and finite for every finite data vector.

3.1givenA1F2F6F7F12F13F14F15step 1.1step 1.3step 2.2algebra∎

Dividing step 1.3 by the finite positive evidence in step 2.2 gives h(μ)=nσϕ ⁣(n(μ−yˉ)σ), the displayed Lebesgue density. Put s=σ/n>0; S(z)=yˉ+sz is a C1 diffeomorphism with inverse μ↦(μ−yˉ)/s. For every Borel A, [F14] defines N(yˉ,s2) as this pushforward; [F7] applied to f=1Ah, which is Lebesgue measurable by [F12, F13, F15], gives ∫Ah(μ) dλ(μ)=∫1A(S(z))h(S(z))s dλ(z)=∫1A(S(z))ϕ(z) dλ(z)=N(yˉ,s2)(A). The update on the full Lebesgue sigma-algebra is a probability by [F2]. If n=0 were allowed, its empty-product likelihood would be 1 and the evidence would be λ(R)=+∞ by step 1.1, so no normalized update would exist.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

The improper Beta(0,0) prior has a divergent binomial endpoint posterior

Example

Let n≥1 and suppose Y∣p∼Binomial⁡(n,p) for p∈(0,1), equipped with the restricted Lebesgue sigma-algebra L(R)∣(0,1):={A∩(0,1):A∈L(R)}. Use the prior measure with density 1/[p(1−p)] relative to Lebesgue measure restricted to (0,1): Π(dp)=dpp(1−p). Equivalently, for an observed count y∈{0,…,n} the likelihood is Ly(p)=(ny)py(1−p)n−y. For an observed count y=0, the posterior normalizer diverges as p↓0; for y=n, it diverges as p↑1. In either endpoint case, this likelihood and prior do not define a posterior probability by normalization.

Facts & Assumptions

[F1]

Evidence normalizer and fiberwise posterior update: a fiberwise update is defined only when its likelihood integral against the prior is finite and positive.

[F2]

Fiberwise posterior propriety is equivalent to finite positive evidence: when the normalizer is infinite, no finite positive constant makes the integrated likelihood a probability measure.

[A1]

The Axiom of Choice: the Axiom of Choice is assumed only to obtain the countable-choice premise used by the Lebesgue-measure, box-measure, and Borel-measurability suppliers.

[F3]

Finite, sigma-finite, and semifinite measures: a measure is sigma-finite if the space is a countable union of measurable sets of finite measure.

[F4]

A box in Rn with parameters ai≤bi is Lebesgue measurable of measure ∏i<n(bi−ai), whichever of its faces are included: assuming countable choice, each interval with finite endpoints is Lebesgue measurable and has measure its length.

[F5]

The indefinite integral of a nonnegative measurable function is a measure: for a nonnegative measurable density, integration over measurable sets defines a measure.

[F6]

Monotonicity and nonnegative homogeneity of the nonnegative integral: the nonnegative integral is monotone and homogeneous for finite positive scalars.

[F7]

AC implies DC implies countable choice: in particular, the Axiom of Choice implies countable choice.

[F8]

For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε: for every ε>0 there is an integer k≥1 with 1/k<ε.

[F9]

The Borel sigma-algebra of a topological space: the Borel sigma-algebra is generated by the open sets.

[F10]

Assuming countable choice, every Borel subset of Rn is Lebesgue measurable: assuming countable choice, every Borel subset of R is Lebesgue measurable.

[F11]

Given: An integer n≥1, a count y∈{0,…,n}, the binomial likelihood, and the prior measure in the Example.

Verification

1.1givenA1F3F4F5F6F7F8F9F10F11algebra

By [A1] and [F7], countable choice is available for [F3], [F4], [F10], and [F11]. Write f(p)=1/[p(1−p)] on (0,1). For any continuous g:(0,1)→R and open U⊆R, continuity makes g−1(U) open in the subspace (0,1), so g−1(U)=O∩(0,1) for some open O⊆R. This intersection is open in R, hence Borel by [F9] and Lebesgue measurable by [F10]. Thus g is measurable for the restricted Lebesgue sigma-algebra. This applies to f and to every binomial likelihood section, which is a polynomial. By [F11], Lebesgue measure on R is a measure; its restriction to the measurable interval (0,1) is a measure as well. Thus [F5] defines the prior measure Π(A)=∫Af dλ. For each p∈(0,1), let ε=min⁡{p,1−p,1/3}>0; by [F8] choose k≥1 with 1/k<ε. Then k≥3 and p∈Ek=[1/k,1−1/k], so these sets cover (0,1). On Ek, f(p)≤k2. Their Lebesgue lengths are at most one by [F4], so homogeneity and monotonicity [F6] give Π(Ek)≤k2<∞; [F3] makes this a sigma-finite prior. It is not finite: on each disjoint interval Ij=(2−j−1,2−j], j≥1, one has f(p)≥1/p≥2j and λ(Ij)=2−j−1 by [F4]. Homogeneity and monotonicity [F6] give Π(Ij)=∫Ijf dλ≥1/2. By [F5], Π is a measure, so the prior mass of the union of the first m such intervals is at least m/2 for every m. Hence Π((0,1))=+∞ and the prior is improper.

2.1step 1.1givenF1F4F5F6algebra

For y=0, put ν0(A):=∫AL0 dΠ; it is a measure by [F5], and Z(0)=ν0((0,1)) by [F1]. The likelihood is L0(p)=(n0)(1−p)n=(1−p)n, so on each Ij from step 1.1, p≤1/2 gives L0(p)≥2−n. Also Π(Ij)≥1/2 by step 1.1. Monotonicity and homogeneity [F6] therefore give ν0(Ij)≥2−n−1. The intervals are pairwise disjoint, so measure additivity gives ν0(⋃j=1mIj)≥m2−n−1; since this union is contained in (0,1), countable additivity gives ν0((0,1))≥m2−n−1 for every m. Thus Z(0)=+∞ and [F1] leaves the quotient undefined.

3.1step 1.1step 2.1givenF1F2F4F5F6algebra∎

For y=n, put νn(A):=∫ALn dΠ; it is a measure by [F5], and Z(n)=νn((0,1)) by [F1]. Here Ln(p)=(nn)pn=pn. On each reflected interval Jj=[1−2−j,1−2−j−1), j≥1, one has p≥1/2, so Ln(p)≥2−n. Also f(p)≥1/(1−p)≥2j there and λ(Jj)=2−j−1 by [F4], so Π(Jj)≥1/2 by [F6]. Monotonicity and homogeneity [F6] give νn(Jj)≥2−n−1. The intervals are pairwise disjoint, and additivity followed by nonnegativity on their complement gives Z(n)=νn((0,1))≥m2−n−1 for every m. Thus Z(n)=+∞ and [F1] leaves this quotient undefined. By [F2], neither endpoint fiber admits a normalized posterior probability.

Sources