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.
Contamination and Robust Risk — Examples
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Conditional Distributions and Regular Conditional Probability
- 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
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Estimators and Randomized Procedures
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability Spaces and Random Variables
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Independence Borel Cantelli and Zero One Laws
- limsup, liminf, and Subsequential Limits
- Loss, Risk and Decision Theory
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Stationary Markov Chains and Ergodic Limits
- Statistical Experiments, Models and Identifiability
- Suprema and Infima
- The Lebesgue Integral and the Convergence Theorems
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Weak Laws and Series of Independent Random Variables
2 · Summary
These examples compute the mean's directional response along a gross-error path, the exact modulus and equalizing contaminations in a Bernoulli Huber model, and a finite-sample replacement bound. The bounded replacement calculation uses values in ; it does not imply a robust mean rate for unbounded observations.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
The mean has an unbounded directional derivative supremum
Example
On with its Borel sigma-algebra, for and , the mean functional has and right derivative at . Each path law has finite support and hence a finite first moment. Taking the supremum of the absolute derivatives over gives .
Facts & Assumptions
Given: The gross-error path and point masses , .
The Dirac set function at a point and A Dirac set function is a probability measure: is a probability law concentrated at .
Expectation agrees with the published finite weighted sum: on a finite probability space, expectation is the finite weighted sum of attained values.
The Borel sigma-algebra of a topological space: the real line carries the sigma-algebra generated by its open sets, so the identity function is measurable.
Verification
By [F1] and [F2], the path law places weight at and weight at ; this also covers , when both atoms coincide.
The identity function is measurable for the Borel sigma-algebra because each Borel set is its own preimage under the identity. Let with its full power-set sigma-algebra and weights . Since the complement of has path-law measure zero, the integral of the identity is the integral of its restriction to this finite probability space: both are the same finite sum over the distinct atoms (apply the simple-function integral separately to the positive and negative parts). Thus [F3] gives , while .
For , the difference quotient is , so the right derivative at zero is . Since ranges over all real numbers, the supremum of its absolute value is .
Bounded sample-mean change under replacements and a common corrupted sample
Example
For integers and , if and at most coordinates differ, then
For the coupling example, take with their full power-set sigma-algebras (Measurable spaces and measurable sets) and the experiment (Statistical experiments, The Dirac set function at a point, A Dirac set function is a probability measure). For and replacement fraction , the clean samples and can both be changed to with one replacement, so the two parameter values induce the same observed law.
Facts & Assumptions
Given: Clean iid samples and a sample-replacement coupling as defined in Adversarial sample replacement.
Adversarial sample replacement: the clean vector is iid and the mismatch count is at most almost surely; the adversary may depend on the clean sample.
Huber contamination model: under the Huber model the observed coordinates are iid from one common mixture law.
Measurable spaces and measurable sets, Statistical experiments, The Dirac set function at a point, and A Dirac set function is a probability measure: the two-point experiment on full power sets has clean law at each , so its size-two clean iid samples are and almost surely.
Verification
Let , with . Since , each changed coordinate satisfies , and .
Use a one-point probability space for each coupling. By [F3], at parameter the clean iid sample is ; set the observed vector to . At parameter the clean sample is ; set the observed vector to . Each coupling changes exactly one of two coordinates, which is the allowed replacement, so both observed laws are the same point mass.
A rule that sees only the observed vector receives the same value under both parameter laws, so it cannot identify both parameters. The observed vector is not iid: its first coordinate is almost surely and its second is almost surely, whereas [F2] requires identical coordinate laws. Thus this replacement mechanism is distinct from iid Huber contamination.
Exact Bernoulli Huber modulus and indistinguishable mixtures
Example
Take with its Borel sigma-algebra and sample space with full power set. Let be the point masses, set , and use absolute parameter loss . Then
For , set , , , and ; both Huber mixtures are Bernoulli. For , endpoint laws can also be made identical.
Facts & Assumptions
Given: The Bernoulli experiment, absolute loss, Huber mixtures, and the modulus definition.
Huber contamination model: each observed coordinate has law .
Huber contamination modulus: is the supremum of parameter loss over clean pairs within the specified total-variation threshold, with the endpoint defined separately.
Total variation distance for probability laws: total variation is the supremum over measurable events, with no factor .
The Dirac set function at a point and A Dirac set function is a probability measure: is the probability law concentrated at .
A convex mixture of probability laws is a probability law: convex mixtures of probability laws are probability laws.
Measurable spaces and measurable sets and The Borel sigma-algebra of a topological space: the parameter set uses its Borel measurable structure and the finite sample space its full-power-set measurable structure.
Verification
The weights in are nonnegative and sum to one. By [F4] and [F5], each is a probability law. On the full power set of the four events are , and .
For the four events in step 1.1, the probability differences are either zero or . Thus [F3] gives . Under absolute loss, the allowed parameter separation is at most when . If the fraction is at most , the pair attains it; if it is at least , the endpoints attain separation . The endpoint definition gives .
For , both chosen parameters lie in . Under the success probability is ; under it is . Hence both mixtures are Bernoulli.
For , take , set and , and define . The lie in , so [F4] and [F5] make these probability laws. The mixture success probabilities are and . At the clean part vanishes and both mixtures still equal Bernoulli.
Sources
- P. B. Stark, Statistics 240 Lecture Notes, Part 9: Robustness and Related Topics, §1.3.4, equations (50)–(52)
- P. B. Stark, Statistics 240 Lecture Notes, Part 9: Robustness and Related Topics, §1.2, PDF pp. 10–12
- Mengjie Chen, Chao Gao and Zhao Ren, Robust Covariance and Scatter Matrix Estimation under Huber’s Contamination Model, §§1 and 5
- Philippe Rigollet, 18.S997: High-Dimensional Statistics, Lecture Notes, Chapter 5, §5.3