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 consistency at a KL projection — Examples

1 · Prerequisites

2 · Summary

Objective

These examples calculate a unique and a nonunique KL projection, show that parameter-distant alternatives can defeat uniform testability even when every KL neighborhood has positive prior mass, and compute finite likelihood tilts whose total masses lie below and above one. The examples keep posterior concentration on the whole minimizer set distinct from selection of one parameter label.

The final counterexample has a unique finite KL minimizer, positive prior mass at it, and uniformly weakly consistent tests against sigma-finite likelihood tilts, yet posterior mass outside its discrete neighborhood has almost-sure limes superior one. It distinguishes weak expected test errors from the sufficient almost-sure type-I and exponential type-II interface.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

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

Distant alternatives can prevent uniform testability

Example

On X={0,1} with counting measure, let p0(0)=p0(1)=1/2. Use labels 0,1,2,…, with p0 at label 0 and, for j≥1, pj(1)=1/2+δj,pj(0)=1/2−δj,δj:=1/(j+4). Give label 0 prior probability 1/2 and label j prior probability 2−(j+1). Use the discrete metric ρ(j,k)=0 if j=k and 1 otherwise, so every alternative is distance one from label 0. Take observations IID with the law at the selected parameter label.

Facts & Assumptions

Given: The model, prior, parameter metric, and IID law in the Example.

[F1]

KL projection sets and relative KL neighborhoods: the relative KL neighborhoods are defined using K(θ)−K∗.

[A1]

Assume AC through the imported KL convention The Axiom of Choice. The displayed finite density family is explicit.

[F2]

Total variation distance for probability laws: ∥P−Q∥TV=sup⁡A∣P(A)−Q(A)∣.

[F3]

Verification

1.1A1F1F3algebra

For δj=1/(j+4), direct substitution gives KL(P0∥Pj)=12log⁡1/21/2+δj+12log⁡1/21/2−δj=−12log⁡(1−4δj2)>0. Thus Θ∗={0}. Every relative KL neighborhood contains 0 and therefore has prior mass at least 1/2, while every j≥1 lies in the distance-one alternative set.

1.2F2givenalgebra

Fix n and choose jn≥n2. For one coordinate define a joint law of (X,Y) by masses 1/2−δjn at (0,0), 1/2 at (1,1), and δjn at (0,1), with zero mass at (1,0). Its marginals are P0 and Pjn, and its disagreement probability is δjn. Take the n-fold product of this finite joint law. By the union bound, the coupled vectors differ with probability at most nδjn≤1/n. For every event A, the indicators of {X1:n∈A} and {Y1:n∈A} can differ only when the vectors differ, so by [F2], ∥P0n−Pjnn∥TV≤1/n.

2.1F2step 1.2algebra∎

For probability laws P,Q on the finite set {0,1}n, ∥P−Q∥TV=∑z:P(z)>Q(z)(P(z)−Q(z)): the set of points with positive difference attains the supremum over events, and no event can sum more than all positive differences. Hence for every test ϕn with 0≤ϕn≤1, Pϕn−Qϕn=∑zϕn(z)(P(z)−Q(z))≤∑z:P(z)>Q(z)(P(z)−Q(z))=∥P−Q∥TV. Taking P=P0n, Q=Pjnn and rearranging gives P0nϕn+Pjnn(1−ϕn)≥1−∥P0n−Pjnn∥TV≥1−1n. If P0nϕn→0, then sup⁡j≥1Pjn(1−ϕn)≥Pjnn(1−ϕn)→1. Since the selected minimizer is the true law, Qj=Pj here. Thus no test sequence has both error limits required by the KL-projection theorem.

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

A nonunique KL projection set need not select one parameter

Example

On X={0,1} with counting measure, let p0(0)=3/5, p0(1)=2/5; pa(0)=pa(1)=pb(0)=pb(1)=1/2; and pc(0)=1/5, pc(1)=4/5. Give prior probabilities Π(a)=Π(b)=1/4 and Π(c)=1/2. On the labels {a,b,c} use ρ(u,v)=0 for u=v and 1 otherwise. Take X1,X2,… IID with law P0.

Facts & Assumptions

Given: The finite model, prior, and IID sampling law in the Example.

[F1]

