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 , , , and in the Gaussian sequence detection experiment. Then the sparse boundary parameter is , the source-normalized constant is , and a minimax separation rate has order
Example references
Facts & Assumptions
Given: Countable Choice (The Axiom of Countable Choice ()), , , , and the Gaussian sequence experiment over .
Minimax detection risk and separation rate: means and ; the null coordinates are independent .
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.
Isonormal Gaussian white-noise inverse experiment: is standard normal under the null, with density . This given probability law already supplies .
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 for every real .
Chebyshev-Markov inequality for the integral: Markov's inequality therefore gives for .
Verification
Substitution gives and . To prove the rate order, first let , set , and for each use the two alternatives with sole nonzero coordinate . Each lies in because and . Put ; then their standardized means satisfy . If , then , because for some when and is small. For each location , the shifted scalar density divided by the null density is , where under the null; averaging the two signs gives . Completing the square using [F3] and [F4] gives and . The measure 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 : only the th 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 . Thus the uniform mixture satisfies . Since , its positive and negative parts have equal integrals, so for every event , . Approximation by averages of event indicators gives the same bound for randomized tests. Therefore the mixture total variation tends to zero, , and every level- test has maximal type-II error at least . The constant randomized test gives the matching upper bound .
First suppose and . Put , , and reject if . Under the null, [F5] and a union bound give type-I error at most . For any alternative, follows from [F1], so the omitted weighted energy obeys . Hence . On the event that all null-noise coordinates satisfy , nonrejection would imply for every , and therefore . But makes , a contradiction for small . The probability that the stated noise event fails is at most , so the maximal type-II error tends to zero.
For an arbitrary positive radius sequence with , use the positive representative and put . Then , , and . Apply step 2.1 with in place of . Its cutoff now tends to infinity, so both its null-size bound and its noise-event bound vanish, and the energy-tail and signal-to-threshold estimates in that step apply at . Since , 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.
The impossibility implication in step 1.1 and the all-positive-radius consistency implication in step 3.1 establish the separation-rate order . The parameter and constant were computed in step 1.1, proving the example.
Depends on
- Minimax detection risk and separation rate
- Expectations factor over finite products of independent random variables
- Finite measures agreeing on a generating pi-system and on the whole space are equal
- Isonormal Gaussian white-noise inverse experiment
- A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions
- Chebyshev-Markov inequality for the integral
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
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
- Yuri I. Ingster, Theofanis Sapatinas and Irina A. Suslina, Minimax signal detection in ill-posed inverse problems, §4.7, Theorem 4.7, PDF pp. 18–19 (standard reference, not scraped)
- Evarist Giné and Richard Nickl, Mathematical Foundations of Infinite-Dimensional Statistical Models, §6.2.3, PDF pp. 506–508 (standard reference, not scraped)