Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-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.

Type-S posterior contracts in quotient log-density coordinates without a tail restriction on a log-Lipschitz prior

Statement

Assume AC for the imported measure and Gaussian interfaces. Use Type-S priors and either cutoff of Type-S log-density and type-H histogram prior families with the compact multiresolution basis of Compact wavelet projections approximate smooth functions and commute asymptotically with multiplication, regular enough for the truth's Hölder approximation. Suppose 0<ρ0≤f0≤D0, g0=log⁡f0∈Cα, and α>1/2. In S1 take σl=2−l(α+1/2) and any probability density whose logarithm is Lipschitz on all of R. In S2 take Gaussian coefficients with σl=2−l(r+1/2) and 0<r<α−1/4.

Write d=dim⁡VLn≍2Ln, ELn=VLn∩{h:∫h=0}, θ=T−∫T, θ∗=PLng0−∫g0, and en=d/n+d−α. Under IID data of density f0, the posterior distributions of ∥θ−θ∗∥2/en are tight in probability. Equivalently, for every deterministic bn→∞, Π(∥θ−θ∗∥2>bnen∣Xn)→0 in P0n-probability. The normalizer defining the posterior is positive and finite P0n-almost surely. The quotient prior has a positive continuous Lebesgue density qL on EL. In S1 it obeys ∣log⁡qL(θ+u)−log⁡qL(θ)∣≤BL∥u∥2,BL2≤C∑l≤L2lσl−2, and a shift in a single high wavelet coordinate obeys the sharper bound C∣ulk∣/σl. The low scaling block has a fixed finite collection of analogous weighted bounds. In S2 the quotient prior is centered Gaussian, with precision QL diagonal on high wavelets with entries σl−2 and a fixed positive definite low scaling block. Its log-density increment is −⟨QLθ,u⟩−⟨QLu,u⟩/2.

Facts & Assumptions

Given: AC and the density, basis, cutoff, coefficient, and regularity hypotheses of the Statement.

[F1]

Compact wavelet projections approximate smooth functions and commute asymptotically with multiplication gives ∥PLg0−g0∥∞≤Cd−α and ∥u∥∞≤Cd∥u∥2 on VL.

[F2]

Tonelli's theorem for nonnegative measurable functions on a sigma-finite product permits integration of nonnegative likelihoods in either order.

[F3]

Markov's inequality for random variables bounds a nonnegative variable's upper tail by its expectation divided by the threshold.

Proof

1.1givenF2algebra

Quotient out constants before using likelihood curvature. Constants belong to the fixed low scaling space. An orthogonal change within that finite space separates T=θ+c1; integrate c out of the prior and write qL for the resulting Lebesgue density on EL. The likelihood depends only on θ. In S1 its product density before integration obeys p(θ+u,c)/p(θ,c)∈[e−BL∥u∥2,eBL∥u∥2], where BL2≤C∑l≤L2lσl−2≤Cd2α+2. Integrating preserves both inequalities for qL; it is positive, finite almost everywhere, and the log-Lipschitz inequality supplies its positive continuous finite version everywhere. In S2 the marginal is a nondegenerate Gaussian on EL, with precision QL equal to σl−2 on high wavelets and a fixed positive definite low block; hence ∥QL∥≤Cd2r+1.

1.2F1F3givenalgebra

Let f∗=eθ∗/∫eθ∗. [F1] gives ∥f∗−f0∥∞≤Cd−α. For ℓ(θ)=n(Pnθ−log⁡∫eθ), the centered score at θ∗ has expected squared Euclidean norm at most Cnd: sum the coordinate variances, each bounded by D0 by orthonormality. The score's deterministic mean is the coefficient vector of n(f0−f∗), with norm at most Cnd−α. Consequently [F3] gives ∥∇ℓ(θ∗)∥2=OP(nen). On every ball ∥u∥2≤Ren with fixed R, [F1] and den→0 make fθ∗+u bounded uniformly above and away from zero. For v∈EL, Var⁡f(v)=inf⁡a∫(v−a)2f lies between c∥v∥22 and C∥v∥22, using ∫v=0. Thus −∇2ℓ is between cnI and CnI on these balls. Convexity of −ℓ holds globally.

2.1givenstep 1.1algebra

In S1, BL≤Cnen by either cutoff. In S2 the Hölder coefficient bound gives GL2:=∥QLθ∗∥22≤C[1+∑l≤L2l(4r+2−2α)], so GL≤Cnen, and ∥QL∥/n→0 because r<α. The Gaussian log-density increment is exactly −⟨QLθ∗,u⟩−⟨QLu,u⟩/2. In particular its radial upper slope is at most GL, and on the en ball it is bounded below by −GLen−∥QL∥en2/2.

3.1step 1.1step 1.2step 2.1algebra

Fix a score event ∥∇ℓ(θ∗)∥2≤Anen. Put r0=Ren, with R a large fixed constant. Taylor's formula on the r0 ball bounds ℓ(θ∗+r0ω)−ℓ(θ∗) above by Anenr0−cnr02/2 and its radial derivative above by Anen−cnr0. Global convexity of −ℓ extends this derivative bound to every r≥r0. Add the prior bound BLr in S1, or GLr with its nonpositive quadratic term in S2. For R large enough the log unnormalized posterior ratio H(rω) relative to θ∗ is at most −c′nr0r for all r≥r0. On r≤en, the lower Taylor bound and the prior lower bounds instead give H≥−CAnen2.

4.1F3step 1.2step 3.1algebra

Polar integration in dimension m=d−1 bounds the tail/normalizer ratio by eCAnen2m∫R∞tm−1e−c′nRen2tdt. Here nen2≥d>m. Choose R so large that log⁡t≤c′Rt/4 for t≥R and CA≤c′R2/4. The integral is then at most [m/(c′′nRen2)]e−c′′nR2en2 after decreasing c′′>0, and tends to zero. The denominator used here is the integral on the en ball, at least its volume times e−CAnen2 times the positive unnormalized value at θ∗. First increase A to make its score event arbitrarily probable, then increase R. This proves tightness. For any bn→∞, eventual containment of every fixed Ren ball in the bnen ball yields the stated equivalent formulation.

5.1F2givenalgebra∎

Every modeled density is everywhere positive. Its prior predictive product density is positive and integrates to one by [F2], so it is finite Lebesgue-almost everywhere on the sample cube. The law P0n has a bounded Lebesgue density, hence the same exceptional set is P0n-null. This proves finite positive evidence on the asserted fibers independently of the score event.

Depends on

Used by

Dependency tree · two levels

15 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