Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-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.

Totality and measurability of the repaired multivariate trimmed-mean selector

Statement

For each fixed admissible d,N,ε and each observed data tuple in (Rd)2N, the procedure Adaptive multivariate trimmed mean returns a unique vector in Rd. 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 d,N≥1, fixed ε∈(0,1], and an arbitrary data tuple in (Rd)2N.

[F1]

The algorithm's directional order statistics, winsorized centers, slabs, tail intersections, and three output branches are as in Adaptive multivariate trimmed mean.

[F5]

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).

[F6]
[F7]

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 Rd (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, Qn is a countable dense subset of Rn, and rational open boxes form a countable basis).

[F8]

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

technique · direct

Given: Integers d,N≥1, fixed ε∈(0,1], and an arbitrary data tuple in (Rd)2N.

1.1F1F2F4algebra

Fix the data tuple x and put M(x)=max⁡i{∥X~i∥2,∥Y~i∥2}. Every projected observation and each order-statistic endpoint lies in [−M(x),M(x)], so ∣UQ(v;x)∣≤M(x)+Q. Hence z∈Γ(Q) implies ∣⟨z,v⟩∣≤M(x)+(1+2ε)Q for every unit v and ∥z∥2≤M(x)+(1+2ε)Q by [F4]. Each order statistic of a finite list a1,…,aN equals min⁡∣J∣=kmax⁡j∈Jaj at rank k: every such maximum is at least the kth smallest entry, and the first k indices attain it. Thus the directional order statistics, clipping endpoints, and UQ(v;x) are continuous in (x,v) for fixed Q. Each Γ(v,Q) is a closed convex slab; intersections preserve these properties. Therefore Γ(Q) and every Kj are closed and convex; a nonempty Kj is bounded by the displayed radius at Q=2j, hence compact by [F2].

2.1F1F2F3F5step 1.1choosealgebra

Since Kj⊆Kj+1, S={j:Kj≠∅} is upward closed. If S is nonempty and proper, choose j0∈S and j1∉S; upward closure forces j1<j0, and the least point of the nonempty finite set S∩{j1+1,…,j0} is least in S. If S=Z, the nested nonempty compact sets K0⊇K−1⊇K−2⊇⋯ have the finite-intersection property inside compact K0, so [F5] gives a nonempty compact intersection. This intersection is exactly ⋂i∈ZΓ(2i), since the constraints in K−n range over all i≥−n. Each nonempty branch set (a least-index Kj or the all-scale intersection) is compact and convex, so its norm attains a minimum by [F3]. If distinct z,w both minimize squared norm, then ∥(z+w)/2∥22=(∥z∥22+∥w∥22)/2−∥z−w∥22/4 is smaller, a contradiction; the minimum-norm point is unique. The empty-S fallback is the defined first-half mean. Thus every branch is total and single-valued.

2.2F1F2F8step 1.1algebra

For fixed Q>0, define gQ(x,z)=max⁡v∈Sd−1{∣⟨z,v⟩−UQ(v;x)∣−2εQ}. 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 (x,z) times the sphere [F8] gives uniform continuity, which bounds the change in the maximum by the supremum change of the maximand. Also, Γ(Q)={z:gQ(x,z)≤0}, and gQ is convex in z as a maximum of absolute affine functions minus constants. Put gI(x,z)=sup⁡i∈Ig2i(x,z) for I=Ij={i∈Z:i≥j} or I=Z. If Q≥2M(x), no first-half projection is clipped, so UQ(v;x)=⟨Xˉ,v⟩ and gQ(x,z)=∥z−Xˉ∥2−2εQ, where Xˉ=N−1∑iX~i. On any compact neighborhood of (x,z) this identity makes the high-scale terms tend uniformly to −∞; for Ij they are eventually below g2j, and for I=Z eventually below g1. Thus the high-scale supremum is locally a finite maximum. For the all-integer index set, define g0 using clipping to [αv,βv] and no error allowance; the same compact-sphere maximum argument shows g0 is continuous. Expanding both clipping endpoints by Q changes each clipped observation by at most Q, so ∣gQ−g0∣≤(1+2ε)Q uniformly in (x,z). On a compact neighborhood, all scales i<−m therefore have supremum between g0 and g0+(1+2ε)2−m, while for all sufficiently large m the scales i>m are below g1. Hence gI is a local uniform limit of the continuous finite maxima max⁡{g0,g2i:−m≤i≤m} and is continuous. Being a supremum of convex functions, gI is convex in z.

