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
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- 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
- Discrete Time Martingales
- 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
- 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
- Independence Borel Cantelli and Zero One Laws
- 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
- 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
- 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
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Derivative and the Mean Value Theorems
- The Exponential Function
- 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
2 · Summary
This page turns moment-generating-function bounds into finite-sample tail guarantees. It defines scalar and vector sub-Gaussian proxies and the restricted moment-generating-function range for sub-exponential variables. It proves independent bounded-sum Hoeffding and Bernstein bounds, a finite maximum inequality, and an epsilon-net reduction with a local volume proof. McDiarmid's inequality is proved from a Doob martingale whose conditional endpoint widths are checked by product integration. The page keeps independence, boundedness, variance, measurability, and the Axiom of Choice assumptions attached to the results that use them.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Sub-Gaussian variables and vectors, and sub-exponential variables
Definition
Use the real random variable convention of Random elements and real random variables and the expectation convention of Expectation of a nonnegative or integrable random variable. A real random variable is centered when it is integrable and . A vector random element in , for an integer , is centered when each coordinate is integrable and . For , write and , using the Euclidean convention in Euclidean spheres and closed balls as subspaces of .
For , a centered real random variable is sub-Gaussian with proxy if A centered vector random element is sub-Gaussian with proxy if
For and , a centered real random variable is sub-exponential with parameters if
The parameters and are moment-generating-function upper-bound proxies; they are not asserted to equal the variance. The vector condition controls every one-dimensional projection and does not assert independence of coordinates.
Hoeffding inequality for independent bounded sums
Statement
Assume AC. Let and let be independent integrable real random variables on one probability space. Suppose finite real numbers satisfy almost surely for every . Put and . For every , if then and if then . The two one-sided tails are each bounded by when .
Facts & Assumptions
Given: AC, , independent integrable real random variables , and deterministic finite intervals containing almost surely.
Assume the Axiom of Choice, namely every family of nonempty sets has a choice function (The Axiom of Choice). AC is used by the supplied conditional-expectation and conditional-Hoeffding results.
Independence means that the sigma-algebras generated by the random variables are an independent family (Independent random elements).
Disjoint groups from an independent family generate independent sigma-algebras (Disjoint groups of an independent sigma-algebra family remain independent).
If an integrable random variable is independent of a sigma-algebra, its conditional expectation given that sigma-algebra is its ordinary expectation (Conditioning a known variable and an independent variable).
Expectation is monotone: almost surely implies (Linearity, monotonicity, and the modulus bound for expectation).
If , , and finite -measurable endpoints have deterministic width , then almost surely (Conditional Hoeffding bound for bounded martingale differences).
Conditional expectation is linear, preserves constants, and preserves the unconditional expectation, so (Basic algebra and order properties of conditional expectation).
A bounded measurable factor known under can be taken outside conditional expectation (Taking out what is known).
For a nonnegative random variable and , (Markov's inequality for random variables).
The probability of a finite union of events is at most the sum of their probabilities (Basic identities for a probability measure).
The real exponential is continuous and strictly increasing, positive, and satisfies and (The exponential is positive and satisfies , The exponential function is strictly increasing, The exponential addition formula ).
Every closed bounded interval with is compact (Heine-Borel by bisection: every closed bounded interval is compact).
A continuous real function is bounded on a compact subset of (A continuous real function on a compact subset of is bounded).
Sums and differences of measurable real-valued functions are measurable (Arithmetic and lattice operations preserve measurability whenever they are defined).
Proof
Set , , , and . By [F13], is -measurable. By [F1] and [F2], is independent of ; [F3] gives , and conditional linearity and preservation of constants in [F6] therefore give almost surely.
By [F4], . Therefore lies almost surely in the finite interval , whose endpoints are -measurable, contain , and have width ; in particular .
Apply [F5] to each and the filtration from step 1.1. For every real , almost surely.
Let and . Step 1.2 gives , hence for . This closed bounded interval is compact by [F11], and is continuous by [F10] and continuity of scalar multiplication, so [F12] makes bounded. Also is Borel: its open-set preimages are open, and the class of Borel sets whose preimages are Borel is a sigma-algebra containing the opens, hence contains the Borel sigma-algebra (The Borel sigma-algebra of a topological space). For each Borel , the preimage of under is , so this bounded factor is -measurable. By the addition formula in [F10], ; conditional expectation preservation [F6], taking out the known factor [F7], and step 2.1 give . Finite induction gives .
If , every , so each almost surely and almost surely. If and , then is nonnegative and implies by [F10]. Markov [F8] and step 3.1 give , using the reciprocal and addition formulas in [F10]. Choosing gives .
If , substitute in the all-real MGF bound from step 3.1. Since is nonnegative and implies by [F10], Markov [F8] gives ; choosing yields . The finite union bound [F9] combines the two tails; step 4.1 already handles . This lower-tail argument uses the same original variables and does not assert independence of their negatives.
Bernstein inequality for bounded independent sums
Statement
Let and let be independent centered square-integrable real random variables. Suppose is finite and almost surely for each . Put . For , if then and if then this probability is .
Facts & Assumptions
Given: Independent centered square-integrable real random variables , a finite deterministic bound , and almost surely.
For centered , (Moments, variance, and covariance on a probability space).
For independent real random variables and nonnegative Borel functions , the expectation of their product factors as the product of their expectations (Expectations factor over finite products of independent random variables).
If and , then (Markov's inequality for random variables).
, and this series converges absolutely for every real (The real exponential function and the number by a power series, The exponential series converges absolutely for every real argument).
for every real ( for every real , hence ).
A nonnegative measurable function with integral vanishes almost everywhere (A nonnegative measurable function has integral exactly when it vanishes almost everywhere).
The probability of a finite union of events is at most the sum of their probabilities (Basic identities for a probability measure).
Independence means independence of the sigma-algebras generated by the random variables (Independent random elements).
Expectation is linear, monotone, and bounded in modulus by the expectation of the absolute value (Linearity, monotonicity, and the modulus bound for expectation).
The real exponential is continuous and strictly increasing, is positive, satisfies , and obeys (The exponential function is strictly increasing, The exponential is positive and satisfies , The exponential addition formula ).
Finite sums of real-valued measurable functions are measurable (Arithmetic and lattice operations preserve measurability whenever they are defined).
Proof
Let . If , then every because . By [F6], almost surely for every , so the finite sum is almost surely and the stated tail probability is .
Suppose . If , every almost surely and , a contradiction; hence . For each fixed real , is continuous: when , continuity of follows from , and continuity of its composition with follows from [F10]; when it is constant. Thus is Borel: the Borel sets whose inverse images under are Borel form a sigma-algebra containing every open set, hence contain the sigma-algebra generated by opens (The Borel sigma-algebra of a topological space). For each Borel , is measurable. Now fix and with . For , the exponential series tail on is uniformly bounded by . Each partial sum at is integrable; the uniform bound and [F9] give , so expectation passes to the series limit. Centering removes the linear term, and for every , by [F1] and monotonicity. Also for : equality holds at , and each subsequent factorial factor is at least . Hence the geometric-series bound and from [F5] give .
Let , a measurable real random variable by [F11]. By the addition formula [F10], ; independence [F8] and factorization [F2], applied to the nonnegative Borel functions established in step 1.2, give for . Since is positive and increasing [F10], implies , so [F3] and the reciprocal and addition formulas in [F10] give . Choose ; then and direct simplification gives .
For , the bound in step 1.2 also holds at parameter . By [F10], ; the original variables remain independent by [F8], and [F2] factors these nonnegative Borel functions, giving . Since implies , Markov [F3] and the same optimizing choice as in step 2.1 yield . By [F7], the two one-sided bounds imply the displayed two-sided bound without asserting independence of the transformed variables .
Finite epsilon nets of the Euclidean sphere
Statement
Let be an integer and . There is a finite set such that every has some with , and Here by Euclidean spheres and closed balls as subspaces of . Such a set is called an -net of the sphere.
Facts & Assumptions
Given: An integer and .
The closed Euclidean ball and sphere are and ; the unit sphere is (Euclidean spheres and closed balls as subspaces of ).
is a metric, so it satisfies the triangle inequality ( as the set of functions , and , , are metrics on it).
Closed Euclidean balls are Jordan measurable, with and the stated slicing recursion for (Closed Euclidean balls are Jordan measurable and their volumes satisfy the slicing recursion).
An invertible linear map scales Jordan content by the absolute determinant; in particular for (A linear endomorphism of sends bounded Jordan sets to bounded Jordan sets and scales their content by the absolute determinant).
Translation preserves Jordan content (Jordan inner content, outer content, measurability, and content are translation invariant).
Jordan content is additive on finite disjoint families of bounded Jordan sets (Jordan content is finitely additive when the overlap has content zero).
Jordan outer content is the infimum of volumes of finite rectangle covers, and the content of a Jordan set is its common inner/outer value (Jordan inner and outer content and Jordan measurable bounded sets in ).
The natural numbers are unbounded in (Every complete ordered field is Archimedean).
Every nonempty finite set of real numbers has a maximum (Every nonempty finite set of reals has a maximum and a minimum).
For rational , rational powers preserve order on positive bases, and (Monotonicity of and of , Rational powers of a positive base).
The Riemann integral is monotone and additive across a cut, and the integral of a constant on an interval is (Linearity, monotonicity, the absolute-value estimate and coordinate-slice additivity for the Riemann integral in , The lower and upper Darboux integrals over a nondegenerate rectangle in ).
Proof
Put . This number is finite by [F3] and positive by induction on : , and for set . On , , so [F10] gives ; on all of this integrand is nonnegative. By [F11], splitting the integral at and and comparing the middle part with the constant shows . The volume recursion [F3] then gives from .
Let have pairwise distances greater than , and put . The closed balls are pairwise disjoint: a point in two of them would, by the triangle inequality [F2], put the corresponding centers at distance at most , contrary to the separation. Each small ball lies in , since and [F2] gives .
By scaling and translation invariance [F4, F5], every small ball in step 1.2 has content and the large ball has content . Finite additivity [F6] and monotonicity of outer content from [F7] give . Step 1.1 gives , so cancellation and yield . This also holds when is empty, for which .
Choose an integer using [F8]. Let be the set of cardinalities of finite subsets of whose distinct points are more than apart. The first coordinate unit vector shows is nonempty, and step 2.1 shows every member of is at most . Thus is a nonempty subset of ; [F9] gives a largest member , attained by a finite set by the definition of .
If some were farther than from every point of , adjoining would produce a finite set with pairwise distances greater than and cardinality , contradicting maximality in step 3.1. Thus is an -net; step 2.1 gives its stated cardinality bound. This construction uses only a maximum in a finite set of possible cardinalities, not an axiom of choice.
Doob differences inherit coordinate oscillation widths
Statement
Let , let be independent random elements with laws on measurable spaces , and let . Let be measurable with . Suppose finite deterministic satisfy for every , every fixed choice of the other coordinates, and every . For each , define by integrating over the unrevealed product coordinates, using the measurable finite versions given by Fubini; set and . Put and . Then is integrable and -measurable, and for every , Moreover, there are finite -measurable endpoints such that , almost surely, and almost surely. No choice axiom is used in this product-integral construction.
Facts & Assumptions
Given: The independent random elements, their marginal laws, the product-measurable integrable function, and the deterministic coordinate oscillation bounds in the Statement.
Independence of random elements means independence of their generated sigma-algebras (Independent random elements).
Independent random elements have joint law equal to the finite product of their marginal laws (Independent random elements have product joint law).
Integrating a measurable function against a random element's law gives its expectation (Change of variables for expectation).
Fubini for an function on a sigma-finite product gives integrable sections almost everywhere, measurable section-integral functions, and equality of iterated and product integrals (Fubini's theorem for L^1 functions on a sigma-finite product).
The finite product sigma-algebra is generated by measurable rectangles (The product sigma-algebra and its finite iterates).
Expectation of an integrable real random variable is its Lebesgue integral (Expectation of a nonnegative or integrable random variable).
Each marginal law is a probability measure: the law definition is by preimages, so disjoint measurable sets have disjoint preimages and countable additivity and total mass one pass from (Law or distribution of a random element).
Proof
By [F1] and [F2], the joint law of is . For , repeated application of [F4] gives a measurable version of the integral over the unrevealed coordinates; clause 3 of [F4] makes each such section-integral function integrable after assigning on its exceptional set. Set and , which are integrable by the hypothesis. Let . Then is integrable and -measurable by [F3], [F5], and the product-integral construction; [F6] identifies the expectation of each integrable with its Lebesgue integral.
Fix . Fubini applied to gives a measurable full-measure set of prefixes for which the integral of over is finite. For such a prefix there is a coordinate value whose future-section integral is finite. The coordinate oscillation assumption gives for every , so every future section is integrable and is finite. Integrating the same pointwise oscillation bound shows for all .
If , the definition of the sigma-algebra generated by the prefix writes for a product-measurable . By [F2], [F3], and [F4], integrating first over coordinate gives the same integral over as integrating . Hence .
On the full-measure prefix set from step 1.2, define and . They are finite because has finite range diameter at most . The definitions and [F7] imply and almost everywhere: the set of almost-everywhere upper bounds is upward closed, so belongs to it for every integer by the defining infimum; similarly is an almost-everywhere lower bound. Thus the explicitly defined sets and are null. Their countable union is null by [F7], and outside it letting gives both endpoint inequalities. These sequences and exceptional sets are specified by formulas, with no choice axiom. Also : otherwise choose with . The sets and then both have positive -measure by the definitions, so a point from each would violate the oscillation bound in step 1.2. For each , iff : if the latter holds, and [F7] give a positive-measure higher level, while means is not an almost-everywhere upper bound. Similarly, iff , using and [F7]. Repeated Fubini in [F4] makes measurable on this set; applying [F4] to the indicators of these level sets makes and measurable. Thus both endpoints are measurable.
Fubini gives for almost every prefix, so . Set and there, and set both to on the exceptional prefix set. These are finite measurable endpoints, contain , and have width at most . For -almost every , lies between them; by the product law this is almost surely. Together with step 2.1 this proves the asserted endpoint and event-integral properties for every .
Sub-exponential concentration for independent sums
Statement
Let be independent centered real random variables, with sub-exponential with parameters as defined in Sub-Gaussian variables and vectors, and sub-exponential variables, where and . Put , , and . For , if then and if then .
Facts & Assumptions
Given: Independent centered real random variables with sub-exponential parameters , where and .
Sub-exponentiality means whenever (Sub-Gaussian variables and vectors, and sub-exponential variables).
Independence means independence of the sigma-algebras generated by the variables (Independent random elements).
For independent real variables and nonnegative Borel functions, the expectation of the product factors (Expectations factor over finite products of independent random variables).
Markov's inequality gives for and (Markov's inequality for random variables).
The exponential is continuous and strictly increasing, positive, satisfies and , and has ; these imply , with equality only at (The real exponential function and the number by a power series, The exponential addition formula , The exponential is positive and satisfies , The exponential function is strictly increasing).
A nonnegative integrable function with integral vanishes almost everywhere (A nonnegative measurable function has integral exactly when it vanishes almost everywhere).
Probability is subadditive on finite unions (Basic identities for a probability measure).
A nonempty finite set of real numbers has a maximum (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).
Expectation is linear on integrable real random variables (Linearity, monotonicity, and the modulus bound for expectation).
Finite sums of real-valued measurable functions are measurable (Arithmetic and lattice operations preserve measurability whenever they are defined).
Proof
If , then every . Fix and choose . By [F1], both and are at most . The nonnegative random variable therefore has expectation at most by [F9]. By [F5], only when ; [F6] gives almost surely. The finite sum is consequently almost surely by [F7].
Suppose . By [F8], exists and is positive. For each real , the map is continuous: scalar multiplication is continuous since , and the exponential is continuous by [F5]. Its inverse images of open sets are open, so the collection of Borel sets with Borel preimage is a sigma-algebra containing the opens; hence is Borel by The Borel sigma-algebra of a topological space, For each Borel , is measurable. For , [F1] applies to every . By [F5], ; independence [F2] and factorization [F3] give .
For and , [F10] makes a measurable real random variable, and implies by [F5]. Markov [F4], step 1.2, and the reciprocal and addition formulas in [F5] yield . Choose . If , the exponent is . If , it is . Hence .
For , [F1] applies at parameter to every original . By [F5], ; the original variables are independent by [F2], the functions are nonnegative Borel by step 1.2, and factorization [F3] gives . Markov [F4] and the same optimizing choice as in step 2.1 yield the stated lower-tail bound. The finite union bound [F7] combines the tails; step 1.1 handles . No independence assertion about the transformed variables is needed.
Finite sub-Gaussian maxima and epsilon-net reduction
Statement
Let be centered sub-Gaussian real random variables with a common proxy , where . No independence is assumed. For , if then and if the probability is .
Let be a centered sub-Gaussian vector in with proxy , where . For , let be the sphere net supplied by Finite epsilon nets of the Euclidean sphere. Then for , if , and if this probability is . The deterministic reduction is for every .
Facts & Assumptions
Given: Centered scalar or vector random elements satisfying the sub-Gaussian proxy bounds; a finite integer ; and, in the vector clause, and .
A centered scalar is sub-Gaussian with proxy when for every real ; the vector condition bounds each projection (Sub-Gaussian variables and vectors, and sub-exponential variables).
For and , Markov gives (Markov's inequality for random variables).
Finite unions satisfy (Basic identities for a probability measure).
For and , there is a finite -net with (Finite epsilon nets of the Euclidean sphere).
and is the Euclidean norm (Euclidean spheres and closed balls as subspaces of ).
The Euclidean inner product satisfies (The Cauchy-Schwarz inequality for finite sums).
Every nonempty finite set of real numbers has a maximum (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).
The exponential is continuous and strictly increasing, positive, and satisfies and (The exponential function is strictly increasing, The exponential is positive and satisfies , The exponential addition formula ).
For every and natural , as ; use to get (The exponential dominates every fixed nonnegative integer power at ).
Proof
For each , is continuous by [F8] and continuity of scalar multiplication, hence Borel: the Borel sets with Borel preimage form a sigma-algebra containing all opens, so contain the sigma-algebra generated by opens (The Borel sigma-algebra of a topological space). For each Borel , is measurable, and by [F8]. If , then implies by [F8]; Markov [F2], the MGF bound [F1], and the reciprocal and addition formulas in [F8] give . Choosing gives ; Using parameter , implies ; the same Markov calculation gives , and gives the same lower-tail bound. If , Markov gives for every . By [F9] with and , the right side tends to as , so the tail is zero, and at parameter the same calculation gives .
Fix and put by [F5]. By [F4], some satisfies . Then [F6] gives . For the claimed reduction is immediate. Thus the deterministic net inequality holds.
By the finite maximum convention in [F7], the event is the union of the upper- and lower-tail events from step 1.1. Applying [F3] gives the stated finite-maximum bounds, without any independence assumption.
Apply step 1.2 to . If , then at least one of the projections has absolute value at least . Each projection is centered sub-Gaussian with proxy by [F1] because its direction is a unit vector. Step 2.1 and [F4] therefore give the displayed vector tail bound; when , step 2.1 gives probability zero.
McDiarmid bounded-differences inequality
Statement
Assume AC. Let , let be independent random elements, meaning measurable maps (Random elements and real random variables), with laws given by pushforward (Law or distribution of a random element). Put on the finite product sigma-algebra (The product sigma-algebra and its finite iterates). Let be product-measurable with . Suppose finite deterministic constants satisfy for every fixed setting of the other coordinates and every . The independent product-law theorem identifies the law of as . Applying change of variables for expectation first to and then to makes integrable and gives . Put . For , if then and if this probability is . The same bound holds for the lower tail, so the two-sided probability is at most when .
Facts & Assumptions
Given: AC, independent random elements , an integrable measurable real function of them, and the deterministic coordinate oscillation bounds in the Statement.
Assume AC, the Axiom of Choice. It is used for the conditional-expectation and conditional-Hoeffding suppliers (The Axiom of Choice).
The product-integral construction gives integrable adapted , with , , event-integral-zero differences, and predictable endpoints of width at most (Doob differences inherit coordinate oscillation widths).
Conditional expectation is the almost-sure class of integrable measurable versions satisfying all event-integral identities (Conditional expectation as an ae class).
Under AC, an integrable adapted process is a martingale when almost surely (Martingale submartingale and supermartingale).
If a martingale difference has predictable finite endpoints of deterministic width , its conditional exponential moment is at most (Conditional Hoeffding bound for bounded martingale differences).
Conditional expectation preserves the unconditional expectation (Basic algebra and order properties of conditional expectation).
A bounded measurable factor known under can be taken outside conditional expectation (Taking out what is known).
For and , (Markov's inequality for random variables).
Probability is subadditive on finite unions (Basic identities for a probability measure).
The joint law of independent random elements is the product of their marginal laws; for measurable with , change of variables applied to gives and applied to gives (Independent random elements have product joint law, Change of variables for expectation).
The real exponential is continuous and strictly increasing, positive, and satisfies and (The exponential function is strictly increasing, The exponential is positive and satisfies , The exponential addition formula ).
Every closed bounded interval with is compact (Heine-Borel by bisection: every closed bounded interval is compact).
A continuous real function is bounded on a compact subset of (A continuous real function on a compact subset of is bounded).
Proof
By [F9], the joint law of is , so the product integral in the statement is . By [F1], take the product-integral sequence and its differences . For every , [F1] gives . By [F2] and AC, is a version of , so [F3] makes a martingale. The same lemma gives finite predictable endpoints with and .
The event-integral identity of [F1] and [F2] give . Applying [F4] to these martingale differences and their endpoints gives for every real . Since the endpoints contain zero and have width at most , almost surely.
Put and . Step 2.1 bounds each difference by , hence for . This closed bounded interval is compact by [F11], and is continuous by [F10] and continuity of scalar multiplication, so [F12] makes bounded. Also is Borel: its open-set preimages are open, and the class of Borel sets whose preimages are Borel is a sigma-algebra containing the opens, hence contains the Borel sigma-algebra (The Borel sigma-algebra of a topological space). For each Borel , the preimage of under is , so this factor is -measurable. By the addition formula in [F10], ; conditional expectation preservation [F5] and taking out the known factor [F6] give . Finite induction yields .
If , all , so step 2.1 gives almost surely and . If and , then is nonnegative and implies by [F10]. Markov [F7] and step 3.1 give by the reciprocal and addition formulas in [F10]. Choosing gives the stated upper-tail bound.
Apply the same argument to for the lower-tail bound. For , [F8] combines the two tails; step 4.1 handles .
5 · Examples, counterexamples and false statements
None yet.
Sources
- Philippe Rigollet and Jan-Christian Hütter, High-Dimensional Statistics: Lecture Notes, Chapter 1, §1.2
- 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, Hoeffding's Lemma and Theorem 1.9
- John Duchi, Lecture Notes on Statistics and Information Theory, Chapter 4, Corollary 4.1.10
- John Duchi, Lecture Notes on Statistics and Information Theory, Chapter 4, Proposition 4.1.20 and equation (4.1.8)
- Jon A. Wellner, Empirical Processes: Theory and Applications, Chapter 1, §3, Lemma 3.3
- Philippe Rigollet and Jan-Christian Hütter, High-Dimensional Statistics: Lecture Notes, Chapter 1, §1.4, Lemma 1.18
- John K. Hunter, Measure Theory, Jordan content and volume properties
- John Duchi, Lecture Notes on Statistics and Information Theory, Chapter 4, §4.2.2, Proposition 4.2.5
- Philippe Rigollet and Jan-Christian Hütter, High-Dimensional Statistics: Lecture Notes, Chapter 1
- Philippe Rigollet and Jan-Christian Hütter, High-Dimensional Statistics: Lecture Notes, Chapter 1, §1.3, Theorem 1.13
- John Duchi, Lecture Notes on Statistics and Information Theory, Chapter 4, §4.1.2
- Philippe Rigollet and Jan-Christian Hütter, High-Dimensional Statistics: Lecture Notes, Chapter 1, Theorems 1.14 and 1.19
- Colin McDiarmid, On the Method of Bounded Differences, Surveys in Combinatorics 1989, §1