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.
Adversarial robustness and robust risk — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Adversarial robustness and robust risk
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Central Limit Theorems
- Characteristic Functions Inversion and Continuity
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- 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
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Direct Matrix Factorisations: LU, Cholesky and QR
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- 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 Probability and the Probabilistic Method
- Finite Probability Spaces and Random Variables
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- 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 effects and longitudinal models
- 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
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Partitions of Unity and Paracompactness
- Pointwise Extended-Real Function Products
- 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
- Radon Measures and the Riesz Markov Kakutani Theorem
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- 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
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- 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 Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- 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
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
2 · Logical flowchart
3 · Definitions, theorems and proofs
None yet.
4 · Examples, counterexamples and false statements
Gaussian robust risk across dimensions and radii
Example
Assume AC. For an integer , set and . For the fixed-parameter Gaussian model with , the class-weighted sample-mean classifier has robust risk at most with training-sample probability at least whenever the integer sample size satisfies . In the separate Gaussian-prior experiment , every Borel learning rule has expected robust risk at least whenever . The first assertion concerns a fixed normalized parameter and an upper bound for one classifier; the second averages over a Gaussian prior and lower-bounds every such Borel learning rule. Expected robust risk in the prior experiment uses outer expectation over the parameter and training sample.
Example references
Facts & Assumptions
Given: The Example's Gaussian parameter, radius, and dimension.
Assume AC as required by both Gaussian robust-risk bounds. The Axiom of Choice.
If , , and , then suffices for the class-weighted mean classifier to have robust risk at most with failure probability at most . Robust sample upper bound in the Gaussian model.
If and , every Borel learning rule under prior has expected robust risk at least . Robust sample lower bound in the Gaussian model.
Proof
The chosen variance satisfies , and makes . The upper-bound condition becomes . Apply [F1] to obtain the first assertion.
For the lower bound, . Thus the stated lower sample-size condition is exactly the premise of [F2], which gives the second assertion.
References
Robust sample upper bound in the Gaussian model: supplies the exact one-percent sufficient sample size.
Robust sample lower bound in the Gaussian model: supplies the learner-independent Gaussian-prior necessary sample size.
Thresholding removes Bernoulli sign perturbations
Example
Let , , , , and let be the binary-feature Bernoulli model. Let for and for . For every classifier , the classifier has exactly the same robust risk at radius as has natural risk: For , define when and otherwise. In particular, if and , then the one-sample classifier has robust risk at most with training-sample probability at least .
Example references
Facts & Assumptions
Given: The hypotheses in the Example.
The Bernoulli model is supported on . Binary-feature Bernoulli model.
maps a nonnegative coordinate to and a negative coordinate to . Coordinatewise threshold preprocessing.
Robust zero-one loss is one exactly when some admissible perturbation changes the label; robust risk is the expectation of this loss. Measurable threat correspondences and robust risk.
Under the stated condition, the one-sample thresholded Bernoulli classifier has robust risk at most with the stated training-sample probability. Architecture-dependent robustness in the Bernoulli model.
Proof
Fix and any with . If , then , so [F2] gives . If , then , so . Hence for every admissible perturbation.
For each support point , every allowed perturbation therefore makes . The robust zero-one loss of equals pointwise. Taking expectation under proves the displayed equality.
Under the final condition, [F4] gives the one-sample risk bound for with the stated probability. The pointwise identity in step 2.1 explains why every radius has the same risk.
References
Binary-feature Bernoulli model: the support is exactly the sign hypercube with a binary label.
Architecture-dependent robustness in the Bernoulli model: supplies the one-sample high-probability error guarantee.
Natural and robust risk in the Gaussian model
Example
Assume AC and set , , , and . In the fixed-parameter experiment with , one class-weighted training sample yields natural test error at most with probability at least . In the distinct Gaussian-prior experiment , at the same and , every Borel learning rule has expected robust risk at least . The first assertion fixes a normalized parameter; the second averages over the stated Gaussian prior. Expected robust risk in the prior experiment uses outer expectation over the parameter and training sample.
Example references
Facts & Assumptions
Given: The Example's parameters and the two separate Gaussian experiments in its Statement.
Assume AC as required by the Gaussian model and both risk bounds. The Axiom of Choice.
For , if , then the one-sample class-weighted classifier has natural test error at most with probability at least . One-sample natural error in the Gaussian model.
If and , every Borel learning rule under prior has expected robust risk at least . Robust sample lower bound in the Gaussian model.
The natural logarithm is increasing, obeys , and satisfies for . Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm, The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t.
Proof
Since and , [F3] gives . Hence , so . Apply [F1] with to get the fixed-parameter natural-risk assertion.
We have , hence . Since , [F3] gives . Therefore , where . Since , [F2] applies and proves the Gaussian-prior robust-risk lower bound.
References
One-sample natural error in the Gaussian model: supplies the fixed-parameter one-sample natural-error guarantee.
Robust sample lower bound in the Gaussian model: supplies the Gaussian-prior robust-risk lower bound.
Sources
- Ludwig Schmidt, Shibani Santurkar, Dimitris Tsipras, Kunal Talwar, and Aleksander Madry, Adversarially Robust Generalization Requires More Data, Corollary 22 and Corollary 23, arXiv:1804.11285v2, PDF pp. 26, 30
- Ludwig Schmidt, Shibani Santurkar, Dimitris Tsipras, Kunal Talwar, and Aleksander Madry, Theorem 10 and the Bernoulli-model discussion, arXiv:1804.11285v2, PDF pp. 7, 31–32
- Zico Kolter and Aleksander Madry, Adversarial Robustness: Theory and Practice, NeurIPS 2018 tutorial notes, Chapter 2
- Ludwig Schmidt, Shibani Santurkar, Dimitris Tsipras, Kunal Talwar, and Aleksander Madry, Corollary 19, Corollary 23, arXiv:1804.11285v2, PDF pp. 24–25, 30