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.
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.
Depends on
- Matrix depth and covariance estimators
- Bounded-spectrum covariance class
- Single-block sparse covariance class and restricted directions
- The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||
- Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis
- Cauchy–Schwarz: $|\langle x,y\rangle|\le\|x\|\,\|y\|$, with equality exactly for dependent pairs
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ 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
- Upper semicontinuous real map on a topological space
- Semicontinuous extreme value theorem on compact Euclidean sets
- A closed subset of a compact metric space is compact
- The Axiom of Choice
Used by
- Measurable selection of a matrix-depth maximizer Lemma
- Operator error bound for the Gaussian Huber matrix-depth estimator Lemma
Cited to discharge well-definedness by Matrix depth and covariance estimators.
Dependency tree · two levels
63 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 and §3.2 (standard reference, not scraped)