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.

Bayesian models, priors, and posterior laws — Examples

1 · Prerequisites

2 · Summary

The examples compute a finite posterior and show why a null-data posterior version is not unique; realize a posterior RCD as a sample-point-indexed random probability measure; construct a standard-Borel posterior kernel for countable data; and verify the dominated-density formula on a nonstandard-Borel observation space. The last example uses a separate, choice-free construction and does not rely on standard-Borel factorization.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

A finite Bayesian update and a null-data posterior version

Example

Let Θ={0,1} with prior Π(1)=1/3, and let Y={0,1,2} have its power-set sigma-algebra. Given θ=1, assign probabilities (1/4,3/4,0) to (0,1,2); given θ=0, assign probabilities (3/4,1/4,0). The posterior probability of θ=1 is 1/7 after data 0 and 3/5 after data 1. Data value 2 has prior-predictive probability zero, so two versions may assign different posterior laws there.

Facts & Assumptions

Given: The finite parameter and data spaces and the prior and sampling probabilities specified in the example.

[F1]

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

[F2]

A data-indexed posterior kernel satisfies the rectangle conditional-law identity; its values on prior-predictive null data may vary by version. Bayesian posterior as a regular conditional law

[F3]

A proper prior and sampling kernel define the joint law by J(A×B)=∫AK(θ,B) Π(dθ). A prior and model kernel define a joint law

Verification

Given: The assumptions and finite model in the example.

1.1givenF1F3algebra

The joint masses are J(1,0)=1/12, J(0,0)=1/2, J(1,1)=1/4, and J(0,1)=1/6, while both masses at data 2 are zero. Therefore JY(0)=7/12, JY(1)=5/12, and JY(2)=0.

2.1F1F2step 1.1algebraconstruct

Define Π0(1)=1/7, Π1(1)=3/5, and choose any probability law for Π2; set Πy(0)=1−Πy(1). Each Πy is a probability, and measurability is automatic on the finite power-set data space. The displayed ratios give Π0(1)JY(0)=J(1,0) and Π1(1)JY(1)=J(1,1); subtraction from the marginal gives the same identities for parameter value 0.

3.1F2step 1.1step 2.1algebra∎

For any A⊆Θ and B⊆Y, summing the singleton identities in step 2.1 over y∈B gives ∫BΠy(A) JY(dy)=J(A×B); the zero-mass term at y=2 contributes zero for every choice of Π2. Thus every such kernel is a data-indexed posterior version by [F2]. In particular, Π2=δ0 and Π~2=δ1, with the same values at 0,1, are distinct versions of the same posterior law.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

A Bayesian posterior RCD indexed by the sample point

Example

Let Θ=Y={0,1}, give each parameter prior probability 1/2, and set K(θ,{y})=3/4 when y=θ and 1/4 otherwise. On the canonical joint space Ω=Θ×Y, the posterior RCD is the random probability measure L(ω,⋅)=ΠY(ω), where Πy(y)=3/4 and Πy(1−y)=1/4. The RCD is evaluated at a sample point ω; the data-indexed version is the separate kernel y↦Πy.

Facts & Assumptions

Given: The finite model and the canonical joint probability specified in the example.

[F1]

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

[F2]

A posterior RCD is indexed by the sample point, while a data-indexed posterior is a kernel on the data space whose composition with Y satisfies the conditional-law identity. Bayesian posterior as a regular conditional law

[F3]

The prior and sampling kernel define the joint probability on the product space. A prior and model kernel define a joint law

Verification

Given: The assumptions and finite model in the example.

1.1givenF1F3algebra

The joint law assigns mass 3/8 to each diagonal point (0,0),(1,1) and 1/8 to each off-diagonal point; hence JY(0)=JY(1)=1/2.

2.1givenF2step 1.1algebraconstruct

For each y, Πy has masses 3/4 at y and 1/4 at 1−y, so it is a probability, with Πy({y})JY(y)=3/8=J(y,y) and Πy({1−y})JY(y)=1/8=J(1−y,y). Define L(ω,A)=ΠY(ω)(A). Since the spaces are finite, both y↦Πy(A) and ω↦L(ω,A) are measurable for every A⊆Θ.

3.1F2step 1.1step 2.1algebra∎

Every event H∈σ(Y) is Θ×B for some B⊆Y. For any A⊆Θ, ∫HL(ω,A) J(dω)=∑y∈BΠy(A)JY(y)=∑y∈BJ(A×{y})=J(H∩{X∈A}). Thus L is an RCD of X given σ(Y), and by [F2] it is the posterior RCD.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

A dominated posterior on a nonstandard-Borel observation space

Example

Let the data set be a disjoint union Y=U⊔V⊔W of three uncountable sets, with sigma-algebra consisting of all unions of these three atoms and reference probability ν(U)=ν(V)=ν(W)=1/3. This measurable space is not standard Borel: distinct points of U cannot be separated by a measurable set, whereas every standard-Borel space separates distinct points. Let Θ={0,1} have prior probabilities 1/2,1/2. With respect to ν, use sampling densities f0(y)=321U∪V(y) and f1(y)=31U(y). The dominated formula gives posterior mass 2/3 on U, 0 on V, and the prior filler 1/2 on the zero-evidence atom W.

Facts & Assumptions

Given: The measurable data space, reference probability ν, finite parameter space, prior, and sampling densities specified in the example.

[F1]

The proper model is a prior probability together with a parameter-measurable sampling probability kernel. Bayesian model as a prior and sampling kernel

[F2]

The posterior is a conditional law; a data-indexed posterior version must satisfy the rectangle identity. Bayesian posterior as a regular conditional law

[F3]

