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.
Adaptive spectral regularization by SOLIT
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
- Deterministic source classes and optimal recovery
- 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
- Numerical Inverse Problems and Regularization Error
- 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
- Spectral regularization and parameter choice
- 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
Gaussian series norm tails and fourth moments
Statement
Assume Countable Choice. Let be given real random variables on a probability space such that every finite subfamily is independent and each variable has density . Let be deterministic with , and put and . The nonnegative series is finite almost surely. Define on that event and set on its null complement. Then For every , The upper quantile is finite and satisfies These conclusions include , in which case almost surely. For a Gaussian series in a fixed orthonormal coordinate system with coordinate variances , is its norm.
Statement references
Facts & Assumptions
Given: The supplied independent standard-normal coordinates and summable nonnegative weights in the Statement.
The Axiom of Countable Choice () is assumed; all countable coordinates are already given.
Monotone convergence for the integral permits increasing limits of nonnegative measurable functions inside the integral.
Chebyshev-Markov inequality for the integral bounds the probability that a nonnegative variable exceeds a positive level by its expectation divided by that level.
A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions gives scalar affine substitution under Countable Choice. The supplied normal density already has total mass one.
Expectations factor over finite products of independent random variables factors finite products of nonnegative or integrable functions of independent coordinates.
Proof
Put , , and . On finite intervals integration by parts with gives . The boundary terms vanish at infinity; the integrals converge since a polynomial times is bounded by a constant times , whose integral is finite by [F3] and the given unit Gaussian integral. Starting from therefore gives and . Thus and finite independence gives . Also and .
The measurable series satisfies by [F1]; hence almost surely, since [F2] gives for every . Extending by zero on the null exceptional set does not change an integral. Applying [F1] also to proves .
Suppose . For the scalar substitution in [F3], using the supplied unit density, gives . Finite factorization [F4] and the power-series inequality for therefore give If , apply [F2] to this exponential and choose . Substitution gives , so . If , then almost surely and this inequality is immediate.
The deterministic levels converge to . Whenever strictly exceeds this final level, sufficiently large have exceeding their corresponding levels. The probability of this eventual-event set is at most the lower limit of their probabilities, as follows directly by countable additivity applied to unions of intersections. Step 2.2 thus gives the first tail inequality. Since and , the second follows. If , all weights vanish and both bounds hold directly.
The second tail bound makes the set defining nonempty and implies . This set is upward closed. Every therefore belongs to it: by the definition of an infimum some member lies strictly below that number. The events increase to , so countable additivity gives . When , step 2.1 gives almost surely and the quantile is zero. Finally, in a fixed orthonormal system the squared norm of the finite Gaussian sum is ; finiteness of gives norm convergence of that series and the asserted norm interpretation.
Ordered spectral filters, source indices, and variance grids
Definition
Assume Countable Choice. Let be an injective compact linear operator of infinite rank between separable real Hilbert spaces (each with a countable dense subset), and assume is Hilbert–Schmidt, meaning that for its positive singular values the sum is finite. Put , , and , with the positive eigenvalues listed with multiplicity in nonincreasing order. Let be continuous and strictly increasing with , and take its inverse on its range. Assume the paper's convexity condition on the spectral range: is convex for . Define the source class for ; equivalently, it is the source ball with singular-value index .
An ordered spectral filter is a family of functions indexed by a set with as an accumulation point, such that for constants and ,
and whenever , for every . The index function is a qualification of this filter if for some ,
For , define the variance function
For , a decreasing candidate sequence in has geometric variance growth if and there are constants such that
Set and
the operator norm of the estimator-noise covariance in the singular basis. The bound and make each and finite. The finite candidate set ends at
The geometric lower bound makes this index finite.
Definition references
The singular-value source ball convention and spectral multiplier for an index function
Compact spectral multipliers, source powers, and regularizing filters
Positive singular systems and the compact SVD
Countable Choice for the upstream countable singular-system construction
Li and Werner, Adaptive minimax optimality in statistical inverse problems via SOLIT, §§3.1.1–3.2.1
Clason, Regularization of Inverse Problems, complete lecture notes, Chapter 5 §§5.1–5.2
Remarks
The source class agrees with the earlier singular-value convention because its multiplier at a singular value is . The variance function is finite for every fixed : the filter bound gives and .
Risk decomposition and monotone bias for ordered spectral filters
Statement
Assume Countable Choice and the positive-noise Gaussian sequence model with , a fixed complete positive singular system for an injective compact Hilbert–Schmidt operator , and a truth with coordinates in . Write and let be the independent standard-normal noise coordinates. Let be nonnegative and satisfy , , and whenever . For each candidate , form the finite sums
The conclusion below includes the existence of their limit in . Put , , and . Then is a measurable -valued random element with finite second moment and
If , then , , and
Statement references
Facts & Assumptions
Given: Countable Choice, the experiment and hypotheses in the Statement, a fixed complete positive singular system with , and a fixed candidate or pair .
The Axiom of Countable Choice (): Countable Choice is assumed by the SVD coordinate model; after its fixed countable basis is supplied, the proof below makes no further selections.
Gaussian sequence inverse model: In the positive-noise sequence experiment, with independent , and .
Singular value decomposition for compact operators: The fixed positive singular vectors form complete orthonormal bases on the minimum-norm parameter space and the closure of the range, with and .
Ordered spectral filters, source indices, and variance grids: For each candidate ; if , then ; and .
Isonormal Gaussian white-noise inverse experiment: The Gaussian coordinates are centered with variance one and independent on every finite orthonormal tuple.
Monotone convergence for the integral permits passing increasing limits of nonnegative coordinate-square sums through the expectation.
Chebyshev-Markov inequality for the integral bounds the probability that a nonnegative random variable is at least a positive level by its expectation divided by that level.
Proof
Put and . By [F3], , so . Also and by [F2], so . The partial sums of increase, and [F5] gives . For each integer , [F6] gives ; since for every , almost surely. Thus on a measurable event of probability one the coordinate series converges in ; define its pointwise limit there and set it to zero on the null complement. The finite partial sums are measurable, and their pointwise limit on this event, extended by zero, is measurable because is separable. By Parseval and [F5], for each , , where [F4] gives and . Both deterministic and noise tails tend to zero, so this constructed measurable pointwise limit is the limit. In particular it has finite second moment.
For , [F3] gives . Squaring these nonnegative terms and summing against gives . Moreover, has coordinate , whose multiplier equals and lies between zero and ; coordinatewise comparison therefore yields .
Subtracting in each singular coordinate gives deterministic bias coefficient and centered noise coefficient . Since and by [F1] and [F4], summing the coordinate second moments and using monotone convergence gives .
The centered pairwise noise difference has coordinate variance . By [F3], each difference lies between zero and ; summing its squared value against proves .
Remarks
The -limit definition is needed because white noise is not an -valued observation in infinite dimension. The estimator itself is -valued because its filtered noise covariance has finite trace.
SOLIT parameter choice on a geometric-variance grid
Definition
Assume Countable Choice. Let be an injective compact Hilbert–Schmidt operator of infinite rank between separable real Hilbert spaces, let , and let be a fixed positive singular system with . Let be a real isonormal Gaussian process on , meaning that is linear into , is centered, has covariance , and has independent standard-normal values on every finite orthonormal tuple. In the weak observation experiment with known noise standard deviation , use the ordered filter , the geometric-variance candidates , and variances from the preceding definition. For each candidate index , the regularized estimator is the limit of its finite singular-coordinate sums; its th coordinate is , where and .
Take as input the observed sequence , where . For each candidate and each , compute
If these partial sums converge in , define to be their limit; otherwise set . This specifies an -valued output for every input sequence. The quantities and are determined by the known operator, filter, noise level and Gaussian coordinate law.
For , set
and let be the norm of the centered estimator difference divided by . For , define its upper quantile by
Given fixed and , for put , and for each pair put . Accept an index exactly when for every with , and output the smallest accepted index and parameter . For , accept without comparisons, including when . This rule uses only the observed sequence, the known operator and filter, the noise level, the fixed candidate grid, and ; it does not use or its source index .
Definition references
Ordered filters, source conditions, and candidate-grid variance
The positive-noise SVD sequence experiment
The weak isonormal observation process
Independent Gaussian coordinates of white noise
Well-definedness and bias–variance properties of the regularized estimators
Li and Werner, Adaptive minimax optimality in statistical inverse problems via SOLIT, §§3.2.1–3.2.2
Spokoiny and Willrich, Bootstrap tuning in ordered model selection, §§2.1–2.4
Rule diagram
The arrows show the order of the finite procedure: form the regularized estimates, compare each candidate with every finer one using the two-index threshold, then return the smallest candidate that passes all of its comparisons. The diagram illustrates the algorithm only; the proofs of its properties use the coordinate definitions and inequalities.
Remarks
The constant controls the strength of the noise quantiles, while controls the bias tolerance. The quantile definition remains meaningful when a pairwise Gaussian difference is degenerate; then its upper quantile is zero.
SOLIT oracle risk bound and spectral rates
Statement
Assume Countable Choice. Let be an injective compact Hilbert–Schmidt operator of infinite rank between separable real Hilbert spaces. Write , and list its positive eigenvalues with multiplicity as , where and . Observe the weak Gaussian experiment where is known and is centered and linear with covariance , and has independent standard-normal values on every finite orthonormal tuple.
Let be continuous and strictly increasing with . Assume is convex for , where is the inverse on the range of . For , define the source ball Assume . Let be an ordered filter indexed by , with an accumulation point of , such that for finite and every and , whenever , and
Define . Assume there is a continuous with , , and for some for every candidate .
Let be candidates in , with the initial candidate fixed independently of , and set and assume and for . Set . Fix a positive singular system with and , set and , and define as the limit with coordinates For , define the pairwise variance Let be the centered estimator difference, and for set For fixed , define for . Let be the smallest such that for every with , and set . Define as the smallest for which every pair satisfies and put . Write , , , and , so . Put , and for put If , define If , set . Then the unchanged pairwise-quantile selector satisfies the finite oracle inequality In particular, put Then and and a rate-oriented consequence is When the selected index is identically zero and its risk is exactly . When , the first term in both displayed oracle bounds is because ; when , the late-selection term vanishes. The bounds retain the pairwise quantiles in the stated rule.
For the rate conclusions as , assume additionally that . In both rate regimes let for , extend it by , take the natural logarithm, and assume the displayed satisfies the index-function, convexity, and filter-qualification hypotheses above; here either or .
If with , , and for some , then for some constant , If instead with , , and , assume also and for some ; then for some , The severe-rate assertion requires exactly ; the source does not establish adaptive-minimax optimality of the polynomial-smoothness severe rate. For spectral cut-off filters, the uniform geometric-variance candidate condition may fail when . When , both displayed rates simplify to .
Statement references
Gaussian series norm tails and fourth moments
Ordered filter, source index, qualification, and geometric-variance grid
The SOLIT selector and its two-index threshold
Risk decomposition, monotone bias, and pairwise variance bound
The positive-noise sequence model and minimum-norm coordinates
Weak Gaussian white-noise observations
Independent Gaussian coordinates of white noise
Spokoiny and Willrich, Bootstrap tuning in ordered model selection, Theorem 2.3 and Appendix A
Clason, Regularization of Inverse Problems, complete lecture notes, Chapter 5 §5.2
Facts & Assumptions
Given: Countable Choice, the weak experiment, all ordered-filter, source, surrogate, grid and selector hypotheses in the Statement, and the additional stated hypotheses when a rate is asserted.
The Axiom of Countable Choice () supplies the fixed countable spectral coordinates; the finite minima and the explicit integer choices below require no further choice.
Risk decomposition and monotone bias for ordered spectral filters gives , nonincreasing , the pairwise bias bound , and for .
SOLIT parameter choice on a geometric-variance grid supplies the unchanged pairwise-quantile acceptance rule and the smallest accepted index. The last candidate is always accepted.
Gaussian series norm tails and fourth moments gives , the norm-quantile bound , and the upper-tail inequality at that quantile for the given countable Gaussian coordinates.
Ordered spectral filters, source indices, and variance grids gives the nonnegative coordinate ordering, the geometric variance ratios, and source qualification. Spectral-index source balls for compact operators and Compact spectral filters, source conditions, and qualification identify the source multipliers.
Monotone convergence for the integral permits summation and integration of the nonnegative coordinate terms.
Holder's inequality for integrals, including the endpoint cases gives scalar Cauchy–Schwarz on the probability space, including for square-integrable nonnegative .
Minkowski's inequality for integrals, including gives the triangle inequality for scalar random variables; applied to Hilbert-valued errors through their norm functions, it is the mean-square triangle inequality.
Proof
Work in the supplied singular coordinates, and write , , and . By [F1] all these variables have finite second moments and . Each finite observed-data sum in [F2] is a measurable -valued random element. For each fixed candidate, its Cauchy set is a measurable event, since it is a countable combination of measurable pairwise-distance events; completeness of makes it the convergence event. Its limit on , extended by outside , is measurable as a pointwise limit into separable . Under the observation law, , so the pointwise construction in [F1] identifies this pointwise limit with the estimator almost surely; the finitely many candidates share a full-probability agreement event. Thus the finite comparison conditions are measurable, and [F2] ensures an accepted index exists. Hence is a measurable finite-valued index. Fix ; its defining condition gives whenever .
For later use, qualification gives . The filter bounds give and . With , splitting eigenvalues at and summing nonnegative terms therefore gives The equality follows by integrating each indicator ; [F5] justifies the interchange. Further , since .
The centered difference has coordinate variances . By nonnegative coordinate ordering their sum and supremum satisfy and . Applying [F3] to their squared weights gives Also the probability of exceeding the actual pairwise quantile is at most , including a degenerate difference. These are statements about the supplied normal sequence; no new infinite product law or general Gaussian concentration theorem is needed.
For the rates let and . The initial variance is with a fixed positive factor, and the geometric lower ratio implies . In the mild case put , and . In the severe case put , , and . In either case , , , and direct substitution gives . All implicit constants in the rest of the argument are independent of the truth in the fixed source ball and of sufficiently small .
On , acceptance gives when , and the difference is zero when equality holds. For , , so step 2.1 bounds every by . Minkowski's inequality in [F7], applied to the norm functions of the two Hilbert-valued errors, consequently bounds the early-selection contribution by . For , this uses the identically zero difference and hence .
For , the event implies rejection of . Its oracle bias bound from step 1.1 shows that a rejecting comparison with must satisfy . The union bound over such comparisons and the quantile-tail property from step 2.1 therefore give . Similarly implies rejection of , so . Here exactly.
Let be the first candidate with . For small , , so this index exists and . Step 1.2 implies . First : otherwise a subsequence bounded away from zero has bounded , contradicting . In the mild case the function is comparable to , so the last inequality and give . In the severe case it is comparable to . For any fixed , as ; since is decreasing for small positive arguments, choosing larger than the fixed comparison constant gives the same conclusion . Qualification and now give .
Scalar Cauchy–Schwarz [F6] and step 2.1 give . Summing gives a late selected-noise second moment at most . By [F1], the corresponding selected bias has mean-square norm at most . Minkowski's inequality [F7] thus bounds the late risk by . Alternatively, and give a late risk bound . Since , dropping the minimum in yields exactly . Together with step 3.1 these prove the first finite oracle inequality. If , both late sums are empty.
Put and choose a fixed nonnegative integer with . For small , , so the infinite candidate sequence has , , and . For every , monotone bias gives . The reverse triangle inequality for the square-summable noise coefficient vectors follows from [F7] with counting measure and gives . Thus and . If , the oracle property implies . Hence ; the case is immediate. In particular and .
Suppose and put . For one has for and for . The geometric variance lower ratio gives and , by summing the backward and forward geometric series from the respective last and first indices. Thus . Also and in the definition of prove its stated simpler bound. The inequality applied to the first late alternative in step 4.1 gives the rate-oriented oracle bound. If , the only index is zero, its risk equals , and all late sums vanish as stipulated.
In the mild case the stated lower variance bound gives . Combined with step 4.2 and , this yields . Therefore step 1.2 gives , because . It follows that for , while handles .
In the severe case put . If , then for small . If , the lower variance bound and give , so again . Hence , using exactly . Consequently in this case also, with as before.
By step 2.2, : when , has a strictly positive power of multiplied by a fixed logarithmic power; when and , . The rate-oriented oracle bound from step 5.1, together with , and the two rate estimates just proved, therefore gives the asserted uniform risk upper bound in each regime. Substituting the explicit expressions for from step 2.2 gives exactly the two displayed rates and their specializations. The severe proof uses at step 5.3 and asserts only the stated upper rate, preserving the given qualification and grid hypotheses. This completes both the finite oracle and rate conclusions.
Remarks
The finite oracle bound accounts explicitly for the number of pairwise comparisons. Its proof and the rate argument above use the specified pairwise selector throughout. The source's sharper displayed oracle constants are not used as a premise.
4 · Examples, counterexamples and false statements
None yet.
Sources
- Vladimir Spokoiny and Niklas Willrich, Bootstrap tuning in ordered model selection, Appendix D, Gaussian quadratic forms
- Housen Li and Frank Werner, Adaptive minimax optimality in statistical inverse problems via SOLIT, §§3.1.1–3.2.1
- Christian Clason, Regularization of Inverse Problems, complete lecture notes, Chapter 5 §§5.1–5.2
- Housen Li and Frank Werner, Adaptive minimax optimality in statistical inverse problems via SOLIT, Lemma 3.6 and §§3.1.1–3.2.1
- Christian Clason, Regularization of Inverse Problems, complete lecture notes, Chapter 5 §5.1
- Housen Li and Frank Werner, Adaptive minimax optimality in statistical inverse problems via SOLIT, §§3.2.1–3.2.2
- Vladimir Spokoiny and Niklas Willrich, Bootstrap tuning in ordered model selection, §§2.1–2.4
- Housen Li and Frank Werner, Adaptive minimax optimality in statistical inverse problems via SOLIT, Theorems 3.4, 3.8, 4.1 and 4.3
- Vladimir Spokoiny and Niklas Willrich, Bootstrap tuning in ordered model selection, Theorem 2.3 and Appendix A
- Christian Clason, Regularization of Inverse Problems, complete lecture notes, Chapter 5 §5.2