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.

Posterior computation and error accounting — 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-generatedverified 2026-10-22 (gpt-6.1-sol)Open item page →

An exact invariant kernel can be biased over a short run

Example

Assume AC. Let E={−1,+1} with the discrete sigma-algebra 2E, and let the target posterior π assign mass 1/2 to each state. For 0<ε<1/2, define Kε(x,A):=(1−ε)1A(x)+ε1A(−x)(x∈E, A⊆E). Take ε=1/1000. The Ionescu--Tulcea construction supplies a time-homogeneous Markov chain on canonical path space with initial law δ+1 and transition kernel Kε. Use this chain with its natural filtration, retain the next N=100 draws, and set the bounded functional f(x)=x. The target law π is invariant for this exact kernel, but the expected reported average is E[1100∑j=1100Xj]=499100(1−(499500)100)>0=π(f). For the error ledger take each deterministic posterior stage to be π; then the invariant-kernel error is zero while the finite-run burn-in error is positive.

Facts & Assumptions

Given: The two-state target law, transition rule, deterministic initial state, and 100 retained draws in the Example.

[F1]

A probability kernel has probability-measure rows and measurable event evaluations. Measure kernel and probability kernel

[F2]

A probability law π is invariant for K when ∫K(x,A) π(dx)=π(A) for every event A. Invariant and stationary distribution for a Markov kernel

[A1]

AC is assumed for conditional-expectation existence and the Ionescu--Tulcea chain construction. The Axiom of Choice

[F3]

For a time-homogeneous Markov chain, P(Xn+1∈A∣Fn)=K(Xn,A) almost surely. Time-homogeneous Markov chain with transition kernel

[F4]

The burn-in component is ∣πK(f)−Eλfˉb,N∣; when the invariant target is π, this is the expected finite-run bias in the Example. Posterior computation error budget

[F5]

The mean and conditional expectation of a bounded real random variable are finite. Moments, variance, and covariance on a probability space

[F6]

Under AC, the Ionescu--Tulcea construction gives a canonical path-space chain with the specified initial law and homogeneous transition kernel. Ionescu-Tulcea construction of a Markov chain

[F7]

Conditional expectation is linear and preserves expectation for integrable variables. Basic algebra and order properties of conditional expectation

[F8]

The expectation of a finite sum of integrable random variables is the sum of their expectations. The Lebesgue integral is linear on L1(μ)

Verification

1.1A1F1F6given

Since 0<ε<1/2, each row assigns the nonnegative masses 1−ε and ε to the two states, and every subset is measurable; thus Kε is a probability kernel [F1]. Under AC [A1], apply [F6] to initial law δ+1 and kernel Kε; this supplies the canonical chain used in the Example.

2.1F1F2step 1.1givenalgebra

For either singleton {x}, πKε({x})=12(1−ε)+12ε=12=π({x}), so additivity on the two-state space gives πKε=π by [F2].

2.2A1F3F5F7step 1.1givenalgebra

Put λ0:=1−2ε=499/500. Summing the two conditional probabilities in [F3] against the values +1 and −1, conditional on Xn=x, and using linearity [F7], E[Xn+1∣Fn]=(1−ε)x+ε(−x)=λ0x. Taking expectations by [F7] and using X0=1 gives EXj=λ0j for every j≥1 by induction.

3.1F4F8step 2.1step 2.2algebra∎

By [F8], E[100−1∑j=1100Xj]=100−1∑j=1100λ0j=499100(1−(499/500)100)>0. Since π(f)=0 and π is invariant by step 2.1, the kernel discrepancy vanishes, while [F4] identifies this positive difference as the burn-in component.

ExampleConstruction: AI-generatedVerification: AI-generatedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Correct invariance can coexist with low effective sample size

Example