A proper prior and a sampling kernel with a specified jointly measurable density against a sigma-finite data measure have the displayed posterior kernel on fibres where the marginal density is finite and positive. The formula fills zero or infinite marginal-density fibres with the prior and does not require a standard-Borel data space. Bayes formula for dominated kernels

[F4]

A standard-Borel space is measurably isomorphic to a Polish space. Standard Borel spaces

[F5]

In a Polish space the topology is induced by a metric, so singleton sets are closed and Borel. Polish spaces are separable completely metrizable spaces

[F6]

The product sigma-algebra contains measurable rectangles; on the finite parameter space, simple functions constant on such rectangles are jointly measurable. The product sigma-algebra and its finite iterates

Verification

Given: The assumptions and finite model in the example.

1.1givenF4F5construct

The eight unions of U,V,W form a sigma-algebra. Assigning mass 1/3 to each disjoint atom defines a probability measure ν: a pairwise disjoint family has at most three nonempty members, so countable additivity reduces to finite additivity on the atoms. Distinct u,u′∈U have the same membership in every measurable set. If (Y,Y) were standard Borel, [F4] would give a bimeasurable bijection h to a Polish space. Let d be a compatible metric. For every z≠h(u), the ball about z of radius d(z,h(u))/2 misses h(u), so {h(u)} is closed and Borel. Its inverse image under h would be a measurable set separating u and u′, a contradiction.

2.1givenF1F3F6step 1.1algebra

The joint density is ℓ(θ,y)=321{0}×(U∪V)(θ,y)+31{1}×U(θ,y), a finite sum of indicators of measurable rectangles by [F6]. Its parameter sections are f0,f1, with integrals ∫f0 dν=32⋅23=1 and ∫f1 dν=3⋅13=1. Thus the sections define sampling probabilities, and the finite reference measure ν is sigma-finite, so [F3] applies.

3.1F3step 2.1algebra

The marginal density is m(y)=12f0(y)+12f1(y), hence m=9/4 on U, m=3/4 on V, and m=0 on W. Thus JY(U)=3/4, JY(V)=1/4, and JY(W)=0. The normalized formula gives Πy(1)=2/3 on U and 0 on V; on W the theorem fills the zero-evidence fibre with the prior, so Πy(1)=1/2.

4.1F2step 3.1algebra∎

For A={1}, the rectangle identities on U,V,W are (2/3)(3/4)=1/2=J({1}×U), 0(1/4)=0=J({1}×V), and (1/2)0=0=J({1}×W). For A={0} they are (1/3)(3/4)=1/4=J({0}×U), 1(1/4)=1/4=J({0}×V), and (1/2)0=0=J({0}×W). Adding over atoms gives the identity for every A⊆Θ and B∈Y, so this is a data-indexed posterior kernel despite the nonstandard-Borel data space.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

A standard-Borel posterior kernel for countable data

Example

Let Θ={0,1} have prior probabilities 1/2,1/2, and let the data space be N0={0,1,2,…} with its power-set sigma-algebra. For n∈N0, set f0(n)=2−(n+1) and f1(n)=23(13)n. These are two geometric sampling laws. The prior-predictive mass is m(n)=12(f0(n)+f1(n))>0, and a data-indexed posterior is Πn(1)=f1(n)f0(n)+f1(n),Πn(0)=f0(n)f0(n)+f1(n).

Facts & Assumptions

Given: AC, the finite parameter space, prior, and countable data model in the example.

[A1]

The Axiom of Choice (AC), as required by the general standard-Borel RCD route. The Axiom of Choice

[F1]

The prior probability and sampling kernel define the proper Bayesian model. Bayesian model as a prior and sampling kernel

[F2]

A data-indexed posterior kernel is a probability kernel whose composition with the observation is a posterior RCD. Bayesian posterior as a regular conditional law

[F3]

When both the parameter and data spaces are standard Borel, the posterior RCD factors through the data coordinate as a measurable posterior kernel. Standard-Borel Bayesian posterior kernel exists

[F4]

For 0≤r<1, the geometric series satisfies ∑n=0∞rn=(1−r)−1. For ∣r∣<1, ∑k≥0rk=1/(1−r), and for ∣r∣≥1 the series diverges

[F5]

A standard-Borel space is measurably isomorphic to a Polish space. Standard Borel spaces

[F6]

A Polish space is a separable space whose topology is induced by a complete metric. Polish spaces are separable completely metrizable spaces

Verification

Given: The assumptions and countable model in the example.

1.1givenF1F4F5F6algebra

The discrete metric on N0 is complete because every Cauchy sequence is eventually constant; N0 itself is a countable dense subset. Its topology is discrete, so its Borel sigma-algebra is the power set. The finite discrete parameter space has the same properties. Thus both spaces are standard Borel by [F5]–[F6]. By [F4], ∑nf0(n)=1 and ∑nf1(n)=1, so they define probability sampling laws and the prior in [F1] gives a Bayesian model.

2.1givenA1F3step 1.1algebra

Since both spaces are standard Borel and AC holds, [F3] supplies a data-indexed posterior kernel. For every n, both f0(n) and f1(n) are positive and finite, so m(n)>0 and the displayed values are in [0,1] and sum to one. Every function on the discrete data space is measurable, hence n↦Πn is a probability kernel.

3.1F2step 1.1step 2.1algebra∎

For i∈{0,1} and every B⊆N0, ∑n∈BΠn(i)m(n)=12∑n∈Bfi(n)=J({i}×B). Adding the identities for i=0,1 proves the rectangle identity for every A⊆Θ and every data event B. Thus the explicit kernel is a data-indexed posterior version; all its data values have positive prior-predictive mass.

Sources