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.

Minimax signal detection and separation rates

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

Weighted chi-square triangular-array limit

Statement

Assume the Axiom of Choice. For each n, let Gn,1,…,Gn,mn be independent standard normal random variables, and let wn,j≥0 satisfy 2∑j=1mnwn,j2=1. If max⁡1≤j≤mnwn,j→0, then Tn=∑j=1mnwn,j(Gn,j2−1) has mean zero and variance one for every n and converges in distribution to N(0,1).

Facts & Assumptions

Given: AC; for each n, independent standard normal coordinates Gn,j; nonnegative weights with 2∑jwn,j2=1 and max⁡jwn,j→0.

[A1]

The Axiom of Choice: AC is the hypothesis of the Lindeberg–Feller supplier.

[F1]

A normal variable has finite fourth moment: for G∼N(0,1), EG2=1 and EG4=3; hence V=G2−1 has mean 0, variance 2, and finite second moment.

[F2]

Lindeberg-Feller central limit theorem: sufficiency: an independent centered triangular array with positive row standard deviations and the Lindeberg condition has its normalized row sums converging in distribution to N(0,1).

[F3]

Dominated convergence: an integrable dominating function allows limits to pass through the expectation.

Proof

1.1givenF1algebra

By [F1], each Vn,j=Gn,j2−1 is centered with variance 2. Independence within each row gives ETn=0 and Var⁡(Tn)=2∑jwn,j2=1. Thus the row standard deviation is sn=1>0.

2.1givenF1F3step 1.1algebra

Fix δ>0 and put wn∗=max⁡jwn,j. If wn,j=0, its Lindeberg summand is zero. Otherwise wn,j∣Vn,j∣>δ implies ∣Vn,j∣>δ/wn∗. Therefore ∑jE ⁣[wn,j2Vn,j21{wn,j∣Vn,j∣>δ}]≤12E ⁣[V21{∣V∣>δ/wn∗}]. Because wn∗→0 and V2 is integrable by [F1], the right side tends to zero by [F3]. This is the Lindeberg condition for the array wn,jVn,j.

3.1A1F2step 1.1step 2.1∎

The array in step 2.1 is centered and independent within rows, has finite second moments, and has row standard deviation 1. By [F2] and the Lindeberg condition just proved, Tn⇒N(0,1).

LemmaStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Sparse Gaussian scalar certificate and extremal profile

Statement

Let 0<q<2, α,β>0, s=α+β, L=qs−2β>0, and κ=L/(2−q). For z>0 define a(z)=z2sinh⁡(z2)−q(cosh⁡(z2)−1)(2−q)z2,b(z)=z2sinh⁡(z2)−2(cosh⁡(z2)−1)(2−q)zq,ϕ(z)=b(z)a(z). Both a and b are positive, and for every v∈R, cosh⁡(zv)−1≥a(z)v2−b(z)∣v∣q, with equality at v=0,z,−z. The function ϕ:(0,∞)→(0,∞) is continuous and strictly increasing onto its target. Put z(x)=ϕ−1(xL),ψ(z)=12a(z),d(x)=x2βψ(z(x))(x>0). For C=[6(2−q)]1/(6−q), its endpoint asymptotics are z(x)∼CxL/(6−q),ψ(z)∼z−2 (z↓0),d(x)∼C−2x2β−2L/(6−q)(x↓0), z(x)∼xκ,ψ(z)∼(2−q)e−z2 (z→∞),d(x)∼(2−q)x2βe−z(x)2(x→∞). There is a constant C1 depending only on the parameters such that ψ(z)z2≤C1,ψ(z)(ez2−1)≤C1(z>0),ψ(z)2(ez2−1)≤C1e−z2(z≥1). The following improper integrals are finite and positive: c0=∫0∞d(x)2(cosh⁡(z(x)2)−1) dx,c1=∫0∞d(x)z(x)2x2β dx,c2=∫0∞d(x)z(x)qxqs dx, M1=∫0∞x4βd(x)z(x)4 dx,M2=∫0∞x2qsd(x)z(x)2q dx, and c0=(c1−c2)/2.

All coordinate indices below are positive integers; h0 is a scale parameter, not a coordinate. For positive real n,h0, set zi=z(i/n) and hi=h0d(i/n) for i≥1. Then ∑ihi<∞, and for every finite real vector (vi)1≤i≤m, ∑i≤mhi(cosh⁡(zivi)−1)≥h02(n−2β∑i≤mi2βvi2−n−qs∑i≤miqs∣vi∣q). As n→∞, the Riemann sums of the five displayed integral integrands, divided by n, converge to their respective integrals. In particular, ∑ihi2(cosh⁡(zi2)−1)∼c0h02n,∑ii2βhizi2∼c1h0n2β+1,∑iiqshiziq∼c2h0nqs+1, ∑ii4βhizi4∼M1h0n4β+1,∑ii2qshizi2q∼M2h0n2qs+1.

Let ε>0, r>0, and define the relaxed extremal value Jε(r)=inf⁡{∑i≥1gi2(cosh⁡(wi2)−1): 0≤gi≤1, wi≥0, ∑ii2βgiwi2≥r2ε−2, ∑iiqsgiwiq≤ε−q}. Choose n,h0>0 by c1h0n2β+1=r2ε−2,c2h0nqs+1=ε−q,U2=c0h02n. Whenever ε↓0, r→0, n→∞, and h0→0, one has Jε(r)∼U2. Writing A=2α+1/q−1/2,B=2s+1/q,D=α+β(1−2/q)=L/q, this gives Jε(r)∼cε−A/DrB/D,c=c0c1(c1c2)−(2β+1/2)/L>0. The sufficient condition n→∞, h0→0 is equivalent to r=o(εac),ac=qα+1−q/2q(α+β)+1. The free coefficients hi need not be at most one. The upper bound on Jε is realized asymptotically by finitely supported feasible pairs, constructed by truncating the profile to compact coordinate windows and adjusting n,h0. No probability statement or unrestricted all-radius power asymptotic is asserted.

Facts & Assumptions

Given: The positive parameters, scalar functions, profiles, integrals, and extremal problem in the Statement. All improper integrals and nonnegative series are interpreted as increasing limits of finite truncations.

[F2]

Addition formulas, identities, parity, and derivatives of the hyperbolic functions gives the hyperbolic identities, derivatives, and exponential representations. The exponent, product, quotient, and iterated-power laws for positive real bases and real exponents and Continuity and derivatives of positive-base real powers give positive-base real-power arithmetic, continuity, and differentiation.

[F3]

Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on [a,b] takes every value between f(a) and f(b) supplies values of a continuous function between its endpoint values, without an additional choice assumption.

[F4]

Continuous functions have an oriented Riemann integral supplies the Riemann integral, comparison, and compact-interval upper and lower sums for continuous functions.

[F5]

The Cauchy-Schwarz inequality for finite sums supplies Cauchy–Schwarz for every finite real array; inequalities for nonnegative infinite series follow by increasing finite truncations.

Proof

1.1F1givenalgebra

Put w=z2. The hyperbolic series give wsinh⁡w−q(cosh⁡w−1)=∑k≥1(2k−q)w2k(2k)!. Every coefficient is positive because q<2. Replacing q by 2 makes only the first coefficient zero and leaves every later coefficient positive. The positive denominators in a,b therefore prove a(z),b(z)>0.

2.1F1F2step 1.1algebra

For fixed z>0 and v>0, put f(v)=(cosh⁡(zv)−1−a(z)v2)/vq. Differentiation and the absolutely convergent series show that f′(v)v1−q=∑k≥1(2k−q)z2kv2k−2(2k)!−(2−q)a(z). This expression is strictly increasing in v: its terms with k≥2 have strictly positive coefficients and positive powers. It is zero at v=z by the definition of a. Consequently f decreases to z and increases after z. Direct substitution gives f(z)=−b(z), so cosh⁡(zv)−1≥a(z)v2−b(z)vq. Evenness proves the assertion for negative v, and direct substitution proves equality at 0,z,−z.

2.2F1F2step 1.1algebra

The quotient representation of ϕ in the Statement is continuous. To prove strict increase, write its numerator series before the factor z2−q as P(w)=∑k≥1pkw2k and its denominator as Q(w)=∑k≥1qkw2k, where pk=(2k−2)/(2k)! and qk=(2k−q)/(2k)!. The ratios pk/qk=(2k−2)/(2k−q) strictly increase with k. Pairing terms with indices k>ℓ in P′Q−PQ′ gives positive multiples of (k−ℓ)(pkqℓ−pℓqk)w2k+2ℓ−1, so this derivative numerator is positive for w>0. The products and paired sums are justified first for finite partial sums and then by absolute convergence on compact intervals. Thus P/Q is strictly increasing; multiplying it by the positive strictly increasing function z2−q proves that ϕ is strictly increasing.

3.1F1F2F3step 2.2algebra

The first nonzero numerator and denominator terms are w4/12 and (2−q)w2/2, respectively. Hence ϕ(z)∼z6−q6(2−q)(z↓0). The exponential representations instead give ϕ(z)∼z2−q as z→∞, since the ratio of its two bracketed expressions tends to one. Thus its endpoint limits are zero and infinity. Strict increase and [F3] give exactly one inverse value at each positive target. The inverse is continuous: values on either side of its value have images on either side of the target, which is the epsilon-delta criterion for the inverse at that target. The inverse power asymptotics follow by trapping ϕ(z) between (1±η) times its stated positive leading power and then taking the corresponding positive roots.

4.1F1F2F4step 3.1algebra

Expanding a at zero gives a(z)∼z2/2, so ψ(z)∼z−2. At infinity, a(z)∼ez2/[2(2−q)], so ψ(z)∼(2−q)e−z2. Combining these with the inverse asymptotics in step 3.1 proves all endpoint formulas for z(x) and d(x). In particular z(x) is comparable to xκ at infinity. The functions ψ(z)z2 and ψ(z)(ez2−1) have finite limits at zero and infinity; continuity bounds them also on the intervening compact interval. Similarly ez2ψ(z)2(ez2−1) is bounded for z≥1, proving the three global bounds.

5.1F1F2F4step 4.1algebra

