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.

✓ 1 result · all verified · 0 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. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

IID posterior contraction by entropy and prior mass — Examples

1 · Prerequisites

2 · Summary

Objective

The examples verify the global-entropy theorem in a regular Bernoulli density model, calculate the source-covered Hölder entropy balance under its explicit prior-mass premise, and show that entropy is sufficient rather than necessary by using a point prior whose posterior remains exactly at the truth while a deliberately broad sieve violates the entropy inequality. The Bernoulli rate includes the logarithmic overhead of the global entropy condition; none of the examples asserts a generic minimax or almost-sure guarantee.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-adaptedprecheck passOpen item page →

A one-parameter density prior meets the logarithmic contraction conditions

Example

Fix 0<a<θ0<b<1. The sample space is {0,1} with counting measure, and pθ(1)=θ, pθ(0)=1−θ for θ∈[a,b]. Let p0=pθ0 and let Π be the prior with constant density 1/(b−a) on [a,b]. The parameter sieve is Θn=[a,b], its density image is Fn={pθ:a≤θ≤b}, and the selected distance is the full density L1 distance d1.

Facts & Assumptions

Given: The Bernoulli density model and prior above, and the constants a,b,θ0.

[A1]

Assume AC for the likelihood-density versions used by IID posterior contraction by entropy and prior mass (The Axiom of Choice). The map (θ,x)↦pθ(x) is jointly measurable directly from its two displayed affine sections.

[F1]

IID posterior contraction by entropy and prior mass: if the same-metric entropy, sieve-tail and local KL/log-square prior-mass conditions hold, posterior mass outside Mϵn tends to zero in P0n-probability for sufficiently large fixed M.

[F2]

Kullback–Leibler divergence: KL(P0∥Pθ)=∫log⁡(p0/pθ) dP0, with this argument direction.

[F5]

Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: the logarithm is continuous on (0,∞) and logarithms of positive products and quotients obey the usual sum and difference identities.

[F7]

Continuity and derivatives of positive-base real powers: for x>0, x−1 is differentiable with derivative −x−2.

[F8]

A function differentiable at c is continuous at c: differentiability on an open interval gives continuity at each point of that interval.

Verification

1.1givenalgebra

Put ϵn:=2log⁡n/n for n≥3. For two parameters, d1(pθ,pθ′)=2∣θ−θ′∣. Hence an ϵn-packing of Fn has at most 1+2(b−a)/ϵn points, so log⁡D(ϵn,Fn,d1)≤12log⁡n+O(1)≤4log⁡n=nϵn2 for all sufficiently large n. Since Θn=[a,b], its prior complement has mass zero. Also ϵn→0 and nϵn2=4log⁡n→∞.

1.2F2F3F4F5F6F7F8givenalgebra

For g(θ):=KL(P0∥Pθ), use [F5] to write g(θ)=c0−θ0log⁡θ−(1−θ0)log⁡(1−θ), with c0=θ0log⁡θ0+(1−θ0)log⁡(1−θ0). The chain, sum, and scalar rules [F6], together with [F4], give g(θ0)=g′(θ0)=0 and g′′(θ)=θ0θ2+1−θ0(1−θ)2; the reciprocal-power derivative in this computation is [F7]. These formulas show that g and g′ are differentiable on (0,1); hence they are continuous there by [F8], so the mean value theorem hypotheses hold on the relevant subintervals of [a,b]. The explicit bound ∣g′′(θ)∣≤L:=θ0/a2+(1−θ0)/(1−b)2 holds there. For θ≠θ0, apply the mean-value theorem [F3] first to g and then to g′ to obtain ∣g(θ)∣≤L∣θ−θ0∣2. Put C1:=L. For the log-square term, apply [F3] to log⁡θ and log⁡(1−θ); these functions are continuous on [a,b] by [F5], and the chain rule [F6] and derivative bounds 1/θ≤1/a and 1/(1−θ)≤1/(1−b) give ∫[log⁡pθp0]2p0 dμ≤C2∣θ−θ0∣2, for example with C2=L. At θ=θ0, both contrasts are zero by [F2, F5], so both bounds also hold.

