Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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 p≥1, write Sp−1:={u∈Rp:∥u∥2=1}. Let U be a nonempty subset of this sphere, let P be a probability law on Rp, and let Γ⪰0. Its matrix depth relative to U is DU(Γ,P):=inf⁡u∈Umin⁡{P((uTX)2≤uTΓu),P((uTX)2≥uTΓu)}, where X has law P. Both weak inequalities include ties.

For observations x1,…,xn, let Pn:=1n∑i=1nδxi on the Borel sigma-algebra of Rp (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 n−1∑i1=1; hence Pn is a probability law by Probability measures and probability spaces. Let β>0 be the constant of The Gaussian matrix-depth scale constant exists uniquely. The global dense depth correspondence is Argmax⁡Γ⪰0DSp−1(Γ,Pn), over symmetric positive semidefinite matrices. For 1≤s≤p/2, define the global single-block class Fp,s:=⋃c>0Fp,s(c) and the global single-block sparse correspondence Argmax⁡Γ∈Fp,sDUs(Γ,Pn). These are the unrestricted-spectrum versions; no known spectral bound is needed to define their selectors.

For known M>0, the dense bounded-class depth correspondence is Argmax⁡Γ∈Fp(βM)DSp−1(Γ,Pn). For known integer 1≤s≤p/2, the single-block sparse version is Argmax⁡Γ∈Fp,s(βM)DUs(Γ,Pn), where the classes and Us 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

Used by

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