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 — Examples and Counterexamples

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

None yet.

4 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedverified 2026-10-22 (gpt-6.1-sol)Open item page →

The lambda-zero sparse detection boundary

Example

Take q=1, α=β=1, aj=j, and σj=j in the Gaussian sequence detection experiment. Then the sparse boundary parameter is λ=0, the source-normalized constant is Λ=1, and a minimax separation rate has order rε∗≍ε1/2(log⁡ε−1)1/4(ε↓0).

Facts & Assumptions

Given: Countable Choice (The Axiom of Countable Choice (ACω)), q=1, α=β=1, ε↓0, and the Gaussian sequence experiment over Θ1(r).

[F1]

Minimax detection risk and separation rate: η∈Θ1(r) means ∑ii2∣ηi∣≤1 and ∑ii2ηi2≥r2; the null coordinates are independent N(0,ε2).

[F2]

Expectations factor over finite products of independent random variables and Finite measures agreeing on a generating pi-system and on the whole space are equal: nonnegative functions of finitely many independent coordinates have factorized expectations; finite measures agreeing on the generating finite-coordinate rectangular cylinders and on total mass agree on the sequence sigma-algebra.

[F3]

Isonormal Gaussian white-noise inverse experiment: Yi/ε is standard normal under the null, with density φ(x)=(2π)−1/2e−x2/2. This given probability law already supplies ∫Rφ(x) dx=1.

[F4]

A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions: under countable choice, completing the square and translating the given normalized density in [F3] gives EetG=et2/2∫Rφ(x−t) dx=et2/2 for every real t.

[F5]

Chebyshev-Markov inequality for the integral: Markov's inequality therefore gives P(∣G∣>t)≤2e−t2/2 for t>0.

Verification

1.1F1F2F3F4givenconstructalgebra

Substitution gives λ=(1+1)/2−1=0 and Λ=(2/(1+1))1/4=1. To prove the rate order, first let r/rε∗→0, set n=⌊1/(4r)⌋, and for each i∈{n+1,…,2n} use the two alternatives with sole nonzero coordinate ηi=±r/i. Each lies in Θ1(r) because ri≤1 and i2ηi2=r2. Put μi=r/(εi); then their standardized means satisfy ∣ηi∣/ε=μi≤4r2/ε. If s=r/rε∗→0, then max⁡iμi2≤16ε−2r4=16s4log⁡(ε−1)=o(log⁡n), because log⁡n≥clog⁡(ε−1) for some c>0 when r≤rε∗ and ε is small. For each location i, the shifted scalar density divided by the null density is e±μiGi−μi2/2, where Gi=Yi/ε under the null; averaging the two signs gives Li=e−μi2/2cosh⁡(μiGi). Completing the square using [F3] and [F4] gives E0Li=1 and E0Li2=cosh⁡(μi2). The measure Li dP0 is therefore a probability measure. Finite-coordinate factorization in [F2] identifies its value on every finite-coordinate rectangular cylinder with the sign-mixture sampling law at location i: only the ith scalar density changes and all other coordinates retain their null law. These cylinders generate the sequence sigma-algebra, so finite-measure uniqueness in [F2] identifies the two measures on all measurable events. For distinct locations, [F2] also gives E0LiLj=1. Thus the uniform mixture L=n−1∑iLi satisfies E0(L−1)2=n−2∑i(cosh⁡(μi2)−1)≤n−1exp⁡(max⁡iμi2)=n−1exp⁡(o(log⁡n))→0. Since E0(L−1)=0, its positive and negative parts have equal integrals, so for every event E, ∣Pπ(E)−P0(E)∣≤12E0∣L−1∣≤12E0(L−1)2. Approximation by averages of event indicators gives the same bound for randomized tests. Therefore the mixture total variation tends to zero, γε(Θ1(r))→1, and every level-α test has maximal type-II error at least 1−α−o(1). The constant randomized test ψ≡α gives the matching upper bound 1−α.

2.1F1F3F4F5step 1.1algebra

