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.
Univariate trimmed-mean bound under sample replacement
Statement
Assume Countable Choice. Let be an absolutely continuous real random variable with mean and finite positive variance (Moments, variance, and covariance on a probability space). Let be iid clean copies of , and let be a sample-replacement version with at most changed coordinates in total (Adversarial sample replacement). Let , , , and
Apply Split-sample univariate winsorized trimmed mean with these parameters. For the centered variable , define, for ,
and, for , define
Here is the raw centered-tail functional, distinct from the excess-tail lower-bound functional. The claims are
and
Facts & Assumptions
Given: Countable Choice, the absolutely continuous centered clean variable , the iid halves and replacement budget, and the displayed parameter domain.
Apply An absolutely continuous upper quantile has its specified tail mass to the absolutely continuous variable . The threshold set defining is the translate by of the one defining , so and , for . Countable Choice is retained from that supplier (The Axiom of Countable Choice ()).
Adversarial sample replacement allows at most changes in either half. Split-sample univariate winsorized trimmed mean uses nearest-rank quantiles and clipping; The split-sample univariate trimmed mean is total and Borel measurable makes the output measurable and total.
The proof of Bernstein inequality for bounded independent sums, step 2.1, establishes the one-sided bound for centered independent summands with and total variance . In particular, a centered average of variance at most has upper or lower deviation at most outside probability , by substituting this threshold into the displayed bound. The zero-variance case is deterministic.
Iid event indicators have the binomial distribution (Identical distribution and IID families, Bernoulli random variables and binomial random variables as sums of independent Bernoulli trials); Markov's inequality is Markov's inequality for random variables. Expectations and variances have their usual integral definitions (Expectation of a nonnegative or integrable random variable, Moments, variance, and covariance on a probability space).
Proof
Given: The objects in the Statement. Write , , , and ; step 1.1 verifies that centering the data shifts the estimator output by .
Shifting every clean and observed coordinate by shifts both order-statistic cutoffs, every clipped value, and the output by , so it suffices to analyze the centered data . By [F1], for each the quantile has and . Thus : if , use ; if , use . For any event , : when , this follows by expanding , and the zero-probability case is immediate. Also is nondecreasing, since its tail sets expand with , and by [F1] and this inequality. For a lower clipping endpoint with , put . If , . If , centering implies ; hence and the clipping excess is at most . The symmetric upper-endpoint argument is identical. For a deterministic clip , with , and because clipping is 1-Lipschitz. Thus ; also since both values lie in .
First use inner endpoints and outer endpoints . Require each of the two inner clean tail counts to exceed and each outer count to be less than . Put . Since , [F3] for the binomial counts bounds each inner failure by , and each outer failure by . The two rational functions are increasing for , as direct differentiation shows, so their minima are their values at zero. Thus all four count conditions hold outside probability , since . After changes the inner counts are still strictly greater than and outer counts strictly less than . Integer counts and the ranks , therefore give and . For example fewer than values below an outer lower endpoint means at most such values, while more than values above an inner upper endpoint means at least such values. These strict inequalities cover noninteger ranks and the integral boundary without a rounding loss.
On the count event, monotonicity of clipping endpoints bounds the clean first-half clipped average above by the average of and below by the average of . Step 1.1 bounds and , their variances by , and their interval widths by . These comparison variables have fixed endpoints, so their deviation events are functions of the clean half and do not rely on the corrupted cutoffs being independent of it. Apply [F3] at separately to the two comparisons. As , each deviation is at most . Their total exceptional probability is .
Write , . Replacing at most first-half points changes the clipped average by at most . If , . If both endpoints are positive, use and the same upper-tail bound; if both are negative, use and its lower-tail bound. By monotonicity . Combining this with step 2.1 and the two exceptional probabilities proves the first displayed bound with its exact constants and , uniformly over every admissible sample-dependent replacement.
For the second bound put and keep the same inner quantiles but use wider outer endpoints . Use the same count thresholds . Since , the inner downward gap is at least from mean , and the outer upward gap is at least from mean . The function increases for , so [F3] bounds each inner failure by and each outer failure by . The same strict rank argument of step 1.2 brackets the corrupted cutoffs. For the fixed comparison clips, step 1.1 gives directional bias at most , variance at most and width at most . Bernstein at therefore bounds each directional clean-average noise by . The replacement shift is at most . The total error is consequently at most . Its exceptional probability is at most , because the first two terms sum to at most . This proves the second assertion.
Remarks
The source distinguishes an excess-tail lower-bound functional from the raw-tail upper-bound functional used here. The former transcription into this theorem was false; The excess-tail functional cannot upper-bound the trimmed mean gives a continuous counterexample. The claimed univariate clean-quantile count exponent is too strong refutes a different source proof step. The exact-count and wider-outer-quantile arguments above avoid that step while preserving both estimator constants, confidence levels and the procedure. No atomic-law extension is claimed.
Depends on
- Split-sample univariate winsorized trimmed mean
- The split-sample univariate trimmed mean is total and Borel measurable
- Adversarial sample replacement
- Bernstein inequality for bounded independent sums
- Random elements and real random variables
- Identical distribution and IID families
- Bernoulli random variables and binomial random variables as sums of independent Bernoulli trials
- Expectation of a nonnegative or integrable random variable
- Moments, variance, and covariance on a probability space
- Markov's inequality for random variables
- The natural logarithm as the inverse of the exponential function
- The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t
- The real exponential function and the number $e$ by a power series
- Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm
- An absolutely continuous upper quantile has its specified tail mass
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Nothing in the library uses this result yet.
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
- Gábor Lugosi and Shahar Mendelson, Robust Multivariate Mean Estimation: The Optimality of Trimmed Mean, Theorem 1 and §2.1 (standard reference, not scraped)
- Gábor Lugosi, Mean Estimation in High Dimension, §2 (standard reference, not scraped)