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.
Two-point Le Cam lower bound for squared-error risk
Statement
Let an experiment have parameter set , sample space , and laws . Let the scalar targets satisfy and put . An arbitrary randomized estimator is a probability kernel from to with its Borel sigma-algebra, and its loss at parameter is squared error . For every such , where . Consequently the minimax risk over all randomized estimators obeys the same lower bound.
Facts & Assumptions
Given: The finite-parameter statistical experiment with laws , targets , and an arbitrary randomized estimator kernel .
Statistical experiments and Parameter-measurable statistical models as kernels: the parameter set has its power-set sigma-algebra and its model assigns the sample law to parameter .
Randomized procedures as probability kernels: for every measurable action event , is measurable and is a probability measure in for fixed .
Loss functions and risk: for a nonnegative jointly measurable loss , the risk is , with an extended nonnegative value allowed.
Total variation distance for probability laws: with the event-supremum convention, .
Bayes risk and minimax risk: the maximum risk of a procedure is and minimax risk is the infimum of this maximum over all procedures.
Proof
Put and define the randomized test . It is measurable and lies in by [F2]. Under parameter , every action in has squared error at least ; under parameter , every action in has squared error at least . Hence
For each integer , let . Then . By [F4], each event term satisfies , so . The two integral errors from replacing by have total absolute value at most ; letting gives Combining with step 1.1 and using proves the risk bound. Taking the infimum over and applying [F5] proves the minimax assertion.
Depends on
Used by
- A Gaussian two-point lower bound Example
- A sparse Gaussian sequence lower bound by Fano’s method Example
- Clean block-sparse Gaussian covariance has squared operator lower rate s log(ep/s) over n Lemma
- Clean Gaussian covariance has a capped squared operator lower rate Lemma
- Gaussian sparse-sequence minimax lower bound Theorem
Dependency tree · two levels
19 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
- Philippe Rigollet and Jan-Christian Hütter, High-Dimensional Statistics: Lecture Notes, Chapter 4, §4.3, Le Cam reduction and equation (4.3.3) (standard reference, not scraped)
- John Duchi, Lecture Notes on Statistics and Information Theory, Chapter 8, §8.3 (standard reference, not scraped)