The definitions give d(x)a(z(x))=x2β/2 and d(x)b(z(x))=xqs/2, since ϕ(z(x))=xL and L+2β=qs. Also a(z)z2−b(z)zq=cosh⁡(z2)−1. Thus d(x)2(cosh⁡(z(x)2)−1)=12(d(x)z(x)2x2β−d(x)z(x)qxqs). Near zero the integrands for c1,c2,c0 are asymptotic to positive constants times x4β, x4β+4L/(6−q), and x4β, respectively; those for M1,M2 have respective exponents 6β+2L/(6−q) and 6β+10L/(6−q). All these exponents exceed −1. At infinity each integrand is bounded by Cxme−cx2κ for suitable positive C,c and some nonnegative m. This envelope is integrable: choosing an integer k with 2κk>m+2 and using ecx2κ≥(cx2κ)k/k! bounds it by a constant times x−2 for large x. The integral of x−2 on [b,R] is 1/b−1/R by the compact fundamental theorem in [F4], and is bounded as R→∞. The small-x power bounds likewise integrate to ap+1/(p+1) when p>−1. Compact intervals are covered by [F4]. The five improper integrals therefore exist, are finite, and are positive. Integrating the pointwise identity proves c0=(c1−c2)/2>0.

6.1step 2.1step 4.1step 5.1algebra

For fixed n,h0>0, the large-x bound d(x)≤Cx2βe−cx2κ makes ∑ih0d(i/n) finite by comparison with a convergent power tail. There are only finitely many remaining indices, including those close to zero. Multiplying the pointwise inequality of step 2.1 by hi and using hia(zi)=h0(i/n)2β/2 and hib(zi)=h0(i/n)qs/2 proves the finite-vector scalar certificate in the Statement. This argument places no upper bound on the score coefficient hi.

6.2F2F4step 5.1algebra

Let f be any of the five integral integrands in step 5.1. On a fixed [a,b]⊂(0,∞), its mesh-1/n sums converge to its integral by trapping the sums between compact-interval upper and lower sums from [F4]; the two endpoint pieces have lengths at most 1/n and bounded values. For small x, f(x)≤Cxp with one of the positive exponents p in step 5.1, so 1n∑i/n<af(i/n)≤C(ap+1+apn). At infinity use the envelope g(x)=Cxme−cx2κ, increasing m,C if necessary. Its derivative has the sign of m−2cκx2κ, so it is eventually decreasing. Consequently its discrete tail is bounded by its integral tail plus one mesh term. First let n→∞, then a↓0 and b→∞. These two tail bounds prove the five full Riemann limits. Substituting hi=h0d(i/n) gives all five scaled sum equivalents, irrespective of how the positive factor h0 varies with n.

7.1F1F5step 5.1step 6.2algebra

The two scaling equations have the unique positive solution nL=c1c2ε2−qr2,h0=r2ε−2c1n2β+1. Let V=∑ihi2(cosh⁡(zi2)−1). Step 6.2 gives V∼U2=c0h02n whenever n→∞. For any feasible relaxed pair (gi,wi) of finite cost W, expansion of the positive kernel gives cosh⁡(zw)−1=∑k≥1z2kw2k(2k)!. Apply [F5] to the arrays with entries hizi2k/(2k)! and giwi2k/(2k)! for finitely many i,k, and increase the truncations. It follows that ∑ihigi(cosh⁡(ziwi)−1)≤VW. This is a deterministic kernel inequality, with no Gaussian probability space.

8.1step 2.1step 5.1step 7.1givenalgebra

Multiply the scalar certificate in step 2.1 at v=wi by higi and sum up to an index m. Step 7.1 bounds the left side by VW, and the partial budget is at most ε−q. The partial energy is therefore bounded above independently of m by the resulting inequality, so its full sum is finite. Increasing m now yields VW≥h02(n−2βr2ε−2−n−qsε−q)=h02n2(c1−c2)=U2. Thus every finite-cost feasible pair has W≥U4/V, and infinite-cost pairs do not lower the infimum. Hence Jε(r)≥U4/V∼U2.

8.2F2F4step 7.1constructalgebra

Fix numbers 0<a<b<∞ and 0<η<1. Write cj,[a,b] for the integral defining cj restricted to [a,b], for j=0,1,2. These constants are positive. Choose n′,h0′>0 from c1,[a,b]h0′(n′)2β+1=(1+η)r2ε−2,c2,[a,b]h0′(n′)qs+1=(1−η)ε−q. Division gives n′n=(c1,[a,b]/c2,[a,b]c1/c21−η1+η)1/L,h0′h0=(1+η)c1c1,[a,b](nn′)2β+1. For this fixed window and margin these ratios are fixed positive constants. Hence n′→∞ and h0′→0 under the claimed hypotheses.

9.1F4step 5.1step 6.2step 8.1step 8.2constructalgebra

Put gi=h0′d(i/n′) and wi=z(i/n′) when a≤i/n′≤b, and set both to zero otherwise. There are finitely many nonzero coordinates. The compact-window maximum of d is finite, so eventually 0≤gi≤1. Compact Riemann convergence gives actual energy (1+η+o(1))r2ε−2 and actual budget (1−η+o(1))ε−q, hence eventual feasibility. Its cost divided by U2 tends to c0,[a,b]c0(h0′h0)2n′n. As a↓0, b→∞, and η↓0, this expression tends to one by step 5.1 and the explicit ratios in step 8.2. For any fixed positive tolerance one may first fix a sufficiently wide window and small margin, and then take sufficiently small ε. This proves lim sup⁡Jε(r)/U2≤1 without choosing an infinite family of windows. With step 8.1 it proves Jε(r)∼U2. In particular, no untruncated claim that h0d(i/n)≤1 has been used.

10.1F2step 6.1step 7.1step 9.1algebra∎

Substituting the value of n from step 7.1 into U=c0h0n gives U=c0c1(c1c2)−(2β+1/2)/Lε−[2qα+1−q/2]/Lr(2qs+1)/L. Since D=L/q, this is precisely the stated power with exponents A/D and B/D. Similarly h0L=C2r2(qs+1)ε−(2qα+2−q) for a parameter-only C2>0, so h0→0 is equivalent to r=o(εac). Finally ac−2−q2=qL2(qs+1)>0. Thus this condition also forces n→∞ by the formula for nL, while n→∞ and h0→0 plainly include h0→0. This proves the asserted equivalence, the restricted power asymptotic, and all remaining claims.

LemmaStatement: AI-adaptedProof: AI-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

A finite-array normal limit from vanishing fourth moments

Statement

Assume Countable Choice, and suppose the probability law with density ϕ(t)=(2π)−1/2e−t2/2 is supplied. Write Φ(t)=∫−∞tϕ(s) ds; normalization is part of the given probability-law hypothesis. For each positive integer n, let Xn,1,…,Xn,kn be independent centered real random variables, where kn is finite and each variable has a finite fourth moment. Different rows need not share a probability space. Suppose

∑j=1knEXn,j2⟶v∈(0,∞),∑j=1knEXn,j4⟶0.

Then, for Sn=∑jXn,j,

sup⁡t∈R∣P(Sn≤t)−Φ(t/v)∣⟶0.

The same conclusion applies to any specified sequence of finite arrays satisfying these two limits; no identical-distribution hypothesis is needed.

Facts & Assumptions

Given: The supplied normalized scalar Gaussian probability law and the finite independent arrays in the Statement.

[A1]

The Axiom of Countable Choice (ACω): Countable Choice is assumed. No family of uncountably many auxiliary random variables is constructed.

[F1]

For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique and Independent random elements have product joint law: finite products of probability laws exist, have the rectangle formula, and give the joint law of a finite independent family.

[F2]

Fubini's theorem for L^1 functions on a sigma-finite product: absolutely integrable functions on a finite product of probability spaces can be integrated successively.

[F3]

A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions: under Countable Choice, a scalar invertible affine substitution has the usual Jacobian formula for nonnegative Lebesgue integrals.

[F4]

Taylor's Lagrange remainder follows from repeated Rolle steps: for a C3 function with third derivative bounded by C, expansion through degree two at a has remainder of absolute value at most C∣x−a∣3/6.

[F5]

If u,v are differentiable on [a,b] with u′,v′ integrable, then ∫abuv′=u(b)v(b)−u(a)v(a)−∫abu′v: on each finite interval, differentiable functions with integrable derivatives satisfy the integration-by-parts identity. The polynomial and Gaussian functions used below are continuously differentiable on every [−R,R], with continuous, hence integrable, derivatives.

[F6]

The exponential dominates every fixed nonnegative integer power at +∞: every fixed polynomial times e−x2/2 tends to zero as ∣x∣→∞; for odd powers this follows by putting y=x2 and bounding ∣x∣m by an integer power of y for ∣x∣≥1.

[F7]

Monotone convergence for the integral: the integrals of the nonnegative truncations x2kϕ(x)1[−R,R](x) increase to the integral over R as integer R→∞.

Proof

1.1givenA1F1F3F5F6F7constructalgebra

For each row put an,j=EXn,j2 and vn=∑jan,j. Finite products in [F1] allow us to integrate replacement coordinates with independent centered Gaussian laws of variances an,j; a zero variance means the point mass at zero. These products need not be coupled across rows. The supplied scalar density already has integral one, so [F3] gives its scaled probability laws without a separate Gaussian-normalization theorem. For ϕ(t)=(2π)−1/2e−t2/2, direct differentiation gives ϕ′(t)=−tϕ(t). On [−R,R], apply [F5] with (u,v)=(t,ϕ(t)) and then (u,v)=(t3,ϕ(t)) to obtain ∫−RRt2ϕ(t) dt=[−tϕ(t)]−RR+∫−RRϕ(t) dt, ∫−RRt4ϕ(t) dt=[−t3ϕ(t)]−RR+3∫−RRt2ϕ(t) dt. The boundary terms tend to zero by [F6]; [F7] and the supplied normalization ∫ϕ=1 then give EG2=1 and EG4=3. Odd moments vanish by symmetry. Consequently a replacement coordinate Gn,j has mean zero, variance an,j and fourth moment 3an,j2.

2.1givenF1F2F3step 1.1inductionalgebra

