Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

Univariate trimmed-mean bound under sample replacement

Statement

Assume Countable Choice. Let X be an absolutely continuous real random variable with mean μ and finite positive variance σ2=E[(X−μ)2] (Moments, variance, and covariance on a probability space). Let X1,…,XN,Y1,…,YN be 2N iid clean copies of X, and let (X~1,…,X~N,Y~1,…,Y~N) be a sample-replacement version with at most ⌊2ηN⌋ changed coordinates in total (Adversarial sample replacement). Let 0≤η, 0<δ<1, δ≥e−N/4, and

ε=8η+12log⁡(4/δ)N∈(0,1/4].

Apply Split-sample univariate winsorized trimmed mean with these parameters. For the centered variable Z=X−μ, define, for 0<u<1,

Qu(Z)=sup⁡{t∈R:P(Z≥t)≥1−u},

and, for 0<u≤1, define

E(u,X)=max⁡{E[∣Z∣1{Z≤Qu/2(Z)}], E[∣Z∣1{Z≥Q1−u/2(Z)}]}.

Here E is the raw centered-tail functional, distinct from the excess-tail lower-bound functional. The claims are

P ⁣(∣μ^−μ∣≤3E(4ε,X)+2σlog⁡(4/δ)N)≥1−δ

and

P ⁣(∣μ^−μ∣≤10ε σ)≥1−4e−εN/12.

Facts & Assumptions

Given: Countable Choice, the absolutely continuous centered clean variable Z=X−μ, the iid halves and replacement budget, and the displayed parameter domain.

[F1]

Apply An absolutely continuous upper quantile has its specified tail mass to the absolutely continuous variable X. The threshold set defining Qp(Z) is the translate by −μ of the one defining Qp(X), so qp=Qp(Z)=Qp(X)−μ and P(Z≤qp)=p, P(Z≥qp)=1−p for 0<p<1. Countable Choice is retained from that supplier (The Axiom of Countable Choice (ACω)).

[F2]

Adversarial sample replacement allows at most M=⌊2ηN⌋ 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.

[F3]

The proof of Bernstein inequality for bounded independent sums, step 2.1, establishes the one-sided bound P(∑iVi≥u)≤exp⁡[−u2/(2(v+bu/3))] for centered independent summands with ∣Vi∣≤b and total variance v. In particular, a centered average of variance at most σ2/N has upper or lower deviation at most 2σ2a/N+2ba/(3N) outside probability e−a, by substituting this threshold into the displayed bound. The zero-variance case is deterministic.

Proof

Given: The objects in the Statement. Write Z=X−μ, ℓ=log⁡(4/δ), t=ℓ/N, and T(u)=E(u,X); step 1.1 verifies that centering the data shifts the estimator output by −μ.

1.1F1F4givenalgebra

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 Z. By [F1], for each p∈(0,1) the quantile qp=Qp(Z) has P(Z≤qp)=p and P(Z≥qp)=1−p. Thus ∣qp∣≤σ/min⁡(p,1−p): if qp≥0, use σ2≥qp2P(Z≥qp); if qp<0, use σ2≥qp2P(Z≤qp). For any event A, E[∣Z∣1A]≤σP(A): when P(A)>0, this follows by expanding 0≤E[(∣Z∣/σ−1A/P(A))2], and the zero-probability case is immediate. Also T is nondecreasing, since its tail sets expand with u, and T(4ε)≤σ2ε by [F1] and this inequality. For a lower clipping endpoint a=qp with p≤1/2, put L=E[∣Z∣1{Z≤a}]. If a≤0, E[(a−Z)1{Z≤a}]≤L. If a>0, centering implies a(1−p)≤E[Z1{Z>a}]=−E[Z1{Z≤a}]≤L; hence ap≤L and the clipping excess is at most 2L. The symmetric upper-endpoint argument is identical. For a deterministic clip W=ϕa,b(Z), E[(W−c)2]=Var⁡W+(EW−c)2 with c=ϕa,b(0), and ∣W−c∣≤∣Z∣ because clipping is 1-Lipschitz. Thus Var⁡W≤σ2; also ∣W−EW∣≤b−a since both values lie in [a,b].