2.1A1F2step 1.2algebra

Choose c>0 with c2max⁡(C1,C2)≤1. For all sufficiently large n, the interval [θ0−cϵn,θ0+cϵn] lies in [a,b] and is contained in the theorem's local KL/log-square set. Its uniform prior mass is 2cϵn/(b−a). Since −log⁡ϵn=12log⁡n+O(log⁡log⁡n) while nϵn2=4log⁡n, there is a fixed C>0 such that this mass is at least e−Cnϵn2 for large n.

3.1A1F1step 1.1step 2.1∎

All hypotheses of [F1] now hold with d=d1; consequently the posterior mass of {θ:d1(pθ,p0)>Mϵn} tends to zero in P0n-probability for sufficiently large fixed M. The rate furnished by this global-entropy theorem is 2Mlog⁡n/n in the full density L1 norm; this example makes no minimax-optimality claim.

ExampleConstruction: AI-generatedVerification: AI-generatedOpen item page →

A sieve can miss the entropy bound while the posterior contracts exactly

Example

Let Θ=[0,1], let Xi∣θ be IID Bernoulli(θ), and put the full Bernoulli family Fn={pθ:θ∈[0,1]} in every sieve Θn=Θ. Take the true value θ0=1/2 and prior Π=δ1/2. In the full density L1 metric, the entropy premise of IID posterior contraction by entropy and prior mass fails for ϵn=(log⁡n)1/4/n at all sufficiently large n, although the other displayed conditions hold and the posterior mass outside every positive-radius ball is exactly zero for every data vector.

Facts & Assumptions

Given: The Bernoulli model, its jointly measurable mass function pθ(1)=θ, pθ(0)=1−θ, the point prior at θ0=1/2, and n≥3.

[F1]

IID posterior contraction by entropy and prior mass defines the data-fiber posterior by likelihood-weighted normalization on finite positive evidence, and its contraction conclusion is in P0n-probability under the stated entropy, sieve-tail, and local KL/log-square conditions.

[F2]

Sieve metric entropy produces uniform exponential tests defines D(u,Fn,d1) using finite sets whose pairwise full density L1 distances exceed u.

[F3]

Kullback–Leibler divergence uses the direction KL(P0∥Pθ)=P0log⁡(p0/pθ).

[A1]

Assume the Axiom of Choice The Axiom of Choice for the imported directional KL convention; all displayed Bernoulli densities and the point-prior update are explicit.

[F4]

Probability measures and probability spaces: the IID Bernoulli sampling law P0n is a probability measure on the finite data vectors.

[F6]

Identical distribution and IID families defines the IID sampling regime.

Verification

Given: The model, sieve, prior, truth, and rate sequence in the Example.

1.1F1F5givenalgebra

Put tn:=log⁡n. For n≥3, tn>1, and ϵn2=tnn,nϵn2=tn⟶∞. The integral formula [F5] gives log⁡n≤2n for n≥1, hence ϵn2≤2 n−3/4→0. Thus ϵn→0 and the rate conditions in [F1] hold.

1.2F2F5givenalgebraconstruct

For j=0,…,⌊1/ϵn⌋, set θj=jϵn. These parameters lie in [0,1], and d1(pθj,pθk)=2∣θj−θk∣>ϵn(j≠k). Therefore D(ϵn,Fn,d1)≥⌊1/ϵn⌋+1>1/ϵn and log⁡D(ϵn,Fn,d1)>log⁡(1/ϵn)=12tn−14log⁡tn. For t≥1, [F5] gives log⁡t≤2t. If tn≥64, then 12tn−14log⁡tn≥12tn−12tn>tn=nϵn2. Hence the entropy premise fails for all sufficiently large n.

1.3A1F3given

