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.
Concentration — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Concentration
- Conditional Expectation
- 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
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- 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
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- 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
- Martingale Inequalities and Convergence
- 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
- Order, Zorn's Lemma, and the Axiom of Choice
- 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
- 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
- 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
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Derivative and the Mean Value Theorems
- The Exponential Function
- 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 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
- Volumes of Elementary Solids and Solids of Revolution
- Weak Convergence Tightness and Representation
2 · Summary
These examples apply the A-page bounds to a Rademacher sum, a perfectly dependent Gaussian maximum, and a sub-Gaussian vector. A symmetric countable distribution shows why finite variance alone cannot give a sub-Gaussian tail. Each calculation retains the parameter and degenerate-case assumptions of the theorem it uses.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A Rademacher sum
Example
Assume AC. Let and let be independent Rademacher variables, meaning , and put . For every ,
Facts & Assumptions
Given: AC, an integer , and independent real random variables with the two-point laws stated in the Example.
Assume AC as required by the Hoeffding supplier used here (The Axiom of Choice).
A real random variable is a measurable map to (Random elements and real random variables).
Independence means independence of the sigma-algebras generated by the variables (Independent random elements).
Expectation is integration against the probability law (Expectation of a nonnegative or integrable random variable).
For independent variables in finite ranges , Hoeffding gives when the denominator is positive (Hoeffding inequality for independent bounded sums).
Verification
Each is a real random variable by [F1], and their given independence is understood by [F2]. Their two-point laws make them integrable with mean by [F3], and they lie in almost surely. Thus the Hoeffding width sum is .
Apply [F4] with those endpoints. The exponent is , yielding the stated bound.
A Gaussian maximum without independence
Example
Assume AC. Let , let , and set for every , where . These variables are perfectly dependent. For every ,
Facts & Assumptions
Given: AC, , , and a standard normal random variable .
Assume AC as required by the standard-normal law construction (The Axiom of Choice).
The law has density , and is the law of applied to (Standard normal and normal laws).
The standard normal density is positive and integrates to one (The standard normal density has total mass one).
For a nonnegative measurable , or an integrable real , expectation of is its integral against the law of (Change of variables for expectation). Integration against the density law satisfies for nonnegative measurable (Integrating against a density agrees with integrating the product); applying this to the positive and negative parts gives the signed formula once absolute integrability is established.
One-dimensional substitution satisfies when is continuous and the stated differentiability and integrability hypotheses hold (Substitution: if is differentiable on with integrable and is continuous on an interval containing , then ).
Increasing nonnegative measurable functions pass to their limit under the integral (Monotone convergence for the integral).
The exponential is continuously differentiable with derivative (The real exponential function and the number by a power series, The exponential function is smooth and ); the chain rule differentiates compositions (The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with ); and (For a natural the function is differentiable everywhere with derivative ; for it is the constant , with derivative ; for a natural the function is differentiable at every with derivative ; consequently every polynomial function is differentiable at every real, with the derivative computed term by term).
Continuous functions on compact intervals are integrable (A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion), and if with integrable , then (The second fundamental theorem: if is differentiable on with and is integrable, then ).
A continuous real function is Borel measurable under AC (Continuous functions on Euclidean spaces are Borel measurable).
A centered variable is sub-Gaussian with proxy when its moment generating function is bounded by for every real (Sub-Gaussian variables and vectors, and sub-exponential variables).
For possibly dependent centered sub-Gaussian variables with common proxy , (Finite sub-Gaussian maxima and epsilon-net reduction).
Expectation is linear on integrable real random variables (Linearity, monotonicity, and the modulus bound for expectation).
Under Countable Choice, every bounded Riemann-integrable function on a nondegenerate compact interval has the same Lebesgue and Riemann integrals (A bounded Riemann integrable function on a closed bounded interval is Lebesgue measurable and has the same integral). AC in [A1] implies Countable Choice, so this applies to the bounded continuous integrands supplied by [F8].
Verification
Write . By [F7] and composition, is continuous and integrable on compact intervals by [F8]. The map is differentiable with derivative by [F7]; the identity is continuous because whenever with , so it is integrable on by [F8]. Thus [F4] applies. By [F7], , so [F8] evaluates the resulting integral: . The integrand is continuous and bounded on every compact interval by [F7] and [F8], so [F13] identifies these Riemann integrals with Lebesgue integrals. Reflection in [F4], followed by [F13], gives since is even. Letting integer increase to infinity, [F2], [F3] for nonnegative functions, and [F5] give . Since is even, the positive and negative parts of have equal integrals, so [F3] for integrable functions gives .
Put . The function is continuous and Borel measurable by [F7] and [F9], so [F3] and completing the square, using [F6], give .
For every positive integer , [F4] with translation by gives . The two integrands are continuous and bounded on these compact intervals by [F7] and [F8]; [F13] therefore identifies both sides with their Lebesgue integrals. Both interval families increase to , so [F5] passes these equal integrals to the whole-line limit; [F2] identifies that limit as . Step 1.2 then yields .
By [F12] and step 1.1, ; step 2.1 gives its moment generating function. Thus each is centered sub-Gaussian with proxy by [F10]. Apply [F11] to the variables. They are all equal, but the bound requires no independence.
A sub-Gaussian vector norm bound
Example
Let and let be a centered sub-Gaussian vector with proxy . Choosing in the net reduction gives, for every , If , the same probability is .
Facts & Assumptions
Given: A centered sub-Gaussian vector , with and proxy .
A centered vector with proxy has each projection sub-Gaussian with proxy (Sub-Gaussian variables and vectors, and sub-exponential variables).
For , the net reduction gives when , and zero tail when (Finite sub-Gaussian maxima and epsilon-net reduction).
Verification
The choice is in and gives the finite-net factor .
By [F1], satisfies the centered projection condition required by [F2]. Apply [F2] with the value from step 1.1. Since , the stated positive-proxy bound follows; the zero-proxy clause of [F2] gives the boundary case.
Finite variance does not imply a sub-Gaussian tail
Statement refuted
Every centered real random variable with finite variance is sub-Gaussian with some finite proxy.
Facts & Assumptions
Given: A countable atomic probability space, the real random variable defined below, and the meanings of expectation, variance, and sub-Gaussian proxy.
A measure is nonnegative and countably additive, and a probability measure has total mass (Measures on sigma-algebras, Probability measures and probability spaces).
A real random variable is a measurable map to (Random elements and real random variables).
Expectation is integration against the probability measure, and the variance of a square-integrable real variable is (Expectation of a nonnegative or integrable random variable, Moments, variance, and covariance on a probability space).
A series is the limit of its partial sums when those partial sums converge; a nonnegative series with bounded partial sums converges to their supremum (Series, partial sums, convergence and the sum, divergence, and the tail series, A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum).
Increasing nonnegative functions pass to their limit under the integral (Monotone convergence for the integral).
A centered variable with sub-Gaussian proxy satisfies for , and its positive-threshold tail is zero for (Finite sub-Gaussian maxima and epsilon-net reduction).
For every positive and natural , as (The exponential dominates every fixed nonnegative integer power at ).
for every real (The exponential is positive and satisfies ).
Counterexample
Let . Its partial sums are increasing, and for , ; hence and is finite by [F4]. Set .
Enumerate by , , and assign each atom weight . Define for . The weights are nonnegative and sum to , so all subseries converge by [F4]. For pairwise disjoint , put and ; at most one term in each is nonzero. For every finite atom prefix , only finitely many meet that prefix, so finite regrouping gives . Taking the supremum over yields . Conversely, for each finite event prefix and each , convergence of the finitely many subseries lets us choose one atom prefix for which . Letting and then taking the supremum over proves the reverse inequality. Thus [F1] makes a probability measure.
Define on . It is a real random variable by [F2], since every preimage is a subset of the full-power-set sample space.
By [F5] applied to finite atom prefixes, and . For , , whose partial sums telescope to at most ; hence both moments are finite, so is integrable and square-integrable. The two atoms at each have equal mass and opposite values; since , their absolutely convergent contributions cancel and . By [F3], is centered with finite variance .
For every integer , the atoms and give .
Suppose for contradiction that has a finite sub-Gaussian proxy . If , [F6] contradicts the positive tail in step 2.1.
If , [F6] gives . By [F8], , which tends to by [F7] with , , and . It is eventually smaller than , so the upper tail is eventually smaller than , contradicting step 2.1. Thus this centered finite-variance variable is not sub-Gaussian for any finite proxy.
Sources
- Philippe Rigollet and Jan-Christian Hütter, High-Dimensional Statistics: Lecture Notes, Chapter 1, Rademacher example and Theorem 1.9
- John Duchi, Lecture Notes on Statistics and Information Theory, Chapter 4, Example 4.1.5 and Corollary 4.1.10
- Philippe Rigollet and Jan-Christian Hütter, High-Dimensional Statistics: Lecture Notes, Chapter 1, Theorem 1.14
- John Duchi, Lecture Notes on Statistics and Information Theory, Chapter 4, §4.1.1
- Philippe Rigollet and Jan-Christian Hütter, High-Dimensional Statistics: Lecture Notes, Chapter 1, Lemma 1.18 and Theorem 1.19
- John Duchi, Lecture Notes on Statistics and Information Theory, Chapter 4, sub-Gaussian vector convention
- Philippe Rigollet and Jan-Christian Hütter, High-Dimensional Statistics: Lecture Notes, Chapter 1, sub-Gaussian tail bounds
- John Duchi, Lecture Notes on Statistics and Information Theory, Chapter 4, Proposition 4.1.8