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.
Robust Means under Heavy Tails — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Banach Valued Integration and the Radon Nikodym Property
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Compact Operators and Riesz Schauder Theory
- Compact Self Adjoint Hilbert Schmidt and Trace Class Operators
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Norms and Realification
- Complex Subspace Realification
- Complexification, Realification and Real Structures
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Concentration
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- 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
- Convergence: Nets and Filters
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces Adjoint Operators and Annihilators
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Dimensional Normed Spaces and Riesz Lemma
- Foundations of the Real Numbers for Analysis
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Independence Borel Cantelli and Zero One Laws
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- 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
- 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
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- 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
- Robust Means under Heavy Tails
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Splitting Fields
- Statistical Experiments, Models and Identifiability
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Analytic Hahn Banach Theorem
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- 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
- Weak Laws and Series of Independent Random Variables
2 · Summary
These examples use a continuous polynomial-tail law with finite variance, an exact five-block calculation showing rejection of one arbitrarily displaced block, and indistinguishable point-mass samples at a replacement fraction of one half. They keep the clean finite-variance guarantee, sample-replacement model, and iid Huber-mixture model distinct.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
One corrupted block is rejected by the geometric median
Example
Take five real block means with . Their geometric median is exactly , regardless of how large is.
Facts & Assumptions
Given: Countable Choice and the five block means with . Countable Choice is a prerequisite of the minimum-norm selector used by Geometric median of block means, through Measurable minimum-norm geometric-median selection.
A geometric median minimizes the sum of distances to the listed block means (Geometric median of block means).
With inner product , is a real inner-product space: ordered-field arithmetic gives bilinearity, symmetry, and with equality only for (The reals form a totally ordered field, Real and complex inner-product spaces and their induced length). Its induced norm is (Square roots exist: a unique with ; the positives are , Basic properties of the absolute value), so completeness of the real line makes it a Hilbert space (The reals are complete, Hilbert space). The embedded rationals are countable and dense, so this Hilbert space is separable ( is countably infinite, The rationals embed densely in the reals, Separability: the existence of an at most countable dense subset).
Verification
Given: and the objective .
If , then , with equality only at . If , then , again with equality only at .
If , then . Therefore is the unique minimizer, and the minimum-norm selection rule also returns . Four of five centers are exact while the fifth can be arbitrarily far away.
Half-sample replacement prevents covariance-only mean recovery
Statement refuted
For sample-replacement fractions , no deterministic Borel estimator can satisfy almost surely for every clean law and every admissible replacement coupling: two different zero-covariance means can generate the same observed sample within the replacement budget. In particular, no covariance-only error bound that forces zero error whenever the clean covariance is zero can hold uniformly.
Facts & Assumptions
Given: A sample size and a replacement fraction .
Under sample replacement, an adversary may change at most coordinates of a clean iid sample; the observed vector need not be iid (Adversarial sample replacement).
Huber contamination instead makes each observed coordinate iid from , which is a different model from a data-dependent joint replacement coupling (Huber contamination model).
Counterexample
Given: Fix any . Consider the two clean laws and on .
Under , the clean sample of size is all zero. Replace coordinates by to obtain the observed vector with entries of each value. This uses at most replacements by [F1].
Under , the clean sample is all . Replacing coordinates by produces exactly the same observed vector and also uses at most replacements. Both clean laws have variance zero, while their means are and .
The two deterministic replacement couplings put probability one on the same observed vector. Hence the same Borel map has the same output value in both experiments. Exact recovery would require that value to equal under the first coupling and under the second, which is impossible because . Both clean variances are zero, so any bound depending only on covariance and forcing zero error there would fail uniformly at . The Huber mixture model in [F2] is not being used in this construction.
A polynomial-tail law with finite variance
Example
Let have density on . This law has mean and variance , but it is not sub-Gaussian in the moment-generating-function sense. The geometric-median-of-means theorem therefore applies even though no finite sub-Gaussian proxy exists.
Facts & Assumptions
Given: Countable Choice, the density , and the definitions of sub-Gaussianity and variance. Fix and a positive integer for which , with as defined in Finite-variance Hilbert mean bound for geometric medians of means. Let be iid Borel real-valued observations with this density, and let be their geometric-median-of-block-means output using blocks and the minimum-norm selection rule specified by that theorem. Countable Choice is an explicit hypothesis of Finite-variance Hilbert mean bound for geometric medians of means, whose selector uses Measurable minimum-norm geometric-median selection.
A centered real random variable is sub-Gaussian with proxy only if for every real (Sub-Gaussian variables and vectors, and sub-exponential variables).
For the density displayed in the Example, symmetry and finite second moment identify the mean and variance; the geometric-median theorem requires a separable Hilbert-valued iid sample with finite second moment (Finite-variance Hilbert mean bound for geometric medians of means).
With inner product , is a real inner-product space: ordered-field arithmetic gives bilinearity, symmetry, and with equality only for (The reals form a totally ordered field, Real and complex inner-product spaces and their induced length). Its induced norm is (Square roots exist: a unique with ; the positives are , Basic properties of the absolute value), so completeness of the real line makes it a Hilbert space (The reals are complete, Hilbert space). The embedded rationals are countable and dense, so this Hilbert space is separable ( is countably infinite, The rationals embed densely in the reals, Separability: the existence of an at most countable dense subset).
Verification
Given: Countable Choice, the displayed density, the iid sample , the admissible confidence parameter and block count , and the estimator specified in Facts & Assumptions.
The density is normalized because . Its second moment is . Since , the first absolute moment is finite, and symmetry then gives .
For every , , since and the integrand is eventually at least . Thus the defining MGF inequality in [F1] fails for every finite proxy.
The law is Borel and takes values in the separable Hilbert space by [F3], with finite second moment . For the iid sample and geometric-median-of-means estimator specified in the Given, the admissible , , and therefore satisfy all hypotheses of Finite-variance Hilbert mean bound for geometric medians of means, which gives . The conclusion uses only the finite variance just computed, not a sub-Gaussian assumption.
Sources
- Stanislav Minsker, Geometric Median and Robust Estimation in Banach Spaces, Lemma 2.1
- Gábor Lugosi and Shahar Mendelson, Robust Multivariate Mean Estimation: The Optimality of Trimmed Mean, lower-bound discussion before Theorem 2
- Gábor Lugosi and Shahar Mendelson, Robust Multivariate Mean Estimation: The Optimality of Trimmed Mean, §1