KL projection sets and relative KL neighborhoods: the KL projection is the full set of parameters minimizing KL(P0∥Pθ).

[A1]

Assume AC through the imported KL convention The Axiom of Choice. No additional choice is used in this finite model.

[F2]

Kolmogorov iid l1 strong law: integrable IID real variables have sample means converging almost surely to their expectation.

Verification

1.1A1F1algebra

Since pa=pb, their KL losses are equal. Direct calculation gives K(c)−K(a)=35log⁡1/21/5+25log⁡1/24/5=35log⁡52+25log⁡58=15log⁡3125512>0. Thus the minimizer set is Θ∗={a,b}.

2.1F1F2algebra∎

The likelihoods at a and b agree for every data vector, so their posterior odds remain Π(a)/Π(b)=1. The posterior odds of c against a have log equal to log⁡(Π(c)/Π(a))+∑i=1nlog⁡(pc(Xi)/pa(Xi)). By [F2], the sum divided by n tends almost surely to −(K(c)−K(a))<0. Hence the posterior mass of c, the complement of Θ∗, tends to zero while the posterior never selects one of a,b over the other.

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

A finite misspecified model with a unique KL projection

Example

On X={0,1} with counting measure, let the true density be p0(0)=3/5, p0(1)=2/5, and let the model densities be pa(0)=pa(1)=1/2 and pb(0)=1/5, pb(1)=4/5. Give a and b prior probability 1/2 each and use the metric ρ(u,v)=0 for u=v and 1 otherwise. Take X1,X2,… IID with law P0.

Facts & Assumptions

Given: The finite model, prior, and IID sampling law in the Example.

[F1]

KL projection sets and relative KL neighborhoods: the KL projection set consists of the minimizers of the directional contrast K(θ)=KL(P0∥Pθ).

[A1]

Assume AC through the imported KL convention The Axiom of Choice. No additional choice is used in this finite model.

[F2]

Likelihood-tilted measures at a KL projection: for a selected minimizer a, the likelihood-tilt mass at b is EP0[pb(X)/pa(X)] and need not equal one.

[F4]

Likelihood tilts are sigma-finite measures: the likelihood tilt is a measure; its total mass is the integral of its density.

[F3]

Kolmogorov iid l1 strong law: integrable IID real variables have sample means converging almost surely to their expectation.

Verification

1.1A1F1algebra

The relative KL contrast is K(b)−K(a)=EP0log⁡pa(X)pb(X)=25log⁡58+35log⁡52=15log⁡3125512>0. Thus a is the unique KL minimizer.

1.2F1F3algebra

The posterior odds are Π(b∣X1:n)Π(a∣X1:n)=∏i=1npb(Xi)pa(Xi). The log factors are bounded and IID, with expectation −(K(b)−K(a))<0. By [F3], their sample mean converges almost surely to that negative number, so the odds tend to zero and Π(b∣X1:n)→0.

2.1F2F4algebra∎

The tilted measure has total mass Qb(X)=EP0pb(X)pa(X)=25⋅85+35⋅25=2225<1. This example has a unique KL projection and a finite likelihood tilt that is not a probability law.

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

A likelihood tilt can be a finite measure of mass below one

Example

On X={0,1} with counting measure, let p0(0)=1/10, p0(1)=9/10, and model densities pa(0)=9/10, pa(1)=1/10, pb(0)=1, pb(1)=0. Give a and b prior probability 1/2 each. The density pa is the unique KL minimizer, while the likelihood tilt at b has total mass 1/9.

Facts & Assumptions

Given: The finite model, prior, and IID law in the Example.

[F1]

KL projection sets and relative KL neighborhoods: the projection minimizes the directional contrast KL(P0∥Pθ).

[A1]

Assume AC through the imported KL convention. No further choice is used in this finite model. The Axiom of Choice

[F2]

Likelihood-tilted measures at a KL projection: the total likelihood-tilt mass is EP0(pb/pa) and is not required to equal one.

[F3]

Likelihood tilts are sigma-finite measures: the tilted set function is a measure; a finite total mass is allowed to be below one.

Verification

1.1A1F1algebra

The KL loss at a is K(a)=110log⁡19+910log⁡9=45log⁡9<∞. At b, P0 is not absolutely continuous with respect to Pb, so K(b)=+∞. Thus a is the unique minimizer and every KL neighborhood has prior mass at least 1/2.

