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.
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.
Depends on
- Bounded-spectrum covariance class
- Single-block sparse covariance class and restricted directions
- The Borel sigma-algebra of a topological space
- The Dirac set function at a point
- A Dirac set function is a probability measure
- Nonnegative scalar multiples and countable weighted sums of measures
- Nonnegative scalar multiples and countable weighted sums of measures are measures
- Probability measures and probability spaces
- 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||
- The Gaussian matrix-depth scale constant exists uniquely
- The Axiom of Choice
Used by
- A matrix-depth maximizer exists on the bounded covariance classes Lemma
- Measurable selection of a matrix-depth maximizer Lemma
- Operator error bound for the Gaussian Huber matrix-depth estimator Lemma
- The scaled Gaussian covariance has matrix depth at least one half Lemma
- Dense Gaussian Huber covariance: high-probability upper and capped lower bounds Theorem
- Single-block sparse Gaussian Huber covariance: high-probability upper and low-ratio lower bounds Theorem
Dependency tree · two levels
29 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Mengjie Chen, Chao Gao and Zhao Ren, Robust Covariance and Scatter Matrix Estimation under Huber's Contamination Model, §3.1 (standard reference, not scraped)