1.2F1F2F3F4algebra

First use inner endpoints q2ε,q1−2ε and outer endpoints qε/2,q1−ε/2. Require each of the two inner clean Y tail counts to exceed N(ε+2η) and each outer count to be less than N(ε−2η). Put a=η/t≥0. Since ε=(8a+12)t, [F3] for the binomial counts bounds each inner failure by exp⁡[−36(a+2)2ℓ/(36a+56)]≤e−18ℓ/7, and each outer failure by exp⁡[−(2a+6)2ℓ/((28/3)a+16)]≤e−9ℓ/4. The two rational functions are increasing for a≥0, as direct differentiation shows, so their minima are their values at zero. Thus all four count conditions hold outside probability 4e−9ℓ/4≤δ/2, since ℓ>log⁡4. After M≤2ηN changes the inner counts are still strictly greater than εN and outer counts strictly less than εN. Integer counts and the ranks r−=⌈εN⌉, r+=N−⌊εN⌋ therefore give qε/2≤α−μ≤q2ε and q1−2ε≤β−μ≤q1−ε/2. For example fewer than εN values below an outer lower endpoint means at most r−−1 such values, while more than εN values above an inner upper endpoint means at least ⌊εN⌋+1 such values. These strict inequalities cover noninteger ranks and the integral boundary without a rounding loss.

2.1F2F3step 1.1step 1.2algebra

On the count event, monotonicity of clipping endpoints bounds the clean first-half clipped average above by the average of W+=ϕq2ε,q1−ε/2(Z) and below by the average of W−=ϕqε/2,q1−2ε(Z). Step 1.1 bounds EW+≤2T(4ε) and EW−≥−2T(4ε), their variances by σ2, and their interval widths by 22σ/ε. These comparison variables have fixed endpoints, so their deviation events are functions of the clean X half and do not rely on the corrupted cutoffs being independent of it. Apply [F3] at a=ℓ separately to the two comparisons. As t/ε≤1/12, each deviation is at most σt[2+(42/3)t/ε]≤2σt. Their total exceptional probability is 2e−ℓ=δ/2.

3.1F1F2step 1.1step 1.2step 2.1algebra

Write A=qε/2, B=q1−ε/2. Replacing at most M first-half points changes the clipped average by at most 2η(B−A)≤(ε/4)(B−A). If A≤0≤B, (ε/4)(B−A)≤max⁡{(ε/2)∣A∣,(ε/2)∣B∣}≤T(ε). If both endpoints are positive, use B−A≤B and the same upper-tail bound; if both are negative, use B−A≤∣A∣ and its lower-tail bound. By monotonicity T(ε)≤T(4ε). Combining this with step 2.1 and the two exceptional probabilities proves the first displayed bound with its exact constants 3 and 2, uniformly over every admissible sample-dependent replacement.

4.1F1F2F3step 1.1step 1.2step 2.1step 3.1algebra∎

For the second bound put s=εN/12≥ℓ>log⁡4 and keep the same inner quantiles but use wider outer endpoints qε/4,q1−ε/4. Use the same count thresholds N(ε±2η). Since 2η≤ε/4, the inner downward gap is at least 3ε/4 from mean 2ε, and the outer upward gap is at least ε/2 from mean ε/4. The function u2/(2(p+u/3)) increases for u>0, so [F3] bounds each inner failure by e−εN/8=e−3s/2 and each outer failure by e−3εN/10=e−18s/5. 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 2T(4ε)≤22σε, variance at most σ2 and width at most 4σ/ε. Bernstein at a=s therefore bounds each directional clean-average noise by (1/6+2/9)σε. The replacement shift is at most 2η⋅4σ/ε≤σε. The total error is consequently at most (22+1/6+2/9+1)σε<10σε. Its exceptional probability is at most 2e−3s/2+2e−18s/5+2e−s≤4e−s, because the first two terms sum to at most 4e−3s/2≤2e−s. 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

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