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.
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.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
10 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.2, PDF pp. 12–13 (standard reference, not scraped)
- Evarist Giné and Richard Nickl, Mathematical Foundations of Infinite-Dimensional Statistical Models, §6.2.3 (standard reference, not scraped)