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.

Uniform marginal-score bounds by derivative integration

Statement

Use the defined inverse Gaussian sequence procedure with fixed p,C,L0,N0,ρ and 0<A=An≤log⁡n/(4log⁡(ρ∨e)) for all sufficiently large n. Write rα=1+2α+2p,sα=1+2α,Nα=n1/rα,Vα=Nαlog⁡Nα,fα(i)=n2isαlog⁡i(irα+n)2,Sα=∑ifα(i)θi2,hα=Sα/Vα. The likelihood has a continuous derivative Mn on [0,A], with the derivative at zero interpreted from the right. Let Qn=Mn−EθMn. Uniformly over θ∈Θpt(L0,N0,ρ), Eθsup⁡0≤α≤A∣Qn(α)∣Vα(1+hα)≤K{1+AL0ρ1+2Alog⁡n}NA⟶0. For all sufficiently large n, all 0≤a≤b≤A, and every such truth, ha≤(4+36L0ρ1+2b)NbNahb. For every θ∈ℓ2, the expectation satisfies EθMn(α)Vα≥18C4−C4hα,EθMn(α)Vα≤3C4−C−4hα. Finally, for arbitrary θ∈ℓ2 and every deterministic interval [0,c]⊆[0,A] on which hα≤H, where H is fixed, one has Eθsup⁡0≤α≤c∣Qn(α)∣Vα≤KH(1+Alog⁡n)NA⟶0. Constants do not depend on n,A,θ. Fixed finite A is allowed by the eventual cap.

Facts & Assumptions

Given: The hypotheses of the Statement and independent standard normal coordinates Zi.

[F1]

The procedure gives Xi=κiθi+n−1/2Zi and C−2i−2p≤κi2≤C2i−2p, with its full-probability endpoint/domain hypotheses. Empirical-Bayes credible-ball procedure in the inverse Gaussian sequence model

[F2]

At every integer m≥N0, ∑i≥mθi2≤L0∑i=m⌊ρm⌋θi2 for a polished-tail truth. Polished-tail class for a Gaussian sequence

[F3]

Cauchy–Schwarz gives E∣UV∣≤(EU2)1/2(EV2)1/2 for square-integrable real variables, and Tonelli interchanges nonnegative integrals on the probability space with counting measure or the finite parameter interval. Cauchy-Schwarz for random variables Tonelli's theorem for nonnegative measurable functions on a sigma-finite product

[F4]

Each Zi has law N(0,1) with even density ϕ(x)=e−x2/2/2π, so EZi=0 and EZi2=1. Standard normal and normal laws Location-scale normal laws have their stated mean and variance

Proof

1.1givenalgebra

Uniformly for α≤A, for all sufficiently large n we have log⁡Nα≥8, ⌈Nα/ρ⌉≥N0, log⁡Nα≥2log⁡ρ and (1+ρ/Nα)rα≤2. Indeed NA grows exponentially in log⁡n whereas rA=O(log⁡n). We henceforth impose these cutoffs. For q≥1, 0≤k≤4 and log⁡N≥8, the bound log⁡i/log⁡N≤exp⁡(qlog⁡(i/N)/(2k)) for i>N and k>0 follows from 1+x≤ex and log⁡N≥2k/q. Summing the resulting powers and comparing a decreasing function with its integral gives ∑i>Ni−1−q(log⁡i)k≤3N−q(log⁡N)k; k=0 follows directly by integration.

2.1step 1.1algebra

Temporarily suppress α from r,s,N,V. The positive deterministic noise series D=∑in2log⁡i/(ir+n)2 satisfies V/8≤D≤3V. For the lower bound retain i≤⌊N⌋, replace the denominator by 4n2, and use ∑i≤⌊N⌋log⁡i≥Nlog⁡N/2 for N≥e8, obtained by integrating log⁡x. For the upper bound the terms below N total at most V. The remaining terms are bounded by n2∑i>Ni−2rlog⁡i, which is at most V{(2r−1)−1+[(2r−1)2log⁡N]−1+N−1}<2V, by integrating x−2rlog⁡x and including its value at N.

2.2F2step 1.1algebra

For a polished-tail truth put m=⌈N/ρ⌉, B={m,…,⌊ρm⌋} and EB=∑i∈Bθi2. On B one has N/ρ≤i≤N+ρ, log⁡i≥log⁡N/2 and ir+n≤3n. Thus Sα≥ρ−sNs(log⁡N)EB/18, and ∑i>Nθi2≤L0EB. For i>N, fα(i)log⁡i≤n2i−1−2α−4p(log⁡i)2≤Ns(log⁡N)2, since the function on the right before evaluation at N decreases beyond N. Below N, log⁡i≤log⁡N. Consequently ∑ifα(i)(log⁡i)θi2≤(1+18L0ρs)(log⁡N)Sα. All these inequalities hold also when Sα=0.

3.1step 2.2algebra

For every i, fα(i)≤2Nslog⁡N. Below N use the denominator bound n2; above N write i=Nx and q=1+2α+4p≥1, obtaining the upper bound Nsx−q(log⁡N+log⁡x), and use x−qlog⁡x≤1/(eq). For a≤b and 2≤i≤Nb, fa(i)/fb(i)=i−2(b−a)[(irb+n)/(ira+n)]2≤4. Apply step 2.2 at b to the energy above Nb, and the kernel supremum at a, to obtain Sa≤4Sb+36L0ρsbNasalog⁡NaNbsblog⁡NbSb. Multiply by Vb/Va. The identities Nαsα=nNα−2p, log⁡Nb/log⁡Na≤1 and (Nb/Na)2p≤1 give the stated comparison of ha,hb, without dividing by a possibly zero signal.