The sieve is the full parameter space, so Π(Θnc)=0. Its local KL/log-square set contains θ0, where KL(P0∥Pθ0)=0 and log⁡(pθ0/p0)=0; consequently its prior mass is 1, which exceeds e−Cnϵn2 for every C>0.

2.1F1F4F6given∎

For any data vector x1:n, the likelihood at the sole prior atom is pθ0⊗n(x1:n)=2−n>0, so the evidence is also 2−n. The normalization in [F1] therefore gives Π(⋅∣x1:n)=δθ0. For every M>0, its mass on {θ:d1(pθ,p0)>Mϵn} is exactly zero for every sample, and thus it contracts in P0n-probability under the IID data law [F4, F6] despite the failed entropy condition.

ExampleConstruction: AI-generatedVerification: AI-generatedOpen item page →

A Hölder-density entropy bound gives the source-covered rate

Example

Let 0<α≤1 and let Hα(L) be the class of measurable probability densities on [0,1] satisfying 0≤p≤L and ∣p(x)−p(y)∣≤L∣x−y∣α. Suppose a dominated IID model has truth p0∈Hα(L), density image Fn=Hα(L) at each n, and a proper prior Π on a measurable parameterization of this class with a jointly measurable density family. Assume its Hellinger packing numbers obey log⁡D(u,Fn,h)≤CHu−1/α for all sufficiently small u>0. Fix C>0, choose K≥max⁡{1,CHα/(2α+1)}, and set ϵ0:=K and ϵn:=Kn−α/(2α+1) for n≥1. Assume that, for all sufficiently large n, Π ⁣{θ:KL(P0∥Pθ)≤ϵn2,∫[log⁡pθp0]2p0 dμ≤ϵn2}≥e−Cnϵn2. Here μ is Lebesgue measure on [0,1], and the log-square expression is the second moment, with the weighted integrand zero where p0=0 and +∞ where p0>0,pθ=0, as in IID posterior contraction by entropy and prior mass. Take the full parameter space as the sieve, so its prior tail is zero. Then the entropy balance gives the source-covered rate ϵn≍n−α/(2α+1) under the theorem's sufficient conditions.

Facts & Assumptions

Given: The density class, its stated packing-entropy bound, the proper prior and jointly measurable dominated IID model, the local KL/log-square prior-mass bound, and CH>0.

[A1]

Assume the Axiom of Choice The Axiom of Choice used by the likelihood-density and directional KL conventions inherited from IID posterior contraction by entropy and prior mass.

[F1]

Sieve metric entropy produces uniform exponential tests defines D(u,F,h) as the supremal cardinality of a finite subset whose pairwise Hellinger distances exceed u.

[F2]

Kullback–Leibler divergence uses the directional convention KL(P0∥Pθ)=P0log⁡(p0/pθ), with value +∞ if P0≪̸Pθ.

[F3]

IID posterior contraction by entropy and prior mass gives contraction in the selected metric in P0n-probability when the entropy, sieve-tail, and local KL/log-square prior-mass conditions hold.

Verification

Given: The hypotheses in the Example.

1.1A1F1F2F3givenalgebra

The chosen K is fixed and 1/(2α+1)>0, so ϵn→0 and nϵn2=K2n1/(2α+1)→∞. For all sufficiently large n, the assumed entropy bound gives log⁡D(ϵn,F,h)≤CHK−1/αn1/(2α+1)≤K2n1/(2α+1)=nϵn2, because K2+1/α≥CH. The full-space sieve has Π(Θnc)=0, and the local prior-mass premise is exactly the theorem's remaining prior condition.

2.1F1F3step 1.1∎

All hypotheses of [F3] now hold eventually with the Hellinger metric and the positive sequence (ϵn). Hence for sufficiently large fixed M, the posterior mass outside the Hellinger ball of radius MKn−α/(2α+1) tends to zero in P0n-probability. This is a sufficient-condition rate calculation only; it does not prove the class's entropy bound or assert a minimax lower bound.

Sources