First suppose r/rε∗→∞ and r→0. Put N=⌈2/r⌉, tN=4log⁡N, and reject if max⁡i≤N∣Yi∣/ε>tN. Under the null, [F5] and a union bound give type-I error at most 2Ne−tN2/2=2N−7→0. For any alternative, ∣ηi∣≤i−2 follows from [F1], so the omitted weighted energy obeys ∑i>Ni2ηi2≤N−2∑i>Ni2∣ηi∣≤N−2≤r2/4. Hence ∑i≤Ni2ηi2≥3r2/4. On the event that all N null-noise coordinates satisfy ∣ξi∣≤tN/2, nonrejection would imply ∣ηi∣≤(3/2)εtN for every i≤N, and therefore ∑i≤Ni2ηi2≤(3/2)εtN∑i≤Ni2∣ηi∣≤(3/2)εtN. But r/rε∗→∞ makes r2/(εlog⁡N)→∞, a contradiction for small ε. The probability that the stated noise event fails is at most 2Ne−(tN/2)2/2=2/N→0, so the maximal type-II error tends to zero.

3.1F1step 2.1givenconstructalgebra

For an arbitrary positive radius sequence with rε/rε∗→∞, use the positive representative rε∗=ε1/2(log⁡ε−1)1/4 and put rˉε=min⁡{rε,rε∗}. Then rˉε→0, rˉε≤rε, and rˉε/rε∗=min⁡{rε/rε∗,1/rε∗}→∞. Apply step 2.1 with rˉε in place of rε. Its cutoff N=⌈2/rˉε⌉ now tends to infinity, so both its null-size bound 2N−7 and its noise-event bound 2/N vanish, and the energy-tail and signal-to-threshold estimates in that step apply at rˉε. Since Θ1(rε)⊆Θ1(rˉε), the same test has unchanged null size and no larger maximal type-II error on the requested alternative. Its total error therefore tends to zero, and its null size is eventually below any fixed significance level, giving both consistency limits in [F1]. For an empty requested alternative both minimax risks are zero by that definition, with the never-reject test attaining zero total error. This covers the nonvanishing-radius case without using a bounded or nondiverging cutoff.

4.1step 1.1step 2.1step 3.1algebra∎

The impossibility implication in step 1.1 and the all-positive-radius consistency implication in step 3.1 establish the separation-rate order ε1/2(log⁡ε−1)1/4. The parameter and constant were computed in step 1.1, proving the example.

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

Mildly ill-posed Sobolev q=2 detection rate

Example

Assume α,β>0, q=2, aj=jα, and σj=jβ in the Gaussian sequence detection experiment. The minimax separation rate over Θ2(r) has order rε∗≍ε4α/(4α+4β+1).

Facts & Assumptions

Given: α,β>0, q=2, aj=jα, σj=jβ, and a nonempty Θ2(r) with the finite extremal profile supplied for sufficiently small r. For this rate comparison, Xε≍Yε means the ratio is bounded above and away from zero by constants independent of ε.

[F1]

q=2 Gaussian-sequence ellipsoid detection boundary: r2=AJ1/J2, uε2=(r/ε)4J0/(2J12), and uε→0 or ∞ gives the corresponding indistinguishability or consistency branch.

[F2]

Existence of a finite q=2 ellipsoid extremal profile for small radius and The q=2 ellipsoid extremal profile minimizes the fourth-power objective: for sufficiently small r, a finite-support extremal profile exists and has η~j2=z02j2β(1−Aj2α)+.

Verification

1.1F1F2givenconstructalgebra

Let m be the largest active index, so Am2α<1≤A(m+1)2α and (m+1)−2α≤A<m−2α. For j≤m/2, 1−Aj2α≥1−2−2α>0. For any fixed p>0, ∑j≤mjp≤mp+1 and ∑m/4≤j≤m/2jp≥cpmp+1 for all sufficiently large m, by counting at least m/8 terms each at least (m/4)p. Applying these bounds with p=4β and p=4β+2α gives J1≍m4β+1,J0≍m4β+1,J2=A∑j≤mj4β+2α(1−Aj2α)≍m4β+1. Thus [F1] yields r2≍A≍m−2α and uε2≍ε−4r4m−(4β+1).