2.1F2F3algebra∎

The likelihood tilt at b assigns mass Qb({0})=11019/10=19,Qb({1})=91001/10=0. Hence Qb(X)=1/9<1, so Qb is a finite nonprobability measure.

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

A likelihood tilt can be a finite measure of mass above one

Example

On X={0,1} with counting measure, let p0=(1/1000,999/1000), pa=(10−6,999999/106), and pb=(1,0), where each pair lists the values at 0 and 1. Give a and b prior probability 1/2 each. Then a is the unique KL minimizer and the tilt at b has mass 1000.

Facts & Assumptions

Given: The finite density model and prior in the Example.

[A1]

Assume AC for the imported directional KL convention The Axiom of Choice. No additional choice is used.

[F1]

KL projection sets and relative KL neighborhoods: a KL projection minimizes K(θ)=KL(P0∥Pθ).

[F2]

Likelihood-tilted measures at a KL projection: for selected θ∗=a, Qb(X)=EP0[pb/pa].

[F3]

Likelihood tilts are sigma-finite measures: the likelihood tilt is a sigma-finite measure, whether or not its total mass is one.

Verification

1.1A1F1algebra

The density pa is positive at both sample points, so K(a)=KL(P0∥Pa)<∞. At b, pb(1)=0 while p0(1)>0, so P0≪̸Pb and K(b)=+∞ by [F1]. Therefore a is the unique minimizer.

2.1F2F3algebra∎

Since pb(0)/pa(0)=106 and pb(1)/pa(1)=0, Qb(X)=11000⋅106+9991000⋅0=1000>1. The tilt is a finite nonprobability measure by [F2] and [F3].

CounterexampleConstruction: AI-generatedVerification: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Weak tests against likelihood tilts do not ensure almost-sure posterior consistency

Statement refuted

In a dominated IID model with a finite KL minimum, a nonempty KL-minimizer set Θ∗, and positive prior mass in every relative KL neighborhood, suppose that for every η>0 there are measurable tests satisfying P0nϕn→0,sup⁡θ:d(θ,Θ∗)>ηQθn(1−ϕn)→0. The false assertion is that these conditions, allowing arbitrary sigma-finite likelihood tilts, imply almost-sure posterior concentration on every neighborhood of Θ∗. The example below has a unique minimizer and finite log likelihood contrasts, but posterior mass outside each discrete neighborhood of radius less than one has almost-sure limes superior one.

Facts & Assumptions

Given: The explicitly supplied countable model and IID observations constructed below. All logarithms are natural.

[A1]

The Axiom of Choice is assumed for the imported KL convention; all densities are supplied and no additional selections are used.

[F1]

KL projection sets and relative KL neighborhoods defines the directional KL contrast, its minimizer set, and relative KL neighborhoods.

[F2]

Likelihood-tilted measures at a KL projection, Likelihood tilts are sigma-finite measures, and Product likelihood tilts have the product density give the sigma-finite tilt with density pθ/p∗ and its product density.

[F3]

A nonconstant centered integrable IID random walk is unbounded above: IID integrable, nonconstant, mean-zero increments have partial sums unbounded above almost surely.

[F4]

Chebyshev's inequality for random variables bounds a centered finite-variance variable's deviation probability by its variance divided by the squared threshold.

[F5]

First Borel-Cantelli lemma for events: summable event probabilities imply only finitely many occurrences almost surely.

[F6]

The finite union bound bounds the probability of at least one of finitely many events by the sum of their probabilities.

Counterexample

Given: The hypotheses and notation just stated.

1.1givenconstructalgebra

Let c>0 normalize the density f(y)=c/[y2(log⁡y)2] on [e,∞). Its normalizing integral is finite and positive, and μ:=E0Y=c∫e∞[y(log⁡y)2]−1dy=c<∞. For IID Yi with this density put Xi=Yi−μ and Sn=∑i=1nXi. These increments are integrable, nonconstant and centered.

2.1F4F6step 1.1constructalgebra