The sum of the replacement coordinates has law N(0,vn). One can verify this using only scalar integration: for positive variances a,b, Fubini and the substitution y=t−x make the sum density the convolution of the two scalar densities. Completing the square in x2/a+(t−x)2/b and using [F3] together with the given unit Gaussian integral makes that convolution (2π(a+b))−1/2exp⁡(−t2/(2(a+b))). Induction gives the assertion for every finite row, and zero-variance coordinates have no effect. The absolute integrals here are finite because they are probability densities.

2.2F1F2F4step 1.1constructalgebra

Let f be bounded and C3 on R, with bounded first, second and third derivatives. In the finite product integral replace Xn,j by Gn,j one coordinate at a time. Conditional on the other coordinates, the constant, linear and quadratic terms of the Taylor expansion of f at their sum have the same integrals, since both coordinates have mean zero and variance an,j. The two remainders are bounded by [F4]. Fubini is legitimate since f is bounded and the displayed moments are finite. Summing the telescoping differences therefore gives ∣Ef(Sn)−Ef(∑jGn,j)∣≤∥f′′′∥∞∑j(E∣Xn,j∣3+E∣Gn,j∣3)/6.

3.1givenstep 1.1step 2.2algebra

Cauchy--Schwarz, first for each coordinate integral and then for the finite index sum, gives ∑jE∣Xn,j∣3≤(∑jEXn,j2)1/2(∑jEXn,j4)1/2→0. Also an,j2≤EXn,j4, by expanding the nonnegative integral of (Xn,j2−an,j)2. Hence ∑jan,j2→0, and the same calculation with the Gaussian fourth moments in step 1.1 gives ∑jE∣Gn,j∣3≤(3vn∑jan,j2)1/2→0. Both Cauchy--Schwarz inequalities follow by expanding a nonnegative square and minimizing its scalar coefficient, for the coordinate integral and the finite index sum respectively. Thus the replacement error in step 2.2 tends to zero for each such test f.

4.1givenstep 2.1step 3.1constructalgebra

For η>0, a concrete C3 cutoff is obtained by integrating the nonnegative polynomial s3(1−s)3 on [0,1], normalizing its integral to one, and extending the resulting cumulative function by zero and one outside that interval. Its first three derivatives join continuously at the endpoints. Translate, rescale and subtract this function from one to bound 1(−∞,t] from below and above by bounded C3 functions that differ only on [t−η,t+η]. Apply step 3.1 to these two fixed cutoffs. By step 2.1 the replacement sum has variance vn→v>0; its probability of this interval is at most 2η/2πvn, and its distribution at each fixed endpoint converges to Φ scaled by v. Taking n→∞ and then η↓0 proves P(Sn≤t)→Φ(t/v) for every real t.

5.1givenA1step 4.1constructalgebra∎

Finally fix δ>0. Choose finitely many increasing real grid points so that the two tails of the limiting normal law each have mass below δ and its mass between consecutive grid points is below δ. Such a finite grid exists because its density is bounded and its total integral is one. Step 4.1 gives convergence at every grid point simultaneously. Between consecutive points monotonicity of the two distribution functions bounds their difference by the largest grid-point difference plus δ; the tail intervals have the same bound using zero and one. Thus the supremum in the Statement has limsup at most δ. Letting δ↓0 proves the asserted uniform convergence. All replacements were finite products of supplied probability laws, and the only additional choice hypothesis remains [A1].

DefinitionDefinition: Literature-sourcedProof: Not applicableverified 2026-10-22 (gpt-6.1-sol)Open item page →

Minimax detection risk and separation rate

Definition

Assume Countable Choice and use the Gaussian sequence inverse model with singular values sj>0, inverse-noise weights σj=sj−1, and parameter coordinates θ=(θj)∈ℓ2. Let a=(aj) be a positive nondecreasing sequence with aj→∞, and let σ=(σj) be a positive nondecreasing sequence with σj→∞. For ε>0, put ηj=θj/σj and observe Yj=Zj/σj=ηj+εξj, where Z is the normalized observation in the Gaussian sequence inverse model and the ξj are independent standard normal random variables. For 0<q≤2 and r>0, define Θq(r)={η∈RN>0:(σjηj)j≥1∈ℓ2, ∑j=1∞∣ajσjηj∣q≤1, ∑j=1∞σj2ηj2≥r2}. Test H0:η=0 against H1:η∈Θq(r) by a product-Borel measurable randomized test ψ:RN>0→[0,1], where ψ(y) is the rejection probability. Its type-I error and maximal type-II error are αε(ψ)=Eε,0ψ,βε(Θq(r),ψ)=sup⁡η∈Θq(r)Eε,η(1−ψ). When Θq(r)=∅, define βε(Θq(r),ψ)=βε(Θq(r),α)=γε(Θq(r))=0, the convention that no type-II error occurs when no alternative is possible. For α∈(0,1) define βε(Θq(r),α)=inf⁡ψ: αε(ψ)≤αβε(Θq(r),ψ),γε(Θq(r))=inf⁡ψ{αε(ψ)+βε(Θq(r),ψ)}. A positive family rε∗→0 is a minimax separation rate if γε(Θq(rε))→1 and βε(Θq(rε),α)→1−α for every α∈(0,1) whenever rε/rε∗→0, while γε(Θq(rε))→0 and βε(Θq(rε),α)→0 for every α∈(0,1) whenever rε/rε∗→∞.

LemmaStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Existence of a finite q=2 ellipsoid extremal profile for small radius

Statement

Assume the minimax detection-risk definition with q=2, and let aj and σj be positive nondecreasing sequences tending to infinity. There is a constant r0>0 such that for every r∈(0,r0) there exist A,z0>0 with finite nonempty S={j:Aaj2<1} for which η~j2=z02σj2(1−Aaj2)+ satisfies ∑j≥1σj2η~j2=r2,∑j≥1aj2σj2η~j2=1.

Facts & Assumptions

Given: Positive nondecreasing aj,σj→∞ in the q=2 Gaussian sequence detection class.

[F1]

Minimax detection risk and separation rate: the two constraints defining Θ2(r) are ∑jaj2σj2ηj2≤1 and ∑jσj2ηj2≥r2.

[F2]

Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on [a,b] takes every value between f(a) and f(b): if a real-valued function is continuous on a closed bounded interval and a target lies between its endpoint values, it takes that target at some point of the interval; no additional choice assumption is needed.

Proof

1.1given

Put bj=aj2 and cj=σj4. For 0<A<b1−1 define the finite sums N(A)=∑j≥1cj(1−Abj)+,D(A)=∑j≥1cjbj(1−Abj)+, and R(A)=N(A)/D(A). The active set is finite because bj→∞, and it is nonempty because A<b1−1. On every compact subinterval of (0,b1−1), only finitely many indices can be active; each summand is continuous and vanishes at its activation endpoint. Thus R is continuous and D(A)>0.

2.1step 1.1algebra

The ratio is a weighted average of 1/bj: with pj(A)=cjbj(1−Abj)+/D(A), the numbers pj(A) are nonnegative, sum to one, and R(A)=∑jpj(A)/bj. Fix K>0 and choose j0 so bj≥K for j≥j0. The head weight ∑j<j0pj(A) tends to zero as A↓0: its numerator is bounded by the fixed finite sum ∑j<j0cjbj, while for any M≥j0 the denominator is at least 12∑j=j0Mcjbj once AbM≤1/2. Since cjbj→∞, these finite partial sums can be made arbitrarily large. Also R(A)≤b1−1∑j<j0pj(A)+1/K, so lim sup⁡A↓0R(A)≤1/K. As K is arbitrary, R(A)→0.

2.2givenstep 1.1algebra

Let m0 be the largest index with bm0=b1; it is finite because bj→∞. For A sufficiently close to b1−1 from below, the active set is exactly {1,…,m0} and all its bj equal b1. Hence R(A)=b1−1 there.

3.1F1F2step 1.1step 2.1step 2.2constructalgebra∎

By step 1.1, R is continuous on (0,b1−1). Given r2∈(0,b1−1), steps 2.1 and 2.2 let us choose 0<A−<A+<b1−1 with R(A−)<r2 and R(A+)=b1−1. Apply [F2] to the restriction of R to [A−,A+] to obtain A with R(A)=r2. Set z02=r2/N(A)>0 and define η~j2=z02σj2(1−Abj)+. Its support is the finite active set, and ∑jσj2η~j2=z02N(A)=r2,∑jaj2σj2η~j2=z02D(A)=r2D(A)N(A)=1. Taking r0=b1−1/2 proves the assertion and, by [F1], the profile belongs to Θ2(r).

LemmaStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

The q=2 ellipsoid extremal profile minimizes the fourth-power objective

Statement

Assume the minimax detection-risk definition, q=2, and positive nondecreasing sequences aj and σj with aj→∞. Let A,z0>0 and suppose S={j:Aaj2<1} is finite and nonempty. Define η~j2=z02σj2(1−Aaj2)+ and assume ∑j≥1σj2η~j2=r2,∑j≥1aj2σj2η~j2=1. Then η~∈Θ2(r) and minimizes ∑j≥1ηj4 over Θ2(r); the nonnegative minimizer is unique.

Facts & Assumptions

Given: The q=2 class Θ2(r), positive nondecreasing aj,σj with aj→∞, a finite nonempty active set S={j:Aaj2<1}, positive A,z0, and the profile η~j2=z02σj2(1−Aaj2)+ satisfying the two displayed constraints.

[F1]

Minimax detection risk and separation rate: η∈Θ2(r) means ∑jaj2σj2ηj2≤1 and ∑jσj2ηj2≥r2, with (σjηj)∈ℓ2.

Proof

1.1givenF1

Since S is finite, η~ has finite support. The second constraint in the Given states ∑jaj2σj2η~j2=1, and the first states ∑jσj2η~j2=r2. Thus [F1] gives η~∈Θ2(r).

1.2F1givenalgebra

Fix any η∈Θ2(r) and put xj=ηj2 and x~j=η~j2. Both series ∑jσj2xj and ∑jaj2σj2xj are finite by [F1], so their displayed difference is absolutely convergent. For j∉S, 1−Aaj2≤0; since xj≥0, ∑j∈Sσj2(1−Aaj2)xj=∑j≥1σj2(1−Aaj2)xj−∑j∉Sσj2(1−Aaj2)xj≥r2−A, where the first sum is at least r2−A by [F1]. For the candidate, the same quantity equals ∑j∈Sσj2(1−Aaj2)x~j=r2−A by its two active constraints. Multiplying the inequality by z02 therefore gives ∑jx~jxj≥∑jx~j2.

