Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

47 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