Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

81 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