2.1F1step 1.2algebra

Expanding the difference of squared ℓ2 norms of the nonnegative sequences x and x~ gives ∑jηj4−∑jη~j4=∑j(xj−x~j)2+2∑jx~j(xj−x~j)≥0 by step 1.2. The sums are well-defined: ∑jxj2≤(∑jxj)2 and ∑jxj=∑jηj2<∞ by [F1]. This proves minimality.

3.1step 2.1algebra∎

If equality holds in the objective, step 2.1 forces ∑j(xj−x~j)2=0, hence xj=x~j for every j. Thus the nonnegative minimizer is unique.

LemmaStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Symmetric Gaussian product-mixture testing bound

Statement

Assume Countable Choice. In the Gaussian sequence detection experiment, let v∈Θq(r) have finite support J and put u(v)2=12ε4∑j∈Jvj4. Let πv be the uniform probability law on the finite family of mean sequences whose jth coordinate is independently +vj or −vj for j∈J and is zero off J, and let Pπv be the corresponding mixture sampling law. Then its likelihood ratio with respect to the null law is Lv=dPπvdPε,0=∏j∈Jexp⁡ ⁣(−vj22ε2)cosh⁡ ⁣(vjYjε2), it satisfies Eε,0Lv2=∏j∈Jcosh⁡ ⁣(vj2ε2),Eε,0(Lv−1)2≤exp⁡(u(v)2)−1, and the minimax risks obey γε(Θq(r))≥1−12exp⁡(u(v)2)−1,βε(Θq(r),α)≥1−α−12exp⁡(u(v)2)−1 for every α∈(0,1).

Facts & Assumptions

Given: Countable Choice, ε>0, v∈Θq(r) of finite support, and the null and alternative laws in the Gaussian sequence detection experiment.

[A1]

The Axiom of Countable Choice (ACω): Countable Choice is inherited from the Gaussian sequence inverse model.

[F1]

Gaussian sequence inverse model and White-noise spectral sequence representation: after scaling the normalized observation by sj=σj−1, Yj=ηj+εξj with independent standard normal coordinates ξj.

[F2]

Minimax detection risk and separation rate: αε(ψ)=Eε,0ψ, βε(Θq(r),ψ)=sup⁡η∈Θq(r)Eε,η(1−ψ), and γε is the infimum of their sum.

[F3]

The standard-normal coordinate law supplied by [F1] has density φ(x)=(2π)−1/2e−x2/2. Since it is a probability law, ∫Rφ(x) dx=1. This uses the supplied experiment, not the stronger-AC normalization theorem The standard normal density has total mass one.

[F4]

Independent random elements have product joint law: a finite tuple of independent coordinates has the product of its marginal laws.

[F5]

Finite measures agreeing on a generating pi-system and on the whole space are equal: probability measures agreeing on a generating pi-system agree on its generated sigma-algebra.

[F6]

Total variation distance for probability laws: ∥P−Q∥TV=sup⁡A∣P(A)−Q(A)∣ over measurable events.

[F7]

A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions: translation of the standard normal density preserves its integral, so EetG=et2/2 for G∼N(0,1) by completing the square.

Proof

1.1A1F1givenconstruct

For each sign vector τ∈{−1,+1}J, let vjτ=τjvj on J and zero elsewhere. Absolute values and squares are unchanged, so every vτ belongs to Θq(r).

1.2F1F3F7givenalgebra

Under the null, Xj=Yj/ε has density φ. For a fixed sign and coordinate, the density ratio for mean τjvj versus zero is exp⁡(τjvjYj/ε2−vj2/(2ε2)); completing the square using [F7] shows its null expectation is one.

2.1step 1.2F4algebra

Independence [F4] multiplies the one-coordinate ratios from step 1.2, giving the density ratio for the finite coordinate vector on each cylinder event. Its null expectation is the product of unit expectations, so it defines a probability measure on the full product space.

3.1step 2.1F5algebra

Cylinder events form a generating pi-system. The fixed-sign sampling law and the probability measure from step 2.1 agree on every cylinder, so [F5] gives equality on the product sigma-algebra and validates the full likelihood-ratio identity.

4.1step 3.1algebra

Averaging the fixed-sign likelihood ratios in step 3.1 over the finite sign set factors coordinatewise and gives Lv=∏j∈Je−δj/2cosh⁡(δjXj), where δj=vj2/ε2. This density is positive and has null expectation one.

5.1F4F7step 4.1algebra

For a standard normal G, [F7] and cosh⁡2t=(1+cosh⁡(2t))/2 give e−δEcosh⁡2(δG)=e−δ(1+e2δ)/2=cosh⁡δ. Independence [F4] and step 4.1 therefore give E0Lv2=∏j∈Jcosh⁡δj.

6.1step 5.1algebra

The function g(t)=t2/2−log⁡cosh⁡t is even, has g(0)=0, and for t≥0 has derivative g′(t)=t−tanh⁡t≥0, since (tanh⁡t)′≤1 and tanh⁡0=0. Thus cosh⁡t≤et2/2 for all real t. Since ∑jδj2=2u(v)2, step 5.1 yields E0(Lv−1)2=∏jcosh⁡δj−1≤e12∑jδj2−1=eu(v)2−1.

7.1F6step 6.1algebra

Since E0(Lv−1)=0, the positive and negative parts of Lv−1 have equal integrals; hence every event E satisfies ∣Pπv(E)−P0(E)∣≤12E0∣Lv−1∣≤12E0(Lv−1)2. Approximate a randomized test ψ by N−1∑k=1N1{ψ≥k/N}; the event bound [F6] and uniform approximation error N−1 give ∣Eπvψ−E0ψ∣≤∥Pπv−P0∥TV.

8.1F2step 6.1step 7.1givenalgebra∎

The maximal type-II error is at least its mixture average because every sign alternative lies in Θq(r). Therefore every test has total error at least 1−∥Pπv−P0∥TV, and any level-α test has maximal type-II error at least 1−α−∥Pπv−P0∥TV. Taking the respective infima, then applying steps 6.1 and 7.1, proves both stated risk bounds.

TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Sparse q<2 detection regime split

Statement

Assume Countable Choice and the minimax detection-risk definition with 0<q<2, aj=jα, σj=jβ, and α,β>0. Let rε→0 as ε↓0, and put λ=α+β2−βq. For λ>0, put A=2α+1/q−1/2, B=2(α+β)+1/q, and D=α+β(1−2/q)>0. Choose any δε>0 with δε→0 and δεlog⁡ε−1→∞, set r~ε=rε(1−δε), and define uε2=2inf⁡{∑j≥1hj2sinh⁡2(zj2/2): 0≤hj≤1, zj≥0, ∑j≥1j2βhjzj2≥r~ε2ε2, ∑j≥1jq(α+β)hjzjq≤1εq}. For each fixed significance level ℓ∈(0,1), the sharp errors have Gaussian form βε(Θq(rε),ℓ)=Φ(Hℓ−uε)+o(1),γε(Θq(rε))=2Φ(−uε/2)+o(1), where Φ(t)=(2π)−1/2∫−∞te−x2/2 dx and Hℓ is its (1−ℓ)-quantile. Moreover, if rε=o(εac) with ac=(qα+1−q/2)/(q(α+β)+1), then uε∼cα,β,q ε−A/DrεB/D for a constant cα,β,q>0. Without this additional restriction on rε, the sharp error formulas above remain valid for every rε→0, and a minimax separation rate is rε∗=εA/B. If λ≤0, for the same fixed significance level ℓ∈(0,1) put nε=rε−1/α and Dε=nε−βrε/ε−2log⁡nε. Then the sharp errors have degenerate form βε(Θq(rε),ℓ)=(1−ℓ)Φ(−Dε)+o(1),γε(Θq(rε))=Φ(−Dε)+o(1), and a sharp separation-rate normalization is rε∗=Λ εα/(α+β)(log⁡ε−1)α/[2(α+β)],Λ=(2α+β)α/[2(α+β)]. Thus the sparse boundary λ=0 belongs to the degenerate regime, and the two regimes have different separation rates.

The deterministic globalized score-and-maximum family and the finite maximum tests constructed in the proof are asymptotically minimax in the Gaussian and degenerate regimes, respectively; the significance tests include deterministic randomization to satisfy the exact level constraint.

Facts & Assumptions

Given: Countable Choice, the sequence experiment and alternatives in the Statement. Write s=α+β, use ℓ∈(0,1) for the fixed significance level, and put Xi=Yi/ε=μi+Gi, where μi=ηi/ε. The supplied normal probability law has density ϕ and distribution function Φ.

[F1]

Minimax detection risk and separation rate: the actual alternatives satisfy ∑i2βμi2≥r2/ε2 and ∑iqs∣μi∣q≤ε−q; finite-support alternatives are allowed, and tests are randomized product-Borel maps.

[F2]

Sparse Gaussian scalar certificate and extremal profile supplies the positive scalar certificate a,b, inverse profile z(x), coefficient d(x)=x2β/(2a(z(x))), constants c0,c1,c2,M1,M2, their endpoint bounds and Riemann sums, and the relaxed extremal equivalent when n→∞,h0→0.

[F3]

A finite-array normal limit from vanishing fourth moments: given normalized Gaussian probability laws, finite centered independent arrays whose summed variances tend to v>0 and whose summed fourth moments tend to zero have distribution functions converging uniformly to Φ( ⋅ /v), under Countable Choice.

[F4]

Isonormal Gaussian white-noise inverse experiment supplies independent standard-normal coordinates, including their normalized scalar probability density. Normalization is a hypothesis of that supplied process; no stronger-choice normalization theorem is used.

[F5]
[F6]

Chebyshev-Markov inequality for the integral gives Markov's inequality, including Chebyshev's inequality by applying it to a squared centered variable.

[F7]
[F8]

Monotone convergence for the integral and Dominated convergence justify the specified nonnegative series and dominated scalar integrals.

[F9]

Finite measures agreeing on a generating pi-system and on the whole space are equal identifies probability laws agreeing on finite cylinders of the product sigma-algebra.

[F10]

Taylor's Lagrange remainder follows from repeated Rolle steps bounds a third-order Taylor remainder by the supremum of the third derivative times the cube of the increment, divided by six.

[F11]

Total variation distance for probability laws defines ∥P−Q∥TV=sup⁡E∣P(E)−Q(E)∣ over measurable events for probability laws on the same measurable space.

[F12]

Continuity from above when one set has finite measure: for decreasing measurable events under a probability law, their probabilities decrease to the probability of their intersection.

[A1]

The Axiom of Countable Choice (ACω): Countable Choice is assumed; all other limits and finite products below use the supplied coordinate laws. No full-Choice central-limit theorem is invoked.

Proof

The two regimes below are separate cases. A paragraph in the Gaussian branch uses its profile notation from step 1.3; a paragraph in the degenerate branch uses the notation from step 2.4. Repeated local letters in these two cases have separate scopes.

1.1givenF4F7F9A1algebra

The finite coordinate density of Xi with mean μi divided by its null density is exp⁡(μiXi−μi2/2). Thus a finite uniform mixture of the two signs at a coordinate of absolute mean z has likelihood e−z2/2cosh⁡(zXi), and the prior with probabilities 1−g,g/2,g/2 at 0,z,−z has likelihood 1+gξz(Xi), where ξz(t)=e−z2/2cosh⁡(zt)−1. Multiplication over finitely many coordinates is justified by [F7]. Off these coordinates the law is unchanged; equality first on finite cylinders and then [F9] proves the likelihood identity on the whole sequence sample space. Every prior below has finite coordinate support; no new countable product probability law is constructed.

1.2givenF4F5F6F10algebra

Completing the square and applying [F5] to the given unit density gives EetG=et2/2. Consequently, by expanding the hyperbolic functions, Eξz(G+μ)=cosh⁡(zμ)−1,Var⁡ξz(G+μ)=cosh⁡(z2)−1+(ez2−1)sinh⁡2(zμ). For fixed B, Eξz(G)4≤CB(cosh⁡(z2)−1)2 when 0<z≤B: the bound ∣ξz(G)∣≤CBz2(1+G2)eB∣G∣ follows from the Taylor bound for cosh⁡ and e−z2/2, its fourth-power integral is finite by completing the square, and cosh⁡(z2)−1≥z4/2. We will also use P(∣G∣>t)≤2e−t2/2, obtained from [F6] and the same exponential moment, and the elementary Mills bounds Φ‾(t)≤ϕ(t)/t and Φ‾(t)≥ϕ(t+1/t)/t for t≥1. The first follows by integrating xϕ(x)/t over [t,∞), and the second by integrating ϕ over [t,t+1/t].

1.3givenF2algebra

First suppose λ>0 and set L=qs−2β>0, κ=L/(2−q). Use [F2] to define the unique positive n,h0 by c1h0n2β+1=r2ε−2,c2h0nqs+1=ε−q,U2=c0h02n, and put zi=z(i/n), hi=h0d(i/n). Then nL=(c1/c2)ε2−q/r2. The scalar certificate in [F2] gives ∑i≤mhi(cosh⁡(zivi)−1)≥h02(n−2β∑i≤mi2βvi2−n−qs∑i≤miqs∣vi∣q). Also ∑hi<∞ and V:=∑hi2(cosh⁡(zi2)−1)∼U2 as n→∞. These are score coefficients, which need not be at most one. On compact subsets of 0<r/rε∗<∞, U stays bounded and bounded away from zero, n grows as a positive power of ε−1, and h0≍n−1/2.

2.1givenF2step 1.3algebra

In the Gaussian branch, with the profile notation of step 1.3, the extremal value in the Statement is exactly Jε(r~) in [F2], because cosh⁡(z2)−1=2sinh⁡2(z2/2). That lemma proves its power equivalent whenever r~=o(εac), equivalently when its associated n→∞,h0→0. Since r~/r→1, this is the asserted restriction and the equivalent may be written with r. In particular on each compact transition range, uε∼U=cα,β,qε−A/DrB/D. No equivalent outside the stated sufficient zone is used.

2.2givenF1F2F6F7F11step 1.3constructalgebra

In the Gaussian branch, with the profile notation of step 1.3, for the Gaussian lower bound, fix a compact transition range. The feasible construction in [F2] can be made with expected energy (1+τ)r2ε−2 and expected budget (1−τ)ε−q, on a finite window a≤i/n′≤b, with probabilities gi=h0′d(i/n′)≤1 and amplitudes z(i/n′). Let the margins tend slowly to zero and windows tend slowly to (0,∞). This can be specified without a rate assumption: use windows [1/k,k], margin 1/k, and pass to each next integer k only after its finite Riemann errors, feasibility bounds and the concentration errors below are smaller than the prescribed margins; the preceding compact-window estimates hold uniformly on the chosen compact transition range. The profile moments M1,M2 give relative variances O((nh0)−1)=O(n−1/2) for both random constraint sums before the slowly varying window constants. Choose the numerical diagonal slowly enough that those relative variances divided by τ2 tend to zero. Chebyshev then puts prior probability 1−o(1) on the actual alternative. Each draw has finite coordinate support and hence is in ℓ2. The prior cost tends to U2, its largest coordinate cost tends to zero, and its cost on zi>B tends uniformly to zero as B→∞, by the bounded small-end and exponential large-end envelopes in [F2]. Let Π denote this finite-support prior on parameter sequences, let A be the event that a draw satisfies both alternative constraints, and put p=Π(A)=1−o(1). If p=1, conditioning changes no mixture law. Otherwise, eventually 0<p<1 and the unconditioned observation law decomposes as PΠ=pPΠ∣A+(1−p)PΠ∣Ac. For every measurable event E, this gives ∣PΠ(E)−PΠ∣A(E)∣=(1−p)∣PΠ∣Ac(E)−PΠ∣A(E)∣≤1−p, so [F11] yields ∥PΠ−PΠ∣A∥TV≤1−p. For every randomized test ψ with values in [0,1], the functions N−1∑k=1N1{ψ≥k/N} approximate ψ uniformly within 1/N; applying the event bound to each summand and letting N→∞ gives ∣EPΠψ−EPΠ∣Aψ∣≤1−p=o(1) uniformly over tests.

2.3givenF2F3F4F6F8step 1.2step 1.3constructalgebra

In the Gaussian branch, with the profile notation of step 1.3, for the matching upper bounds define the product-Borel score F(X)=∑i≥1hie−zi2/2cosh⁡(ziXi)−∑i≥1hi. The first series is nonnegative and may be infinite; then the test rejects. Under the null its expectation is ∑hi<∞, so it is finite almost surely by [F6], and its centered partial sums converge in mean square with variance V. The bounded-amplitude fourth-moment calculation in step 1.2 and [F3], followed by the null variance tail bound in [F2], give F⇒N(0,U02). For n large put Qi2=2log⁡(i+1)+4log⁡log⁡(i+3)+4log⁡log⁡n,Y={∃i:∣Xi∣>Qi}. Step 1.2 and a countable union bound give P0(Y)≤2(log⁡n)−2∑i≥1[(i+1)(log⁡(i+3))2]−1=o(1). For every fixed K, max⁡i≤n(log⁡n)KQi=2log⁡n+o(log⁡n). Reject on {F>HℓV}∪Y for the significance problem, and on {F>V/2}∪Y for total error. These are unions with a centered-cosh score, rather than an intersection or a positive-exponential uncentered score.

2.4givenF1F4F6step 1.2constructalgebra

Now suppose λ≤0, put e=2β−qs≥0, n=r−1/α, m=rs/α, Aε=m/ε and Dε=Aε−2log⁡n. Every alternative has an index i≤⌊n⌋ with ∣ηi∣≥m. Indeed with wi=iqs∣ηi∣q, its energy summand is wiie∣ηi∣2−q. If i≤n and ∣ηi∣<m, this multiplier is strictly below nem2−q=r2. If i>n, the termwise budget gives ∣ηi∣≤i−s, so the multiplier is at most i−2α<r2. If all the indicated coordinates were smaller than m, summing with ∑wi≤1 would give energy strictly below r2, a contradiction. Let N=⌊n⌋ and tN=2log⁡N. The finite maximum test R=1{max⁡i≤N∣Xi∣>tN} has size p0≤2NΦ‾(tN)=O(1/tN)=o(1) by step 1.2. Its maximal type-II error is at most Φ(tN−Aε)=Φ(−Dε)+o(1), uniformly in Aε, since tN−2log⁡n→0 and Φ′ is bounded. For significance ℓ, the randomized test ρ+(1−ρ)R with ρ=(ℓ−p0)/(1−p0) is eventually valid and has size exactly ℓ; its type-II error is at most (1−ℓ)Φ(−Dε)+o(1). The unrandomized maximum gives the total-error upper bound.

3.1givenF3F6F10step 1.1step 1.2step 2.2algebra

In the Gaussian branch, with the profile notation of step 1.3, under the null put Ai=giξzi(Gi) for the finite prior in step 2.2. They are centered and independent, and ∑EAi2→U02 along any subsequence with U→U0∈(0,∞). On zi≤B, step 1.2 and the vanishing maximum coordinate variance give ∑EAi4→0. The omitted linear sum has variance tending uniformly to zero as B→∞; the omitted quadratic sum has expectation tending to zero. Apply [F3] to the finite bounded-amplitude arrays and then let B→∞, using Chebyshev for the linear tail. The same fourth-moment bound gives concentration of their quadratic sums. Thus ∑Ai ⇒ N(0,U02),∑Ai2→U02,max⁡i∣Ai∣→0 in probability for the last two limits. Each factor 1+Ai=1−gi+gie−zi2/2cosh⁡(ziGi) is positive. On max⁡∣Ai∣≤δ<1/2, [F10] gives ∣∑log⁡(1+Ai)−∑Ai+12∑Ai2∣≤Cδ∑Ai2. Let δ↓0. The likelihood from step 1.1 therefore has log⁡L⇒N(−U02/2,U02). The addition of terms converging in probability and the successive tail limits preserve the displayed distribution limit by squeezing distribution functions between thresholds differing by an arbitrary positive tolerance.

3.2givenF1F2F7F12step 1.2step 1.3step 2.3constructalgebra

In the Gaussian branch, with the profile notation of step 1.3, fix d∈(0,1). Alternatives with Pμ(Yc)<d already have type-II error below d. For every other alternative, writing pi=Pμ(∣Xi∣>Qi), finite independence gives ∏i≤m(1−pi)≥d for each m. Hence ∑ipi≤−log⁡d and ∣μi∣≤Qi+Cd, the latter because the probability of the inside interval is at most Φ(Qi−∣μi∣). Choose K>(2−q)/(2L) and N=⌈n(log⁡n)K⌉. The energy of indices i>N is at most ε−qsup⁡i>Ni−L(Qi+Cd)2−q≤Cdε−qN−L(log⁡N)(2−q)/2=o(r2ε−2). The envelope is eventually decreasing and ε−qn−L is a fixed multiple of r2ε−2. Among i≤N delete those with ∣μi∣>clog⁡n, where c=0.45∈(2−1,1/2). The lower Mills bound in step 1.2 implies pi≥n−a+o(1) there, with a=(2−c)2/2<1/2, uniformly over these indices. Thus at most na+o(1) are deleted. Their energy is at most n2β+a+o(1)=o(n2β+1/2)=o(r2ε−2), including the polynomial logarithmic factors from N and the means. Define μi∗=μi for i≤N not deleted and μi∗=0 for every deleted index and every i>N. This vector has finite support, satisfies ∣μi∗∣≤clog⁡n, and has no increased q-budget. Its energy loss is at most the sum of the already bounded tail energy and deleted-coordinate energy, so its retained energy is (1−o(1))r2ε−2. Its score mean M=Eμ∗F is therefore at least U2−o(1) by the certificate in step 1.3 and c0=(c1−c2)/2. Coordinatewise ∣μi∗∣≤∣μi∣, and ∣G+μ∣ is stochastically increasing in ∣μ∣, since Φ(t−∣μ∣)−Φ(−t−∣μ∣) decreases with ∣μ∣. Independence and the positive coefficients imply the score comparison for every finite partial sum. The full score event is the decreasing intersection of these partial-sum events after adding the fixed ∑hi; [F12] passes the comparison to the full nonnegative series, giving Pμ(F≤t)≤Pμ∗(F≤t).

3.3givenF1F5F7step 1.1step 1.2step 2.4constructalgebra

In the degenerate branch, with the notation of step 2.4, for the matching degenerate lower bound first take Dε→d∈R. Put M=⌊n/(log⁡n)2⌋, I={⌊n⌋−M+1,…,⌊n⌋}, and mix uniformly over indices i∈I and signs with ηi=±ri−β, all other coordinates zero. Every point has energy r2 and budget (riα)q≤1. Write T=2log⁡M and μi=r/(εiβ); uniformly on I, μi=T+d+o(1) since M/n=O((log⁡n)−2) and T−2log⁡n→0. The null likelihood from step 1.1 is L=M−1∑i∈Ie−μi2/2cosh⁡(μiGi). Truncate each summand to ∣Gi∣≤T, obtaining L~. Completing the square gives its summand mean Φ(T−μi)−Φ(−T−μi)→c=Φ(−d) and its second moment at most 12eμi2Φ(T−2μi)+12e−μi2. The upper Mills bound and μi2−12(2μi−T)2−log⁡M=−(μi−T)2 bound this second moment divided by M by O(1/T). Independence gives Var⁡L~=O(1/T)→0, and P0(L≠L~)≤2MΦ‾(T)=O(1/T)→0. Thus E0∣L~−c∣→0 and L→c in null probability. Since L≥L~, every size-ℓ test has mixture type-II error at least c(1−ℓ)−E∣L~−c∣; every total error is at least Emin⁡(1,L)→c. Bounded convergence in probability here follows directly by splitting at any fixed positive deviation; no likelihood uniform integrability is asserted. This proves both lower bounds for finite d.

4.1givenF5F8step 2.2step 3.1algebra

In the Gaussian branch, with the profile notation of step 1.3, for any likelihood L, randomized test χ and c>0, scalar algebra gives L(1−χ)≥min⁡(L,c)−cχ. The limit law in step 3.1 has no positive atoms, so E0min⁡(L,c)=∫0cP0(L>t) dt converges by [F8]; the identity itself follows first for step functions and then by increasing finite subdivisions. Choose c=exp⁡(−U02/2+U0Hℓ). Its limiting upper-tail probability is ℓ, and completing the square gives the limiting lower bound Φ(Hℓ−U0) for every test of size at most ℓ. Likewise every total error is at least E0min⁡(1,L)→2Φ(−U0/2). Conditioning in step 2.2 costs only o(1) uniformly over tests. This proves both minimax lower bounds on compact transitions without an additional Neyman--Pearson or unrestricted-choice supplier.

4.2givenF2step 1.2step 3.2algebra

In the Gaussian branch, with the profile notation of step 1.3, for the residual vector set mi=hi(cosh⁡(ziμi∗)−1), so M=∑mi≥0. The exact variance formula in step 1.2 shows that the excess above V is ∑hi2(ezi2−1)sinh⁡2(ziμi∗)≤∑Kimi,Ki=hi(ezi2−1)(cosh⁡(ziμi∗)+1). For zi≤log⁡n, the global bound ψ(z)(ez2−1)≤C in [F2], its relation x≤C(1+z1/κ) at large z, and h0≍n−1/2 give Ki≤n−1/2+c+o(1)=o(1). For zi>log⁡n the other global bound in [F2] gives an absolute excess bound Ch02∑zi>log⁡n(i/n)4βexp⁡(−zi2+2czilog⁡n)≤Ch02∑zi>log⁡n(i/n)4βe−(1−2c)zi2=o(1). The final estimate follows from the exponential profile tail and h02n=O(1); its discrete tail is bounded by the integral of an eventually decreasing polynomial-times-exponential envelope plus a mesh term, as in [F2]. Thus uniformly over residual alternatives, Var⁡μ∗F≤V+o(1)M+o(1). Unbounded zi have been controlled by an absolute variance bound, not a uniform bounded-amplitude assumption.

4.3givenF1step 2.4step 3.3algebra

In the degenerate branch, with the notation of step 2.4, if Dε→+∞, step 2.4 settles both errors by nonnegativity. If Dε→−∞, fix K>0. The continuous strictly increasing function r↦ε−1rs/α−(2/α)log⁡(1/r) ranges from −∞ to a positive value on (0,1), so it has a unique radius rε,K at value −K, and this radius tends to zero. Eventually r<rε,K; inclusion of alternative sets and step 3.3 give lower limits at least Φ(K) for total error and (1−ℓ)Φ(K) for type-II error. Let K→∞. Subsequences in the extended real line now establish the two degenerate formulas for arbitrary Dε. Finally put p=s/α and Λ=(2/s)α/(2s), so Λp=2/s. For each fixed c>0, direct substitution into the displayed rε∗ gives Dε(crε∗)=(cp−1)2log⁡(ε−1)/s+o(1). The logarithmic correction is O(log⁡log⁡(ε−1)/log⁡(ε−1)), which tends to zero. Thus the stated sharp constant, zero/infinite-ratio separation limits and the assignment of λ=0 all follow, with no strict inequality imposed on e.

5.1givenF2F3F6F7step 1.2step 4.1step 2.3step 3.2step 4.2algebra

In the Gaussian branch, with the profile notation of step 1.3, if M stays bounded, fix B>0. For zi≤B, hizi2≤CBh0(i/n)2β by [F2]. Writing the hyperbolic addition formula and using ∣sinh⁡(zμ)∣≤z∣μ∣eB∣μ∣ gives E∣hi(ξzi(Gi+μi∗)−Eξzi(Gi+μi∗))∣4≤CB(hizi2)4(1+∣μi∗∣4)e4B∣μi∗∣. Here the fourth moments of cosh⁡(zG)−Ecosh⁡(zG) and sinh⁡(zG) are bounded respectively by CBz8 and CBz4, by the same Gaussian exponential integration as in step 1.2. Since zi≤B implies i≤CBn, the summed fourth moments are OB(nh04)no(1)=n−1+o(1)→0. The variance of the omitted zi>B centered sum is at most its null variance tail plus o(1), by step 4.2 and bounded M. Apply [F3] to the retained finite arrays and then let B→∞ to obtain F−M⇒N(0,U02). The assertion is uniform in the sense that every sequence of residual alternatives with bounded M obeys this limit. If M→∞, step 4.2 and Chebyshev instead show Pμ∗(F≤t)→0 for every bounded threshold. These conclusions and M≥U2−o(1) prove the upper type-II limits Φ(Hℓ−U0) and Φ(−U0/2). To justify passage to the supremum, any contrary sequence has either a bounded-mean subsequence (then a convergent-mean subsequence) or a subsequence with M→∞; both cases give the asserted bound. Let d↓0 for the alternatives excluded in step 3.2. Under the null step 2.3 gives the corresponding errors ℓ+o(1) and Φ(−U0/2)+o(1). If the first test has size pε>ℓ, multiply its indicator by ℓ/pε; otherwise leave it unchanged. Its size is then at most ℓ and every power changes by o(1). This proves the exact-level Gaussian upper bound and the total-error upper bound.

6.1givenA1F1F2step 2.1step 2.3step 4.1step 5.1constructalgebra

