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.
Exact cutoff risk for a polynomial singular spectrum
Example
Assume Countable Choice for the upstream sequence-model coordinates. Let , , , and . Use the polynomial spectrum and ellipsoid weights . In the operator taxonomy used here, this polynomial singular-value decay is called moderately ill-posed. The exact worst-case squared sequence risk of the cutoff at is with an empty sum when .
Example references
Facts & Assumptions
The Axiom of Countable Choice (): Countable Choice is used upstream to choose the compact SVD coordinates and identify the complete-basis coefficient space.
Exact worst-case risk of the truncated estimator: The worst-case squared sequence risk is for positive nondecreasing weights and .
Gaussian sequence inverse model: The normalized observation variance in coordinate is ; at zero noise the observation is exact.
Weighted ellipsoid class for sequence inversion: The weights must be positive and nondecreasing.
Given: Countable Choice, the Gaussian sequence inverse model, weights , singular numbers , , noise , radius , and cutoff .
Verification
By [A1], the upstream sequence coordinates are fixed. Since , is positive and decreases to , and makes positive and nondecreasing; thus the exact-risk theorem's spectrum and ellipsoid hypotheses hold.
Substituting and into [F1] gives the displayed risk, including by its empty-sum convention.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
17 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
- Litao Ding and Peter Mathé, Minimax rates for statistical inverse problems under general source conditions, Lemma 1 (standard reference, not scraped)
- Litao Ding and Peter Mathé, Minimax rates for statistical inverse problems under general source conditions, Definition 3 (ill-posedness of the operator), PDF p. 6 (standard reference, not scraped)
- Iain M. Johnstone, Gaussian estimation: Sequence and wavelet models, §3.2 (standard reference, not scraped)