3.1F2F3F8step 1.1step 2.2

For I=Ij, every z∈Kj satisfies ∥z∥2≤Rj(x)=M(x)+(1+2ε)2j by step 1.1; for I=Z, every feasible z lies in Γ(1) and has norm at most R∞(x)=M(x)+1+2ε. These radii are positive and continuous. Since KI(x)={z:gI(x,z)≤0}, its nonemptiness is equivalent to mI(x)≤0, where mI(x)=min⁡∥w∥2≤1gI(x,RI(x)w). The minimum exists by [F2], [F3]. It is continuous in x: on a compact neighborhood of any x, [F8] makes (x,w)↦gI(x,RI(x)w) uniformly continuous in x 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 {x:KI(x)≠∅}={x:mI(x)≤0} is Borel.

4.1F2F3F6F7step 2.2step 3.1

Fix one such branch index set I and write R=RI(x). By [F6], enumerate a countable dense rational subset (ra) of Qd and set da=ra/max⁡{1,∥ra∥2}. The radial map is continuous and is the identity on the unit ball, so (da) is dense in that ball. Let hI(x,w)=gI(x,Rw) and, for each integer λ≥1, minimize Jλ,I(x,w)=R2∥w∥22+λmax⁡{hI(x,w),0} over ∥w∥2≤1. The function is jointly continuous and strictly convex in w: hI is convex by step 2.2, its positive part is convex, and R>0 makes the quadratic strictly convex. Compactness and [F3] give a unique minimizer wλ,I(x). The value bλ,I(x)=inf⁡aJλ,I(x,da) is Borel as a countable infimum of continuous functions and equals the minimum by density and continuity. For each integer s≥1, put Aa,s={x:Jλ,I(x,da)<bλ,I(x)+1/s}. The rational points in [F6] give Aa,s=⋃q∈Q{x:Jλ,I(x,da)<q}∩{x:bλ,I(x)>q−1/s}, so Aa,s is Borel. Such indices exist by density; the least one's level set is Aa,s∖⋃b<aAb,s, and x↦da(x,s) 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 Jλ,I(x,y)−Jλ,I(x,wλ,I)≥R2∥y−wλ,I∥22: apply the quadratic identity ∥(1−t)w+ty∥22=(1−t)∥w∥22+t∥y∥22−t(1−t)∥y−w∥22, convexity of the penalty, minimality, and let t↓0. Hence ∥da(x,s)−wλ,I(x)∥2<1/(Rs), so these Borel maps converge pointwise to wλ,I. 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 wλ,I is Borel. For each coordinate j, the pair (RI(x),wλ,I,j(x)) is Borel because inverse images of rational rectangles are intersections of coordinate preimages and those rectangles form a countable basis of R2. Multiplication is continuous, so its composition with this pair map is Borel by the inverse-image definition; hence zλ,I(x)=RI(x)wλ,I(x) is Borel.

5.1F2F7step 2.1step 2.2step 3.1step 4.1

On the Borel event EI={x:KI(x)≠∅}, let z∗(x) be its unique minimum-norm point from step 2.1 and put w∗=z∗/R. Comparing the penalized minimum with the feasible w∗ gives ∥zλ,I(x)∥2≤∥z∗(x)∥2 and max⁡{gI(x,zλ,I(x)),0}≤∥z∗(x)∥22/λ. The sequence zλ,I(x) lies in the compact closed ball of radius R(x) 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 gI, each cluster point is feasible; the norm bound makes its norm no greater than ∥z∗(x)∥2, so uniqueness in step 2.1 forces every cluster point to equal z∗(x). The full sequence therefore converges to z∗(x): otherwise a subsequence staying a fixed positive distance away would have a different cluster point. The maps equal to zλ,I on EI and 0 off it are Borel: for an open set their inverse image is the branch-event intersection with the Borel inverse image under zλ,I, with EIc added exactly when 0 belongs to the open set. They converge everywhere, to z∗ on EI and to 0 off it; their pointwise limit is Borel by [F7].

6.1F1F7step 2.1step 3.1step 5.1∎

The events S=∅, S=Z, and min⁡S=j 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

Used by

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