In the Gaussian branch, write ρ=r/rε∗, p=B/D>0 and c=cα,β,q. For a comparison radius R=trε∗, let Tε,tℓ be the score-and-maximum significance test in steps 2.3 and 5.1, with its exact-level scaling, and let Tε,ttot be their unscaled total-error test. The proved estimates are uniform over each fixed t∈[1/k,k]: otherwise a countersequence has a convergent subsequence of t in that compact interval, and all the compact-transition estimates already proved apply with a positive finite limiting U=ctp, contradicting the countersequence. Consequently, for every integer k≥2 there is a sufficiently small noise threshold such that for all smaller ε and every t∈[1/k,k], the profile dimension is n>e, ∣uε(trε∗)−ctp∣≤1/k, the maximal type-II error of Tε,tℓ at radius trε∗ is at most Φ(Hℓ−ctp)+1/k, and the total error of Tε,ttot there is at most 2Φ(−ctp/2)+1/k. Both tests are therefore defined on this whole compact range, and the significance test has size at most ℓ for every such noise level. Fix j1=1 and recursively let jk be the least integer j>jk−1, j≥k, for which all these uniform properties hold for every 0<ε≤2−j. These integers exist by the uniform convergence just proved. For 0<ε≤2−j2 define kε=max⁡{k≥2:ε≤2−jk}. This is a nonempty finite set because jk≥k; kε→∞ as ε↓0. The least-integer rule and this finite maximum specify one deterministic diagonal, depending only on the fixed model, significance level and the given δε family, not on the unknown truth or the observations.

7.1givenF1F2step 6.1constructalgebra

For this single diagonal, define the Gaussian-regime test family for every known radius r>0 as follows. When ρ<1/kε, use the constant randomized significance test χε,rℓ≡ℓ and the never-reject total-error test χε,rtot≡0. When 1/kε≤ρ≤kε, use Tε,ρℓ and Tε,ρtot. When ρ>kε, use Tε,kεℓ and Tε,kεtot, constructed at the smaller comparison radius kεrε∗, never at the possibly invalid profile dimension associated with r. For ε>2−j2 set the family to the same two trivial tests; this finite-noise convention does not affect an asymptotic statement. Every test is product-Borel, each significance test has size at most ℓ, and every formula log⁡log⁡n actually evaluated has n>e. Write k=kε. In the middle case the upper risk bounds in step 6.1 hold with error 1/k, and ∣uε(r)−cρp∣≤1/k, so the attained errors are bounded by the stated Gaussian profiles plus a quantity tending to zero. In the small-radius case, monotonicity of the relaxed extremal problem gives 0≤uε(r)≤ck−p+1/k→0; the two trivial tests have respective errors 1−ℓ and 1 whenever the alternative is nonempty, and no larger errors if it is empty, matching the profile upper bounds up to a vanishing quantity. In the large-radius case, the actual alternative is a subset of the comparison-radius alternative, so both achieved errors are no larger than their comparison-radius errors, bounded by Φ(Hℓ−ckp)+1/k and 2Φ(−ckp/2)+1/k, respectively, and these tend to zero. Also uε(r)≥ckp−1/k→∞, as required for the displayed profiles. These bounds apply to all three cases with the same deterministic kε; hence they also apply to ratios oscillating between them, without selecting a test by a subsequence.

8.1givenF1F2step 2.4step 4.1step 4.3step 6.1step 7.1algebra

The compact-transition lower bounds in step 4.1 extend globally by monotonicity of the minimax errors and of Jε(r(1−δε)). Comparing r/rε∗→0 with each fixed small positive transition constant gives uε→0, lim inf⁡γε≥1 and lim inf⁡βε(ℓ)≥1−ℓ; the corresponding upper bounds are the trivial tests. Comparing r/rε∗→∞ with each fixed large transition constant gives uε→∞ and vanishing minimax errors. For any other sequence of positive ratios, every subsequence has a further subsequence tending to zero, a finite positive constant or infinity, so the same lower-profile conclusion applies. Together with the globally defined upper family in step 7.1 this proves both sharp Gaussian formulas and asymptotic minimax attainment for every rε→0, including oscillating ratios. In particular the displayed rε∗ is a separation rate with both impossibility and consistency halves. In the degenerate regime, the finite maximum and exact-level randomized tests in step 2.4 already apply along every rε→0, because N→∞ and p0→0 irrespective of the noise/radius ratio; to define them also before N≥2 and p0<ℓ, use the constant significance test and never-reject total-error test until those inequalities hold. Their global sharp attainment follows from step 4.3 and its matching upper bounds. No unrestricted power equivalent or undefined transition threshold is used in either family.

9.1givenF1step 2.4step 4.3step 7.1step 8.1constructalgebra

The separation-rate definition in [F1] allows every positive radius sequence, not only vanishing ones. In either regime the displayed positive rate rε∗ tends to zero. If rε/rε∗→0, then rε→0, so the impossibility half already proved applies. For the consistency half, let rε>0 satisfy rε/rε∗→∞ and set rˉε=min⁡{rε,rε∗}. Then 0<rˉε≤rε, rˉε→0, and rˉε/rε∗=min⁡{rε/rε∗,1/rε∗}→∞. The Gaussian tests of step 7.1 and the degenerate tests of steps 2.4 and 8.1, evaluated at rˉε, therefore have vanishing total error and vanishing maximal type-II error at each fixed significance level on Θq(rˉε). The defining energy inequality gives Θq(rε)⊆Θq(rˉε), so using these same tests at the requested radius leaves their null size unchanged and cannot increase their maximal type-II error. Thus both minimax errors at rε are bounded above by their counterparts at rˉε and tend to zero. If Θq(rε) is empty, both minimax errors are zero by the explicit convention in [F1]; the never-reject test also realizes zero total error in that case. This proves the rate implications for all positive radius sequences, including nonvanishing or oscillating radii, in both regimes. All cutoffs and profile parameters used in this reduction are evaluated at the vanishing comparison radius.

10.1givenA1F1F3F4F7step 2.1step 7.1step 8.1step 9.1step 4.3∎

The Gaussian and degenerate bounds agree with their respective lower bounds, and the globally specified tests in steps 7.1 and 8.1 attain them asymptotically, including exact significance adjustment. Step 2.1 proves the qualified extremal power equivalent, step 8.1 proves the full Gaussian separation claim, and step 4.3 proves the degenerate sharp normalization. Step 9.1 supplies the separation-rate implications for all positive radius sequences. Each test is product-Borel, using a specified nonnegative countable series or finitely many coordinates and deterministic randomization. All Gaussian laws were given by [F4], all auxiliary probability products were finite, and the finite-array approximation used [F3] under Countable Choice. This proves every stated clause without a stronger choice assumption or a citation in place of a local proof.

Remarks

The unrestricted all-radius extremal power equivalent in the cited 2012 display is not used: for some radii tending to zero the relaxed value grows faster than every power of the noise level. The sufficient moderate-zone restriction above preserves the full sharp error profiles, whose endpoint cases follow by monotonicity. The explicit upper test uses a centered factor e−z2/2cosh⁡(zt)−1 and a union with the maximum event. These corrections are verified directly in the proof rather than inferred from the sign and set-operation displays in the source. The 2003 book remains bibliographic context; no unread book or supplemental argument is a premise.

TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

q=2 Gaussian-sequence ellipsoid detection boundary

Statement

Assume Countable Choice and the minimax detection-risk definition with q=2. For each ε, suppose Θ2(rε) is nonempty and has a finite-support fourth-power minimizer η~ε with profile η~ε,j2=z02σj2(1−Aaj2)+ as in the extremal-profile lemma. Put uε2=12ε4∑jη~ε,j4,wε,j=η~ε,j22∑jη~ε,j4,wε,0=max⁡jwε,j, and define Tε=∑jwε,j((Yj/ε)2−1),ψε,H=1{Tε>H}. If uε→0, then γε(Θ2(rε))→1 and βε(Θ2(rε),α)→1−α for every α∈(0,1). If uε→∞, then for every fixed c∈(0,1) the tests ψε,cuε have total error tending to zero.

For the extremal profile, define the finite sums J1=∑jσj4(1−Aaj2)+,J2=A∑jaj2σj4(1−Aaj2)+,J0=∑jσj4(1−Aaj2)+2. The active constraints imply rε2=AJ1J2,uε2=(rεε)4J02J12.

Facts & Assumptions

Given: Countable Choice; q=2; a nonempty class Θ2(rε); a finite-support minimizing profile satisfying both active constraints; and the Gaussian sequence detection experiment.

[F1]

Minimax detection risk and separation rate: αε(ψ)=E0ψ, βε(Θ2(r),ψ)=sup⁡η∈Θ2(r)Eη(1−ψ), and γε is the infimum total error.

[F2]

The q=2 ellipsoid extremal profile minimizes the fourth-power objective: η~j2=z02σj2(1−Aaj2)+ minimizes ∑jηj4 over Θ2(r) and satisfies ∑jσj2η~j2=r2, ∑jaj2σj2η~j2=1.

[F3]

Symmetric Gaussian product-mixture testing bound: for a finite-support feasible v, its symmetric sign mixture has total-variation distance at most 12exp⁡(u(v)2)−1 from the null; consequently it gives the displayed minimax lower bounds.

[F4]

Isonormal Gaussian white-noise inverse experiment supplies independent standard-normal coordinates with normalized density φ(t)=(2π)−1/2e−t2/2 and covariance one. We use the scalar calculation of A normal variable has finite fourth moment with this supplied law, rather than invoke its AC-based law construction: φ′(t)=−tφ(t), so integration by parts on [−R,R] gives ∫t2φ=[−tφ]−RR+∫φ and ∫t4φ=[−t3φ]−RR+3∫t2φ. The polynomial-Gaussian boundary terms vanish as R→∞; the nonnegative integrals increase to their full integrals. Supplied normalization therefore gives second and fourth moments 1 and 3; symmetry gives first and third moments zero. This supplied-law calculation uses no additional choice.

[F5]

Chebyshev-Markov inequality for the integral: Chebyshev's inequality bounds a tail probability by the variance divided by the squared deviation.

[A1]

The Axiom of Countable Choice (ACω): Countable Choice is the assumption of the upstream Gaussian sequence model.

Proof

1.1A1F1F2F4algebra

The profile has finite support by the assumption on S. Its weights satisfy 2∑jwε,j2=1, so ∑jwε,j2=1/2. Under a parameter η, write μj=ηj/ε; then Yj/ε=ξj+μj. Independence and [F4] give mη:=EηTε=∑jwε,jμj2,Var⁡η(Tε)=1+4∑jwε,j2μj2≤1+4wε,0mη. In particular, under the null the statistic has mean zero and variance one.

1.2F1F3given

