Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-adaptedPipeline-generatedprecheck pass
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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

65 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources