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.
Influence and Breakdown — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Contamination and Robust Risk
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Domination and Likelihood Ratios
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Influence and Breakdown
- Influence Functions and Efficient Scores
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Norming and Separation under Hahn–Banach
- Order, Zorn's Lemma, and the Axiom of Choice
- Orthonormal Bases, Parseval and Fourier Series
- Outer Measure and the Caratheodory Extension Theorem
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Semiparametric Models and Tangent Spaces
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Statistical Experiments, Models and Identifiability
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Analytic Hahn Banach Theorem
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Inverse and Implicit Function Theorems
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
Objective
Work out the mean and median influence and replacement breakdown calculations, then give a fully specified functional whose gross-error sensitivity is finite while its empirical plug-in statistic has a replacement breakdown fraction tending to zero. The examples use the definitions and proved results on robust-influence-and-breakdown and add no dependency for another page.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
The mean has unbounded influence and 1/n breakdown
Example
Let be any probability law on with finite first absolute moment . Its mean functional has , so its gross-error sensitivity is infinite. At every fixed sample, its sample mean has replacement breakdown fraction .
Facts & Assumptions
Given: A probability law with , its mean , and a fixed sample of size .
Influence function for a regular M-location functional: for , the mean's point-contamination influence function is for every .
Gross-error sensitivity of a functional: is the supremum of the absolute influence values on their domain.
Replacement breakdown of the sample mean and odd-sample median: the sample mean's replacement breakdown fraction at any fixed sample is .
Verification
By [F1], the mean influence function exists for every and equals .
The sample-mean replacement breakdown fraction is by [F3], independently of the distribution .
The values are unbounded as ranges over ; hence [F2] gives .
Thus in this example the population gross-error sensitivity is infinite, while one arbitrary coordinate replacement already makes the finite-sample mean unbounded.
A smooth median has bounded influence and about one-half breakdown
Example
Suppose has a unique median , satisfies , and has a continuous density with . The median's gross-error sensitivity is . For odd sample sizes , the sample median's replacement breakdown fraction is , which tends to as increases through odd integers.
Facts & Assumptions
Given: A probability law and median satisfying the density and uniqueness assumptions in the Statement of Influence function and sensitivity of the median, and an odd sample size .
Influence function and sensitivity of the median: the median has gross-error sensitivity under these assumptions.
Replacement breakdown of the sample mean and odd-sample median: the odd-sample median's replacement breakdown fraction is for every fixed sample.
Verification
By [F1], the influence values have absolute value at most , and their supremum is exactly that value, which is finite because .
By [F2], the finite-sample replacement breakdown fraction is .
Since as , the odd-sample median breakdown fractions tend to .
The bounded pointwise sensitivity and the separate replacement count follow from different definitions and theorems; here the median has both properties under the stated density hypothesis.
Bounded influence can coexist with vanishing replacement breakdown
Statement refuted
At a probability law , finite gross-error sensitivity forces the empirical plug-in statistic to have replacement breakdown bounded below by a positive constant as .
Facts & Assumptions
Given: Countable Choice, the Borel probability law on , and the functional and statistics defined in the Counterexample below. Here is one-dimensional Lebesgue measure.
The Borel sigma-algebra of a topological space: is the sigma-algebra generated by the open subsets of .
Probability measures and probability spaces: a probability measure is a countably additive measure of total mass one.
Lebesgue measurable sets, the family , and the restricted set function : is the Lebesgue measure set function on the Lebesgue measurable subsets of .
Assuming countable choice, is a sigma-algebra containing every elementary set and is a complete measure extending elementary volume: under Countable Choice, Lebesgue measurable sets form a sigma-algebra and is a complete measure on it.
A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included: under Countable Choice, every interval is Borel/Lebesgue measurable with , including degenerate intervals.
The Axiom of Countable Choice (): Countable Choice is the hypothesis of [F4], [F5], and [F14], supplying the measure, interval-volume, and Borel-measurability properties of used to construct .
The lower median of a real probability law: is the lower median of a law in its domain.
A finite empirical measure is a probability law: is a probability measure for every finite sample.
Statistical functionals and gross-error influence functions: the gross-error influence function is the right derivative along a point-contamination path.
Gross-error contamination path: is the point-contamination path.
Gross-error sensitivity of a functional: sensitivity is the supremum of absolute influence values over the directions where they exist.
Finite-sample replacement breakdown: the breakdown fraction is the first replacement count at which the maximum displacement is unbounded, divided by .
Influence function and sensitivity of the median: at a continuous positive density at the median, the median's right influence is below , above , and at .
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.
Under Countable Choice, every Borel subset of is Lebesgue measurable (Assuming countable choice, every Borel subset of is Lebesgue measurable).
Counterexample
Let be the Borel probability laws on for which for some finite . Then for and for , so [F6] defines . For , call an atom location when . Define
The supremum is finite in the first case because every atom location lies in an interval carrying . For a sample , let be its empirical law from [F7] and set .
By [F14], every Borel set is Lebesgue measurable; since [F5] makes Borel and Lebesgue measurable with measure , each is measurable for Borel . For pairwise disjoint Borel sets , these intersections are disjoint, so countable additivity of gives countable additivity of . Also because , and by [F5]. Thus [F1] and [F2] make a Borel probability law. For , [F5] gives ; for the intersection is empty. It follows that , the density near zero is , and has no atoms, the latter by the degenerate-interval case of [F5].
Fix any point . By [F9], is carried by a bounded interval containing and , and its only possible atom location is , because [F5] gives . The trigger in requires two distinct atom locations, so it is false and for all sufficiently small . Therefore [F8] and [F12] give , equal to for , for , and for .
Fix odd and a clean sample . Its empirical median is the middle order statistic by [F13] and lies in , so every atom location of is within distance of that median. The trigger is false and is the sample median.
After at most one replacement, at least observations remain in . At least resulting observations are at most and at least are at least , so the middle order statistic, hence the lower empirical median by [F13], remains in . All unchanged atom locations are within distance of it, and only the single replacement can add a distinct outlying atom. Thus the trigger is still false and remains the sample median in for every one-coordinate replacement; its maximum displacement is bounded.
The absolute values in step 1.2 have supremum over , so [F10] gives .
Replace two coordinates by distinct values and with . The remaining observations lie in , so the middle order statistic (position ) is still one of them and lies in ; by [F13] this is the lower empirical median. Both new atom locations are more than above that median, so the trigger is true and . Letting 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 .
Along odd , , while step 2.1 gives finite gross-error sensitivity at the fixed law . Hence this functional has bounded influence and an empirical plug-in statistic whose replacement breakdown is not bounded away from zero, refuting the Statement.
Sources
- P. B. Stark, Statistics 240 Lecture Notes, Part 9: Robustness and Related Topics, §1.3.4, PDF pp. 16–17
- Elvezio Ronchetti, Introduction to Robust Statistics, slides 9–10 and 22
- P. B. Stark, Statistics 240 Lecture Notes, Part 9: Robustness and Related Topics, §§1.2–1.3, PDF pp. 2–3, 13–18
- Elvezio Ronchetti, Introduction to Robust Statistics, slides 15–17 and 22
- Elvezio Ronchetti, Introduction to Robust Statistics, slides 15–23