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
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Compact linear inverse maps and the Picard criterion
- Compact Operators and Riesz Schauder Theory
- Compact Self Adjoint Hilbert Schmidt and Trace Class Operators
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Norms and Realification
- Complex Subspace Realification
- Complexification, Realification and Real Structures
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Conditional Distributions and Regular Conditional Probability
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Convergence: Nets and Filters
- Cosets, Index and Lagrange's Theorem
- Cost-Constrained, Gaussian, and Feedback Channels
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces Adjoint Operators and Annihilators
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Estimators and Randomized Procedures
- F-Divergences, Rényi Information, and Hypothesis Testing
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Dimensional Normed Spaces and Riesz Lemma
- Finite Probability and the Probabilistic Method
- Finite Probability Spaces and Random Variables
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Gaussian sequence inversion and exact risk
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Inverse maps, identifiability, and stability
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Loss, Risk and Decision Theory
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Minimax signal detection and separation rates
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Norming and Separation under Hahn–Banach
- Order, Zorn's Lemma, and the Axiom of Choice
- Orthonormal Bases, Parseval and Fourier Series
- Outer Measure and the Caratheodory Extension Theorem
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Stationary Markov Chains and Ergodic Limits
- Statistical Experiments, Models and Identifiability
- Statistical inverse experiments and white noise
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tests, Neyman–Pearson and Valid P-values
- The Analytic Hahn Banach Theorem
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
- Weak Laws and Series of Independent Random Variables
- Weak nonparametric Bernstein–von Mises limits
2 · Logical flowchart
3 · Definitions, theorems and proofs
None yet.
4 · Examples, counterexamples and false statements
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.
Mildly ill-posed Sobolev q=2 detection rate
Example
Assume , , , and in the Gaussian sequence detection experiment. The minimax separation rate over has order
Example references
Facts & Assumptions
Given: , , , , and a nonempty with the finite extremal profile supplied for sufficiently small . For this rate comparison, means the ratio is bounded above and away from zero by constants independent of .
q=2 Gaussian-sequence ellipsoid detection boundary: , , and or gives the corresponding indistinguishability or consistency branch.
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 , a finite-support extremal profile exists and has .
Verification
Let be the largest active index, so and . For , . For any fixed , and for all sufficiently large , by counting at least terms each at least . Applying these bounds with and gives Thus [F1] yields and .
Since , the last expression becomes . Hence radii with ratio tending to zero give , and [F1] gives the indistinguishability limits. For a ratio tending to infinity, if does not tend to zero, replace it by : nonempty alternatives satisfy , so , , and . The consistent tests from [F1] at therefore also work at . This proves the stated separation rate.
Mildly ill-posed analytic q=2 detection rate
Example
Assume , , , and in the Gaussian sequence detection experiment. The minimax separation rate over has order
Example references
Facts & Assumptions
Given: , , , , and a nonempty with a finite extremal profile for sufficiently small . For this rate comparison, means the ratio is bounded above and away from zero by constants independent of .
q=2 Gaussian-sequence ellipsoid detection boundary: , , and the boundary determines minimax distinguishability.
Existence of a finite q=2 ellipsoid extremal profile for small radius and The q=2 ellipsoid extremal profile minimizes the fourth-power objective: a finite active profile exists and its cutoff satisfies .
Verification
Let be the largest active index. Then , so . For with , the profile factor is . For , . Hence the terms with give a lower bound for and , while the full sums are bounded above by . Thus . In , the summand at is . Its sum is at most , and the term is at least for . Therefore . Formula [F1] gives Taking logarithms of the first relation shows .
Set and . At this radius, , so [F1] and step 1.1 give . If , then and If and , the logarithm ratio is at least one, so . If the radii do not tend to zero, use . Nonempty alternatives satisfy because . Hence , , and ; consistent tests for the larger class work on the original class. The two risk implications in [F1] prove the claimed rate.
Severely ill-posed Sobolev q=2 detection rate
Example
Assume , , , and in the Gaussian sequence detection experiment. A minimax separation rate over is
Example references
Facts & Assumptions
Given: , , , , and the finite-support extremal profile for sufficiently small . For this rate comparison, means the ratio is bounded above and away from zero by constants independent of .
q=2 Gaussian-sequence ellipsoid detection boundary: , , and or gives the two minimax risk regimes.
Existence of a finite q=2 ellipsoid extremal profile for small radius and The q=2 ellipsoid extremal profile minimizes the fourth-power objective: the active cutoff satisfies .
Verification
Let be the largest active index, so , and write . For , the mean-value theorem applied to on gives For , the profile factor is at most one. Summing against , the near terms are bounded by the convergent sums and , and the far tail is exponentially smaller than . The term supplies matching lower bounds. Thus For , its extra factor is at most one and is bounded below by a positive constant at . Consequently [F1] gives and .
The cutoff relation implies . For , if , then , so the expression in step 1.1 tends to zero. If the ratio tends to infinity while , then and , because . If does not tend to zero, reduce to . Nonempty alternatives satisfy by the two q=2 constraints, so and . The inclusion transfers consistent tests to the original class. By [F1], these limits prove the displayed rate.
Severely ill-posed analytic q=2 detection rate
Example
Assume , , , and in the Gaussian sequence detection experiment. A minimax separation rate over is
Example references
Facts & Assumptions
Given: , , , , and the finite-support extremal profile for sufficiently small . For this rate comparison, means the ratio is bounded above and away from zero by constants independent of .
q=2 Gaussian-sequence ellipsoid detection boundary: , , and the boundary determines minimax distinguishability.
Existence of a finite q=2 ellipsoid extremal profile for small radius and The q=2 ellipsoid extremal profile minimizes the fourth-power objective: the active cutoff satisfies .
Verification
Let be the largest active index and put . For , the profile factor is . For every , , while . The sums for and are geometric in ; their terms give positive lower bounds and the full geometric sums give upper bounds, so . In , the summands are ; the term is bounded below by a positive constant times , and the geometric series gives the matching upper bound. Thus . By [F1],
The last expression is comparable to . Thus radii below the displayed scale by a factor tending to zero have , and radii above it by a factor tending to infinity have when . If does not tend to zero, reduce to . Nonempty alternatives satisfy by the two q=2 constraints, so and . The inclusion transfers consistent tests to the original class. The risk implications in [F1] establish the separation rate.
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
- Evarist Giné and Richard Nickl, Mathematical Foundations of Infinite-Dimensional Statistical Models, §6.2.3, PDF pp. 506–508
- Yuri I. Ingster, Theofanis Sapatinas and Irina A. Suslina, Minimax signal detection in ill-posed inverse problems, Theorem 4.2, PDF pp. 12–13
- Evarist Giné and Richard Nickl, Mathematical Foundations of Infinite-Dimensional Statistical Models, §6.2.3
- Yuri I. Ingster, Theofanis Sapatinas and Irina A. Suslina, Minimax signal detection in ill-posed inverse problems, Theorem 4.5, PDF p. 14
- Yuri I. Ingster, Theofanis Sapatinas and Irina A. Suslina, Minimax signal detection in ill-posed inverse problems, Theorem 4.4 and equation (4.5), PDF pp. 13–14
- Yuri I. Ingster, Theofanis Sapatinas and Irina A. Suslina, Minimax signal detection in ill-posed inverse problems, Theorem 4.3 and equation (4.4), PDF p. 13