3.2step 2.2algebra

Differentiation under the signal sum is valid by domination by a bounded multiplier of θi2, since its tail and each of its first derivatives are bounded by a constant times i−1−4p(log⁡i)k. It gives Sα′=2∑ifα(i)(log⁡i)(n−irα)/(n+irα)θi2. Step 2.2 bounds its absolute value by 2(1+18L0ρsα)(log⁡Nα)Sα. Moreover Vα′/Vα=−2(1+log⁡Nα)/rα. Therefore Gα=Vα+Sα is positive and continuously differentiable, with ∣Gα′∣/Gα≤KL0ρ1+2Alog⁡n.

3.3F1F3F4step 2.1algebra

Set ti=i1+2ακi−2 and ai=n2tilog⁡i/(ti+n)2. Direct differentiation of finite likelihood sums, followed by centering, gives EθMn(α)=∑in2log⁡i(ti+n)2−∑in2i1+2α(log⁡i)θi2(ti+n)2,Qn(α)=−∑iai(α)(Xi2−EθXi2). Ellipticity compares ti+n to irα+n with factors C±2. Thus step 2.1 proves both asserted expectation inequalities. By [F4], EZi=0 and EZi2=1. Two integrations by parts using ϕ′(x)=−xϕ(x) give EZi4=3; the boundary terms vanish because every polynomial times ϕ tends to zero at infinity. Hence E∣Zi∣3≤(EZi2)1/2(EZi4)1/2<∞ by [F3]. The density ϕ is even, so the integrable odd moment satisfies EZi3=0. Expanding Xi2−EθXi2 now gives Var⁡(Xi2)=2/n2+4κi2θi2/n. Independence makes variances additive. Finally ai′=2(log⁡i)ai(n−ti)/(n+ti), so ∣ai′∣≤2(log⁡i)ai.

4.1step 1.1step 3.3algebra

For j=0,1 the preceding identities give Var⁡θQn(j)(α)≤KNα(log⁡Nα)2+2j(1+hα). Here are the series estimates in full. The noise contribution is bounded by K∑i[nirα/(irα+n)2]2(log⁡i)2+2j. Below N bound the bracket by one; above N bound it by ni−r and use step 1.1 with q=2r−1≥1. The result is KN(log⁡N)2+2j. The signal contribution is bounded by K∑ifα(i)θi2[nir(log⁡i)1+2j/(ir+n)2]. The bracket is at most K(log⁡N)1+2j: below N this is immediate, and above N it follows from x−r(log⁡N+log⁡x)1+2j≤K(log⁡N)1+2j for x=i/N≥1, r≥1. The signal contribution is therefore at most KSα(log⁡N)1+2j=KN(log⁡N)2+2jhα. This calculation uses only θ∈ℓ2, not polished tails.

5.1F1F3step 3.3step 4.1algebra

The random sums have common versions suitable for integration and suprema. On each fixed [0,A], the variance-series tails for Qn,Qn′ tend to zero uniformly: coarse dominating summands are constants times i−2−4p(log⁡i)4 and i−1−4p(log⁡i)4θi2, both summable. For a finite centered tail T, the fundamental theorem of calculus and Cauchy–Schwarz give Esup⁡∣T∣≤ET(0)2+∫0AET′(u)2 du. Thus partial sums converge in expected uniform norm to a continuous Qn. Their derivatives converge in L1(dP dα), so the limit has absolutely continuous paths and the fundamental theorem passes to the limit. Deterministic expectation sums converge uniformly by the analogous kernel domination. Choose an almost surely uniformly convergent subsequence of score sums. On the procedure's full-probability domain, the finite likelihood sums converge at zero to its prescribed value. Integrating those finite scores and passing along this subsequence gives ℓn(α)=ℓn(0)+∫0αMn(u) du simultaneously on [0,A]. Its continuous integrand is therefore the asserted derivative, including the right endpoint derivative at zero.

6.1F3step 3.2step 4.1step 5.1algebra

Put Rα=Qn(α)/Gα. By step 4.1, E∣Rα∣≤K/Nα. The quotient rule, step 3.2 and Cauchy–Schwarz give E∣Rα′∣≤KL0ρ1+2A(log⁡n)/Nα. The absolutely continuous version from step 5.1 satisfies sup⁡[0,A]∣R∣≤∣R0∣+∫0A∣Rα′∣ dα. Taking expectations by Tonelli and using Nα≥NA proves the first bound. For arbitrary truths on an interval where h≤H, instead normalize by V alone. Step 4.1 and ∣V′/V∣≤3log⁡n yield E∣Q/V∣≤KH/NA and E∣(Q/V)′∣≤KHlog⁡n/NA. The same integral inequality proves the final asserted bound, including c=0.

7.1step 6.1algebra∎

Write λ=log⁡(ρ∨e)≥1 and t=log⁡n. At the maximal allowed A, 2Alog⁡ρ≤tλ/2, whereas 12log⁡NA=t2/[2(1+2A+2p)]≥tλ−O(1). Consequently ρ2A/NA≤Kexp⁡(−tλ/2), which dominates every polynomial in log⁡n. The first bound tends to zero; the arbitrary-truth bound is smaller apart from a fixed factor. For smaller A, the numerators only decrease and NA increases. This proves all uniform convergence assertions.

Depends on

Used by

Dependency tree · two levels

33 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