2.1F1step 1.1givenalgebra∎

Since m≍r−1/α, the last expression becomes uε2≍ε−4r4+(4β+1)/α=(r/ε4α/(4α+4β+1))4+(4β+1)/α. Hence radii with ratio tending to zero give uε→0, and [F1] gives the indistinguishability limits. For a ratio tending to infinity, if rε does not tend to zero, replace it by rˉε=rεrε∗: nonempty alternatives satisfy rε≤a1−1, so rˉε→0, rˉε/rε∗→∞, and Θ2(rε)⊆Θ2(rˉε). The consistent tests from [F1] at rˉε therefore also work at rε. This proves the stated separation rate.

ExampleConstruction: AI-generatedVerification: AI-generatedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Mildly ill-posed analytic q=2 detection rate

Example

Assume α,β>0, q=2, aj=eαj, and σj=jβ in the Gaussian sequence detection experiment. The minimax separation rate over Θ2(r) has order rε∗≍ε(log⁡ε−1)β+1/4.

Facts & Assumptions

Given: α,β>0, q=2, aj=eαj, σj=jβ, and a nonempty Θ2(r) with a finite extremal profile for sufficiently small r. For this rate comparison, Xε≍Yε means the ratio is bounded above and away from zero by constants independent of ε.

[F1]

q=2 Gaussian-sequence ellipsoid detection boundary: r2=AJ1/J2, uε2=(r/ε)4J0/(2J12), and the uε boundary determines minimax distinguishability.

[F2]

Verification

1.1F1F2givenconstructalgebra

Let m be the largest active index. Then Ae2αm<1≤Ae2α(m+1), so t=Ae2αm∈[e−2α,1). For j=m−ℓ with 0≤ℓ<m, the profile factor is ρℓ=1−te−2αℓ. For ℓ≥1, 1−e−2α≤ρℓ≤1. Hence the terms with 1≤ℓ≤m/2 give a lower bound for J1 and J0, while the full sums are bounded above by ∑j≤mj4β≤m4β+1. Thus J1≍J0≍m4β+1. In J2, the summand at ℓ is te−2αℓ(m−ℓ)4βρℓ. Its sum is at most m4β∑ℓ≥0e−2αℓ≤Cαm4β, and the ℓ=1 term is at least cα,βm4β for m≥2. Therefore J2≍m4β. Formula [F1] gives r2≍e−2αmm,uε2≍ε−4r4m−(4β+1). Taking logarithms of the first relation shows m≍log⁡(1/r).

2.1F1step 1.1givenalgebra∎

Set L=log⁡ε−1 and rε∗=εLβ+1/4. At this radius, log⁡(1/rε∗)∼L, so [F1] and step 1.1 give uε2≍1. If rε/rε∗→0, then log⁡(1/rε)≥log⁡(1/rε∗)∼L and uε2≍(rε/rε∗)4(log⁡(1/rε∗)log⁡(1/rε))4β+1→0. If rε/rε∗→∞ and rε→0, the logarithm ratio is at least one, so uε→∞. If the radii do not tend to zero, use rˉε=rεrε∗. Nonempty alternatives satisfy rε2≤a1−2 because ∑jσj2ηj2≤a1−2∑jaj2σj2ηj2≤a1−2. Hence rˉε→0, rˉε/rε∗→∞, and Θ2(rε)⊆Θ2(rˉε); consistent tests for the larger class work on the original class. The two risk implications in [F1] prove the claimed rate.

ExampleConstruction: AI-generatedVerification: AI-generatedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Severely ill-posed Sobolev q=2 detection rate

Example

Assume α,β>0, q=2, aj=jα, and σj=eβj in the Gaussian sequence detection experiment. A minimax separation rate over Θ2(r) is rε∗≍(log⁡ε−1β)−α.

Facts & Assumptions

Given: α,β>0, q=2, aj=jα, σj=eβj, and the finite-support extremal profile for sufficiently small r. For this rate comparison, Xε≍Yε means the ratio is bounded above and away from zero by constants independent of ε.

[F1]

q=2 Gaussian-sequence ellipsoid detection boundary: r2=AJ1/J2, uε2=(r/ε)4J0/(2J12), and uε→0 or ∞ gives the two minimax risk regimes.

