Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

The dyadic scale bands satisfy the weighted entropy condition

Statement

Fix A≥1 independently of n. The constants in the entropy estimates and the required fixed M0 may depend on A. Let 0<a2<a1<1, n−a1≲σn≲n−a2, and γ>1. Suppose G is a probability measure on (0,∞) satisfying G((0,s])≤Ce−βs−γ for all sufficiently small s>0. Let sn→0 with sn/σn→∞. For integers j with 2jσn≤sn, put r~n:=min⁡{rn,1/4} and Pn,j:={pF,σ:F([−A,A]c)≤r~n2/8,2jσn≤σ<2j+1σn,σ≤sn}, and let πn,j be the prior mass of the corresponding parameter band, so πn,j≤G([2j,2j+1)). Suppose rn>0 and, for some fixed sufficiently large M0 (allowed to depend on A) and fixed η>γ/[2(γ−1)], rn≥M0max⁡{(nσn)−1/2log⁡n,n−1/2σn−η}. With Nn,j=N(rn,Pn,j,h), one has e−nrn2∑j:2jσn≤snNn,jπn,j⟶0. If instead G is supported on a compact subset of (0,∞), the same conclusion holds under the first rate term alone.

Facts & Assumptions

Given: The fixed cutoff A≥1, AC, the polynomial bounds on σn, the lower scale-tail bound on G, the dyadic scale bands, and the compact-location entropy estimate.

[A1]

Assume AC for the compact-location entropy and mixture-density interfaces. The Axiom of Choice

[F1]

Hellinger entropy for compact-location normal mixtures in a scale band: for compactly supported mixing laws on [−A,A], 0<u<1/4, and τ≤σ≤2τ, log⁡N(u,{pF,σ},h)≤C(A/τ∨1)[log⁡(C(A/τ∨1)/u)]2.

[F2]

Hellinger distance is a metric and controls L1 and total variation: for probability densities, Hellinger distance is a metric and h2(p,q)≤∫∣p−q∣dλ.

Proof

Given: The hypotheses in the Statement.

1.1A1F1F2givenalgebra

Write xn=nrn2 and Jn=max⁡{j:2jσn≤sn}. Since sn→0 and σn≥cn−a1, Jn=O(log⁡n). Put un:=min⁡{rn/2,1/8}. If rn≤1/4, truncate a mixing law to [−A,A] and normalize it there; the removed mass is at most rn2/8, so its mixture changes by L1 at most rn2/4 and by Hellinger at most rn/2 using [F2]. The compact cover at radius un=rn/2 then covers Pn,j at radius rn. If rn>1/4, the sieve tail is at most 1/128, so truncation changes Hellinger distance by at most 1/8; the compact cover at radius un=1/8 then covers the class at radius at most 1/4<rn. Thus in both cases Nn,j≤N(un,PA,2jσn,h). The rate lower bound implies log⁡(1/un)≤Clog⁡n and xn≥M02σn−1(log⁡n)2,xn≥M02σn−2η. For 0≤j≤Jn, [F1] bounds log⁡Nn,j≤Cσn−1(log⁡n)2, because the band lower scale is at least σn. Since πn,j≤1, these terms contribute at most Clog⁡nexp⁡{Cσn−1(log⁡n)2/2−xn}, which tends to zero for sufficiently large M0.

1.2A1F1givenalgebra

For negative indices write j=−k, k≥1. For all sufficiently large k, the scale-tail premise gives πn,−k≤Cexp⁡(−c2γk). Also [F1] and un≥cn−1/2log⁡n imply log⁡Nn,−k≤Cσn−12k(log⁡n+k)2. Choose θ>0 and γ0<γ sufficiently close to 0 and γ, respectively, so q:=1+θ<γ0 and ρ:=γ0/(γ0−q)<2η. Since (log⁡n+k)2≤Cθ(log⁡n)22θk and e−c2γk≤e−c′2γ0k, the logarithm of each summand is at most CKn2qk−c′2γ0k,Kn:=σn−1(log⁡n)2. Enlarging C handles the finitely many smaller k.

2.1step 1.2givenalgebra

Put p=γ0/q>1. As a function of v=2qk≥1, the exponent CKnv−c′vp has maximum at most C′Knp/(p−1)=C′Knρ, by differentiation. The maximizing scale is a constant multiple of Kn1/(p−1), so there are O(log⁡Kn) indices up to any fixed multiple of that scale; their sum has logarithm at most C′′Knρ. Choose a fixed multiple L large enough that for v≥LKn1/(p−1) the negative term is at least twice the positive term. Grouping the subsequent dyadic v values gives a convergent geometric tail, also bounded by exp⁡(C′′Knρ). Therefore log⁡∑k≥1Nn,−kπn,−k≤C′′σn−ρ(log⁡n)2ρ. Because ρ<2η and σn≤Cn−a2, this is o(σn−2η)=o(xn). The negative-index contribution therefore vanishes after multiplication by e−xn.

3.1A1F1step 1.1givenalgebra∎

If G is supported on [g−,g+] with g−>0, only a fixed finite number of dyadic indices have positive mass. Their lower scales are at least g−σn/2, so [F1] at radius un bounds each log covering number by Cσn−1(log⁡n)2. The first rate term gives xn≥M02σn−1(log⁡n)2, and the finite weighted sum tends to zero for sufficiently large M0.

Depends on

Used by

Dependency tree · two levels

20 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