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.
Gaussian sequence inversion and exact risk — 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
- 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
- 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
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Dimensional Normed Spaces and Riesz Lemma
- Finite Probability and the Probabilistic Method
- 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
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- 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
- 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
- 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
- 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 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
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.
Exact cutoff risk for an exponentially decaying spectrum
Example
Assume Countable Choice for the upstream sequence-model coordinates. Let , , , and . Use the exponential spectrum and ellipsoid weights . This is a severely ill-posed operator spectrum, with exponential singular-value decay. 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 , with , 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.
The zero-noise boundary of truncated risk
Example
Assume Countable Choice for the upstream sequence-model coordinates. Take and . In the zero-noise sequence model, exactly, so the cutoff error is the deterministic squared tail . For weights with , its worst case over is and tends to as . For the equally weighted ellipsoid , the worst case is for every finite , attained by . This is a deterministic boundary of the sequence-risk formula; it makes no claim about arbitrary bounded perturbations of the original inverse data.
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.
Gaussian sequence inverse model: At , deterministically.
Weighted ellipsoid class for sequence inversion: For any positive nondecreasing weights, is defined by .
Exact worst-case risk of the truncated estimator: The zero-noise worst-case squared error is , attained by a truth supported only at coordinate .
Given: Countable Choice, , a finite cutoff , and either weights with or for all .
Verification
Under [A1], the sequence model coordinates are fixed. Using [F1] and substituting and in [F3] gives ; since , this tends to as .
Under [A1], [F3] applies to the unit-weight ellipsoid. The ellipsoid condition in [F2] is , so the squared tail is at most . The vector belongs to the ellipsoid and its entire squared norm lies beyond , so it attains . This is also the , case of [F3].
Sources
- Litao Ding and Peter Mathé, Minimax rates for statistical inverse problems under general source conditions, Lemma 1
- 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
- Iain M. Johnstone, Gaussian estimation: Sequence and wavelet models, §3.2