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.
Polynomial singular-value decay and a power Gaussian prior
Example
Assume AC and Countable Choice. Fix . For each , use the centered Gaussian Borel prior on with independent coordinates , independent of the observation noise. Under the fixed-truth law, observe with independent noise and a fixed truth in the power ellipsoid . Then the posterior contracts in the norm at rate , meaning that for every the expected posterior mass outside radius tends to zero as .
Example references
Facts & Assumptions
Given: AC and Countable Choice; ; ; the power ellipsoid and Gaussian prior in the Example; and the exact posterior moment formula for the coordinate model.
AC is the declared assumption for the Gaussian product posterior construction. The Axiom of Choice
Countable Choice is inherited from the compact-SVD sequence model. The Axiom of Countable Choice ()
The posterior coordinate mean and variance are and , and the expected posterior squared error is the displayed nonnegative sum; posterior tail mass is bounded by that sum divided by the squared radius. Exact posterior second moment and contraction bound for a Gaussian sequence inverse problem
A rate is established when expected posterior mass outside every diverging multiple tends to zero under the fixed-truth law. Posterior contraction rate in a Gaussian sequence inverse experiment
The Gaussian sequence inverse model has , positive singular values, product-Borel observations, and independent standard-normal noise coordinates. Gaussian sequence inverse model
For positive bases, real powers satisfy and the ordinary exponent laws. Real powers for positive bases, with the zero-base positive-exponent convention, The exponent, product, quotient, and iterated-power laws for positive real bases and real exponents
For every , the geometric series converges and equals . For , , and for the series diverges
The canonical real square-summable sequence space is complete, hence a real Hilbert space. Positive-index coordinates are identified with the -indexed sequence space by the isometry . The real square-summable sequence space is complete The set of finite-support sequences with rational coordinates is countable and dense: truncate any square-summable sequence so the tail norm is arbitrarily small, then approximate the finitely many retained coordinates by rationals. Hence is separable. For the diagonal covariance, positivity and self-adjointness follow from and . Finite-rank truncations converge in operator norm, so is compact; its diagonal rank-one expansion has nuclear sum , so it is trace class. A Hilbert space with a given orthonormal basis is of the index set, Separability: the existence of an at most countable dense subset, Bounded finite rank operators are compact, Norm limit of compact operators is compact, Nuclear series characterizes trace norm
A positive self-adjoint trace-class covariance on a separable real Hilbert space defines a Borel centered Hilbert-valued Gaussian random element with that covariance. Positive trace-class covariance defines a Hilbert Gaussian
A finite vector is multivariate normal when all its linear projections are normal. Multivariate normal law, including singular covariance
Finite jointly Gaussian blocks with zero cross-covariance are independent, including for singular covariance matrices. Uncorrelated jointly Gaussian blocks are independent
The notation denotes the law of a normal variable with mean and variance . Standard normal and normal laws
For positive bases, makes increasing, makes it decreasing, and for the map is increasing while is decreasing, since . In particular, for , , because and is positive and increasing. For , , so implies . Finally, for and any , if then , so ; the latter tends to zero as . These facts use , strict increase of and , , positivity of , and its limit at . Real powers for positive bases, with the zero-base positive-exponent convention, The natural logarithm as the inverse of the exponential function, The real exponential function and the number by a power series, Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm, The exponential function is strictly increasing, The exponential tends to at and to at , The exponential is positive and satisfies
Given: The hypotheses of the Example and facts [A1], [F1]–[F11].
Verification
Given: The hypotheses of the Example and facts [A1], [A2], [F1]–[F11].
Let with standard basis and set . Each dyadic block has at most terms, each at most , so [F5] gives ; here the geometric ratio satisfies by [F11]. Define . It is positive and self-adjoint; its truncations have finite rank, and , so [F6] makes compact. The expansion has nuclear sum , so [F6] also makes it trace class. By [F7] there is a Borel centered Gaussian random element in with covariance . For each finite coordinate vector, every linear projection is centered normal by [F7], hence it is jointly Gaussian by [F8]; its covariance matrix is diagonal with entries . Repeatedly applying [F9] to the first coordinate and the remaining block proves that the coordinates are independent, and [F10] identifies their laws as . Thus the law of is the stated prior on .
Put and . Since , one has . The posterior variance satisfies . Therefore . The finite sum has at most terms each at most ; for the tail, the block has at most terms, each at most . The conversions between powers of and use the positive-base power order in [F11].
Write . The ellipsoid condition gives . For , this supremum is bounded by when , and by when . For , it is at most . The bounds on in step 1.2 give . This treats the equality case in the first branch. The power-order comparisons use and the positive-base facts in [F11].
Since , one has . The exact sum [F1] and steps 1.2–2.1 therefore give ; here . Put . By [F11], , as required in the rate definition. Since , [F11] also permits the posterior-moment bound to be written as . The expected posterior tail outside is therefore at most for every . By [F2], this is the stated contraction rate.
Depends on
- Gaussian sequence inverse model
- Posterior contraction rate in a Gaussian sequence inverse experiment
- Exact posterior second moment and contraction bound for a Gaussian sequence inverse problem
- Standard normal and normal laws
- Multivariate normal law, including singular covariance
- Separability: the existence of an at most countable dense subset
- The real square-summable sequence space is complete
- Bounded finite rank operators are compact
- Nuclear series characterizes trace norm
- Positive trace-class covariance defines a Hilbert Gaussian
- Uncorrelated jointly Gaussian blocks are independent
- Norm limit of compact operators is compact
- A Hilbert space with a given orthonormal basis is $\ell^2$ of the index set
- The Axiom of Choice
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Real powers for positive bases, with the zero-base positive-exponent convention
- The exponent, product, quotient, and iterated-power laws for positive real bases and real exponents
- The natural logarithm as the inverse of the exponential function
- The real exponential function and the number $e$ by a power series
- Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm
- The exponential function is strictly increasing
- The exponential tends to $+\infty$ at $+\infty$ and to $0$ at $-\infty$
- The exponential is positive and satisfies $\exp(-x)=1/\exp(x)$
- For $|r| < 1$, $\sum_{k \ge 0} r^k = 1/(1-r)$, and for $|r| \ge 1$ the series diverges
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
131 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
- B. T. Knapik, A. W. van der Vaart, and J. H. van Zanten, Bayesian inverse problems with Gaussian priors, The Annals of Statistics 39 (2011), 2626–2657 (standard reference, not scraped)
- Iain M. Johnstone, Gaussian estimation: Sequence and wavelet models, 2013 draft (standard reference, not scraped)