Assume AC. Let E={−1,+1} with the discrete sigma-algebra 2E, and let the target posterior π be uniform on E. For 0<ε<1/2, define Kε(x,A):=(1−ε)1A(x)+ε1A(−x)(x∈E, A⊆E), and set ε=1/100. The Ionescu--Tulcea construction supplies a time-homogeneous Markov chain on canonical path space with initial law π and transition kernel Kε. Use this chain with its natural filtration and set f(x)=x. Define its lag-k autocorrelation by ρf(k):=Cov⁡(f(X0),f(Xk))Var⁡(f(X0)). For every k≥1, ρf(k)=(49/50)k. Its integrated autocorrelation time τf:=1+2∑k=1∞ρf(k) is therefore 99, so the theoretical functional-specific effective sample size of N=10,000 draws is ESS⁡f(10,000)=10,00099≈101.01. The invariant law is exactly the target posterior, while this functional has only about one percent of the nominal independent-sample size. This is the theoretical ESS from the stationary autocorrelation sequence, not an empirical finite-run ESS estimate, and it asserts no central limit theorem.

Facts & Assumptions

Given: The two-state probability kernel, its initial law π, and the bounded functional f in the Example.

[F1]

A probability kernel has probability-measure rows and measurable event evaluations. Measure kernel and probability kernel

[F2]

Invariance means πK(A)=π(A) for every measurable event A. Invariant and stationary distribution for a Markov kernel

[F3]

A time-homogeneous Markov chain has one-step conditional law given by its transition kernel. Time-homogeneous Markov chain with transition kernel

[A1]

AC is assumed for conditional-expectation existence, the Ionescu--Tulcea chain construction, and the invariant-initial-law theorem. The Axiom of Choice

[F4]

If the initial law is invariant, the chain is strictly stationary. Invariant initial law makes a Markov chain stationary

[F5]

The theoretical functional ESS is N/(1+2∑k≥1ρf(k)) when the process is strictly stationary, has positive finite variance, absolutely summable autocorrelations, and positive integrated autocorrelation time; this definition asserts no CLT. Functional-specific effective sample size

[F6]

For a stationary chain with absolutely summable lag covariances, the finite-sample mean-square error is bounded by N−1(γ0+2∑k≥1∣γk∣). Bounded posterior functionals and stationary sample error

[F7]

Variance is the expected squared centered value, and covariance is the expected product of centered values. Moments, variance, and covariance on a probability space

[F8]

Under AC, the Ionescu--Tulcea construction gives a canonical path-space chain with the specified initial law and homogeneous transition kernel. Ionescu-Tulcea construction of a Markov chain

[F9]

Conditional expectation is linear and preserves expectation for integrable variables. Basic algebra and order properties of conditional expectation

[F10]

A bounded measurable factor can be taken outside conditional expectation. Taking out what is known

Verification

1.1A1F1F8given

Since 0<ε<1/2, each row assigns the nonnegative masses 1−ε and ε to the two states, and every subset is measurable; thus Kε is a probability kernel [F1]. Under AC [A1], apply [F8] to initial law π and kernel Kε; this supplies the canonical chain used in the Example.

2.1F1F2step 1.1givenalgebra

For either singleton {x}, πKε({x})=12(1−ε)+12ε=12=π({x}); additivity gives πKε=π by [F2].

2.2F3F5F7F9F10step 1.1givenalgebra

Put λ=1−2ε=49/50. On the two-point state space, summing the conditional probabilities in [F3] against the values +1 and −1 and using linearity [F9] gives E[Xn+1∣Fn]=λXn. Since X0∼π, EX0=0; expectation preservation [F9] gives EXn=0 for all n. As X0 is bounded and Fk-measurable, [F10] and expectation preservation [F9] give E[X0Xk+1]=λE[X0Xk], and E[X02]=1. Induction yields Cov⁡(X0,Xk)=λk and, since Var⁡(X0)=1, ρf(k)=λk.

3.1A1F2F4F7step 2.1given

