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.
Linear feature identifiability and Gaussian MAP tests
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
- Banach Gaussian priors, RKHS support, and concentration
- Bayesian models, priors, and posterior laws
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Brownian Motion Construction and Continuity
- Central Limit Theorems
- Characteristic Functions Inversion and Continuity
- Compact Operators and Riesz Schauder Theory
- Compact Self Adjoint Hilbert Schmidt and Trace Class Operators
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Complex Norms and Realification
- Complex Subspace Realification
- Complexification, Realification and Real Structures
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- 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
- Continuous Functional Calculus for Self Adjoint and Normal Operators
- Convergence: Nets and Filters
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Density Separability and Convolution in Lᵖ
- Detection and quantification limits
- 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
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- 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
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- 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
- Loss, Risk and Decision Theory
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed effects and longitudinal models
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- 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
- Partitions of Unity and Paracompactness
- 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
- Radon Measures and the Riesz Markov Kakutani Theorem
- Reeb Stability and Global Foliation Constructions
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Square-Integrable Kernels and Hilbert–Schmidt Compactness
- State-space model laws
- 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 Cantor Set, Baire Category, and Measure Zero in ℝ
- 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 Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- 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
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
2 · Logical flowchart
3 · Definitions, theorems and proofs
Exact linear feature estimability through the adjoint range
Definition
Assume Countable Choice. Let be a real Hilbert space and let be a separable real Hilbert space. Let be bounded and linear, let , and let be a jointly Gaussian centered family indexed by , linear into with covariance . For each define . A continuous linear feature is a map , where is the continuous dual of . By the Riesz representation theorem there is a unique with for every . The feature is exactly linearly estimable by one probe if some makes the statistic unbiased for for every . Writing for the adjoint range, this holds exactly when . Every such probe has variance . This definition concerns one-probe unbiased linear estimators; it does not identify membership in with exact estimability.
Definition references
Facts & Assumptions
Given: Real Hilbert spaces , a bounded linear map , an isonormal white-noise experiment with , and a continuous linear feature .
In the isonormal experiment, and for every fixed and . Isonormal Gaussian white-noise inverse experiment
The adjoint satisfies . The Hilbert-space adjoint of a bounded operator
Every continuous linear functional on a real Hilbert space has a unique representing vector with . Riesz representation for Hilbert spaces
Countable Choice is assumed by [F2] and [F3]. The Axiom of Countable Choice ()
Proof
Fix a probe . By [F1] and [F2], whose supplier hypotheses are recorded in [A1], its mean at parameter is and its variance is finite, equal to . If it is unbiased for every , then for every . Taking gives , so .
Conversely, if , use [A1] to choose with . Equations [F1] and [F2] then give for every , and [F1] gives its finite variance . Hence this probe is an exact one-probe estimator, proving both directions and the variance assertion.
Gaussian posterior law in an isonormal inverse experiment
Statement
Assume the Axiom of Choice. Let and be separable real Hilbert spaces with supplied finite or countable complete orthonormal bases and . Let be bounded and linear, let , and let be a Borel Gaussian random element with mean and positive self-adjoint, injective, trace-class covariance . Let be a jointly Gaussian centered family indexed by , linear into with covariance , independent of , and observe the random field on with its cylinder sigma-algebra ; write for the law of this field. Write , and for put For , set If , define ; otherwise define . In finite dimension these sums terminate, and an empty basis is allowed for the zero space.
There is a data-indexed probability kernel on that is a regular conditional law of given the field , and for every it is the Borel Gaussian law with mean and covariance . In particular, for every fixed and every Borel set , For each fixed , for -almost every , The exceptional null set in this identity may depend on ; no simultaneous identity for every on one sample set is asserted. Here denotes the scalar normal law of mean and variance , including the zero-variance point mass.
Statement references
Isonormal white-noise inverse experiment
Bayesian model as a prior and sampling kernel
Bayesian posterior as a regular conditional law
Stuart, Inverse problems: A Bayesian perspective, §6.3, Theorem 6.20 and Example 6.23
Giné and Nickl, Mathematical Foundations of Infinite-Dimensional Statistical Models, §1.2.2
Facts & Assumptions
Given: The Gaussian Bayesian model and operator hypotheses in the Statement, including the supplied bases and the independent isonormal noise.
The white-noise field is centered after subtracting its signal, has covariance , and each finite orthonormal coordinate tuple consists of independent standard normals. Isonormal Gaussian white-noise inverse experiment
A proper prior and sampling kernel define the joint prior-predictive law; a posterior is a regular conditional distribution of the parameter given the data field. Bayesian model as a prior and sampling kernel, Bayesian posterior as a regular conditional law
Translation by the fixed mean preserves Borel measurability, so is a centered Borel Gaussian random element with covariance ; every finite family of its continuous linear projections is jointly Gaussian because each scalar linear combination is again such a projection. The finite-linear-combination criterion in Gaussian process records this joint-Gaussian convention. The centered premise applies to , not to when . Centered Borel Gaussian random element on a separable Banach space, Gaussian process
A positive trace-class operator is compact and has a positive square root under Countable Choice. The spectral theorem supplies a complete eigenbasis for ; the positive-trace theorem gives as the sum of its positive eigenvalues, so is Hilbert–Schmidt relative to that basis with squared norm , and Hilbert–Schmidt basis independence transfers this to the supplied bases. For every positive trace-class , its trace is the sum of its diagonal entries in any supplied Hilbert basis. Composing a compact operator with bounded operators preserves compactness. Trace class operator, Self-adjoint, positive, unitary and normal operators, Positive square root of a compact positive operator, Hilbert–Schmidt operator and Hilbert–Schmidt norm, The Hilbert–Schmidt norm is basis independent, Trace of a positive operator is the sum of its eigenvalues, Trace is absolutely convergent and basis independent, Compositions with a compact operator are compact
A bounded linear has adjoint satisfying , and is invertible for every . A bounded linear operator between normed spaces, The shifted Hilbert-space normal operator is invertible with inverse norm at most , The Hilbert-space adjoint of a bounded operator
Under the Axiom of Choice, finite jointly Gaussian blocks with zero cross-covariance are independent. Independent finite Gaussian vectors are jointly Gaussian, including singular covariance matrices. Jointly Gaussian blocks with zero cross-covariance are independent, including singular blocks, A finite stack of independent Gaussian vectors is jointly Gaussian
In a Hilbert space, a supplied complete orthonormal basis gives norm-convergent Fourier expansions and Parseval's identity. Hilbert space, Orthonormal families, complete orthonormal systems and Hilbert bases, Fourier expansion in a Hilbert space, Parseval equivalences for an orthonormal family
Tonelli interchanges expectation and a countable sum of nonnegative random variables; composing a Hilbert–Schmidt operator with a bounded one preserves the Hilbert–Schmidt property, and a product of two Hilbert–Schmidt operators is trace class. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product, Hilbert Schmidt operators form a two sided ideal, Trace class iff product of two Hilbert Schmidt operators
Finite measures agreeing on a generating pi-system that contains the whole space agree on its generated sigma-algebra. The constant sequence equal to the whole space supplies the required finite-measure exhaustion. Measures agreeing on a generating pi-system are equal under an increasing finite-measure exhaustion from that pi-system
A nonnegative-kernel integral of a jointly measurable function is measurable in the conditioning argument. Measurability of integration against a kernel
Markov's inequality, the first Borel–Cantelli lemma, and measurability of limits apply to the scalar coordinate reconstructions. Chebyshev-Markov inequality for the integral, The first Borel-Cantelli lemma for measures, Sequential suprema, infima, limsup, liminf, and pointwise limits of measurable functions are measurable
Independence means independence of generated sigma-algebras, and measurable functions of independent random elements remain independent. Independent random elements, Measurable coordinatewise functions preserve independence
The Axiom of Choice is assumed. It implies Countable Choice for the Hilbert adjoint, square-root, and basis interfaces in [F4]–[F7], and is the explicit hypothesis of [F6]. The Axiom of Choice, The Axiom of Countable Choice ()
Proof
Set . The positive trace-class operator is compact by [F4], so is compact and self-adjoint. Then is compact, self-adjoint, and positive, because a composition containing a compact operator is compact. By [F5], applied to , is bijective and is bounded. Its inverse is self-adjoint: writing and transfers symmetry of to . It is positive because when . The inverse identities give . For , put , so . Expanding this equation and using self-adjointness of gives . Thus , so is positive and . Define ; then is positive, is positive, and . The products are trace class by [F8] because is Hilbert–Schmidt and the intervening operators are bounded. Consequently and .
For , write . The signal and noise are independent, so covariance expansion gives . For , when the observed field is . Using and , the covariance identity yields . Likewise . These equalities follow by expanding the two covariance terms, using and .
For the supplied finite or countable basis of , [F8] and step 1.1 give . Therefore the nonnegative sum is finite almost surely: if it were infinite on a set of positive probability, its expectation would exceed every finite bound. Parseval gives , and shows on that probability-one set. Hence the first branch of the Statement's definition applies and there. The same argument includes finite and empty bases. The series converges in by [F7]. Its partial sums are measurable; their Cauchy set is a countable intersection and union of norm-comparison events, hence measurable, and completeness of gives a limit there. For each nonempty closed set , distance to is continuous, so the distance of the limit to is the limit of the measurable distances of the partial sums; [F11] makes this limit measurable. Because each coordinate map is measurable for the cylinder sigma-algebra, the convergence construction and the default value show that is measurable from to with its Borel sigma-algebra. For each fixed , expand in the supplied basis. The corresponding finite linear combinations of converge in to , since [F7] makes the basis projections converge to and [step 2.1] bounds the squared error by times the squared projection error. The same finite combinations converge almost surely to the inner product of the coordinate-series limit with . Uniqueness of limits in probability gives almost surely for this fixed . This proves the displayed posterior-mean formula, with an exceptional set allowed to depend on .
For fixed and , covariance expansion gives . The covariance of with is . Since , , and , one has . By step 3.1, almost surely, so the residual has zero covariance with every observation . Both and are centered, so the same identity shows for each ; thus is centered. Its covariance is by the two covariance identities in step 2.1 and the covariance of .
For each fixed basis vector , step 3.1 identifies almost surely with . For any finite list of basis vectors, intersect the corresponding probability-one events; the associated coordinates of are then linear images of finite Gaussian projections of and . The same holds jointly with any finite list of observations. The underlying finite and blocks are independent by [F12], so their joint linear images are Gaussian by [F3] and [F6]. Step 4.1 makes the residual-coordinate and observation blocks have zero cross-covariance, so [F6] makes those blocks independent. The rational finite linear combinations of the supplied basis form a countable dense subset of . For each center in this set, Parseval expresses the squared distance from as the limit of finite sums of squared basis-coordinate differences, so open balls with rational radii about these centers are measurable in the basis-coordinate sigma-algebra; they form a countable base, proving that these coordinates generate the Borel sigma-algebra of . For a fixed finite list of observations, finite basis-coordinate cylinder rectangles and observation rectangles have the product of their marginal probabilities by the independence just proved. These rectangles form a generating pi-system for the product of the residual Borel sigma-algebra and the finite observation Borel sigma-algebra, so [F9] extends the product identity and shows that is independent of this finite observation block. Now fix any . The finite measures and agree on the pi-system of finite observation cylinder events, including the whole space. By [F9] they agree on . Since this holds for every , is independent of the full field. This argument includes finite and empty supplied bases and requires no inclusion in the ordinary completion of a basis-observation sigma-algebra.
The map is measurable by step 3.1. Let be the Borel law of the residual random element , whose mean is zero and covariance is by step 4.1. Define for . The map is measurable, and [F10] makes measurable; for each , translation of is a probability measure. Since is independent of the full data field by step 5.1 and , integrating first with respect to the fixed law gives for every Borel and . This is the regular conditional distribution identity from [F2].
For every finite list , step 3.1 gives almost surely, simultaneously for this finite list, . The vector of these residual functionals is therefore a linear image of finite Gaussian projections of and , whose blocks are independent by [F12] and jointly Gaussian by [F3] and [F6]; hence it is jointly Gaussian. Step 4.1 gives that is centered with covariance , so is a centered Borel Gaussian random element with that covariance. Translating by shows that every section is Gaussian with mean and covariance , including the zero-dimensional and finite-dimensional cases. For fixed , step 3.1 identifies the posterior mean with almost surely, and the scalar marginal under a translated Gaussian is normal with variance . This proves all asserted posterior-law and feature-marginal formulas; the exceptional set remains feature-dependent.
Gaussian MAP feature test
Definition
Assume the Axiom of Choice. Let be separable real Hilbert spaces, let be bounded and linear, and let . Let be a Borel Gaussian prior with mean and positive self-adjoint, injective, trace-class covariance , independent of a jointly Gaussian centered family indexed by , linear into with covariance . For parameter , the observation field is . Fix a feature vector . Let and define the raw threshold Input a white-noise observation field . Compute . Return when and return when . This strict raw comparison defines the Gaussian MAP feature test for every field input .
Level, power, and weighted regularization of Gaussian MAP feature tests
Statement
Assume the Axiom of Choice. Let be separable real Hilbert spaces, bounded and linear, , and let be a Borel Gaussian prior with mean and positive self-adjoint, injective, trace-class covariance , independent of a jointly Gaussian centered family indexed by , linear into with covariance . Fix , define , , , , and . Let and let the raw MAP test reject exactly when . Define , the standard normal cumulative distribution function. For every its rejection probability is
Let be the prior-predictive law of the field on with its cylinder sigma-algebra, and let and be the data-indexed posterior kernel and mean supplied by the Gaussian posterior-law theorem, using supplied finite or countable complete orthonormal bases of and as in that theorem. For every , the scalar feature marginal under is normal with mean and variance ; its mode is its mean, with the support point serving as the mode when the variance is zero. For each fixed , the raw MAP test agrees for -almost every with rejection exactly when this posterior marginal mode is positive. The exceptional null set may depend on . If , then , and the raw test returns almost surely under every sampling law and under .
For a further real Hilbert space and a continuous linear injection , define the residual functional , where is the continuous dual of , by For let satisfy . If , the calibrated probe test rejects exactly when Its rejection probability at every is the same displayed Gaussian-tail formula with in place of and calibrated threshold in place of . If satisfies and , this test has rejection probability at most . For it never rejects and has level zero.
As an additional weighted-regularization identity, assume Countable Choice and suppose that . Let be the real partial isometry in the polar decomposition . Let , and define as the inverse of on . On , set when , and set otherwise. Then is a minimizer of , and
Statement references
Facts & Assumptions
Given: The Gaussian model and hypotheses in the Statement, a feature vector , a truth space when the calibrated test is used, and the commutation hypothesis for the final clause.
The MAP feature test has probe and threshold . Gaussian MAP feature test
At any fixed and probe , is normal with mean and variance ; the zero probe is the constant zero. Isonormal Gaussian white-noise inverse experiment
The standard normal distribution is continuous, strictly increasing, symmetric, and its upper quantile satisfies . The standard normal CDF has unique symmetric quantiles
A positive injective trace-class covariance is compact and has a positive square root; its compact positive operator admits a complete orthonormal eigenbasis under Countable Choice. Trace class operator, Positive square root of a compact positive operator, Spectral theorem for compact self adjoint operators
The cited partial-isometry definition uses nonzero complex Hilbert spaces; it supplies only the terminology here. The real operator is constructed and its defining properties are verified directly in step 1.2. Isometry coisometry and partial isometry
A self-adjoint operator on each finite-dimensional real inner-product space has an orthonormal eigenbasis, and Hilbert-basis expansions converge in norm with Parseval's identity. Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis, Fourier expansion in a Hilbert space, Parseval equivalences for an orthonormal family
The Hilbert adjoint satisfies . The Hilbert-space adjoint of a bounded operator
For , the density of is uniquely maximized at ; when , is the point mass at , whose support point is its mode.
For every fixed , the posterior-law theorem gives for -almost every , and gives the scalar posterior marginal stated in the Statement. Gaussian posterior law in an isonormal inverse experiment
The posterior input inherits the Axiom of Choice from its separate conditional-law construction. Countable Choice is used for the compact spectral and square-root suppliers in the weighted clause; its real partial isometry is constructed in the proof. The Gaussian-tail and calibration calculations use no additional choice principle. The Axiom of Choice, The Axiom of Countable Choice ()
Proof
For fixed and , [F2] gives in law, where is standard normal. By [F7], the mean is . Hence , which equals the stated formula by symmetry in [F3]. For , and the probability is exactly . Substituting proves the raw MAP formula.
For the weighted clause, [F4] gives the compact positive injective spectral decomposition with , finite-dimensional eigenspaces, and a complete orthonormal family spanning . The commutation hypothesis makes each such eigenspace invariant under the self-adjoint positive operator . By [F6], diagonalize its finite-dimensional restriction in each eigenspace. This gives a common complete orthonormal basis with and , . For , put ; then by [F7]. Define and define for and for . For a finite sum , orthonormality gives and . Thus both rules extend by completeness to bounded real-linear operators on , with self-adjoint and positive and . Any bounded self-adjoint positive square root of commutes with its square and therefore preserves each eigenspace; on an eigenspace with eigenvalue , it equals . Indeed, for , , and a vector in that eigenspace, satisfies , which positivity forces to vanish; when , . Hence . Also , so is the closed span of the zero-eigenvalue vectors and is the closed span of the positive-eigenvalue vectors. The extended vanishes on , is isometric on , and has by its coordinate formula; these real-space properties verify that is a partial isometry as characterized in [F5], including when the basis is empty. The expansions of and show and . Since are orthonormal, with the adjoint identities and Fourier expansion in give and . If , the Fourier expansions give and whenever the second term is defined. Components of in affect neither expression.
For each fixed , [F9] gives for -almost every that . For every , the posterior feature marginal has the normal law stated in the theorem. If its variance is positive, its density is , uniquely maximized at ; if its variance is zero, it is the point mass at that same value. Thus its mode is in both cases. On the probability-one set where the displayed identity holds, the raw comparison is therefore equivalent to a positive posterior marginal mode; its exceptional null set may depend on . If , the definitions give , and [F2] gives almost surely under each and almost surely under , so the raw test returns under all those laws.
For in the stated null ball, [F7] gives . Thus the calibrated threshold is at least . Applying step 1.1 to that threshold and using [F3] bounds the rejection probability by . The same substitution gives the exact stated power formula at every . If , then and its norm is nonnegative, so the strict comparison is , which is false; the level and power are zero.
For each , the scalar quadratic is minimized at . These coefficients define a vector in and lie in the inverse-square-root domain because , using for ; Parseval makes the bound summable. The corresponding vector is , since has coefficient on . Each coordinate minimizes its summand, while the terms are fixed and the orthogonal observation component is irrelevant, so minimizes . Finally [F7] and the diagonal action of show that has coefficient , which is the coefficient of .
Remarks
The raw MAP formula uses a prior fixed independently of the observation whose rejection is tested. If prior covariance is tuned using the same sample, this theorem does not establish the displayed level or power formula for that empirical procedure.
Remarks references
Polar factorization diagram
The triangle records the real polar factorization . On the common eigenbasis in step 3.1, the upper arrow sends to ; the right arrow then sends it to when , and to zero when . This agrees with the lower arrow on the basis and therefore on all of by boundedness and density. The diagram summarizes step 1.2 and is not used in any proof step.
A non-eigenfeature can give an unrestricted Gaussian MAP test level one
Statement
Assume the Axiom of Choice. Let be separable real Hilbert spaces, bounded and linear, , and let be a Borel Gaussian prior with mean and positive self-adjoint, injective, trace-class covariance , independent of a jointly Gaussian centered family indexed by , linear into with covariance . Put , , . For a feature vector , define , , and the raw test , where . Suppose , , and is not a scalar multiple of . Then the unrestricted null set satisfies The supremum need not be attained at any finite parameter value.
Statement references
Facts & Assumptions
Given: The Gaussian inverse model, operators, feature, and test in the Statement, together with the commutation and non-eigenfeature hypotheses.
Under the commutation hypothesis, , and the raw test has rejection probability when . Level, power, and weighted regularization of Gaussian MAP feature tests
The shifted normal operator is invertible, and its inverse commutes with . The shifted Hilbert-space normal operator is invertible with inverse norm at most
The adjoint identity is , and inner products satisfy Cauchy–Schwarz. The Hilbert-space adjoint of a bounded operator, Cauchy–Schwarz: , with equality exactly for dependent pairs
The Axiom of Choice is inherited from the posterior and polar-decomposition branches; Countable Choice is used for Hilbert adjoints and shifted-operator inversion. The Axiom of Choice, The Axiom of Countable Choice ()
Proof
Put . By [F1] and its inherited Axiom of Choice hypothesis [A1], . If for a real scalar , multiply the identity by and use [F2] to obtain , hence . The case forces , contrary to the hypothesis; otherwise . Thus any scalar dependence of and would make a scalar multiple of . The assumed non-eigenfeature condition therefore implies .
Let . Then , , and by orthogonal projection. For , belongs to . Moreover , since otherwise by invertibility of and would be an eigenvector with eigenvalue zero; so implies .
By [F3] and the inherited Axiom of Choice hypothesis [A1], the test statistic at has mean and positive standard deviation . The exact tail formula [F1] gives as . Every is null, so the supremum over is at least this limit and at most one; it is therefore one. Since a nondegenerate normal tail is strictly below one at every finite threshold, the limiting sequence does not assert attainment.
4 · Examples, counterexamples and false statements
None yet.
Sources
- Remo Kretschmann and Frank Werner, Maximum a posteriori testing in statistical inverse problems, §1.1 and §1.2
- Remo Kretschmann, Daniel Wachsmuth, and Frank Werner, Optimal regularized hypothesis testing in statistical inverse problems, §1.1
- Remo Kretschmann and Frank Werner, Maximum a posteriori testing in statistical inverse problems, §§1.1–1.3
- Andrew M. Stuart, Inverse problems: A Bayesian perspective, §6.3, Theorem 6.20 and Example 6.23
- Evarist Giné and Richard Nickl, Mathematical Foundations of Infinite-Dimensional Statistical Models, §1.2.2
- Remo Kretschmann and Frank Werner, Maximum a posteriori testing in statistical inverse problems, §1.2 and Theorems 2.3–2.5
- Andrew M. Stuart, Inverse problems: A Bayesian perspective, §6.3
- Remo Kretschmann and Frank Werner, Maximum a posteriori testing in statistical inverse problems, Theorems 2.4–2.5
- Remo Kretschmann, Daniel Wachsmuth, and Frank Werner, Optimal regularized hypothesis testing in statistical inverse problems, §1.2 and Theorem 2.3
- Remo Kretschmann and Frank Werner, Maximum a posteriori testing in statistical inverse problems, Theorem 2.6 and its proof