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.
Robust Covariance and Sparse Robust Estimation
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Analyticity of Holomorphic Functions; Liouville and Morera
- Approximation and Compactness in C(K)
- Arc Length and Rectifiable Curves
- Areas of Elementary Plane Figures
- Banach Alaoglu Goldstine and Krein Milman
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Bounded Variation and the Riemann–Stieltjes Integral
- Central Limit Theorems
- Characteristic Functions Inversion and Continuity
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Coordinate and Path Transport
- Complex Differentiability and the Cauchy–Riemann Equations
- Complex Lp Spaces and Test-Function Conventions
- Complex Norms and Realification
- Complex Power Series and Analytic Functions
- Complexification, Realification and Real Structures
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Concentration
- Conditional Distributions and Regular Conditional Probability
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Contamination and Robust Risk
- Continuity, IVT, EVT, and Uniform Continuity
- Contour Integration
- Convex and Semicontinuous Functions on Rⁿ
- Convexity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Darboux, L'Hôpital, and Taylor's Theorem
- Density Separability and Convolution in Lᵖ
- 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
- Domination and Likelihood Ratios
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Estimators and Randomized Procedures
- Euclidean Surface Measure, Divergence, and Green Identities
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- 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
- Goursat's Theorem and Cauchy's Theorem in a Convex Domain
- 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
- Line Integrals and the Gradient Theorem
- 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
- Matrix Norms, Condition Numbers and Numerical Stability
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Minimax Lower Bounds
- 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
- Order, Zorn's Lemma, and the Axiom of Choice
- 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
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Robust Means under Heavy Tails
- 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
- Sparse Estimation and Covariance
- Splitting Fields
- Stationary Markov Chains and Ergodic Limits
- Statistical Experiments, Models and Identifiability
- 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 Fundamental Theorems of Calculus
- The Galois Correspondence
- The Identity Theorem, the Maximum Principle and the Open Mapping Theorem
- The Integral Logarithm and the Equivalence of Its Characterisations
- 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
- Volumes of Elementary Solids and Solids of Revolution
- Weak Convergence Tightness and Representation
- Weak Laws and Series of Independent Random Variables
2 · Summary
This page separates two observation models that can produce different covariance guarantees. Under Gaussian Huber contamination, an arbitrary probability law contaminates an iid sample while the target remains the clean Gaussian covariance. Under a clean heavy-tail model, the sample is uncorrupted and the finite matrix variance controls the covariance procedure. It proves dense and single-block sparse Gaussian Huber rates in squared operator norm, with global and bounded-class Borel maximizing selectors. A local trace-aware theorem proves the clean heavy-tail guarantee under and the stated sample condition, including the same-sample pilot. Separate counterexamples refute the source's two-axis trace comparison and its former intrinsic-ratio-only pilot guarantee; they do not refute the trace-aware theorem.
Clean heavy-tail covariance
The radial-truncation estimator retains its original same-sample geometric- median pilot and adaptive scale rule. Its complete proof separates ambient dimension from intrinsic matrix variance. Local Golden–Thompson and matrix Bernstein arguments give a known-mean bound for every sample size; a uniform pilot-ball comparison handles a pilot computed from the same observations. A trace-aware sufficient sample condition gives the fixed-scale and adaptive constants three and eighteen for every clean finite-fourth-moment law. The adaptive proof pays the common pilot failure once and recovers the unrounded logarithmic probability factor through sharper event budgets. The companion axis-family counterexample shows why the former intrinsic- ratio-only sample condition fails, independently of the separate two-axis counterexample to the source trace inequality.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Covariance matrix of a finite-dimensional random vector
Definition
Let be a measurable random vector in , where is finite, and assume . Define the mean coordinatewise by and define the covariance matrix by where each entry is the expectation of the corresponding real random variable. Write .
The well-definedness lemma proves these expectations are finite, is symmetric positive semidefinite, and .
Finite-dimensional Golden–Thompson trace inequality
Statement
For Hermitian matrices with , Here is the norm-convergent finite-matrix exponential series. No commutativity assumption is imposed.
Facts & Assumptions
Given: The Hermitian matrices and the usual Euclidean operator norm. The trace is the sum of diagonal entries as in The trace as the sum of the diagonal entries.
The finite singular value decomposition is supplied by Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition. If are the singular values, set for . The operator norm is the largest singular value; this follows immediately by applying the diagonal singular-value matrix to a unit vector. Unitary multiplication preserves these norms.
Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely supplies orthonormal eigenbases for Hermitian matrices. In particular is unitary for real , and is positive definite. The exponential series converges uniformly on every norm-bounded matrix set, because ; thus it is continuous and its entries are entire functions of a scalar complex multiplier.
Hadamard three-lines theorem: a bounded continuous scalar function on that is holomorphic inside and has boundary moduli at most satisfies for .
Proof
We first record two elementary trace estimates. If is a singular value decomposition, cyclically expanding the finite diagonal sum gives , so . Also , so scalar Cauchy–Schwarz gives , since by the singular value decomposition. These arguments also prove the trace cyclicity used here by interchanging two finite sums.
Set and . The function is entrywise entire and uniformly bounded on the closed strip: for each exponential is the product of a bounded positive real exponential with a unitary imaginary exponential of the same Hermitian matrix. On the line , . On , the identity and unitary invariance give .
We need a finite eigenvalue comparison only for a diagonalizable invertible matrix . Order its eigenvalue moduli and its singular values decreasingly. For , the th exterior space has the orthonormal wedge basis , , and its induced map sends a wedge to the wedge of the images. This defines the finite matrix directly by multilinearity and alternation. The singular value decomposition makes its norm : wedges of the two singular-vector orthonormal bases give diagonal coefficients consisting of all -fold singular-value products. Wedges of the first independent eigenvectors are nonzero eigenvectors with eigenvalue ; nonvanishing follows by expanding independent vectors in a basis and noting that some -minor is nonzero. The norm bounds the modulus of an eigenvalue, proving . This uses only finite bases and finite determinants.
Fix , put and , and choose a singular value decomposition . All are positive because is invertible. Set and , so . Define and . These functions are continuous and bounded on the closed strip and holomorphic inside: their entries are finite sums of entire exponentials and their moduli are bounded uniformly in the imaginary coordinate. On its left boundary , and on its right boundary . The two trace estimates of step 1.1 therefore bound by and on the respective boundaries. Since , one has . Applying [F3] yields .
Put and in decreasing order. Step 1.3 gives for every . For any real , the positive terms form an initial segment, so . For every , multiply by and integrate: , as follows by evaluating the elementary exponential primitive at finite lower limits and sending that limit to . The finite sums can be integrated termwise and all integrands are nonnegative, giving .
For each integer , let . It is similar to the positive definite matrix , since conjugating by gives that matrix. Thus [F2] makes diagonalizable with positive eigenvalues. Apply step 2.2 with and step 2.1 with to obtain .
The exponential series gives and in operator norm, where the constants depend only on the fixed matrices. Also for one fixed . The telescoping identity , valid by cancellation without commutativity, gives . The addition law for exponential series of scalar multiples of one matrix gives . Therefore , using and cyclicity to evaluate the Hilbert–Schmidt square . This is the claimed inequality.
The Gaussian matrix-depth scale constant exists uniquely
Statement
Let . There is a unique such that .
Facts & Assumptions
Given: The standard normal probability law .
Standard normal and normal laws defines by the positive even density , whose integral over is one.
Continuity from below for measures: measures of increasing measurable sets converge to the measure of their union.
Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on takes every value between and : a continuous real function on a closed interval takes every value between its endpoint values.
Proof
Since the standard-normal density is bounded by , ; hence is continuous. The density is positive, so its integral over every nonempty interval is positive and is strictly increasing. Evenness and total mass one give . Applying [F2] to as gives .
Choose an integer with . By [F3] on , some satisfies ; strict increase from step 1.1 makes unique. Then is the unique positive value with .
Uniform deviation for squared-projection slabs
Statement
Let be independent random elements of with common Borel probability law . Let be nonempty coordinate sets with , where , and define For and , put and . There is a universal constant such that, for every , The same bound holds for the upper-tail sets .
Facts & Assumptions
Given: Independent random elements, their common law , a finite support family , and .
Independent random elements: independence means the generated event sigma-algebras factor on finite intersections.
Probability measures and probability spaces and Expectation of a nonnegative or integrable random variable define the probabilities and expectations used below.
Dominated convergence: pointwise convergence of indicators bounded by passes to their probabilities.
Continuity from below for measures: probabilities of increasing measurable sets converge to the probability of their union.
Jensen's integral inequality for a probability measure: Jensen's inequality applies to the bounded empirical-process suprema below.
The product sigma-algebra and its finite iterates, The product measure of two sigma-finite measure spaces, For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique, and Independent random elements have product joint law: finite ghost samples and independent signs can be realized on finite product spaces with their stated independent laws.
The norm induced by a real or complex inner product and Cauchy–Schwarz: , with equality exactly for dependent pairs give the Euclidean norm and Cauchy--Schwarz inequality. The inner-product norm is definite, homogeneous, and satisfies the triangle inequality gives homogeneity and the triangle inequality, hence .
The six hyperbolic functions and their natural domains, Addition formulas, identities, parity, and derivatives of the hyperbolic functions, The real exponential function and the number by a power series, The exponential function is strictly increasing, The natural logarithm as the inverse of the exponential function, Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm, The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t, The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with , Sums, scalar multiples, products and quotients: , , , and when , and The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with : is positive and even, , and on positive arguments; the mean value theorem turns nonnegative derivatives into monotonicity.
The rationals embed densely in the reals places a rational strictly between any two reals; is countably infinite gives a fixed enumeration of the rationals.
Proof
The supremum is measurable. Fix with . By [F9], rational vectors supported in can be enumerated by enumerating their finite tuples of rational indices in increasing sum; their nonzero normalizations form a countable subclass of . For and each , choose the first rational tuple in that enumeration satisfying for . Such a tuple exists by rational density, and , so . With , [F7] gives . For , choose the first rational in the fixed enumeration. Cauchy--Schwarz yields Thus for every , including boundary points: at equality the threshold margin eventually exceeds this error, while away from equality convergence preserves the strict sign. By [F3] their -probabilities converge; finite empirical probabilities converge too. Negative thresholds give the empty set, already represented by rational thresholds. Hence the supremum equals that over the countable subclass of normalized rational vectors and rational thresholds, and is measurable. The first-element rules use no choice axiom.
Fix a support of size . Trace patterns of affine halfspaces on fixed points are sign patterns of affine hyperplanes in a -dimensional parameter space. The number of open regions is at most : adding one hyperplane creates at most the number of regions cut on that hyperplane, so induction on and the dimension gives Pascal's recurrence and this sum. Weak-boundary traces are also counted, since on a finite point set a halfspace threshold can be increased slightly without changing its trace.
A slab with is the intersection of the halfspaces and in the same coordinates; when it is empty. Hence its trace count on points is at most . For , set . Since for , If , then : the logarithmic difference is positive at and has positive derivative thereafter. Thus points cannot be shattered by the slab class, so its VC dimension is at most .
Let be independent uniform signs, independent of the sample, and let be an independent copy. Jensen's inequality [F5], conditional on the original sample, gives Each pair is exchangeable, so independently swapping its coordinates with sign leaves the joint law unchanged. The triangle inequality then gives The ghost sample and signs exist on finite product spaces by [F6]; all suprema use the countable class from step 1.1.
Replacing one observation changes every empirical set probability by at most , so the supremum changes by at most . In the Doob martingale of , each conditional increment therefore has a range of width at most . If a random variable lies in an interval of width , the log-mgf of its centered version has second derivative equal to a tilted variance at most ; integrating twice gives . Iterating these bounds and optimizing the exponential Markov inequality yields .
On a fixed -point sample the trace class is finite. For , if traces are pairwise separated by more than in , sample coordinates uniformly with replacement. For a fixed pair the probability that the traces agree at all sampled coordinates is at most ; a union bound over pairs shows that some coordinate sample distinguishes all traces. Put . If , then . If , step 2.1 bounds the trace count by , where ; the inequality follows because is increasing for . Writing , the choice of gives and hence . Put . If , then , so ; if , then . Thus for a universal . After increasing , the same bound covers . A maximal -separated set is a -net, so .
To obtain the sign MGF bound used for chaining, for put . Then and by [F8]; the mean value theorem gives . Put . Then and , so ; evenness extends the bound to every real . Hence . Conditional on the sample, the sign process therefore has increments satisfying , by multiplying the independent sign MGFs with coefficients . Choose empirical nets at radii . Telescope each trace through its nearest net points; adjacent levels differ by at most in . For centered sub-Gaussian variables with common proxy , follows by Jensen's inequality applied to the log-sum-exp of and , followed by minimization in . Thus the conditional expected supremum is at most The finite trace class makes the sum terminate.
From step 3.1, . Therefore the dyadic sum in step 4.1 is at most ; the base trace contributes at most by Cauchy--Schwarz. Combining the symmetrization bound from step 2.2 with the chaining bound from step 4.1 yields .
Apply step 2.3 with separately to each support class and take a union bound over its supports. Combining with step 5.1 proves the displayed probability bound after increasing the universal constant .
For any , an increasing union. Continuity from below [F4] makes both and probabilities converge to those of the strict lower-tail set. The deviation bound in step 6.1 holds at every threshold, so it passes to this limit. Taking complements gives the same bound for the upper weak tails .
Bounded-spectrum covariance class
Definition
For and , define For positive semidefinite , the operator norm is its largest eigenvalue, so this is the bounded-spectrum covariance class.
Matrix variance for covariance estimation
Definition
For a random vector with mean and covariance as in Covariance matrix of a finite-dimensional random vector, assume . Its matrix variance is When , define the intrinsic ratio
The expectation is entrywise. The finite fourth moment makes every entry integrable. This definition imposes neither Huber contamination nor sample replacement.
Bounded independent matrix Bernstein bound from the trace exponential
Statement
Let be independent centered random Hermitian matrices, . Suppose , , and Writing , for one has Consequently, for when , For every , the following convenient forms also hold: If , all and vanish almost surely, so the displayed positive-threshold conclusions remain valid.
Facts & Assumptions
Given: The matrices, constants and independent laws of the statement, with expectation as in Expectation of a nonnegative or integrable random variable. Matrix expectation is taken entrywise. The uniform bound makes all entries and all exponential series integrable.
Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely supplies the Hermitian spectral calculus. The semidefinite order means for every vector . Expectation preserves this order, by taking the expectation of each quadratic form.
Finite-dimensional Golden–Thompson trace inequality gives for Hermitian matrices. Trace is as in The trace as the sum of the diagonal entries.
Independence is in the sense of Independent random elements. By Independent random elements have product joint law, integration of a bounded measurable function of these matrices can be performed successively over their product law.
The scalar Markov bound for a nonnegative random variable is Markov's inequality for random variables.
Proof
Fix . If and is an integer, then , including odd and negative . Applying the spectral calculus and taking expectations gives . Since for every (start at and multiply by ), the exponential series and yield , where . The first inequality is the sum of the convergent geometric majorant , and the second uses and the scalar inequality . Termwise expectation is justified by the uniform norm majorant .
Let , with . For each fixed value of , [F2] and integration over the independent give . The last implication follows because and imply : diagonalize and sum its nonnegative eigenvalues times the bounded diagonal quadratic forms of . Successive integration using [F3] and iteration from prove .
By [F1], . Markov's inequality [F4] and step 2.1 therefore give for every and . If , choose , which belongs to that interval. Substitution gives , proving the stated tail bound. The same fixed-parameter bound with in place of will also be used below.
For set . Expanding its square shows : with and , the two sides are respectively and . Thus step 3.1 bounds the one-sided failure by . Applying the same argument to and taking the union of the two failures bounds the norm failure by , since the norm of a Hermitian matrix is the larger of its maximum eigenvalue and the maximum eigenvalue of its negative.
Finally, if , then for each coordinate vector , . A nonnegative random variable with zero expectation vanishes almost surely: otherwise one of the events where it exceeds would have positive probability and positive contribution to the expectation. Intersecting the finitely many full-probability coordinate events gives almost surely; a further finite intersection covers all . The trace mgf is then and both strict positive-threshold events are empty. This covers the remaining case and completes all conclusions.
A finite second moment defines a positive semidefinite covariance matrix
Statement
If is measurable and , then and in Covariance matrix of a finite-dimensional random vector are well-defined entrywise, is symmetric positive semidefinite, and .
Facts & Assumptions
Given: A finite-dimensional measurable random vector with .
Covariance matrix of a finite-dimensional random vector defines the mean coordinatewise and covariance entries by .
Expectation of a nonnegative or integrable random variable: finite expectation is defined for integrable real random variables.
Proof
For each coordinate, and imply , so every exists. Also , since .
For every pair , . Thus every covariance entry is integrable; all entries are finite and symmetry follows from commutativity of multiplication.
For , , so is positive semidefinite. Summing the diagonal entries gives ; the sum is finite.
Adaptive truncated covariance estimator
Definition
Input a finite sample , confidence parameter , and positive finite scale bounds . The computational domain requires . Statistical guarantees are stated separately: for a clean iid finite-fourth-moment law, use the matrix variance of Matrix variance for covariance estimation and a bracket containing . The statistical conditions are not needed merely to evaluate this finite-sample procedure.
Call Geometric median of block means on with block count to obtain the pilot . Use its consecutive blocks in index order, of size for the first blocks and for the rest. This uses the same sample and is not a sample split.
For a real symmetric matrix , define , where . The real spectral theorem makes this definition independent of the chosen orthonormal eigenbasis. Define the finite grid and truncation thresholds For every , form Choose the smallest such that and output .
This is the clean heavy-tail moment procedure. It makes no Huber contamination or sample-replacement guarantee.
Single-block sparse covariance class and restricted directions
Definition
For , let and, for an integer , let Here is the diagonal matrix with the same diagonal entries as . Thus all nonzero off-diagonal entries lie in one common coordinate block of size at most ; no row-sparsity condition is implied.
For , define When , the restricted direction set is
Gaussian Huber contamination model for covariance estimation
Definition
Let , , and let be a real positive semidefinite covariance matrix. For any Borel probability law on , define where is the finite-dimensional Gaussian law from Multivariate normal law, including singular covariance. A sample in this model consists of independent observations with common law . The target is the covariance of the uncontaminated Gaussian component, not the covariance of the mixture.
This is the covariance specialization of the Huber model in Huber contamination model. It is distinct from a clean heavy-tail moment model and from adversarial sample replacement.
Exact block budget for the covariance geometric-median pilot
Statement
Assume Countable Choice. Let be iid with mean , finite covariance , and . For , put . Partition the sample into consecutive blocks by the deterministic balanced rule of Geometric median of block means, and let be the selected minimum-norm geometric median of their block means. Then In particular the larger radius has the same failure bound. This proves the prescribed covariance-pilot block count without relying on the robust-mean theorem's different confidence convention.
Facts & Assumptions
Given: Countable Choice, iid observations with finite covariance, the balanced block partition, and , .
A geometric median is close when a strict majority is close: if a geometric median of points is farther than from , more than points are farther than from , where for .
Independent random elements, Disjoint groups of an independent sigma-algebra family remain independent, Measurable coordinatewise functions preserve independence, Independent random elements have product joint law, and Fubini's theorem for L^1 functions on a sigma-finite product: disjoint blocks of an iid sample, their block means, and the bad-block indicators are independent; integrable cross-products of independent centered vectors have expectation zero by the product law and Fubini.
Expectation of a nonnegative or integrable random variable, Markov's inequality for random variables, and Cauchy–Schwarz: , with equality exactly for dependent pairs: nonnegative Markov bounds apply, and finite second moment implies integrability for the block cross-products.
The natural logarithm as the inverse of the exponential function, Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm, The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t, The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with , Sums, scalar multiples, products and quotients: , , , and when , The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with , The first fundamental theorem: if is integrable on and continuous at , then ; in particular a continuous has as a primitive, and For the sequence is null, and for the sequence diverges to : the logarithm has derivative and its laws, the chain rule and FTC apply, the mean value theorem turns a zero derivative into constancy, and for . These facts justify the logarithmic series calculation in step 3.1.
The real exponential function and the number by a power series, The exponential addition formula , and The exponential function is strictly increasing: and is strictly increasing.
Geometric median of block means, Measurable minimum-norm geometric-median selection, and The Axiom of Countable Choice (): the prescribed deterministic partition and minimum-norm geometric-median selector are single-valued and Borel under Countable Choice.
Proof
Given: The iid sample, its finite covariance, the deterministic balanced partition, Countable Choice, and the displayed conditions.
Suppose , put , , , and . For a block of size , expand : diagonal terms sum to by [F2], and each cross term has expectation zero by [F3], because it is integrable by [F4] and the centered factors are independent. Thus . Markov [F4] gives . Grouping and measurable images in [F3] make the bad-block indicators independent.
Let be the number of bad blocks. For any , independence gives : each Bernoulli factor is , and [F3, F6] factor the product. Since , choose . Markov [F4] then gives , where , by substituting this and simplifying. By [F1], implies , so its probability is at most this bound.
For put , so . For , the function has and, by [F5], . The function has the same derivative by FTC and the same value at zero, so the mean value theorem applied to gives . Integrating yields the partial logarithm series plus a remainder between zero and , which tends to zero by [F5]. Thus . For and , the positive series and its geometric tail give and . Hence . Since , [F6] gives .
For and , . Since and , the radius in step 3.1 satisfies . Thus the event at radius is contained in the event bounded in step 3.1. If , Markov's inequality applied to shows almost surely for each ; a finite intersection makes every block mean equal , and the selected median equals . Finally, because , is at least the stated radius.
The covariance matrix variance ratio is at least one
Statement
Let have finite fourth moment, mean , nonzero covariance , and matrix variance as in Covariance matrix of a finite-dimensional random vector and Matrix variance for covariance estimation. Then
Facts & Assumptions
Given: A finite-dimensional random vector with and nonzero covariance .
Covariance matrix of a finite-dimensional random vector: is symmetric positive semidefinite and .
Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis: a nonzero positive semidefinite matrix has a unit eigenvector for its largest eigenvalue, equal to its operator norm.
Cauchy–Schwarz: , with equality exactly for dependent pairs: for square-integrable real random variables and , .
Proof
Put and choose a unit top eigenvector of , with by [F1] and [F3]. The positive semidefinite matrix inside [F2] has operator norm at least its quadratic form at , so The second inequality follows pointwise from .
The finite fourth moment makes square-integrable. By [F4], . Hence , and division by this positive quantity proves .
Oracle-truncated covariance and vector concentration under finite matrix variance
Statement
Let be independent copies of a centered random vector , , with nonzero covariance and finite fourth moment. Write For , , and , set Then there are events such that and on the respective events The same also has the sharper-radius, larger-failure alternative No independence between these events and a statistic formed from the same sample is asserted or needed.
Facts & Assumptions
Given: The independent vectors and finite-moment assumptions in the statement. Covariance and matrix variance have the meanings in Covariance matrix of a finite-dimensional random vector and Matrix variance for covariance estimation. The fourth moment makes every matrix and scalar expectation used below finite.
Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis supplies spectral calculus for real symmetric matrices. For , , and the sole possibly nonzero eigenvalue of is . Semidefinite order is tested on quadratic forms and is preserved by expectation.
Bounded independent matrix Bernstein bound from the trace exponential: for independent centered Hermitian matrices with and , one has for . It also proves the associated fixed-parameter one-sided Chernoff bound and the explicit one-sided radius with failure ; the two-sided failure is .
Cauchy–Schwarz in Cauchy–Schwarz: , with equality exactly for dependent pairs, applied to square-integrable scalar random variables with inner product , gives . This expectation inner product may be read on the quotient by almost-sure equality. Independence is as in Independent random elements and is preserved under deterministic measurable transformations, by taking preimages of the defining independent events.
Proof
Put and . The weight is a Borel function, including its declared value at zero, so all transformations used here preserve the independence of the samples by [F3]. The rank-one spectral calculus gives and . For a scalar , : the inequality is immediate for , and for it is equivalent to . Applying it to the eigenvalues of proves . Therefore and . Nonzero covariance also implies : a positive variance in some unit direction forces . Thus the displayed thresholds are well-defined.
Put . Its norm is at most : for use , and otherwise use . Since , . For a unit vector , apply [F3] to and , assigning at zero. Then by matrix variance, and pointwise: it vanishes on , and elsewhere is at most . Thus . Taking the Euclidean dual supremum proves .
Set . Since both matrices subtracted lie between and , , whence . Expanding the square and taking expectations, without any commutativity requirement, gives . The left side is positive semidefinite; hence its norm is at most . The matrices are independent and centered.
For a vector define its symmetric dilation of size . Its square is ; its nonzero eigenvalues when are and , as is checked on the span of and . It vanishes on the orthogonal complement, so , also at zero. For , step 1.2 gives . The square identity gives . Its norm is at most ; for the lower block, test a unit vector and bound its squared scalar projection by the squared norm. The are independent centered symmetric matrices.
Let and use [F2] with the fixed Chernoff parameter ; it is admissible since . Its exponent bound is . Consequently, for , the one-sided failure is at most ; apply the same statement to and take a union to obtain . Adding the bias from step 1.1 and using yields . Define by this bound. Finally since the first four nonnegative terms of sum to ; since , the claimed strict bound by follows.
For the alternative radius, apply the two-sided explicit form in [F2] to the same , now with confidence parameter . After division by its radius is . Adding the bias and substituting , , and , gives the displayed radius with failure at most .
Apply the one-sided explicit Bernstein bound [F2] to with dimension , bound , variance bound and confidence . Since , division by gives outside probability . Because , one has , and the radius is at most . Adding step 1.2 proves the stated vector bound and defines . The two events were obtained from the original independent observations without conditioning on any other statistic. Together with steps 3.1 and 3.2 this proves every asserted conclusion.
Matrix depth and covariance estimators
Definition
For , write . Let be a nonempty subset of this sphere, let be a probability law on , and let . Its matrix depth relative to is where has law . Both weak inequalities include ties.
For observations , let on the Borel sigma-algebra of (The Borel sigma-algebra of a topological space). Each Dirac measure is a probability measure by The Dirac set function at a point and A Dirac set function is a probability measure. Their finite nonnegative weighted sum is a measure by Nonnegative scalar multiples and countable weighted sums of measures and Nonnegative scalar multiples and countable weighted sums of measures are measures, and its total mass is ; hence is a probability law by Probability measures and probability spaces. Let be the constant of The Gaussian matrix-depth scale constant exists uniquely. The global dense depth correspondence is , over symmetric positive semidefinite matrices. For , define the global single-block class and the global single-block sparse correspondence . These are the unrestricted-spectrum versions; no known spectral bound is needed to define their selectors.
For known , the dense bounded-class depth correspondence is For known integer , the single-block sparse version is where the classes and are defined in Bounded-spectrum covariance class and Single-block sparse covariance class and restricted directions. A measurable matrix-depth estimator is a Borel measurable selector from the applicable argmax correspondence, with covariance output . Either global correspondence or the applicable bounded-class correspondence may be used. The compact search restriction contains whenever the target belongs to the corresponding class; it makes no computational feasibility claim.
Remarks
Existence of a maximizer and existence of a measurable selector are separate obligations. Both are proved locally for the bounded classes, and the measurable-selection lemma also proves existence of Borel global maximizers by a data-dependent compact cap. Global argmax fibers are not asserted compact.
The adaptive truncated covariance procedure is well-defined on its declared domain
Statement
On the input domain in Adaptive truncated covariance estimator, the adaptive truncated covariance procedure is total and Borel measurable as a function of the sample.
Facts & Assumptions
Given: A finite sample in , , and positive finite scale bounds with the algorithm's declared block-count condition.
Adaptive truncated covariance estimator specifies a finite block partition, the geometric-median pilot, spectral truncation, a finite scale grid, and a least-index selection rule.
Measurable minimum-norm geometric-median selection: the geometric median pilot is a Borel function of its block means.
Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis: real symmetric matrices admit orthonormal eigenbases, so the scalar truncation defines a basis-independent matrix function.
Polynomials are uniformly dense in for every closed interval: every continuous scalar function on a compact real interval is uniformly approximable by polynomials.
Every complete ordered field is Archimedean: every finite real number is smaller than some natural number.
Proof
The integer satisfies on the declared domain. The deterministic balanced partition therefore has nonempty blocks, and each block mean is a continuous linear function of the sample. By [F2], applying the minimum-norm geometric median gives a single-valued Borel pilot.
For each finite symmetric matrix, [F3] defines its spectral truncation independently of the eigenbasis. To check continuity in the matrix, let be symmetric and choose larger than all their operator norms. By [F4], approximate the scalar clipping function uniformly on by a polynomial within . Spectral diagonalization [F3] gives for ; polynomial evaluation is continuous in matrix entries, so . Hence , and letting proves continuity. Each is positive and finite. The grid consists exactly of integers , where ; it is finite by [F5] and nonempty since belongs to it.
The largest grid index satisfies the agreement rule vacuously, so the set of admissible indices is nonempty and has a least element . For each fixed pair of indices, the matrix difference is Borel in the sample: the pilot is Borel by step 1.1 and the remaining finite matrix operations and truncation are continuous by step 1.2. Its operator norm is Borel as the composition with a continuous norm. Therefore the event that a given index satisfies all finitely many comparisons is Borel; taking the least among finitely many such indices is a Borel rule. The output is thus defined and Borel on the whole declared domain.
Fixed-scale matrix-truncated covariance deviation under finite matrix variance
Statement
Assume Countable Choice for the specified geometric-median pilot. Let , , be iid with mean , nonzero covariance , finite fourth central moment and matrix variance as in Matrix variance for covariance estimation. Put For , set , and For any measurable pilot, any and any event on which , there is an event with , , such that on , where , , and . The concentration event is constructed from the true centered observations and the inequality is uniform over the pilot ball; no independence of the pilot and sample is assumed.
For the exact pilot of Adaptive truncated covariance estimator, the explicit sufficient sample condition therefore gives Every finite-fourth-moment law is retained under this trace-aware sample condition; no coordinate independence or bounded-kurtosis assumption is added. If the mean is supplied exactly, the stronger bound holds with failure at most for every , without the sample condition.
Facts & Assumptions
Given: The iid sample, matrix moments, scales, confidence and stated pilot/event conventions. The probability factor denotes ambient dimension, whereas is an intrinsic moment ratio.
With , , , the oracle matrices and vectors obey and , except on events of probability and , respectively. Oracle-truncated covariance and vector concentration under finite matrix variance.
The specified balanced-block geometric-median pilot has radius with failure at most whenever . Exact block budget for the covariance geometric-median pilot.
For nonzero covariance the intrinsic ratio . The covariance matrix variance ratio is at least one.
Proof
Intersect the two oracle events [F1], at cost . Put and , interpreted as one at . For , the ratio lies in . Indeed , and the reverse follows by swapping the two vectors. Thus .
Expand . The perturbation of its part has norm at most , because its scalar coefficients have absolute value at most and the summands are positive semidefinite. For the cross vector, scalar Cauchy–Schwarz and give . Hence , since . This bound is pointwise for every in the ball, so it applies to the random same-sample on , without conditioning on it. The first conclusion follows using and [F1].
For the prescribed pilot take . The condition and [F3] imply , so [F2] applies. By homogeneity, replace by and by : then scale by , by , by , and is unchanged. It therefore suffices to normalize by so , , and . Put and . Using , and , direct substitution gives , and . Therefore and : indeed , and , give , hence the square-root factor is at most . The three terms in are at most , and , respectively: use , and . In total the perturbation beyond is at most . Step 2.1 is thus strictly below . Undo the normalization and add the single pilot failure to obtain . For known mean, and only the oracle matrix event is needed, proving the last assertion.
Remarks
The sufficient condition replaces a false general claim; Intrinsic matrix variance alone does not control pilot-centered covariance truncation ↗ gives an explicit counterexample to that original estimator guarantee. Under a separately proved extra relation , one has , recovering that sample-size regime. The auxiliary comparison cannot be assumed for arbitrary dependence. The uniform pilot formula above can be sharper than this sufficient sample condition when a pilot has a better separately established accuracy bound.
The Gaussian Huber covariance mixture is a probability law
Statement
For every admissible in Gaussian Huber contamination model for covariance estimation, is a probability measure on the Borel subsets of .
Facts & Assumptions
Given: A probability law , a Borel probability law , and .
Probability measures and probability spaces: both component laws are nonnegative, countably additive, and have total mass one.
Proof
For each Borel set , the mixture assigns , which is nonnegative because both coefficients are nonnegative. Its value at the empty set is zero because each component measure vanishes there.
Let be pairwise disjoint Borel sets. Countable additivity of the two component laws in [F2] gives their values on the union as the corresponding nonnegative series; distributing the fixed nonnegative coefficients over partial sums and taking limits yields . The total mass is . Together with step 1.1, these are the probability-measure axioms.
Lepski scale selection transfers fixed-scale covariance bounds
Statement
Let , , , and . Use the finite grid and agreement rule of Adaptive truncated covariance estimator, with measurable matrix estimates on that grid. Put On any event on which every satisfies , the selected estimate satisfies . If the individual failures are at most , its success probability is at least . For the prescribed same-sample estimator, when the hypotheses of Fixed-scale matrix-truncated covariance deviation under finite matrix variance hold at every required scale, its individual failure bounds give success probability at least . The shared-event bound below counts the common pilot failure once.
More sharply, suppose a common event has , and for each an event has , with the stated fixed-scale bound valid on . Then success is at least . No independence between scales or the pilot and covariance estimates is required. The exact grid cardinality is , not the generally false unrounded bound .
Facts & Assumptions
Given: The bracket, positive finite grid scales, matrix estimates and deterministic agreement rule in the statement, with the stated probability assumptions when invoked.
The scale grid is ; the agreement rule selects the smallest index whose estimate is within of every larger-scale estimate. Adaptive truncated covariance estimator.
The finite agreement rule has a valid index since its largest grid index satisfies every comparison vacuously. The adaptive truncated covariance procedure is well-defined on its declared domain.
Under its trace-aware sample condition, the prescribed pilot in Fixed-scale matrix-truncated covariance deviation under finite matrix variance has fixed-scale failure probability at most for each scale .
Proof
The grid condition is , so it has exactly elements. The first scale at or above is , and puts it in the grid. Thus exactly required scales are , with .
On the joint fixed-scale event, for every the triangle inequality gives . Hence is admissible and the selected . If they differ, the selection rule gives ; if equal this distance is zero. Adding the error at yields .
A finite union bound costs at most for individual failure bounds; under [F3], gives the stated bound. For a shared event , the complement of has probability at most ; the common failure is counted once. Applying step 2.1 proves all probability assertions.
A matrix-depth maximizer exists on the bounded covariance classes
Statement
For every integer , every nonempty finite sample in , and every , the dense bounded-class argmax correspondence from Matrix depth and covariance estimators is nonempty compact. If , the single-block sparse bounded-class argmax is also nonempty compact.
Facts & Assumptions
Given: An integer , a nonempty finite sample in , its empirical law , a bound , and, for the sparse case, .
Matrix depth and covariance estimators defines empirical matrix depth as the infimum over directions of the minimum of the two empirical weak-tail counts.
Bounded-spectrum covariance class, Single-block sparse covariance class and restricted directions, Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis, and The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||: the search classes consist of positive semidefinite symmetric matrices with operator norm at most ; the sparse class is the finite union of closed support classes.
Cauchy–Schwarz: , with equality exactly for dependent pairs and Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line: for unit coordinate vectors, , and a closed bounded subset of finite-dimensional Euclidean coordinate space is compact.
Upper semicontinuous real map on a topological space: a real map is upper semicontinuous exactly when its strict sublevel sets are open, equivalently its weak superlevel sets are closed.
Semicontinuous extreme value theorem on compact Euclidean sets and A closed subset of a compact metric space is compact: an upper semicontinuous real map on a nonempty compact Euclidean set attains its maximum, and a closed subset of a compact space is compact.
Proof
Identify the symmetric matrices with their coordinates in . The dense class is bounded because each entry satisfies by [F3]. It is closed: if coordinatewise with , then is symmetric, for every , and for every . By the operator-norm definition in [F2], this gives . Thus is closed and bounded, so [F3] makes it compact.
Fix and write and . If , then . For each , if or , the two weak-tail indicators eventually keep their limiting membership; if , the observation is counted in both weak tails at . Therefore the limsup of each finite tail count is at most its value at , and the limsup of their minimum is at most the minimum of their values there. The minimum of the two empirical tails is upper semicontinuous in . The infimum over remains upper semicontinuous because each strict sublevel set of the infimum is the union of the corresponding open strict sublevel sets from [F4]. Hence is upper semicontinuous on either search class.
For each fixed with , requiring the off-diagonal entries outside to vanish is a finite collection of closed coordinate equalities. Its intersection with the dense compact class is compact by [F5]. There are finitely many such , and their union is by [F2]. A finite union of compact sets is compact, since any open cover has a finite subcover on each of its finitely many members.
Both applicable search classes are nonempty because they contain the zero matrix. By steps 1.1–1.2 they are compact Euclidean sets. By step 1.2, their empirical depth functions are upper semicontinuous, so [F5] gives a maximizer on each applicable class. Its argmax is the nonempty weak superlevel set at that maximum, closed by [F4] and compact by [F5]. This proves the claim.
The scaled Gaussian covariance has matrix depth at least one half
Statement
Let , let be nonempty, and let be its centered Gaussian law. If is the unique positive constant satisfying , then Equality holds for every direction with positive variance; when the depth is .
Facts & Assumptions
Given: A positive semidefinite covariance matrix , a nonempty direction set , and its centered Gaussian law.
Matrix depth and covariance estimators defines depth using both weak tails, including their boundary ties.
Multivariate normal law, including singular covariance: for , under .
The Gaussian matrix-depth scale constant exists uniquely: for the unique .
A nonnegative measurable function has integral exactly when it vanishes almost everywhere: a nonnegative random variable with expectation zero vanishes almost surely.
Proof
Fix and put . If , [F2] gives with . The threshold for is , so The normal law has a density, so its boundary has probability zero and as well.
If , then by [F2]. Fact [F4] implies almost surely. Both weak-tail events at threshold zero then have probability one. Thus in every direction the smaller weak tail is at least ; taking the infimum proves the depth bound. If , every direction is in the zero-variance case and the depth equals one.
Huber covariance modulus lower bound for unrestricted matrix-valued actions
Statement
Assume AC. Fix , , , and let be either from Bounded-spectrum covariance class or from Single-block sparse covariance class and restricted directions with , equipped with its induced Borel sigma-algebra. Let be the set of Borel maps . The clean family is . For and matrix action , put Its restriction to defines the contamination modulus through Huber contamination modulus. Suppose , , , and Then
Facts & Assumptions
Given: AC, the bounded covariance class, the Gaussian Huber model, its contamination modulus, and the clean tail-risk premise in the Statement.
Gaussian Huber contamination model for covariance estimation: one observation has law and the sample consists of iid observations from this law.
Huber contamination modulus: for , pairs in the modulus satisfy ; at all pairs are allowed.
TV-close laws have identical Huber mixtures at the contamination threshold: under AC, every pair satisfying [F2] admits contaminants making the two one-observation Huber laws equal.
For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique: finite product laws are determined by their factor laws and rectangle values.
Measurable spaces and measurable sets, A measurable function between measurable spaces, and Composition with a Borel measurable outer map preserves measurability: a Borel estimator composed with the continuous loss section gives measurable tail events.
The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv|| and The norm induced by a real or complex inner product define the matrix and vector norms. The inner-product norm is definite, homogeneous, and satisfies the triangle inequality gives the vector-norm triangle inequality: for every unit , . Taking the supremum gives , without symmetry assumptions on .
Proof
Fix any . For each , choosing makes the one-observation Huber law equal to the clean law by [F1]. If , then , so the robust supremum probability at the smaller threshold is at least the clean supremum probability at . The clean premise therefore gives the claimed bound for this estimator. Taking the infimum preserves it.
Suppose . By the definition of the finite supremum in [F2], there are with and satisfying the total-variation condition there; when every pair is admissible. By [F3], choose contaminants whose one-observation Huber laws coincide at a law . Their iid sample laws both equal by [F1] and [F4].
For every matrix action , the triangle inequality gives Indeed, one of the two distances from is at least half the distance between and . The two measurable loss events at threshold therefore cover the sample space under the common law; their probabilities sum to at least one. One has probability at least , and its event is contained in the event at the smaller displayed threshold. The robust supremum probability for this estimator is at least .
Step 1.1 applies when and steps 1.2–2.1 apply when . The bound holds for every Borel matrix-valued estimator, so taking their infimum proves the statement.
The Huber covariance contamination modulus has a quadratic lower bound
Statement
For fixed , , and , the squared operator loss has contamination modulus at least on and on for every .
Facts & Assumptions
Given: The bounded covariance classes, the contamination modulus, the Gaussian Huber covariance model, Pinsker's inequality, and the local Gaussian KL formula.
Huber contamination modulus: the modulus uses pairs of clean laws whose total-variation distance is at most ; at the threshold is infinite.
Gaussian Huber contamination model for covariance estimation: the clean Gaussian law is with covariance parameter .
Kullback–Leibler divergence between nondegenerate centered Gaussian laws: the KL divergence of the positive-definite Gaussian pair is given by its trace-determinant formula.
Bounded-spectrum covariance class and Single-block sparse covariance class and restricted directions: a diagonal positive semidefinite matrix with largest eigenvalue at most lies in the dense class and in every defined single-block class.
Proof
For , set and . Both are positive definite, their largest eigenvalues are at most , and they are diagonal. Thus they belong to the dense class and to every block-sparse class in the Statement by [F5]. Their squared operator separation is .
Put . By [F4], The derivative of the bracket is ; integration from proves the inequality. Pinsker [F2] gives for . At , the modulus threshold is infinite.
The pair from step 1.1 is admissible in the supremum defining the contamination modulus [F1]. Its loss is , so the modulus on both classes is at least that amount. At the claimed lower bound is zero.
Operator error bound for the Gaussian Huber matrix-depth estimator
Statement
Let be independent with common law from Gaussian Huber contamination model for covariance estimation, where , , is arbitrary, and is fixed. Let be a Borel measurable positive semidefinite symmetric matrix-valued statistic satisfying for every sample. This includes every measurable global maximizer and every measurable maximizer over a compact search class containing . For a direction family with , nonempty , integer , and , assume and for a sufficiently large universal . Then, uniformly over and , with probability at least . Here depends only on the fixed spectrum bound .
This is a comparison bound. Existence of selectors is separate from this argument; the dense and block-sparse global and bounded-class selectors are proved in the local selection lemma.
Facts & Assumptions
Given: The Gaussian Huber model, a Borel measurable positive semidefinite statistic satisfying the displayed empirical-depth comparison, and the sample-size and confidence conditions in the Statement.
Matrix depth and covariance estimators: empirical depth uses both weak tails. The displayed comparison premise applies in particular to a global maximizer or to a maximizer over a class containing .
The scaled Gaussian covariance has matrix depth at least one half: , including singular directions.
Uniform deviation for squared-projection slabs: for clean independent observations, both squared-projection tail classes over supports of size at most have uniform empirical error at most with probability at least .
Standard normal and normal laws and The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with : the standard-normal density is positive and continuous, so its inverse CDF is locally Lipschitz on compact subintervals of .
Multivariate normal law, including singular covariance: if , then the clean Gaussian projection has law .
Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis and The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||: for symmetric , the map is 1-Lipschitz in operator norm for every nonempty of unit vectors.
A measurable function between measurable spaces and Composition with a Borel measurable outer map preserves measurability: composing a Borel selector with a continuous real-valued function gives a Borel random variable.
Proof
Expand the finite product mixture law using independent contamination labels. The contaminated count is binomial. For a Bernoulli variable with mean , the centered log-mgf satisfies and is a variance of a tilted Bernoulli law, hence at most . Integrating twice gives ; Chernoff optimization gives except on an event of probability . Put . Since and , the square-root term is at most . Thus and .
Conditional on the label pattern and clean count , the clean observations are independent with law . Apply [F3] with confidence . Except on a conditional event of probability , every clean empirical tail differs from its Gaussian probability by at most .
For fixed and , each full-sample tail count lies between the corresponding clean count and that count plus . Taking the minimum of the two tails and then the infimum over yields Since by the comparison premise, these inequalities imply .
On the deviation event in step 1.2, replacing clean empirical depth by population depth costs at most at each matrix. [F2] and the comparison in step 2.1 therefore imply . Since , and , we have . Choose large enough that . Step 1.1 gives . Retain the actual deficit . Also and step 1.1 give , while ; hence .
Fix and put . If , let . The Gaussian tails at threshold are and ; their minimum is . Step 3.1 therefore gives . The bound places both Gaussian probabilities in the fixed compact interval . On this interval [F4] gives and then . Since and , this implies .
If , [F5] gives almost surely. If , the upper weak tail is zero, contradicting the positive depth lower bound in step 3.1. Hence and the quadratic error is zero. Taking the supremum over is a Borel function of the Borel selector by [F6, F7]; its Lipschitz bound follows by applying the operator-norm inequality to the difference of two candidate matrices. Intersecting the events from steps 1.1–1.2 gives probability at least and the stated bound.
Measurable selection of a matrix-depth maximizer
Statement
For every nonempty finite sample, both the bounded-class and global dense and block-sparse argmax correspondences in Matrix depth and covariance estimators admit Borel measurable selectors as functions of the sample. The covariance output obtained by division by is Borel as well. No computational feasibility is asserted.
Facts & Assumptions
Given: Fix integers , a sample , and, in the sparse case, . Identify matrices with , . First fix and let or , with respectively or . Write .
The Axiom of Choice is inherited through the fixed Gaussian scale in Matrix depth and covariance estimators and The Axiom of Choice. The construction below makes only least choices from fixed finite orders and adds no choice axiom.
Matrix depth and covariance estimators defines empirical depth as the directional infimum of the minimum of two weak-tail counts; both counts include ties.
A matrix-depth maximizer exists on the bounded covariance classes proves that and its empirical argmax fibers are nonempty compact. It applies to any fixed by taking the bound there to be .
Upper semicontinuous real map on a topological space characterizes upper semicontinuity by open strict sublevels, equivalently closed weak superlevels.
The Borel sigma-algebra of a topological space defines the Borel sigma-algebra generated by open sets; in particular closed sets and their finite or countable Boolean combinations are Borel.
Sequential suprema, infima, limsup, liminf, and pointwise limits of measurable functions are measurable: a pointwise limit of measurable real functions is measurable.
For n at least one, open sets, closed sets, compact sets, open balls, boxes, rational open boxes, and rational half-open boxes generate the Borel sigma-algebra on R^n: rational open boxes generate the finite-dimensional Borel sigma-algebra, so a map with Borel real coordinates is Borel.
Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis, The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||, and Cauchy–Schwarz: , with equality exactly for dependent pairs supply norm-attaining eigenvectors for positive semidefinite symmetric matrices and for unit . The block-sparse class in Single-block sparse covariance class and restricted directions has one off-diagonal block of size at most , with a diagonal complement.
Proof
For fixed , each function is continuous. Its nonpositive and nonnegative sets are closed, so their indicators are upper semicontinuous: outside a closed set the indicator is locally zero, and at a point of the set its limsup is at most one. Finite sums and the minimum of two upper semicontinuous maps are upper semicontinuous. The infimum over fixed is also upper semicontinuous because its strict sublevel is the union of the strict sublevels for individual . Thus is jointly upper semicontinuous in . Every directional count minimum belongs to ; the infimum of a nonempty subset of this finite set belongs to the same set. Ties may give depth , so the full grid is retained.
Put . If a positive semidefinite matrix has , a top unit eigenvector gives for every , so the empirical upper weak tail is zero and the dense depth is zero. In the global block-sparse class, write as its symmetric block on some support , , and its diagonal complement. The largest eigenvalue is attained either by a unit eigenvector in that block or by a coordinate vector in the complement; choose the former in a tie when the block is nonempty. Hence a norm-attaining vector has support of size at most or one, extends to a coordinate set of size , and belongs to . The same strict inequality makes the sparse depth zero. This argument selects one appropriate eigenvector and does not claim every eigenvector is supported in a small block.
For and any fixed closed cube , let . This is closed. Indeed its defining superlevel set is closed by step 1.1, and is compact. If , product-open rectangles in the complement of that superlevel set cover . Finitely many matrix-coordinate neighborhoods cover ; intersect their sample-coordinate neighborhoods to obtain a neighborhood of outside . The empty case gives the empty hit set. The same argument with gives a closed set .
Set and for . These are Borel by [F4] and partition , since the maximum exists by [F2] and takes a value in the finite grid by step 1.1. On , the argmax fiber is , so hits a fixed closed cube exactly when .
Take a fixed closed cube containing ; the entry bound in the proof of [F2] permits . Repeatedly bisect each coordinate interval into two closed halves, ordering the child cubes lexicographically. On , starting from , retain the first child cube with . A child exists because the children cover their parent and the parent meets . Inductively every selected-cube event is Borel: if is the event selecting a parent with ordered children , the event selecting is . Each level has finitely many cubes, so its selected center is a finite-valued Borel map. The first-child rule remains unambiguous at overlapping cube boundaries.
For fixed , the sets are nested nonempty compact sets and the cubes have diameter . Their intersection is nonempty: otherwise their complements would cover the first compact set, and a finite subcover would contradict a later set's nonemptiness. The intersection has at most one point because its diameter is zero; denote the point by . Since both it and lie in , is at most the cube diameter and tends to zero. Thus each coordinate of is Borel by [F5], and the matrix-valued map is Borel by [F6]. It belongs to for every sample. Taking proves both original bounded-class selection claims.
The continuous function has a Borel integer majorant , with for . On that stratum, step 1.2 shows that every admissible matrix outside the fixed cap has depth zero. The maximum over the cap is nonnegative, so any cap maximizer is a global maximizer. Apply the explicit construction of steps 1.1–5.1 with for each integer and paste those Borel maps on the Borel strata . For any open set of matrices, the preimage under this pasted map is the countable union, over , of the Borel stratum intersected with the preimage under its fixed-cap Borel selector; hence the pasted map is Borel. This yields a Borel global maximizer in each class. Global argmax fibers need not be compact when the maximal depth is zero; only their compact capped subfibers are used. Division by the fixed preserves coordinatewise Borel measurability, proving the covariance-output claim for bounded and global selectors.
Adaptive truncated covariance has a finite matrix-variance operator bound
Statement
Assume Countable Choice. Let be clean iid observations with mean , nonzero covariance , and finite fourth central moment. For the matrix variance in Matrix variance for covariance estimation, put Suppose , and The same-sample pilot and original scale/selection rule of Adaptive truncated covariance estimator then satisfy Here is ambient dimension; it is not the intrinsic ratio . More precisely, with and , the failure bound is The trace-aware sample condition is sufficient, not necessary. All clean finite-fourth-moment laws remain eligible; no coordinate independence, kurtosis bound, contamination or replacement guarantee is imposed. The broader uniform pilot-accuracy formula in Fixed-scale matrix-truncated covariance deviation under finite matrix variance can be used instead of this sufficient sample condition whenever it establishes the same fixed-scale radius for each required scale.
Facts & Assumptions
Given: Countable Choice, the clean iid model, matrix moments, confidence, bracket and sample-size hypothesis in the statement.
For every scale , the fixed-scale proof provides a true-centered concentration event of failure at most , ; on it and the common pilot-radius event the error is at most . Fixed-scale matrix-truncated covariance deviation under finite matrix variance.
The common prescribed pilot has radius with failure at most . Exact block budget for the covariance geometric-median pilot.
Simultaneous required-scale radius-three bounds imply radius eighteen for the selected estimate; the exact number of required scales is , and a shared pilot event is paid once. Lepski scale selection transfers fixed-scale covariance bounds.
The intrinsic ratio is at least one. The covariance matrix variance ratio is at least one.
Proof
Since by [F4], and the prescribed is admissible. All finite-grid estimates and the selection rule are defined and measurable. Intersect the common pilot event [F2] with the required concentration events [F1]. Their complement has probability at most , by the shared-event conclusion of [F3]. On this intersection all required fixed-scale bounds hold, and [F3] gives the error at most .
The true grid size is and , so . Therefore . This proves the unrounded displayed bound by sharper event budgets, rather than the false assertion that the grid has at most elements. The same deterministic argument applies to any separately proved pilot event and fixed-scale interface as stated.
Remarks
The former assertion for this unknown-mean estimator is false under arbitrary dependence, as proved by Intrinsic matrix variance alone does not control pilot-centered covariance truncation ↗. The separate two-axis example refutes the trace comparison used by the source. A full known-mean finite-matrix-variance concentration bound, without the trace-aware sample condition, is retained in Oracle-truncated covariance and vector concentration under finite matrix variance.
Clean block-sparse Gaussian covariance has squared operator lower rate s log(ep/s) over n
Statement
Assume AC. Fix and integers . There are constants such that if , then The infimum is over Borel maps . This is the single-common-block class, not a row-sparsity class.
Facts & Assumptions
Given: AC, , integers and , and clean iid observations with law for an unknown .
Single-block sparse covariance class and restricted directions: all off-diagonal entries of a candidate covariance lie in one common block of size at most .
Kullback–Leibler divergence between nondegenerate centered Gaussian laws: the KL divergence between positive-definite centered Gaussian laws is .
Additivity of KL divergence for finite product laws: KL divergence of finite product laws is the sum of the component divergences.
Fano’s packing bound with a reference-distribution KL bound: for a uniform finite family with pairwise target separation in a metric space and reference law , the average squared-metric risk of any estimator kernel is at least , where . A classifier with the discrete metric has risk equal to its error probability.
Pinsker’s inequality with event-supremum total variation: under the event-supremum total-variation convention, .
Two-point Le Cam lower bound for squared-error risk: for two scalar targets at distance , every estimator has maximum squared-error risk at least . With binary targets and binary actions, this is a testing-error lower bound.
A measurable function between measurable spaces, The Borel sigma-algebra of a topological space, Randomized procedures as probability kernels, The Dirac set function at a point, and A Dirac set function is a probability measure: a Borel finite-valued classifier defines a deterministic probability kernel by its Dirac law.
Proof
Suppose and . For , let , where . These matrices are diagonal, so [F1] places them in . Since , choose so their largest eigenvalue is at most . Their pairwise operator distance is . Relative to , [F2] and give The inequality follows by integrating from to . By [F3], each -sample KL is at most .
The remaining case with is . Let and , where . The sample-size condition and small make both matrices members of . With , [F2] gives The derivative of the bracket is , proving the inequality. By [F3], choose small enough that the -sample KL is at most . Pinsker [F5] gives total variation at most ; [F6] then gives maximum binary testing error at least . A wrong nearest covariance decision forces error at least , and its decision cells are Borel by finite distance comparisons, so [F7] gives an admissible test kernel. Thus one law has probability at least of squared error at least , which is the required rate.
Suppose , and put and . Since , . Partition of the coordinates other than coordinate into disjoint groups of size . For each word , select its indexed coordinate in every group and form the unit vector with value on those coordinates and zero elsewhere. There are words. Greedily retain a word and delete its Hamming ball of radius . Each ball has at most words. To obtain the binomial sum bound, put ; in , each weight for is at least , and .
Use the diagonal matrices from step 1.1 as the packing and as reference. Choose so their average KL is at most . The Fano factor for , so [F4] gives classification error greater than . Classify an estimator by its nearest covariance, resolving ties by least index. This rule is Borel because its decision cells are finite intersections of strict or weak comparisons of continuous distances, and [F7] turns it into a deterministic test kernel. If it is misclassified, the triangle inequality forces operator error at least . Thus the supremum tail probability is greater than at threshold . Because , , giving the required rate after reducing if needed.
The retained code has pairwise Hamming distance greater than and Here and . Also because and for . Thus , and . Further : if , then and no word is removed by a radius-zero ball; if , the displayed bound gives . Distinct code vectors satisfy .
Define , where . The off-diagonal entries lie in the block formed by coordinate and the selected coordinates, so by [F1]. The perturbation has eigenvalues on and zero on its orthogonal complement. Choose , so ; then every is positive definite and has top eigenvalue at most . For distinct codewords,
Let . The relative perturbation has eigenvalues and zero otherwise. By [F2], The scalar inequality follows by integrating from to . By [F3], the -sample KL to is at most . Since , choose so this KL is at most .
The Fano factor obeys Thus [F4] gives every classifier error greater than . Nearest-covariance classification from any estimator is wrong only when its operator error is at least half the separation from step 3.1, hence at least . The finite nearest-code rule is Borel by finite distance comparisons, so [F7] makes it a classifier kernel. The supremum tail probability at threshold is therefore greater than , proving the rate for .
Choose and . The bounds from steps 2.1, 1.2, and 5.1 cover the cases , , and , respectively, and give probability at least at threshold . Taking the infimum over estimators and combining the cases proves the claim.
Clean Gaussian covariance has a capped squared operator lower rate
Statement
Assume AC. Fix . There are constants such that if , The infimum is over Borel maps . The constants may depend on , but not on or .
In addition, there is such that for every , One may choose and after fixing the constants of the first assertion. Thus the original small-ratio lower bound is retained and the capped extension covers every dimension and sample size.
Facts & Assumptions
Given: AC, , integers , and clean iid observations with law for an unknown .
Bounded-spectrum covariance class: consists of positive semidefinite symmetric matrices with operator norm at most .
Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis and Finite epsilon nets of the Euclidean sphere: a symmetric matrix has operator norm , and the Euclidean unit sphere has a -net of size at most .
Kullback–Leibler divergence between nondegenerate centered Gaussian laws: for positive definite covariance matrices, Gaussian KL equals .
Additivity of KL divergence for finite product laws: KL divergence of finite product laws is the sum of the component divergences.
Fano’s packing bound with a reference-distribution KL bound: for a uniform finite family with pairwise target separation in a metric space and reference law , the average squared-metric risk of any estimator kernel is at least , where . A classifier with the discrete metric has risk equal to its error probability.
Pinsker’s inequality with event-supremum total variation: under the event-supremum total-variation convention, .
Two-point Le Cam lower bound for squared-error risk: for two scalar targets at distance , every estimator has maximum squared-error risk at least . With binary targets and binary actions, this is a testing-error lower bound.
The six hyperbolic functions and their natural domains, Addition formulas, identities, parity, and derivatives of the hyperbolic functions, The real exponential function and the number by a power series, The exponential function is strictly increasing, The natural logarithm as the inverse of the exponential function, Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm, The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t, The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with , Sums, scalar multiples, products and quotients: , , , and when , and The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with : is positive and even, , and on positive arguments; the mean value theorem turns nonnegative derivatives into monotonicity.
A measurable function between measurable spaces, The Borel sigma-algebra of a topological space, Randomized procedures as probability kernels, The Dirac set function at a point, and A Dirac set function is a probability measure: a Borel finite-valued classifier defines a deterministic probability kernel by its Dirac law.
Multivariate normal law, including singular covariance, The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||, and Composition with a Borel measurable outer map preserves measurability: a fixed zero-padding linear map carries a centered Gaussian to the corresponding covariance-block embedding, including singular covariance; compositions with continuous coordinate embeddings and block extractions preserve Borel measurability. The compression norm inequality used below is proved directly from the operator-norm definition.
Proof
First suppose . Put and let range over symmetric sign matrices with zero diagonal and independent entries above the diagonal. For fixed unit , . For , put and . By [F9], and , so the mean value theorem gives ; then and . Evenness gives for all real , so . Since each is a uniform sign and the signs are independent, Chernoff's inequality applied to both signs gives . By [F2], use a -net with at most points; approximating each unit vector changes its quadratic form by at most . Thus . A union bound at gives failure probability at most . At least half of the sign matrices therefore satisfy .
In the finite Hamming cube of upper-triangular signs, greedily retain a good matrix and delete all good matrices within Hamming distance . Each deleted ball contains at most words, where . For , the binomial theorem gives . Each weight with is at least , which proves the ball bound. Greedy deletion retains at least words. The resulting code has pairwise Hamming distance greater than and Here , , and . For distinct code matrices, is eight times their upper-triangular Hamming distance, hence at least .
Now suppose . Set and , where . The condition and small make both matrices members of . With , [F3] gives The derivative of the bracket is , proving the bound. By [F4], the -sample KL is at most ; choose so it is at most .
Set with , where is sufficiently small. Since , the perturbation has norm at most ; choose so . Thus each is positive definite and belongs to by [F1]. If , [F8] gives
Pinsker [F6] gives . By [F7], every binary test has maximum error probability at least . The nearest-covariance test from an arbitrary estimator is wrong only when its operator error is at least ; its two decision cells are Borel by finite distance comparisons, so [F10] makes it an admissible test kernel. Therefore one of the two laws has probability at least of squared error at least . This proves the rate for .
Let be a reference law. For each , the relative perturbation has eigenvalues with and . By [F3], The scalar inequality follows by integrating from zero to and using for . Also and . By [F4], the average -sample KL to is at most . Choose smaller if needed so this is at most .
The Fano factor in [F5] satisfies using and . Thus every classifier of the uniform index has error probability greater than . Classify an estimator by its nearest , resolving ties by least index. This rule is Borel: its decision cell for index is the finite intersection of strict distance comparisons against earlier indices and weak comparisons against later indices. If it is wrong, the triangle inequality and step 2.1 force operator error at least . Thus the supremum tail probability at threshold is greater than . Since , this proves the rate for .
Choose and . Steps 4.1 and 2.2 give a probability lower bound at least at threshold in their respective dimension ranges. Taking the infimum over estimators and combining the ranges proves the first, small-ratio assertion for all dimensions satisfying its premise.
Abbreviate the constants just established by and , and put . If , step 5.1 gives tail probability at least at threshold . Since and , lowering the threshold gives the asserted capped bound in this case.
Suppose and . Put , so and . Let be the zero-padding coordinate isometry. For any Borel ambient matrix estimator , the rule is Borel by [F11]. For any matrix , including a nonsymmetric one, : for each unit , because is an isometry and discards coordinates. Every embeds as by [F1], and [F11] identifies its iid sample with zero-padded observations. Apply the small-ratio result of step 5.1 in dimension to . Since , the ambient supremum tail probability is at least at threshold . This holds for every ambient Borel estimator.
Suppose and . Take and , where . Both are positive definite in and their operator separation is . Put . The scalar KL calculation from step 1.3 and [F3] gives ; the bracket has derivative for . Thus [F4] gives , and [F6] gives total variation at most . Classify an arbitrary Borel estimator by the nearer of these two covariance matrices, resolving ties by the first index. This is a Borel binary test by [F10]. Apply the expected squared-risk theorem [F7] to that test with scalar targets : its squared risks are exactly its error probabilities, so their maximum is at least . A wrong classification forces the original operator error to be at least by the triangle inequality. The ambient maximum tail probability is therefore at least at squared threshold .
The three cases in steps 6.1, 7.1, and 7.2 cover every . Each establishes the same probability constant at threshold for every Borel matrix-valued estimator, so taking their infimum proves the all-regime assertion. The preceding small-ratio result remains unchanged.
Dense Gaussian Huber covariance: high-probability upper and capped lower bounds
Statement
Assume AC. Fix . Let be independent with common law from Gaussian Huber contamination model for covariance estimation, where and is arbitrary. If , , and for a sufficiently large universal , then every Borel measurable dense matrix-depth estimator, from either the global positive semidefinite correspondence or the bounded-class correspondence, from Matrix depth and covariance estimators satisfies with probability at least , uniformly over and .
Such Borel maximizing selectors exist by Measurable selection of a matrix-depth maximizer.
There are constants such that for every and every , The infimum is over all Borel maps . The constants may depend on .
Facts & Assumptions
Given: AC, the Gaussian Huber model, , arbitrary contaminating law , and the stated confidence and sample-size conditions.
Operator error bound for the Gaussian Huber matrix-depth estimator gives the directional operator-error bound for the dense sphere family, for a Borel statistic satisfying the empirical-depth comparison.
Clean Gaussian covariance has a capped squared operator lower rate gives, under AC, the clean tail-risk lower bound of order for all , retaining the original small-ratio result.
Huber covariance modulus lower bound for unrestricted matrix-valued actions: under AC, a clean tail-risk lower bound for all matrix-valued estimators and a finite contamination modulus give the Huber lower bound at threshold , for the same unrestricted action space.
Bounded-spectrum covariance class: every is positive semidefinite and has operator norm at most .
Measurable selection of a matrix-depth maximizer supplies Borel maximizers for the global and bounded-class correspondences. A global maximizer dominates in depth; in the bounded case belongs to the search class by the target spectrum bound.
Proof
By [F7], Borel maximizers exist in both versions and every such maximizer satisfies the comparison premise in [F1]. Take , one support , and in [F1]. For a real symmetric matrix , [F5] gives . Thus . Squaring and using gives the stated upper rate.
The all-regime clean lower bound [F2] supplies constants such that the clean tail-risk premise in [F4] holds for every with and . By [F3], the contamination modulus is at least . It is finite because for every pair in the bounded class.
Apply [F4] with the same unrestricted matrix-valued estimator class as in the Statement and the inputs from step 1.2. Its threshold is at least . Since , . Lowering to this capped threshold only enlarges the event, and the probability lower bound is . Renaming the two positive constants proves the all-dimension lower assertion. Its original uncapped rate remains valid whenever .
Authoring status
The lower proof uses the current batch-17 and batch-31 supplier bodies. The local measurable-selection proof discharges the selector-existence obligation for both global and bounded-class matrix-depth versions.
Single-block sparse Gaussian Huber covariance: high-probability upper and low-ratio lower bounds
Statement
Assume AC. Fix and an integer . Let be independent with common law from Gaussian Huber contamination model for covariance estimation, where and is arbitrary. If , , and for sufficiently large universal , then every Borel measurable restricted matrix-depth estimator, from either the global single-block correspondence or the bounded-class correspondence, satisfies with probability at least , uniformly over and .
Such Borel maximizing selectors exist by Measurable selection of a matrix-depth maximizer.
There are constants such that whenever , for every , The constants may depend on . The class is one common correlated block, not a row-sparsity class. The infimum is over all Borel maps .
Facts & Assumptions
Given: AC, , , the Gaussian Huber model, and the stated confidence and sample-size restrictions.
Operator error bound for the Gaussian Huber matrix-depth estimator gives the directional error bound over a union of coordinate spheres, for a Borel statistic satisfying the empirical-depth comparison.
Clean block-sparse Gaussian covariance has squared operator lower rate s log(ep/s) over n gives, under AC, the clean tail-risk lower bound of order when its sample-size condition holds.
Huber covariance modulus lower bound for unrestricted matrix-valued actions: under AC, a clean tail-risk lower bound for all matrix-valued estimators and a finite contamination modulus give the Huber lower bound at threshold , for the same unrestricted action space.
Single-block sparse covariance class and restricted directions: off-diagonal support lies in one common coordinate block of size at most , and the operator norm is bounded by .
The set of -element subsets and the binomial coefficient , for ; hence , the quotient is a natural number, and , The factorial and the falling factorial , defined by recursion in , The canonical natural of a field, and Laws of finite sums and products in , and : identifying naturals with their real embeddings, for integers , and .
The natural logarithm as the inverse of the exponential function, Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm, The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t, Sums, scalar multiples, products and quotients: , , , and when , The second fundamental theorem: if is differentiable on with and is integrable, then , The real exponential function and the number by a power series, The exponential function is strictly increasing, Integer powers , and Laws of integer exponents: is increasing, , and the integral of on is by the antiderivative .
Every nonempty finite set of reals has a maximum and a minimum: a nonempty finite set of real numbers has a maximum; applying this to the absolute diagonal entries gives a coordinate attaining their largest absolute value.
Measurable selection of a matrix-depth maximizer supplies Borel maximizers for the global and bounded-class correspondences. A global maximizer dominates in depth; in the bounded case belongs to the search class by the target spectrum bound.
Proof
By [F7], Borel maximizers exist in both versions and satisfy [F1]'s empirical-depth comparison. Put and . By [F8], . Since for and , summing over these intervals and using [F9] gives . Exponentiating with [F9] yields , hence and . Enumerate the coordinate sets of size and take , in [F1]. If , choose blocks of size at most supporting the off-diagonal entries of its two summands, and let be their union. Then , entries between and vanish, and the block on is diagonal. Thus is block diagonal on , with symmetric block and diagonal block on . Its operator norm is the larger block norm: for , is the sum of the squared norms of the two block outputs, and a norm-maximizing vector in either nonempty finite-dimensional block attains its block norm. If and either or , [F5] gives a unit eigenvector attaining , supported in . If and , then , and any coordinate unit vector belongs to because ; it attains . In every remaining case and (with the empty-block norm set to zero). Write . By [F10] choose with . For every unit , , and the coordinate vector attains equality. By [F5], therefore attains . In either case some unit vector attaining has support of size at most . Since , its support extends to a set of size exactly , so the vector belongs to . Conversely every unit vector in is among all unit vectors, hence by [F5]. Finally, Squaring [F1]'s bound proves the displayed upper rate after adjusting .
By [F2], the clean lower premise holds at for sufficiently small , with a fixed positive probability . By [F3], the contamination modulus is at least . It is finite because for all pairs in the bounded class.
Apply [F4] with these clean and modulus bounds and the unrestricted matrix-valued estimator class in the Statement. Its threshold is at least a constant multiple of , and the probability lower bound is . Lowering the threshold only enlarges the event, which proves the lower assertion for the event probabilities in the Statement.
Authoring status
The lower proof uses the current batch-17 and batch-31 supplier bodies. The local measurable-selection proof discharges the selector-existence obligation for both global and bounded-class matrix-depth versions.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Philippe Rigollet, 18.S997 High-Dimensional Statistics Lecture Notes, MIT OpenCourseWare, Chapter 4
- Joel A. Tropp, An Introduction to Matrix Concentration Inequalities, §3.3, equation (3.3.3), printed p.34
- Mengjie Chen, Chao Gao and Zhao Ren, Robust Covariance and Scatter Matrix Estimation under Huber's Contamination Model, Proposition 3.1
- Rick Durrett, Probability: Theory and Examples, 5th ed., §1.6
- Mengjie Chen, Chao Gao and Zhao Ren, Robust Covariance and Scatter Matrix Estimation under Huber's Contamination Model, Lemma 7.3
- Mengjie Chen, Chao Gao and Zhao Ren, Robust Covariance and Scatter Matrix Estimation under Huber's Contamination Model, §3.2
- Stanislav Minsker and Xiaohan Wei, Estimation of the Covariance Structure of Heavy-Tailed Distributions, §2
- Joel A. Tropp, An Introduction to Matrix Concentration Inequalities, §§3.2–3.3 and §§6.6–6.7, especially Lemma 6.6.2
- Mengjie Chen, Chao Gao and Zhao Ren, Robust Covariance and Scatter Matrix Estimation under Huber's Contamination Model, §3.4
- Mengjie Chen, Chao Gao and Zhao Ren, Robust Covariance and Scatter Matrix Estimation under Huber's Contamination Model, §2
- Minsker and Wei, Estimation of the Covariance Structure of Heavy-Tailed Distributions
- Stanislav Minsker and Xiaohan Wei, Estimation of the Covariance Structure of Heavy-Tailed Distributions, §§5.3–5.5
- Joel A. Tropp, An Introduction to Matrix Concentration Inequalities, §§6.6–6.7
- Mengjie Chen, Chao Gao and Zhao Ren, Robust Covariance and Scatter Matrix Estimation under Huber's Contamination Model, §3.1
- Stanislav Minsker and Xiaohan Wei, Estimation of the Covariance Structure of Heavy-Tailed Distributions, Lemma 2.1 and §§4.1–4.2
- Stanislav Minsker and Xiaohan Wei, Estimation of the Covariance Structure of Heavy-Tailed Distributions, Theorem 2.1 and §4.3
- Mengjie Chen, Chao Gao and Zhao Ren, Robust Covariance and Scatter Matrix Estimation under Huber's Contamination Model, §3.1 and §3.2
- Mengjie Chen, Chao Gao and Zhao Ren, Robust Covariance and Scatter Matrix Estimation under Huber's Contamination Model, §5 and supplement
- Philippe Rigollet, 18.S997 High-Dimensional Statistics Lecture Notes, MIT OpenCourseWare, Chapter 5, §5.3
- Mengjie Chen, Chao Gao and Zhao Ren, Robust Covariance and Scatter Matrix Estimation under Huber's Contamination Model, proof of Theorems 3.2 and 3.7
- Mengjie Chen, Chao Gao and Zhao Ren, Robust Covariance and Scatter Matrix Estimation under Huber's Contamination Model, Theorem 7.1 and proofs of Theorems 3.1 and 3.6
- Mengjie Chen, Chao Gao and Zhao Ren, Robust Covariance and Scatter Matrix Estimation under Huber's Contamination Model, proof of Theorem 3.7
- Philippe Rigollet, 18.S997 High-Dimensional Statistics Lecture Notes, MIT OpenCourseWare, Chapter 5
- Mengjie Chen, Chao Gao and Zhao Ren, Robust Covariance and Scatter Matrix Estimation under Huber's Contamination Model, proof of Theorem 3.2
- Mengjie Chen, Chao Gao and Zhao Ren, Robust Covariance and Scatter Matrix Estimation under Huber's Contamination Model, Theorems 3.1, 3.2 and 5.1
- Mengjie Chen, Chao Gao and Zhao Ren, Robust Covariance and Scatter Matrix Estimation under Huber's Contamination Model, Theorems 3.6, 3.7 and 5.1