Verification

1.1F1F2givenconstructalgebra

Let m be the largest active index, so (m+1)−2α≤A<m−2α, and write ℓ=m−j. For 1≤ℓ≤m/2, the mean-value theorem applied to x2α on [1/2,1] gives cαℓ+1m≤1−A(m−ℓ)2α≤Cαℓ+1m. For ℓ>m/2, the profile factor is at most one. Summing against σj4=e4βme−4βℓ, the near terms are bounded by the convergent sums ∑ℓ≥0(ℓ+1)e−4βℓ and ∑ℓ≥0(ℓ+1)2e−4βℓ, and the far tail is exponentially smaller than m−2. The ℓ=1 term supplies matching lower bounds. Thus J1≍J2≍e4βm/m,J0≍e4βm/m2. For J2, its extra factor Aaj2 is at most one and is bounded below by a positive constant at j=m−1. Consequently [F1] gives r2≍A≍m−2α and uε2≍ε−4r4e−4βm.

2.1F1step 1.1givenalgebra∎

The cutoff relation implies m≍r−1/α. For rε∗=(log⁡ε−1/β)−α, if rε/rε∗→0, then m/(log⁡ε−1/β)→∞, so the expression in step 1.1 tends to zero. If the ratio tends to infinity while rε→0, then m=o(log⁡ε−1) and log⁡uε2=4log⁡ε−1−4βm+4log⁡rε+O(1)→∞, because log⁡(1/rε)=O(log⁡log⁡ε−1). If rε does not tend to zero, reduce to rˉε=rεrε∗. Nonempty alternatives satisfy rε2≤a1−2 by the two q=2 constraints, so rˉε→0 and rˉε/rε∗→∞. The inclusion Θ2(rε)⊆Θ2(rˉε) transfers consistent tests to the original class. By [F1], these limits prove the displayed rate.

ExampleConstruction: AI-generatedVerification: AI-generatedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Severely ill-posed analytic q=2 detection rate

Example

Assume α,β>0, q=2, aj=eαj, and σj=eβj in the Gaussian sequence detection experiment. A minimax separation rate over Θ2(r) is rε∗≍εα/(α+β).

Facts & Assumptions

Given: α,β>0, q=2, aj=eαj, σj=eβj, and the finite-support extremal profile for sufficiently small r. For this rate comparison, Xε≍Yε means the ratio is bounded above and away from zero by constants independent of ε.

[F1]

q=2 Gaussian-sequence ellipsoid detection boundary: r2=AJ1/J2, uε2=(r/ε)4J0/(2J12), and the uε boundary determines minimax distinguishability.

Verification

1.1F1F2givenconstructalgebra

Let m be the largest active index and put t=Ae2αm∈[e−2α,1). For j=m−ℓ, the profile factor is ρℓ=1−te−2αℓ. For every ℓ≥1, 1−e−2α≤ρℓ≤1, while 0≤ρ0≤1. The sums for J1 and J0 are geometric in ℓ; their ℓ=1 terms give positive lower bounds and the full geometric sums give upper bounds, so J1≍J0≍e4βm. In J2, the summands are te−(2α+4β)ℓρℓe4βm; the ℓ=1 term is bounded below by a positive constant times e4βm, and the geometric series gives the matching upper bound. Thus J2≍e4βm. By [F1], r2≍A≍e−2αm,uε2≍ε−4r4e−4βm≍ε−4r4+4β/α.

2.1F1step 1.1givenalgebra∎

The last expression is comparable to (r/εα/(α+β))4+4β/α. Thus radii below the displayed scale by a factor tending to zero have uε→0, and radii above it by a factor tending to infinity have uε→∞ when rε→0. If rε does not tend to zero, reduce to rˉε=rεrε∗. Nonempty alternatives satisfy rε2≤a1−2 by the two q=2 constraints, so rˉε→0 and rˉε/rε∗→∞. The inclusion Θ2(rε)⊆Θ2(rˉε) transfers consistent tests to the original class. The risk implications in [F1] establish the separation rate.

Sources