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

The split-sample univariate trimmed mean is total and Borel measurable

Statement

Fix an integer N≥1, 0<ε≤1/4, and the split-sample rule in Split-sample univariate winsorized trimmed mean. It defines a total continuous, hence Borel measurable, map R2N→R for every admissible pair of observed samples, including tied values.

Facts & Assumptions

Given: N≥1, 0<ε≤1/4, and two real samples of length N.

[F1]

The algorithm uses ranks r(u)=⌈uN⌉, sets its cutoffs to the second-half order statistics at ranks r(ε) and r(1−ε), clips first-half observations with ϕα,β(x)=min⁡{β,max⁡{α,x}}, and returns their finite average (Split-sample univariate winsorized trimmed mean).

[F2]

A map between measurable spaces is Borel when preimages of Borel sets are Borel; open sets belong to the Borel sigma-algebra (A measurable function between measurable spaces, The Borel sigma-algebra of a topological space).

Proof

technique · direct

Given: N≥1, 0<ε≤1/4, and two real samples of length N.

1.1F1givenalgebra

Since 0<ε≤1/4, both ε and 1−ε lie in (0,1]. Thus 1≤r(ε),r(1−ε)≤N, and monotonicity of the ceiling gives r(ε)≤r(1−ε). The corresponding sorted values therefore satisfy α≤β, so every clipped value in [F1] is a finite real and the output is defined for every input, including ties.

1.2F1givenalgebra

For a scalar list y1,…,yN, its kth order statistic equals min⁡J⊆{1,…,N}, ∣J∣=kmax⁡j∈Jyj: every k-subset has a maximum at least the kth smallest value, while the indices of the first k sorted values attain it. This is a finite minimum of finite maxima of coordinate functions, hence is continuous in the list. The two cutoff maps in [F1] are therefore continuous; ϕα,β(x) is continuous in (α,β,x) because it is a composition of minimum and maximum, and the final finite average is continuous. Hence the estimator is a continuous map on R2N.

2.1F2step 1.1step 1.2∎

For any Borel target set, its preimage under a continuous map is Borel: preimages of open sets are open, and the sets whose preimages are Borel form a sigma-algebra containing all open sets. By [F2] this is exactly Borel measurability, so the total estimator from step 1.1 is Borel.

Depends on

Used by

Cited to discharge well-definedness by Split-sample univariate winsorized trimmed mean.

Dependency tree · two levels

7 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