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 ellipsoid detection-boundary theorem, Countable Choice, and the Axiom of Choice. Along a sequence for which is bounded above and bounded away from zero and , the minimax level- type-II error and minimax total error satisfy where is the standard normal distribution function and is defined by . Let ; then and . The weighted tests with thresholds and attain these asymptotics, while the uncalibrated threshold has asymptotic size . The vanishing-largest-weight condition is required for this Gaussian sharp branch.
Statement references
Facts & Assumptions
Given: The q=2 detection-boundary statistic , finite-support extremal mean , , and weights ; AC and Countable Choice; bounded above and away from zero; .
q=2 Gaussian-sequence ellipsoid detection boundary: , every alternative has statistic mean , and .
Weighted chi-square triangular-array limit: under the null, when .
Symmetric Gaussian product-mixture testing bound: for the symmetric sign mixture on , , where and under the null.
Isonormal Gaussian white-noise inverse experiment and A normal variable has finite fourth moment: under the null the are independent standard normals with even density and moments and . The sixth and eighth moments are derived in step 1.2.
Slutsky's theorem for real random variables: adding a term converging to zero in probability preserves convergence in distribution.
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.
Chebyshev-Markov inequality for the integral: Chebyshev's inequality bounds a tail probability by the variance divided by the squared deviation.
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.
If are differentiable on with integrable, then : 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.
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.
Monotone convergence for the integral: nonnegative truncations of a measurable function on increasing intervals have integrals increasing to its full integral.
The Axiom of Choice: AC is used through the weighted Lindeberg–Feller theorem in [F2].
The Axiom of Countable Choice (): Countable Choice is inherited from the Gaussian sequence experiment.
Proof
Under an alternative , write and let denote the independent standard-normal noise coordinates, so . Then The first sum converges to by [F2]. The second has mean zero and variance . Thus for any sequence of alternatives with bounded , the second sum tends to zero in probability by [F7], and [F5] gives .
Put . Since is bounded and , and . For , direct differentiation gives . For each and , [F9] applied on to and gives The boundary term tends to zero by [F10], and [F11] passes the nonnegative truncated integrals to the full real line. Starting from in [F4], the recurrence gives and . Taylor's theorem applied to gives for all real : on use the bounded sixth derivative, and outside that interval use . Therefore the summed Taylor remainder in has expected absolute value at most .
Put and . Since is real-valued, the events increase to the whole space and decrease to the empty set; [F8] shows that and . Thus is nonempty and bounded below, so is finite. For every , the definition of the infimum gives some with , and monotonicity gives . Hence for every positive integer . The events decrease to , so [F8] gives and therefore . By [F2] and [F6], , since the limiting normal distribution is continuous and strictly increasing. To bound maximal type-II error, consider any sequence . If its means are unbounded, pass to a subsequence on which they tend to infinity; the variance bound in [F1] and [F7] show . If they are bounded, pass to a subsequence on which and , where . Step 1.1 gives type-II limit . A subsequence contradiction therefore proves the uniform upper bound .
The quartic term has mean and variance . Substituting the expansion from step 1.2 into [F3] gives Together with [F2], this implies that under the likelihood ratio converges along any subsequence with to for .
For any level- test , set . Pointwise, . Hence the mixture-average type-II error is at least . Along a subsequence with , step 2.1 gives , and step 2.2 and [F6] yield the limit . Since maximal type-II error dominates the mixture average, this proves the matching lower bound for .
For every test , pointwise. Thus its total error against the null and mixture is at least . By step 2.2 and [F6] this expectation tends along to , giving the matching minimax lower bound for . The weighted test at threshold has type-I limit and maximal type-II upper limit by the same bounded-mean/unbounded-mean split as step 2.1. Continuity in and compactness of the allowed range of turn the subsequential bounds into the stated formulas.
Depends on
- q=2 Gaussian-sequence ellipsoid detection boundary
- Weighted chi-square triangular-array limit
- Symmetric Gaussian product-mixture testing bound
- Slutsky's theorem for real random variables
- Portmanteau theorem
- Chebyshev-Markov inequality for the integral
- A normal variable has finite fourth moment
- The Axiom of Choice
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Isonormal Gaussian white-noise inverse experiment
- If $u,v$ are differentiable on $[a,b]$ with $u',v'$ integrable, then $\int_a^b u v' = u(b)v(b)-u(a)v(a) - \int_a^b u'v$
- The exponential dominates every fixed nonnegative integer power at $+\infty$
- Monotone convergence for the integral
- Continuity from above when one set has finite measure
- Continuity from below for measures
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
- Yuri I. Ingster, Theofanis Sapatinas and Irina A. Suslina, Minimax signal detection in ill-posed inverse problems, Theorem 4.1 and the discussion after equation (4.3), PDF pp. 6–7 (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)
- Clément Marteau and Theofanis Sapatinas, A unified treatment for non-asymptotic and asymptotic approaches to minimax signal detection, §§3.1–3.2 (standard reference, not scraped)