For b≥e, direct integration gives E0[Y1{Y>b}]=c/log⁡b and P0(Y>b)≤c/[b(log⁡b)2]. Moreover E0[Y21{Y≤b}]=c∫eb(log⁡y)−2dy=O(b/(log⁡b)2): split the integral at b, bound the first part by b, and the second by 4b/(log⁡b)2. Put bn=n/(log⁡n)3/2 for all sufficiently large n. By [F6], the probability that any of the first n observations exceeds bn is O((log⁡n)−1/2)→0. The variance of ∑i=1nYi1{Yi≤bn} is at most O(nbn/(log⁡bn)2) by independence. Dividing this bound by (n/log⁡n)2 gives O(bn/n)→0. Chebyshev [F4] therefore shows Sn/(n/log⁡n)=−clog⁡n/log⁡bn+oP0(1)→−c. Define an=cn/(2log⁡n) and ϕn=1{Sn>−an} for n≥3, with arbitrary tests for n<3. It follows that P0nϕn→0.

2.2F3F5step 1.1construct

By [F3], the hitting times Tj=inf⁡{n≥1:Sn≥j} are finite almost surely for every positive integer j. Define recursively N0=0 and let Nj be the least integer at least max⁡(j,Nj−1+1) with P0(Tj>Nj)≤2−j. Such an integer exists since Tj<∞ almost surely. Put ϵj=Nj−1. Thus ϵj>0 and ϵj→0; these constants depend only on the true law, not the realized observations. By [F5], Tj≤Nj eventually almost surely. Also Tj→∞ almost surely, since finitely many finite partial sums cannot exceed arbitrarily large levels.

3.1A1F1step 1.1step 2.2constructalgebra

Take sample space X=[e,∞)⊔{z} with its disjoint-union Borel sigma-algebra and dominating measure equal to Lebesgue measure plus δz. Set p0(y)=f(y) and p0(z)=0. On the continuous part supply p∗(y)=f(y)e−2y and pj(y)=f(y)e−y−μ−ϵj; give each density its remaining mass at z. Both continuous masses are strictly between zero and one, so these atom masses are positive, and every density is finite and normalized. Take Θ={∗}⊔{1,2,…} with the discrete metric and its Borel sigma-algebra; the supplied density family is jointly measurable. By [F1], K(∗)=2μ<∞ and K(j)=E0(Y+μ+ϵj)=2μ+ϵj, so Θ∗={∗}. All relevant log ratios are integrable because E0Y<∞.

4.1F2step 2.1step 3.1algebra

On the P0-support, the tilt at j has density rj(y)=ey−μ−ϵj=eX−ϵj. Its total mass is infinite, since ∫e∞eyf(y)dy=∞, but the finite pointwise density makes it sigma-finite by [F2]. Its product density is eSn−nϵj. On {ϕn=0} this is at most e−an, uniformly in j, and hence sup⁡jQjn(1−ϕn)≤e−an→0. For 0<η<1, the set at distance greater than η from Θ∗ is precisely {1,2,…}, so these same tests satisfy both required weak errors. For η≥1 that set is empty and the type-II requirement is vacuous.

5.1F1step 3.1step 4.1constructalgebra

Put r=e−1/4 and give the model prior π∗=1/2, πj=(1−r)rj−1/2. These masses sum to one. Every relative KL neighborhood has mass at least 1/2 because it contains ∗. On any observed continuous sample, divide the prior-weighted likelihood by ∏ip∗(Yi) to obtain the alternative numerator An=eSn∑j≥1πje−nϵj. It is finite, being at most eSn/2, and the total relative evidence is 1/2+An>0. Thus the posterior mass of the alternatives is An/(1/2+An).

6.1step 2.2step 5.1algebra∎

Almost surely, for every sufficiently large j, step 2.2 gives Tjϵj≤1 and STj≥j. Consequently ATj≥ej−1πj=(1−r)ej−1rj−1/2→∞. Since Tj→∞, the posterior mass outside every discrete neighborhood of radius less than one has limes superior one almost surely. This contradicts the claimed a.s. consistency although both test errors in the refuted statement tend to zero.

Remarks

The test statistics converge to zero only in probability: the unbounded positive excursions of Sn make ϕn=1 infinitely often almost surely. Thus this counterexample does not satisfy an a.s.-vanishing type-I premise. It does not refute a posterior conclusion formulated only in probability. It specifically refutes the original unrestricted weak-test to almost-sure implication and its proposed exponential-test amplification.

Sources