Since X0∼π and π is invariant by step 2.1, [A1] permits the invariant-initial-law result [F4], which makes the chain strictly stationary. Its one-time law is symmetric, so EXj=0 and Var⁡(Xj)=1.

4.1F5F6F7step 2.2step 3.1givenalgebra∎

Since the chain is strictly stationary by step 3.1 and has variance one, [F5] applies. Step 2.2 gives ρf(k)=λk; these autocorrelations are absolutely summable because 0<λ<1, with ∑k≥1λk=λ/(1−λ)=49. Thus τf=1+2⋅49=99>0 and [F5] gives ESS⁡f(10,000)=10,000/99. Since γk=ρf(k) here, [F6] applies, but neither it nor the ESS definition supplies a CLT.

ExampleConstruction: AI-generatedVerification: AI-generatedverified 2026-10-22 (gpt-6.1-sol)Open item page →

A biased forward solve shifts a Gaussian posterior

Example

Let the scalar parameter u have prior density p0(u)=(2π)−1/2e−u2/2, and observe y=0 with unit-variance Gaussian noise. The exact forward map is G(u)=u, while a deliberately biased numerical forward/PDE solver reports G~(u)=u+2. At y=0, use likelihoods L(u)=exp⁡(−G(u)2/2) and L~(u)=exp⁡(−G~(u)2/2); the common Gaussian density constant cancels when normalizing. Define each fixed-data posterior by normalizing the prior times its stated likelihood. The exact posterior is N(0,1/2) and the solver posterior is N(−1,1/2). For the bounded functional f(u)=1(−∞,0](u), their expectations are respectively Π(f)=12,Π~(f)=Φ0(2)>12, where Φ0(t):=∫−∞t(2π)−1/2e−z2/2 dz. The discrepancy is in the forward-solver stage of the posterior error budget; this toy solver assumption makes no claim about the bias of any general PDE discretization.

Facts & Assumptions

Given: The prior density, the exact and solver forward maps, the unit-variance observation noise, and the normalized prior-times-likelihood posterior convention in the Example.

[F1]

The error-budget solver term compares the exact-model posterior expectation with the posterior expectation obtained from the declared numerical forward solve. Posterior computation error budget

[F2]

The standard normal density is (2π)−1/2e−z2/2, and N(m,s2) is its affine image m+sZ for s>0. Standard normal and normal laws

[A1]

AC is assumed by the library standard-normal law interface. The Axiom of Choice

[F3]

For a bounded measurable functional, the expectation difference is at most 2∥f∥∞ times the event-supremum total variation distance. Bounded posterior functionals and stationary sample error

Verification

1.1A1F2givenalgebra

With the likelihoods stated in the Example, the exact prior-times-likelihood product is (2π)−1/2e−u2. The substitution z=2u and the normalized standard-normal integral in [F2] give ∫Re−u2 du=π, so this product has normalizing integral (2π)−1/2π=1/2. Its normalized density is therefore π−1/2e−u2, which is N(0,1/2) by [F2]. For the solver output, the prior-times-likelihood product is (2π)−1/2e−u2/2−(u+2)2/2=(2π)−1/2e−(u+1)2−1; its normalizing integral is (2π)−1/2e−1π=e−1/2, and its normalized density is π−1/2e−(u+1)2=N(−1,1/2) by [F2].

2.1F2step 1.1givenalgebra

The exact density is symmetric about zero, so its mass on (−∞,0] is 1/2. Under the solver density, Z=2(U+1) is standard normal, and U≤0 is equivalent to Z≤2; hence Π~(f)=Φ0(2). The standard normal density is positive and symmetric, so Φ0(2)>Φ0(0)=1/2.

3.1F1F3step 2.1algebra∎

In the error ledger set μ⋆=μmodel=Π and μsolver=μdisc=Π~; then the solver-stage term is δsolver=Φ0(2)−1/2 and the model and discretization terms vanish. Since ∥f∥∞=1, [F3] also gives δsolver≤2∥Π−Π~∥TV.

Sources