Suppose uε→0. Apply [F3] to v=η~ε. The resulting total-variation bound tends to zero, so every test has total error at least 1−o(1) and every level-α test has maximal type-II error at least 1−α−o(1). The constant test ψ≡0 gives total error 1, and the constant randomized test ψ≡α gives level α and maximal type-II error 1−α. These upper bounds prove both limits.

2.1A1F1F2step 1.1algebra

For any η∈Θ2(rε), put xj=ηj2 and x~j=η~j2. Since 1−Aaj2≤0 off the profile support, ∑jx~jxj=z02∑j∈Sσj2(1−Aaj2)xj≥z02(rε2−A)=∑jx~j2, where the inequality follows from ∑jσj2xj≥rε2 and ∑jaj2σj2xj≤1. Thus mη≥∑jη~j4ε22∑jη~j4=uε.

3.1F1F5step 1.1step 2.1algebra

Suppose uε→∞ and fix c∈(0,1). Applying [F5] under the null gives αε(ψε,cuε)≤(cuε)−2→0. For any alternative, step 2.1 and step 1.1 give Pη(Tε≤cuε)≤1+4wε,0mη(mη−cuε)2≤1(1−c)2uε2+4wε,0(1−c)2uε. The final bound uses that m/(m−cu)2 decreases for m≥u and wε,0≤1/2, which follows from ∑jwε,j2=1/2. It tends to zero uniformly over Θ2(rε), proving consistency.

4.1F2givenalgebra∎

Substituting the profile into the active constraints gives rε2=z02J1 and 1=z02J2/A. Hence rε2=AJ1/J2. Also ∑jη~j4=z04J0, and eliminating z02=rε2/J1 gives uε2=(rε/ε)4J0/(2J12).

CorollaryStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Sharp Gaussian asymptotics under a vanishing largest weight

Statement

Assume the q=2 ellipsoid detection-boundary theorem, Countable Choice, and the Axiom of Choice. Along a sequence for which uε is bounded above and bounded away from zero and wε,0→0, the minimax level-α type-II error and minimax total error satisfy βε(Θ2(rε),α)=Φ(Hα−uε)+o(1),γε(Θ2(rε))=2Φ(−uε/2)+o(1), where Φ is the standard normal distribution function and Hα is defined by Φ(Hα)=1−α. Let cε,α=inf⁡{t:Pε,0(Tε≤t)≥1−α}; then Pε,0(Tε>cε,α)≤α and cε,α→Hα. The weighted tests with thresholds cε,α and uε/2 attain these asymptotics, while the uncalibrated threshold Hα has asymptotic size α. The vanishing-largest-weight condition is required for this Gaussian sharp branch.

Facts & Assumptions

Given: The q=2 detection-boundary statistic Tε, finite-support extremal mean η~ε, uε, and weights wε,j; AC and Countable Choice; uε bounded above and away from zero; wε,0→0.

[F1]

q=2 Gaussian-sequence ellipsoid detection boundary: 2∑jwε,j2=1, every alternative has statistic mean mη=∑jwε,j(ηj/ε)2≥uε, and Var⁡η(Tε)≤1+4wε,0mη.

[F2]

Weighted chi-square triangular-array limit: under the null, Tε⇒N(0,1) when wε,0→0.

[F3]

Symmetric Gaussian product-mixture testing bound: for the symmetric sign mixture on η~ε, Lε=dPπ/dP0=∏je−δj/2cosh⁡(δjGj), where δj=η~ε,j2/ε2 and Gj=Yj/ε under the null.

[F4]

Isonormal Gaussian white-noise inverse experiment and A normal variable has finite fourth moment: under the null the Gj are independent standard normals with even density and moments EGj2=1 and EGj4=3. The sixth and eighth moments are derived in step 1.2.

[F5]

Slutsky's theorem for real random variables: adding a term converging to zero in probability preserves convergence in distribution.

[F6]

Portmanteau theorem: convergence in distribution gives convergence of bounded uniformly continuous test expectations and convergence of probabilities on Borel sets whose boundaries have limiting probability zero.

[F7]

Chebyshev-Markov inequality for the integral: Chebyshev's inequality bounds a tail probability by the variance divided by the squared deviation.

[F8]

Continuity from above when one set has finite measure and Continuity from below for measures: probabilities of monotone event sequences converge to the probability of their intersection or union, respectively; the finite-measure hypothesis for continuity from above holds for probability laws.

[F9]

If u,v are differentiable on [a,b] with u′,v′ integrable, then ∫abuv′=u(b)v(b)−u(a)v(a)−∫abu′v: on a finite interval, differentiable functions with integrable derivatives satisfy integration by parts. The Gaussian density and the polynomial factors used in step 1.2 are continuously differentiable there, with continuous, integrable derivatives.

[F10]

The exponential dominates every fixed nonnegative integer power at +∞: every fixed polynomial times the Gaussian exponential tends to zero at both ends of the real line.

[F11]

Monotone convergence for the integral: nonnegative truncations of a measurable function on increasing intervals have integrals increasing to its full integral.

[A1]

The Axiom of Choice: AC is used through the weighted Lindeberg–Feller theorem in [F2].

[A2]

The Axiom of Countable Choice (ACω): Countable Choice is inherited from the Gaussian sequence experiment.

Proof

1.1A1A2F1F2F5F7given

Under an alternative η, write μj=ηj/ε and let Gj=ξj denote the independent standard-normal noise coordinates, so Yj/ε=μj+Gj. Then Tε−mη=∑jwε,j(Gj2−1)+2∑jwε,jμjGj. The first sum converges to N(0,1) by [F2]. The second has mean zero and variance 4∑jwε,j2μj2≤4wε,0mη. Thus for any sequence of alternatives with bounded mη, the second sum tends to zero in probability by [F7], and [F5] gives Tε−mη⇒N(0,1).

1.2A1F3F4F9F10F11givenalgebra

Put δj=η~ε,j2/ε2=2uεwε,j. Since uε is bounded and wε,0→0, max⁡jδj→0 and ∑jδj2=2uε2=O(1). For ϕ(x)=(2π)−1/2e−x2/2, direct differentiation gives ϕ′(x)=−xϕ(x). For each R>0 and k=3,4, [F9] applied on [−R,R] to u(x)=x2k−1 and v(x)=ϕ(x) gives ∫−RRx2kϕ(x) dx=[−x2k−1ϕ(x)]−RR+(2k−1)∫−RRx2k−2ϕ(x) dx. The boundary term tends to zero by [F10], and [F11] passes the nonnegative truncated integrals to the full real line. Starting from EG4=3 in [F4], the recurrence gives EG6=5⋅3=15 and EG8=7⋅15=105. Taylor's theorem applied to f(x)=log⁡cosh⁡x gives ∣f(x)−x2/2+x4/12∣≤C∣x∣6 for all real x: on [−1,1] use the bounded sixth derivative, and outside that interval use ∣log⁡cosh⁡x∣≤∣x∣. Therefore the summed Taylor remainder in log⁡Lε has expected absolute value at most C∑jδj3E∣G∣6≤C(max⁡jδj)∑jδj2→0.

2.1F1F2F6F7F8step 1.1given

Put Fε(t)=P0(Tε≤t) and p=1−α. Since Tε is real-valued, the events {Tε≤n} increase to the whole space and {Tε≤−n} decrease to the empty set; [F8] shows that Fε(n)→1 and Fε(−n)→0. Thus S={t:Fε(t)≥p} is nonempty and bounded below, so cε,α=inf⁡S is finite. For every x>cε,α, the definition of the infimum gives some s∈S with s<x, and monotonicity gives Fε(x)≥Fε(s)≥p. Hence Fε(cε,α+1/n)≥p for every positive integer n. The events {Tε≤cε,α+1/n} decrease to {Tε≤cε,α}, so [F8] gives Fε(cε,α)≥p and therefore P0(Tε>cε,α)≤α. By [F2] and [F6], cε,α→Hα, since the limiting normal distribution is continuous and strictly increasing. To bound maximal type-II error, consider any sequence ηε∈Θ2(rε). If its means mηε are unbounded, pass to a subsequence on which they tend to infinity; the variance bound in [F1] and [F7] show Pηε(Tε≤cε,α)→0. If they are bounded, pass to a subsequence on which mηε→m≥u∗ and uε→u∗, where u∗>0. Step 1.1 gives type-II limit Φ(Hα−m)≤Φ(Hα−u∗). A subsequence contradiction therefore proves the uniform upper bound βε(Θ2(rε),ψε,cε,α)≤Φ(Hα−uε)+o(1).

2.2F2F3F4step 1.2algebra

The quartic term ∑jδj2Gj4 has mean 3∑jδj2=6uε2 and variance 96∑jδj4≤96(max⁡jδj)2∑jδj2→0. Substituting the expansion from step 1.2 into [F3] gives log⁡Lε=uεTε−uε2/2+oP0(1). Together with [F2], this implies that under P0 the likelihood ratio converges along any subsequence with uε→u∗>0 to exp⁡(−u∗2/2+u∗G) for G∼N(0,1).

3.1F1F3F6step 2.1step 2.2givenalgebra

For any level-α test ψ, set aε=exp⁡(uεcε,α−uε2/2). Pointwise, Lε(1−ψ)≥min⁡(Lε,aε)−aεψ. Hence the mixture-average type-II error is at least E0min⁡(Lε,aε)−aεα. Along a subsequence with uε→u∗>0, step 2.1 gives cε,α→Hα, and step 2.2 and [F6] yield the limit Φ(Hα−u∗). Since maximal type-II error dominates the mixture average, this proves the matching lower bound for βε(Θ2(rε),α).

4.1F1F2F6F7step 2.1step 2.2givenalgebra∎

For every test ψ, ψ+Lε(1−ψ)≥min⁡(1,Lε) pointwise. Thus its total error against the null and mixture is at least E0min⁡(1,Lε). By step 2.2 and [F6] this expectation tends along uε→u∗ to 2Φ(−u∗/2), giving the matching minimax lower bound for γε. The weighted test at threshold uε/2 has type-I limit Φ(−u∗/2) and maximal type-II upper limit Φ(−u∗/2) by the same bounded-mean/unbounded-mean split as step 2.1. Continuity in u∗ and compactness of the allowed range of uε turn the subsequential bounds into the stated o(1) formulas.

4 · Examples, counterexamples and false statements

None yet.

Sources