Alphabeta Math
Pipeline-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.

✓ 5 results · all verified · 5 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 5 also cleared it.

Influence and Breakdown

1 · Prerequisites

2 · Summary

Objective

Define statistical functionals and pointwise gross-error influence, then distinguish their local sensitivity from finite-sample replacement breakdown. Prove the M-location influence formula under explicit differentiation and local-root hypotheses, derive the median formula with its pointwise tie convention, and establish exact mean and odd-sample median replacement breakdown fractions. The earlier A-page requirements are contamination-models-and-robust-risk for the gross-error path and pathwise-differentiability-influence-functions-and-efficient-scores for the distinction between robust and semiparametric influence notions.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Finite-sample replacement breakdown

Definition

Let n≥1, let Tn:Rn→R be a total statistic, and fix a sample x=(x1,…,xn). For 0≤m≤n, define its maximum replacement displacement by

Bm(Tn,x):=sup⁡{∣Tn(y)−Tn(x)∣:y∈Rn, #{i:yi≠xi}≤m}∈[0,+∞].

When the set is nonempty, the finite-sample replacement breakdown fraction is

ϵn∗(Tn,x):=1nmin⁡{m∈{1,…,n}:Bm(Tn,x)=+∞}.

Only coordinate replacements are counted, and the replacement values range over all of R. This is a property of the statistic at the fixed sample; it is not a probability or contamination-neighborhood statement.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

The lower median of a real probability law

Definition

Let G be a probability measure on the Borel subsets of R, and put FG(t):=G((−∞,t]). For any G such that SG:={t∈R:FG(t)≥1/2} is nonempty and bounded below, define its lower median by

m(G):=inf⁡SG.

The stated condition makes m(G) a finite real number. This convention chooses the left endpoint when the set of medians is an interval; it assumes neither a density nor uniqueness.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

A finite empirical measure is a probability law

Statement

Let (X,A) be a measurable space, let n≥1, and let x1,…,xn∈X. Define

Pn(A):=1n∑i=1nδxi(A),A∈A.

Then Pn is a probability measure on (X,A).

Facts & Assumptions

Given: A measurable space (X,A), an integer n≥1, points x1,…,xn∈X, and the displayed set function Pn.

[F1]

The Dirac set function at a point: δx(A)=1 when x∈A and 0 otherwise.

[F2]

Probability measures and probability spaces: a probability measure is a countably additive measure of total mass one.

Proof

technique · direct
1.1givenF1algebra

Each summand in Pn(A) is nonnegative, Pn(∅)=0, and Pn(X)=n−1∑i=1n1=1 by [F1].

1.2givenF1algebra

Let (Aj)j≥1 be pairwise disjoint. For each j, let Ij:={i∈{1,…,n}:xi∈Aj}. The sets Ij are pairwise disjoint, and at most n of them are nonempty, because each index i belongs to at most one Ij. Their union is {i:xi∈⋃jAj}. Hence the number of sample indices in ⋃jAj is ∑j#Ij, and dividing by n gives Pn(⋃jAj)=∑jPn(Aj).

2.1step 1.1step 1.2F2∎

Steps 1.1–1.2 show that Pn is a nonnegative countably additive set function with total mass one; by [F2] it is a probability measure.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

The lower median of an odd empirical sample is its middle order statistic

Statement

Let n=2r+1≥1 and x1,…,xn∈R. Let Pn=n−1∑iδxi be their empirical probability law and write x(1)≤⋯≤x(n) for the sorted sample. Then the lower median m(Pn) is x(r+1).

Facts & Assumptions

Given: An odd sample size n=2r+1≥1, real observations x1,…,xn, and their empirical law Pn.

[F1]

A finite empirical measure is a probability law: Pn(A)=n−1∑iδxi(A) is a probability law.

[F2]

The lower median of a real probability law: m(Pn)=inf⁡{t:Pn((−∞,t])≥1/2}.

Proof

technique · direct
1.1givenF1F2algebra

If t<x(r+1), at most r sample coordinates are at most t. Therefore Pn((−∞,t])≤r/(2r+1)<1/2, so no such t belongs to the defining set in [F2].

1.2givenF1F2algebra

At t=x(r+1), at least r+1 sample coordinates are at most t. Hence Pn((−∞,t])≥(r+1)/(2r+1)>1/2, so x(r+1) belongs to that defining set.

2.1step 1.1step 1.2∎

Steps 1.1–1.2 show that the defining set has no point below x(r+1) and contains x(r+1) itself. Its infimum is therefore x(r+1), as claimed.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Replacement breakdown of the sample mean and odd-sample median

Statement

For any fixed sample x∈Rn, the sample mean xˉ=n−1∑i=1nxi has finite-sample replacement breakdown fraction 1/n. If n=2r+1 is odd and the conventional sample median is the (r+1)-st order statistic, its finite-sample replacement breakdown fraction is (r+1)/n=⌊(n+1)/2⌋/n.

Facts & Assumptions

Given: A sample x=(x1,…,xn)∈Rn, the mean statistic xˉ, and, when n=2r+1, the sample median x(r+1) after sorting the observations in nondecreasing order.

[F1]

Finite-sample replacement breakdown: breakdown is the smallest replacement count m for which the supremum displacement over changes to at most m coordinates is infinite, divided by n.

Proof

technique · direct
1.1givenF1algebra

With no replacements the mean displacement is zero. Replacing coordinate i by M changes the sample mean to xˉ+(M−xi)/n, whose displacement is unbounded as M→+∞. Thus the smallest breaking count for the mean is one, and [F1] gives 1/n.

1.2givenF1algebra

Let n=2r+1. If at most r coordinates are replaced, at least r+1 original observations remain. Writing xmin⁡=min⁡ixi and xmax⁡=max⁡ixi, at least r+1 resulting observations are at most xmax⁡ and at least r+1 are at least xmin⁡. Therefore the (r+1)-st order statistic lies in [xmin⁡,xmax⁡], so its displacement from the original median is bounded uniformly over all such replacements.

1.3givenalgebra

Replace r+1 coordinates by the same value M>xmax⁡. The r unchanged observations are the first r order statistics and the r+1 copies of M occupy positions r+1 through 2r+1. The median is therefore M, which is unbounded as M→+∞.

2.1step 1.2step 1.3F1algebra∎

Steps 1.2–1.3 show that the smallest breaking count for the odd-sample median is r+1. By [F1] its breakdown fraction is (r+1)/(2r+1)=⌊(n+1)/2⌋/n.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Statistical functionals and gross-error influence functions

Definition

Let (X,A) be a measurable space, let P be a collection of probability measures on it, and let T:P→Rk be a single-valued map with finite k≥1. Such a map is a statistical functional. For F∈P and x∈X, suppose the point-contamination path Fϵ,x=(1−ϵ)F+ϵδx belongs to P for all sufficiently small ϵ≥0 (Gross-error contamination path). The gross-error influence function at (x;T,F) is

IF⁡(x;T,F):=lim⁡ϵ↓0T(Fϵ,x)−T(F)ϵ∈Rk,

when this finite right limit exists. Its domain may be a proper subset of X.

Remarks

This is a pointwise derivative along one point-contamination direction. Its definition supplies no remainder bound uniform in x or in a general contaminating law H.

There are two other notions also called influence functions in semiparametric work. Pathwise differentiability and parameter influence curves defines pathwise differentiability through allowed differentiable-in-quadratic-mean paths and a continuous linear derivative on the score tangent space; this definition neither assumes nor asserts that the gross-error path is one of those paths. Asymptotically linear estimators and influence functions defines an estimator influence function through an empirical-average expansion with an oP(n−1/2) remainder. Neither notion is identified with the pointwise gross-error derivative here. The pathwise supplier's Riesz-representation and choice-dependent conclusions are cited only as terminology context; no such conclusion or axiom is used in this definition.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Gross-error sensitivity of a functional

Definition

For a statistical functional T at a law F, let DT,F:={x∈X:IF⁡(x;T,F) exists as a finite vector}. When DT,F≠∅, its gross-error sensitivity is the extended nonnegative number

γ∗(T,F):=sup⁡x∈DT,F∥IF⁡(x;T,F)∥2.

For a real-valued functional the norm is absolute value. This supremum only ranges over directions where the influence function exists; it makes no claim that the derivative exists in every direction.

Remarks

Finite gross-error sensitivity is a local pointwise stability bound. It does not, without a uniform remainder hypothesis, bound the maximum bias over an entire contamination neighborhood.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Influence function for a regular M-location functional

Statement

Let F be a Borel probability law on R, let ψ:R→R be C1, and let θ∈R satisfy

J(θ):=∫ψ(y−θ) dF(y)=0.

Assume ∫∣ψ(y−θ)∣ dF(y)<∞ and that there is an open interval I containing θ and a nonnegative g∈L1(F) such that ∣ψ′(y−t)∣≤g(y) for F-almost every y and every t∈I. Put A:=∫ψ′(y−θ) dF(y) and assume A≠0. For each fixed x∈R, let θx(ϵ) be the locally unique root near θ of

∫ψ(y−t) dFϵ,x(y)=0,Fϵ,x=(1−ϵ)F+ϵδx.

Then, for all sufficiently small ϵ≥0, this local root exists and

IF⁡(x;T,F)=lim⁡ϵ↓0θx(ϵ)−θϵ=ψ(x−θ)A.

Here T(Fϵ,x) denotes this local root. In the special case ψ(u)=u and F has a finite first absolute moment, θ=μ:=∫y dF(y) and IF⁡(x;T,F)=x−μ.

Facts & Assumptions

Given: The law F, the function ψ, the root θ, the open interval I, the integrable derivative majorant g, and A≠0 as in the Statement. Fix one contamination point x∈R.

[F1]

Gross-error contamination path: for 0≤ϵ≤1, Fϵ,x=(1−ϵ)F+ϵδx is the point-contamination specialization of the gross-error path.

[F2]

Dominated convergence: pointwise almost-everywhere convergence under one integrable majorant permits passing limits through the integral.

[F4]

The Euclidean implicit function theorem with derivative formula: if H(e,t) is C1, H(0,θ)=0, and ∂tH(0,θ)≠0, then a unique local C1 root t=θ(e) exists and θ′(0)=−∂eH(0,θ)/∂tH(0,θ).

[F5]

Statistical functionals and gross-error influence functions: the gross-error influence function is the right derivative of T(Fϵ,x) at ϵ=0, when finite.

[A1]

For the mean specialization, ∫∣y∣ dF(y)<∞.

Proof

technique · direct
1.1givenF2F3

For t∈I, the mean value theorem [F3] gives ∣ψ(y−t)−ψ(y−θ)∣≤∣t−θ∣g(y) for F-almost every y, so J(t) is finite. For any t∈I and nonzero h with t+h∈I, the difference quotient of ψ(y−t) in t converges pointwise to −ψ′(y−t) and is bounded in absolute value by g(y), again by [F3]. Dominated convergence [F2] therefore gives J′(t)=−∫ψ′(y−t) dF(y). If tj→t in I, continuity of ψ′ gives pointwise convergence of ψ′(y−tj) to ψ′(y−t), and the same majorant with [F2] shows J′(tj)→J′(t). Thus J is C1 on I.

2.1givenF1F4step 1.1

Define Hx(e,t):=(1−e)J(t)+eψ(x−t) for real e near 0 and t∈I. By step 1.1 and ψ∈C1, Hx is C1; also Hx(0,θ)=0 and ∂tHx(0,θ)=J′(θ)=−A≠0. Applying [F4] gives a unique local C1 root t=θx(e) through (0,θ). For e≥0 small, [F1] identifies its equation with the stated M-location equation under Fe,x.

3.1F4F5givenstep 2.1algebra

At (0,θ), ∂eHx=ψ(x−θ)−J(θ)=ψ(x−θ) and ∂tHx=−A. The derivative formula in [F4] therefore yields θx′(0)=ψ(x−θ)/A. Since a two-sided derivative implies the same right derivative, [F5] identifies this value with IF⁡(x;T,F).

4.1A1step 3.1algebra∎

If ψ(u)=u, then J(t)=∫y dF(y)−t=μ−t, so its unique root is θ=μ and A=∫1 dF=1. Substitution in step 3.1 gives IF⁡(x;T,F)=x−μ.

Remarks

The argument is pointwise in x: the implicit-function neighborhood and the remainder are not asserted to be uniform over contamination points. No Axiom of Choice is used.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Influence function and sensitivity of the median

Statement

Let F be a Borel probability law on R, let m=m(F) be its lower median, and assume F(m)=1/2. Suppose that on an open interval I containing m there is a continuous density version f satisfying

F((s,t])=∫stf(u) du(s<t, s,t∈I),f(m)>0.

For each fixed x∈R, the right point-contamination influence function of the lower-median functional is

IF⁡(x;m,F)={−12f(m),x<m,0,x=m,+12f(m),x>m.

Consequently, its gross-error sensitivity is γ∗(m,F)=1/(2f(m)).

Facts & Assumptions

Given: A Borel probability law F, its lower median m, the equality F(m)=1/2, and a continuous local density f on an interval I with f(m)>0. Fix a contamination point x∈R.

[F1]

Gross-error contamination path: Fϵ,x=(1−ϵ)F+ϵδx for 0≤ϵ≤1.

[F2]

The lower median of a real probability law: m(G)=inf⁡{t:G((−∞,t])≥1/2} on its stated domain.

[F3]

Statistical functionals and gross-error influence functions: IF⁡(x;m,F) is the right derivative of m(Fϵ,x) at ϵ=0, when finite.

[F4]

Gross-error sensitivity of a functional: γ∗(m,F) is the supremum of the absolute influence values over the directions where they exist.

Proof

technique · direct
1.1givenalgebra

Since I is open, f is continuous at m, and f(m)>0, choose δ>0 and c>0 so that [m−δ,m+δ]⊂I and f(u)≥c throughout this closed interval. For s<t in it, the density identity gives F(t)−F(s)=∫stf(u) du≥c(t−s)>0. Thus F is continuous and strictly increasing there, with F(m)=1/2.

2.1step 1.1F1F2givenalgebra

Suppose first that x<m, and shrink δ so that m−δ>x. For sufficiently small ϵ>0, the number rϵ=(1/2−ϵ)/(1−ϵ) lies strictly between F(m−δ) and 1/2. Continuity and strict increase give a unique qϵ∈(m−δ,m) with F(qϵ)=rϵ. Since rϵ↑1/2 as ϵ↓0, for every 0<η<δ eventually rϵ>F(m−η), so m−η<qϵ<m and qϵ→m. Since qϵ>x, the mixture cdf at qϵ is (1−ϵ)F(qϵ)+ϵ=1/2. For t<x, the contamination term is zero and, by monotonicity and F(m)=1/2, the mixture cdf is (1−ϵ)F(t)≤(1−ϵ)/2<1/2. At t=x, monotonicity gives F(x)≤F(m−δ)<rϵ, so (1−ϵ)F(x)+ϵ<(1−ϵ)rϵ+ϵ=1/2. For x<t<qϵ, the contamination term is ϵ and F(t)<F(qϵ)=rϵ: below the local interval this follows from monotonicity and F(t)≤F(m−δ)<F(qϵ), and inside it from strict increase. Therefore the mixture cdf at such t is (1−ϵ)F(t)+ϵ<(1−ϵ)rϵ+ϵ=1/2. Together with the cases t<x and t=x, this puts the mixture cdf below 1/2 for every t<qϵ, while it equals 1/2 at qϵ, so [F2] gives m(Fϵ,x)=qϵ.

2.2step 1.1F1F2givenalgebra

If x>m, shrink δ so that m+δ<x. For small ϵ>0, sϵ=1/(2(1−ϵ)) lies strictly between 1/2 and F(m+δ). There is a unique qϵ∈(m,m+δ) with F(qϵ)=sϵ. Since sϵ↓1/2 as ϵ↓0, for every 0<η<δ eventually sϵ<F(m+η), so m<qϵ<m+η and qϵ→m. Now qϵ<x, so the mixture cdf at qϵ is (1−ϵ)F(qϵ)=1/2. For every t<qϵ, the contamination term is zero; if m≤t<qϵ, strict increase on the local interval gives F(t)<F(qϵ), and if t<m then monotonicity gives F(t)≤F(m)<F(qϵ). Thus the mixture cdf is below 1/2 for every t<qϵ, while it equals 1/2 at qϵ, so [F2] gives m(Fϵ,x)=qϵ.

3.1step 2.1givenalgebra

In the case x<m, step 2.1 gives F(qϵ)−F(m)=−ϵ/[2(1−ϵ)] and qϵ→m. The density identity and continuity of f imply [F(qϵ)−F(m)]/(qϵ−m)→f(m). Dividing these two relations yields (qϵ−m)/ϵ→−1/(2f(m)).

3.2step 2.2givenalgebra

In the case x>m, step 2.2 gives F(qϵ)−F(m)=ϵ/[2(1−ϵ)] and qϵ→m. The same density quotient tends to f(m), hence (qϵ−m)/ϵ→+1/(2f(m)).

4.1step 1.1F1F2F3step 3.1step 3.2givenalgebra

If x=m, continuity of F at m gives Fϵ,m(m−)=(1−ϵ)/2<1/2 and Fϵ,m(m)=(1+ϵ)/2>1/2. Monotonicity then puts every t<m below the median threshold, while m itself is above it, so the lower median remains exactly m and its right derivative is 0. By [F3] and steps 3.1–3.2, these three cases give the displayed pointwise influence function.

5.1givenF4step 1.1step 3.1step 3.2step 4.1algebra∎

The absolute influence value is 1/(2f(m)) for every x≠m and zero at m. Both sides of m are nonempty in R, so the supremum over all directions is 1/(2f(m)) by [F4]. Since F has a density near m, F{m}=0; therefore the conventional expression (1/2−1{x≤m})/f(m) agrees with this pointwise derivative F-almost everywhere, though its value at x=m is not the literal right derivative.

Remarks

The conventional indicator formula in the Statement of the controlling design is an F-almost-everywhere representative. At the single point x=m, the right point-contamination derivative of the lower median is 0; retaining this pointwise value makes the definition agree exactly with the computed limit.

5 · Examples, counterexamples and false statements

None yet.

Sources