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.
Totality and measurability of the repaired multivariate trimmed-mean selector
Statement
For each fixed admissible and each observed data tuple in , the procedure Adaptive multivariate trimmed mean returns a unique vector in . As a function of the observed data tuple it is Borel measurable. The fallback branch covers the case where no dyadic tail intersection is nonempty; the all-scale branch covers the case where every tail intersection is nonempty.
Facts & Assumptions
Given: Integers , fixed , and an arbitrary data tuple in .
The algorithm's directional order statistics, winsorized centers, slabs, tail intersections, and three output branches are as in Adaptive multivariate trimmed mean.
The Euclidean unit sphere and closed unit ball are compact, and a closed bounded subset of is compact (Euclidean spheres and closed balls as subspaces of , 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).
A continuous real-valued function on a nonempty compact space attains a minimum (A continuous image of a compact space is compact; a continuous real-valued map on a nonempty compact space attains a maximum and a minimum; and a continuous bijection from a compact space to a Hausdorff space is a homeomorphism).
Cauchy–Schwarz holds for the Euclidean inner product; consequently (Cauchy–Schwarz: , with equality exactly for dependent pairs, The Euclidean inner product on , Euclidean spheres and closed balls as subspaces of ).
In a compact metric space, every family of closed sets with the finite intersection property has nonempty intersection (A metric space is compact if and only if every family of closed subsets with the finite intersection property has nonempty intersection).
Rational -tuples are countable and dense, and a nonempty countable set has an enumeration by ( is a countable dense subset of , and rational open boxes form a countable basis, A nonempty set is at most countable iff it is a surjective image of ).
Borel sets form a sigma-algebra, a map is Borel when preimages of Borel sets are Borel, pointwise limits of measurable real functions are measurable, and rational open boxes form a countable basis of (The Borel sigma-algebra of a topological space, A measurable function between measurable spaces, Sequential suprema, infima, limsup, liminf, and pointwise limits of measurable functions are measurable, is a countable dense subset of , and rational open boxes form a countable basis).
A continuous map from a compact metric space to a metric space is uniformly continuous (Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous).
Proof
Given: Integers , fixed , and an arbitrary data tuple in .
Fix the data tuple and put . Every projected observation and each order-statistic endpoint lies in , so . Hence implies for every unit and by [F4]. Each order statistic of a finite list equals at rank : every such maximum is at least the th smallest entry, and the first indices attain it. Thus the directional order statistics, clipping endpoints, and are continuous in for fixed . Each is a closed convex slab; intersections preserve these properties. Therefore and every are closed and convex; a nonempty is bounded by the displayed radius at , hence compact by [F2].
Since , is upward closed. If is nonempty and proper, choose and ; upward closure forces , and the least point of the nonempty finite set is least in . If , the nested nonempty compact sets have the finite-intersection property inside compact , so [F5] gives a nonempty compact intersection. This intersection is exactly , since the constraints in range over all . Each nonempty branch set (a least-index or the all-scale intersection) is compact and convex, so its norm attains a minimum by [F3]. If distinct both minimize squared norm, then is smaller, a contradiction; the minimum-norm point is unique. The empty- fallback is the defined first-half mean. Thus every branch is total and single-valued.
For fixed , define . It is continuous: the maximand is jointly continuous by step 1.1, the sphere is compact by [F2], and on a compact neighborhood of any times the sphere [F8] gives uniform continuity, which bounds the change in the maximum by the supremum change of the maximand. Also, , and is convex in as a maximum of absolute affine functions minus constants. Put for or . If , no first-half projection is clipped, so and , where . On any compact neighborhood of this identity makes the high-scale terms tend uniformly to ; for they are eventually below , and for eventually below . Thus the high-scale supremum is locally a finite maximum. For the all-integer index set, define using clipping to and no error allowance; the same compact-sphere maximum argument shows is continuous. Expanding both clipping endpoints by changes each clipped observation by at most , so uniformly in . On a compact neighborhood, all scales therefore have supremum between and , while for all sufficiently large the scales are below . Hence is a local uniform limit of the continuous finite maxima and is continuous. Being a supremum of convex functions, is convex in .
For , every satisfies by step 1.1; for , every feasible lies in and has norm at most . These radii are positive and continuous. Since , its nonemptiness is equivalent to , where . The minimum exists by [F2], [F3]. It is continuous in : on a compact neighborhood of any , [F8] makes uniformly continuous in uniformly over the compact unit ball, and the difference of two minima is bounded by the supremum of the corresponding function differences. Thus each event is Borel.
Fix one such branch index set and write . By [F6], enumerate a countable dense rational subset of and set . The radial map is continuous and is the identity on the unit ball, so is dense in that ball. Let and, for each integer , minimize over . The function is jointly continuous and strictly convex in : is convex by step 2.2, its positive part is convex, and makes the quadratic strictly convex. Compactness and [F3] give a unique minimizer . The value is Borel as a countable infimum of continuous functions and equals the minimum by density and continuity. For each integer , put . The rational points in [F6] give , so is Borel. Such indices exist by density; the least one's level set is , and is Borel because each open-set preimage is the union of the Borel level sets whose values lie in that open set. Strong convexity gives : apply the quadratic identity , convexity of the penalty, minimality, and let . Hence , so these Borel maps converge pointwise to . Each selected map is countably valued with Borel level sets, so its coordinate functions are Borel; [F7] makes their pointwise limits measurable. Rational open boxes form a countable basis by [F6], so is Borel. For each coordinate , the pair is Borel because inverse images of rational rectangles are intersections of coordinate preimages and those rectangles form a countable basis of . Multiplication is continuous, so its composition with this pair map is Borel by the inverse-image definition; hence is Borel.
On the Borel event , let be its unique minimum-norm point from step 2.1 and put . Comparing the penalized minimum with the feasible gives and . The sequence lies in the compact closed ball of radius by [F2]. Every sequence in a compact metric space has a convergent subsequence: if no point had infinitely many terms in every neighborhood, neighborhoods containing only finitely many term indices would cover the ball, contradicting a finite subcover; if one point did have infinitely many terms in every neighborhood, choosing the least successive indices in shrinking balls would give a convergent subsequence. Thus every subsequence has a convergent subsubsequence. By continuity of , each cluster point is feasible; the norm bound makes its norm no greater than , so uniqueness in step 2.1 forces every cluster point to equal . The full sequence therefore converges to : otherwise a subsequence staying a fixed positive distance away would have a different cluster point. The maps equal to on and off it are Borel: for an open set their inverse image is the branch-event intersection with the Borel inverse image under , with added exactly when belongs to the open set. They converge everywhere, to on and to off it; their pointwise limit is Borel by [F7].
The events , , and are respectively countable intersections or combinations of the Borel nonemptiness events in step 3.1, so they are Borel by [F7]. On each such event the algorithm uses the corresponding Borel branch selector from step 5.1 or the continuous first-half mean. For every open target set, its inverse image under the piecewise map is the countable union of each branch event intersected with that branch map's Borel inverse image; it is Borel. Step 2.1 proves all branches defined and single-valued, so the complete output map is total and Borel.
Depends on
- Adaptive multivariate trimmed mean
- The Euclidean inner product $\langle x,y\rangle = \sum_{k<n} x_k y_k$ on $\mathbb{R}^n$
- Euclidean spheres and closed balls as subspaces of $\mathbb{R}^n$
- 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
- Open cover, subcover, compact metric space, and compact subset of a metric space
- A continuous image of a compact space is compact; a continuous real-valued map on a nonempty compact space attains a maximum and a minimum; and a continuous bijection from a compact space to a Hausdorff space is a homeomorphism
- Cauchy–Schwarz: $|\langle x,y\rangle|\le\|x\|\,\|y\|$, with equality exactly for dependent pairs
- A metric space is compact if and only if every family of closed subsets with the finite intersection property has nonempty intersection
- Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous
- $\mathbb{Q}^n$ is a countable dense subset of $\mathbb{R}^n$, and rational open boxes form a countable basis
- A nonempty set is at most countable iff it is a surjective image of $\mathbb{N}$
- The Borel sigma-algebra of a topological space
- A measurable function between measurable spaces
- Sequential suprema, infima, limsup, liminf, and pointwise limits of measurable functions are measurable
Used by
- Exact recovery by the multivariate trimmed mean at zero covariance Lemma
- The multivariate trimmed-mean rate follows from a correct-scale slab event Lemma
- Correct-scale slab bound for multivariate trimming Proposition
- Multivariate trimmed-mean bound under sample replacement Theorem
Cited to discharge well-definedness by Adaptive multivariate trimmed mean.
Dependency tree · two levels
94 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
- Gábor Lugosi and Shahar Mendelson, Robust Multivariate Mean Estimation: The Optimality of Trimmed Mean, estimator definition and §4 (standard reference, not scraped)
- Gábor Lugosi, Mean Estimation in High Dimension, §3.2 (standard reference, not scraped)