Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedprecheck passjudge 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.

Bounded influence can coexist with vanishing replacement breakdown

Statement refuted

At a probability law F, finite gross-error sensitivity forces the empirical plug-in statistic T(Pn) to have replacement breakdown bounded below by a positive constant as n→∞.

Facts & Assumptions

Given: Countable Choice, the Borel probability law P(A):=λ(A∩[−1,1])/2 on R, and the functional and statistics defined in the Counterexample below. Here λ is one-dimensional Lebesgue measure.

[F1]

The Borel sigma-algebra of a topological space: B(R) is the sigma-algebra generated by the open subsets of R.

[F2]

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

[F3]

Lebesgue measurable sets, the family L(Rn), and the restricted set function λn: λ is the Lebesgue measure set function on the Lebesgue measurable subsets of R.

[F4]

Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume: under Countable Choice, Lebesgue measurable sets form a sigma-algebra and λ is a complete measure on it.

[F5]

A box in Rn with parameters ai≤bi is Lebesgue measurable of measure ∏i<n(bi−ai), whichever of its faces are included: under Countable Choice, every interval [a,b] is Borel/Lebesgue measurable with λ([a,b])=b−a, including degenerate intervals.

[A1]

The Axiom of Countable Choice (ACω): Countable Choice is the hypothesis of [F4], [F5], and [F14], supplying the measure, interval-volume, and Borel-measurability properties of λ used to construct P.

[F6]

The lower median of a real probability law: m(G) is the lower median of a law in its domain.

[F7]

A finite empirical measure is a probability law: Pn=n−1∑iδxi is a probability measure for every finite sample.

[F8]

Statistical functionals and gross-error influence functions: the gross-error influence function is the right derivative along a point-contamination path.

[F9]

Gross-error contamination path: Pϵ,z=(1−ϵ)P+ϵδz is the point-contamination path.

[F10]

Gross-error sensitivity of a functional: sensitivity is the supremum of absolute influence values over the directions where they exist.

[F11]

Finite-sample replacement breakdown: the breakdown fraction is the first replacement count at which the maximum displacement is unbounded, divided by n.

[F12]

Influence function and sensitivity of the median: at a continuous positive density at the median, the median's right influence is −1/(2f(m)) below m, +1/(2f(m)) above m, and 0 at m.

[F13]

The lower median of an odd empirical sample is its middle order statistic: for an odd empirical sample, its lower median is the middle order statistic.

[F14]

Under Countable Choice, every Borel subset of R is Lebesgue measurable (Assuming countable choice, every Borel subset of Rn is Lebesgue measurable).

Counterexample

Let Pc be the Borel probability laws on R for which G([a,b])=1 for some finite a≤b. Then FG(t)=0 for t<a and FG(t)=1 for t≥b, so [F6] defines m(G). For G∈Pc, call z an atom location when G({z})>0. Define

T(G):={sup⁡{z:G({z})>0},if there are two distinct atom locations z1,z2 with ∣zi−m(G)∣>2,m(G),otherwise.

The supremum is finite in the first case because every atom location lies in an interval carrying G. For a sample x∈Rn, let Pn be its empirical law from [F7] and set Tn(x):=T(Pn).

1.1A1F1F2F3F4F5F6F14algebra

By [F14], every Borel set is Lebesgue measurable; since [F5] makes [−1,1] Borel and Lebesgue measurable with measure 2, each A∩[−1,1] is measurable for Borel A. For pairwise disjoint Borel sets Aj, these intersections are disjoint, so countable additivity of λ gives countable additivity of P(A)=λ(A∩[−1,1])/2. Also P(∅)=0 because λ(∅)=0, and P(R)=1 by [F5]. Thus [F1] and [F2] make P a Borel probability law. For −1≤t≤1, [F5] gives FP(t)=P((−∞,t])=(t+1)/2; for t<−1 the intersection (−∞,t]∩[−1,1] is empty. It follows that m(P)=0, the density near zero is f=1/2, and P has no atoms, the latter by the degenerate-interval case of [F5].

1.2F5F6F8F9F12givenalgebra

Fix any point z∈R. By [F9], Pϵ,z is carried by a bounded interval containing [−1,1] and z, and its only possible atom location is z, because [F5] gives P({z})=0. The trigger in T requires two distinct atom locations, so it is false and T(Pϵ,z)=m(Pϵ,z) for all sufficiently small ϵ≥0. Therefore [F8] and [F12] give IF⁡(z;T,P)=IF⁡(z;m,P), equal to −1 for z<0, +1 for z>0, and 0 for z=0.

1.3F6F7F13givenalgebra

Fix odd n=2r+1≥5 and a clean sample x∈[−1,1]n. Its empirical median is the middle order statistic by [F13] and lies in [−1,1], so every atom location of Pn is within distance 2 of that median. The trigger is false and Tn(x) is the sample median.

1.4F6F7F13givenalgebra

After at most one replacement, at least n−1=2r observations remain in [−1,1]. At least r+1 resulting observations are at most 1 and at least r+1 are at least −1, so the middle order statistic, hence the lower empirical median by [F13], remains in [−1,1]. All unchanged atom locations are within distance 2 of it, and only the single replacement can add a distinct outlying atom. Thus the trigger is still false and Tn remains the sample median in [−1,1] for every one-coordinate replacement; its maximum displacement is bounded.

2.1F10step 1.2algebra

The absolute values in step 1.2 have supremum 1 over z∈R, so [F10] gives γ∗(T,P)=1<∞.

2.2F6F7F11F13step 1.4givenalgebra

Replace two coordinates by distinct values M and 2M with M>3. The remaining 2r−1 observations lie in [−1,1], so the middle order statistic (position r+1) is still one of them and lies in [−1,1]; by [F13] this is the lower empirical median. Both new atom locations are more than 2 above that median, so the trigger is true and Tn=2M. Letting M→+∞ makes the maximum displacement unbounded. Since step 1.4 ruled out one replacement and [F11] defines the first unbounded count, the breakdown fraction is exactly 2/n.

3.1step 2.1step 2.2algebra∎

Along odd n→∞, 2/n→0, while step 2.1 gives finite gross-error sensitivity at the fixed law P. Hence this functional has bounded influence and an empirical plug-in statistic whose replacement breakdown is not bounded away from zero, refuting the Statement.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

51 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