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.
Empirical-Process Complexity
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- 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
- Convexity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- 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 Algebra Methods in Combinatorics
- 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
- 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
- Suprema and Infima
- 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 Riemann Integral: Definition and Integrability
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Laws and Series of Independent Random Variables
2 · Summary
This page defines empirical and Rademacher processes with an explicit countability and outer-probability convention, then proves the independent-copy convex-moment symmetrization inequality with its factor 2 inside the convex function. It is an expectation statement; tail inequalities require their own measurability and integrability premises.
The Rademacher complexity here is one-sided and has no absolute value. Coordinate contraction has factor without requiring the coordinate maps to vanish at zero. The separate absolute-value theorem assumes they do vanish at zero and has factor . For a finite class of -valued functions, the uniform deviation bound is .
For VC-subgraph classes, the entropy statement gives the exact finite- logarithmic form for every , with the first-unshattered index convention and a finite nonzero envelope. Sauer–Shelah is applied only to traces on finite sampled sets; the proof does not assert an exponent uniform in . Its envelope transfer uses a finite weighted grid and product integration, so it does not inherit the Countable Choice hypothesis of the continuous Lebesgue-interval route.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Empirical, centered, and Rademacher processes
Definition
Let be a probability space, let be an integer, and let be IID random elements with law . For a class of measurable, integrable real-valued functions on , write
The map is the centered empirical process, and is its -scaled version. More generally, for independent processes whose marginal expectations are finite for each index , the centered process sum is
On an auxiliary probability-space extension, let be independent signs, each taking and with probability , independent of the observations. The empirical Rademacher process is
The centered Rademacher process is a distinct process; no equality between it and is part of this definition.
For a countable class of measurable functions, each displayed supremum of measurable sample paths is measurable. For an uncountable class, ordinary probability or expectation is used only when a specified countable subclass has the same supremum almost surely for the process in question; this is the separable-version convention used here. Otherwise state results using outer probability
and, for a nonnegative possibly nonmeasurable random quantity , outer expectation
In particular, measurability of every separately does not by itself make an uncountable supremum measurable.
Shattering, VC dimension, and first-unshattered index for set classes
Definition
Let be a family of subsets of an arbitrary set . For a finite , its trace is
The family shatters when . This extends the finite-ground-set trace convention of Shattering and the Vapnik–Chervonenkis dimension of a set family: any finite can be relabeled by , and relabeling preserves all traces and their cardinalities.
For a nonempty class, its VC dimension is the greatest size of a finite shattered set if those sizes are bounded, is if no singleton is shattered, and is if finite shattered sets have unbounded size. When the dimension is finite, its VC index is
equivalently the least positive integer such that no -point subset is shattered. The empty class is assigned by convention and is treated separately in the entropy theorem.
The Hoeffding MGF bound for a variable in a unit interval
Statement
Let be a measurable real random variable on a probability space with almost surely. Then, for every ,
This proof uses only finite product and scalar integral arguments; it does not assume the Axiom of Choice.
Facts & Assumptions
Given: A probability space, a measurable with almost surely, and .
If almost surely for integrable real variables, then (Linearity, monotonicity, and the modulus bound for expectation).
For and real , (The two-point convexity inequality for the exponential function).
For , is differentiable and ; (The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t, The exponential function is smooth and ).
Sums, scalar multiples, products, quotients with nonzero denominator, and compositions obey the usual derivative and continuity rules (Sums, scalar multiples, products and quotients: , , , and when , The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with , Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function).
If a differentiable function has continuous integrable derivative on a compact interval, the second fundamental theorem evaluates the integral of that derivative by endpoint differences (The second fundamental theorem: if is differentiable on with and is integrable, then ).
The exponential is positive, , and (The exponential is positive and satisfies , Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm).
A real-valued function is measurable when all strict upper or all strict lower threshold sets are measurable; the exponential is strictly increasing, positive, and inverse to the natural logarithm on positive inputs (Threshold characterisations of real-valued and extended-real-valued measurability, The exponential function is strictly increasing, The exponential is positive and satisfies , The natural logarithm as the inverse of the exponential function).
The exponential addition formula is (The exponential addition formula ).
Absolute values of measurable real functions are measurable. A statement holding almost surely has a measurable null exceptional set. The probability measure satisfies . For nonnegative measurable , the set function is a measure; the nonnegative integral is monotone under pointwise order, indicators integrate to their measures, and integrals over null sets vanish. A real measurable function is integrable exactly when its absolute-value integral is finite (Arithmetic and lattice operations preserve measurability whenever they are defined, Measure-null sets and almost-everywhere statements relative to a measure, Probability measures and probability spaces, The indefinite integral of a nonnegative measurable function is a measure, Integral over a measurable subset, Monotonicity and nonnegative homogeneity of the nonnegative integral, The integral of a nonnegative simple function, A nonnegative integral over a null set vanishes, Integrable real and complex functions, and their integrals).
Proof
Given: A probability space, a measurable with almost surely, and .
Let be any measurable real random variable. For , is the whole probability space by [F6]. For and , this set is the whole space if and empty if . For and , it is the whole space when ; when , strict increase of the exponential and the inverse relation with give Every set on the right is measurable by [F7]. Thus is measurable by the threshold characterization, with no appeal to a continuous-map Borel measurability result qualified by Countable Choice.
Let , measurable by [F9], so . Define ; by [F9] this is a measure. Since , [F9] gives , while gives . Therefore , so is integrable by [F9]. Put ; then [F1] gives . The shifted variable is measurable because for every real . Applying step 1.1 to and establishes measurability of both exponentials. Applying [F2] with endpoints gives for every ; taking expectations yields .
Define and . Positivity follows from [F6] and . With , [F3]–[F4] give and . The formula also covers or , since then remains positive.
The function in step 3.1 is continuous. For , integrating twice by [F5] gives . For , the same endpoint formula written from to gives .
By step 2.1 and the exponential addition formula [F8], ; step 4.1 bounds this by . This proves the claim for every real , including .
A finite uniform grid approximates interval length
Statement
Let be an integer, put for , and give the finite set the probability weights
For all ,
Facts & Assumptions
Given: An integer , the grid , and its specified weights.
A measure on a finite power-set space is a nonnegative set function that vanishes on the empty set and is countably additive (Measures on sigma-algebras). It is a probability measure when its total mass is one (Probability measures and probability spaces).
Finite sums are additive and obey the usual recursive sum law (Finite sums and finite products, by recursion, Laws of finite sums and finite products).
Proof
Given: An integer , the grid , and its specified weights.
The weights are nonnegative and sum to . Their finite weighted sum therefore defines a probability measure on the full power set of ; countable additivity reduces to finite additivity because is finite.
Define . If , the included weights have sum for and for , while ; the difference is at most . If , then and , again giving difference at most . The endpoint has both values zero and is the grid-point case .
For , the grid points in are those with and , so . Subtracting and applying step 1.2 at each endpoint gives absolute error at most .
Positive real powers preserve measurability
Statement
Let . The map is strictly increasing on . Consequently, if is a measurable space and is measurable, then is measurable.
Facts & Assumptions
Given: A measurable and a real exponent .
For , is continuous and differentiable on with derivative ; also and for (Continuity and derivatives of positive-base real powers, Real powers for positive bases, with the zero-base positive-exponent convention).
Positive-base real powers obey , so for (The exponent, product, quotient, and iterated-power laws for positive real bases and real exponents).
A real-valued function is measurable exactly when all threshold sets of the form are measurable (Threshold characterisations of real-valued and extended-real-valued measurability, A measurable function between measurable spaces).
The mean value theorem applies on every compact interval where the function is continuous on the interval and differentiable in its interior (The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with ).
Proof
Given: A real exponent and, for the measurability clause, a measurable function .
The map is strictly increasing on . If , [F1] gives continuity on and positive derivative at every , so [F4] gives ; if , [F1] gives .
For a threshold , . For , the set is . For , [F2] and strict increase from step 1.1 give . Each such set is measurable because is measurable, so [F3] implies is measurable.
Covering, packing, bracketing numbers, and metric entropy
Definition
A pseudometric on a set is a nonnegative symmetric function with and ; distinct points may have distance zero. For a nonempty subset and , the covering number is the least finite for which there are centers such that every satisfies for some . It is if no finite cover exists. Set .
The packing number is the largest size of a finite subset whose distinct members have pairwise distance strictly greater than . If the sizes of such finite subsets are unbounded, put ; put . These conventions give the radius comparison proved in Packing and covering numbers with explicit radius conventions ↗. The metric entropy is for nonempty classes, with .
For a probability measure on and a measurable real function , set for when the integral is finite, using the real-power convention, including , of Real powers for positive bases, with the zero-base positive-exponent convention. If the integral is , define directly. The function is measurable by Arithmetic and lattice operations preserve measurability whenever they are defined, and Positive real powers preserve measurability makes measurable, so this nonnegative extended integral is well-defined. On a class of functions with finite such norms, is a pseudometric: nonnegativity, symmetry, and zero diagonal follow from the absolute value, and the triangle inequality is Minkowski's inequality for integrals, including . Functions that agree -almost everywhere have distance zero. We write for this covering number.
For measurable real endpoints -almost everywhere, the bracket is the set of measurable functions satisfying -almost everywhere. Its width is . The bracketing number is the least number of such brackets of width at most that cover , or if no finite cover exists; for the empty class set it equal to . Centers of metric covers are in ; bracket endpoints need not be.
One-sided empirical Rademacher complexity
Definition
Let , let be a fixed sample in a measurable space , and let be a nonempty finite or countable class of measurable real functions such that the displayed supremum is finite and measurable on the finite sign space. Let be independent uniform signs. The one-sided empirical Rademacher complexity is
There is no absolute value in this definition and need not belong to . It differs from the absolute-value complexity .
Remarks
This convention is the one used in One-sided coordinate Rademacher contraction.
VC-subgraph classes, envelopes, and the first-unshattered index
Definition
Let be a measurable space and let be a class of measurable real-valued functions on it. The subgraph of is
It is measurable in : the coordinate lifts are measurable by The product sigma-algebra and its finite iterates, their difference is measurable by Arithmetic and lattice operations preserve measurability whenever they are defined, and its strict negative set is measurable by Threshold characterisations of real-valued and extended-real-valued measurability. The class is a VC-subgraph class when the set family has finite VC index as defined in Shattering, VC dimension, and first-unshattered index for set classes. For nonempty , write for the greatest size of a finite shattered set (zero if none is shattered) and
equivalently the least positive integer for which no -point set is shattered. If no finite such integer exists, set . The empty class is treated separately and assigned index by convention. Thus for every nonempty finite-index class, the VC dimension is exactly .
A measurable envelope of is a nonnegative measurable function on such that for every and . In an assertion, changing on a -null set does not change its norm or the distances in that assertion.
Uniform deviation bound for a finite unit-range class
Statement
Let , let be IID observations with law , and let be a finite nonempty class of measurable functions . For every ,
Here and . The proof uses only scalar exponential moments and finite independence; it does not assume the Axiom of Choice.
Facts & Assumptions
Given: IID observations, a finite nonempty measurable -valued class, , and .
IID means independent and identically distributed (Identical distribution and IID families); independence of random elements is defined through their generated sigma-algebras (Independent random elements).
Measurable functions of independent random elements remain independent (Measurable coordinatewise functions preserve independence).
If has law , then for integrable (Law or distribution of a random element, Change of variables for expectation).
If almost surely, then for all real (The Hoeffding MGF bound for a variable in a unit interval).
For independent real random variables and Borel maps , the expectation of a finite product of the nonnegative variables factors into the product of expectations; also, (Expectations factor over finite products of independent random variables, The exponential addition formula ).
For nonnegative and , (Markov's inequality for random variables).
A finite union of events has probability at most the sum of their probabilities (Basic identities for a probability measure).
For , the translation is Borel measurable because its strict upper threshold set at is . For , the map is Borel measurable: its upper threshold set is for ; for it is if and , empty if and , if , and if . These formulas use , positivity, strict increase, and the inverse relation of and . Borel maps preserve measurability under composition, and finite arithmetic and lattice operations preserve measurability (The exponential is positive and satisfies , The natural logarithm as the inverse of the exponential function, The real exponential function and the number by a power series, Composition with a Borel measurable outer map preserves measurability, The exponential function is strictly increasing, Threshold characterisations of real-valued and extended-real-valued measurability, Arithmetic and lattice operations preserve measurability whenever they are defined).
Proof
Given: IID observations, a finite nonempty measurable -valued class, , and .
Fix and put . By [F2]–[F3], the are measurable independent real random variables. By [F4], . The translation in [F9] is Borel measurable, so applying [F3] to shows that the are measurable, independent, and centered. Also almost surely.
For every , apply [F5] to , whose range is , to obtain . By [F9], is Borel measurable, so applying [F3] to the independent shows that are measurable and independent. Their expectations are finite by the displayed bound. The exponential addition formula and the nonnegative product case of [F6] now give The sum in the left exponential is measurable by [F9]'s arithmetic-measurability clause and composition clause.
For , [F7] and step 2.1 give . Setting gives .
Applying step 3.1's Markov argument to uses the bound from step 2.1 at (obtained by applying [F5] to each ) and gives . The finite union bound [F8] therefore gives .
The event in the statement is the union over the finite class of the events in step 4.1. A second application of [F8] gives the stated factor .
Independent-process symmetrization for convex moments
Statement
Let , let be IID observations with law , and let be an independent IID copy. Let be independent uniform signs, independent of both samples. Let be a nonempty countable class of measurable -integrable real functions. Assume the two suprema below are finite almost surely. If is finite, convex, and nondecreasing, then
The same statement holds for an uncountable class when a specified countable subclass gives the same three displayed suprema almost surely for the data, copy, and signs. This is an expectation inequality only; a tail form requires separate assumptions.
Facts & Assumptions
Given: IID observations, an independent IID copy and independent signs, a nonempty countable measurable class of integrable functions, finite displayed suprema, and a finite convex nondecreasing .
, , and ; the general centered independent-process sum is (Empirical, centered, and Rademacher processes).
Independence of random elements means independence of their generated sigma-algebras, and finite independent random elements have product joint law (Independent random elements, Independent random elements have product joint law).
For an integrable real random variable and a convex with integrable or nonnegative, (Jensen's inequality for expectation).
Tonelli's theorem permits iterated integration of nonnegative measurable functions on product measure spaces (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product, For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique).
Increasing nonnegative measurable functions pass to the limit under integration (Monotone convergence for the integral).
IID means independent and identically distributed; each observation and its copy therefore have the same law (Identical distribution and IID families).
The finite product measure is determined by its rectangle formula, so a coordinate permutation that preserves those rectangle probabilities preserves the product law (For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique).
For finite subclasses, coordinate lifts, sums, absolute values, maxima, and their compositions with a Borel map are measurable. Since is nondecreasing, each strict upper level set is an upper interval and hence Borel; composition with therefore preserves measurability (The product sigma-algebra and its finite iterates, Arithmetic and lattice operations preserve measurability whenever they are defined, Composition with a Borel measurable outer map preserves measurability).
Proof
Given: The objects and hypotheses of the statement.
First let be finite. For fixed observed values , write . Then . For each , ; taking the finite maximum and applying monotonicity of and Jensen [F3] gives . By [F8], these finite statistics and their -compositions are measurable, so Tonelli [F4] applies when integrating over observations and copy. It gives .
By [F6], each and has law ; by [F2] and the independent-copy hypothesis, all coordinates have product law. [F7] makes this product law invariant under swapping the two coordinates in any selected pair. Thus for every fixed sign vector , the signed difference process has the same law as the unsigned difference process. Averaging this equality over the finite sign space leaves the right-hand expectation in step 1.1 unchanged when is replaced by .
For every outcome, put and . By [F8] these statistics and their -compositions are measurable. The triangle inequality gives . Monotonicity and convexity yield ; since and have the same distribution, the resulting expectation is . Combining with steps 1.1 and 2.1 proves the desired inequality for finite .
Enumerate the countable class and let be its first members. The finite-class inequality applies to every , and its suprema increase to those over . To justify the limit, fix and . For , monotonicity and convexity give ; for , writing gives . Thus is continuous on . At zero, for any and , monotonicity and convexity give , so it is right-continuous there too. By [F8], the finite-class compositions are measurable; [F5] now passes both nonnegative expectations to the limit. A countable subclass giving the same suprema proves the stated separable-version extension.
Packing and covering numbers with explicit radius conventions
Statement
Let be a nonempty subset of a pseudometric space , with covering and packing numbers as in Covering, packing, bracketing numbers, and metric entropy. For every ,
The packing convention is strict separation ; covers use closed balls of radius at most centered in .
Facts & Assumptions
Given: A nonempty subset of a pseudometric space and .
is the least number of closed radius- balls centered in covering , while is the largest size of a finite subfamily with pairwise distances strictly greater than (Covering, packing, bracketing numbers, and metric entropy).
Proof
Given: The class, pseudometric, and radius in the statement.
Suppose a cover of by closed balls of radius is given. Two points in the same ball have distance at most by the triangle inequality, so an -separated subfamily contains at most one point from each ball. Hence every finite separated subfamily has size at most , and . Taking the least such proves ; if no finite cover exists the inequality is automatic.
If , then is immediate. Otherwise the finite separated cardinalities are a nonempty bounded subset of the natural numbers, so a largest size is attained by some finite separated subfamily .
Maximality of means each has for some ; if all distances were greater, adding would make a larger separated subfamily. Thus the balls centered at with radius cover , so .
One-sided coordinate Rademacher contraction
Statement
Let , let be fixed, and let be a nonempty finite class of real-valued functions on their domain. For each , let satisfy for all , with a common . Then
Here and . Expectations over signs mean this uniform finite average; no measurability on the functions' domain is needed. For measurable classes on a measurable space this agrees with One-sided empirical Rademacher complexity. Equivalently, the unnormalized left expectation is at most times the unnormalized one-sided supremum on the right.
The same holds for a countable class when both suprema are finite for every sign vector. No condition is required; additive constants cancel because the proof compares coordinate differences.
Facts & Assumptions
Given: A fixed sample, a nonempty finite class of real-valued functions, and coordinate maps with common Lipschitz constant .
The fixed-sample finite-average convention in the statement gives , with no absolute value. On measurable classes it is One-sided empirical Rademacher complexity.
Proof
Given: The finite class, fixed sample, and Lipschitz coordinate maps in the statement.
Fix a coordinate , arbitrary real offsets for , and . Averaging over gives . The Lipschitz bound makes the last summand at most . Because ordered pairs include both and , the supremum with equals the supremum with : swap the pair whenever . Factoring this last supremum gives .
Apply step 1.1 successively for . At stage , condition on all other signs and use , so the offsets include both unreplaced and replaced coordinates. Averaging the inequality over the other signs shows that replacing coordinate cannot decrease the expected supremum. Thus . Dividing by and using [F1] gives the statement.
For a countable class, enumerate its members and apply the finite result to each increasing finite initial subclass. For each of the finitely many sign vectors, the suprema increase to the stated finite supremum; taking the finite average over sign vectors passes the inequalities to the limit.
Remarks
Adding constants to the coordinate maps adds the same sign sum to every candidate in the supremum. Its sign expectation is zero, so the expected supremum is unchanged; this is why the one-sided result needs no zero-at-zero assumption.
Logarithmic L-r covering bound for VC classes of sets
Statement
Let be a nonempty class of measurable subsets of a measurable space, with finite VC index as in Shattering, VC dimension, and first-unshattered index for set classes. Let be a probability measure, , and . Put . Then
For sets, . In the case , the exponent is zero and the class consists of one set modulo equality, so the bound is .
Facts & Assumptions
Given: A nonempty measurable set class with finite VC index , a probability measure , , and .
For a set class, the distance is ; is the covering number with centers in the class, and uses strict pairwise separation (Covering, packing, bracketing numbers, and metric entropy).
A nonempty class has VC dimension when is its least positive unshattered size; traces on arbitrary finite ground sets define shattering (Shattering, VC dimension, and first-unshattered index for set classes).
A family of subsets of with VC dimension at most has size at most (Sauer–Shelah: a family on of VC dimension at most has at most members).
The finite product probability exists and assigns a measurable rectangle mass (The product sigma-algebra and its finite iterates, For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique).
A finite union of events has probability at most the sum of their probabilities (Basic identities for a probability measure).
For and a natural , , and for real ( for every real , hence ).
The finite binomial theorem is , where is the canonical embedding of naturals into reals and powers are natural powers (The binomial theorem in : , The set of -element subsets and the binomial coefficient , The canonical natural of a field, Integer powers ).
with strict separation and closed-ball radii as stated (Packing and covering numbers with explicit radius conventions).
is the increasing inverse of the exponential, , and (The natural logarithm as the inverse of the exponential function, Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm, The real exponential function and the number by a power series, The exponential addition formula , The exponential function is strictly increasing).
For , ; derivative rules and the mean value theorem apply on compact intervals (The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t, Sums, scalar multiples, products and quotients: , , , and when , The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with ).
Natural powers obey their recursive definition and are monotone in nonnegative bases (Integer powers , Monotonicity of and of ).
For , and positive-base real powers obey their product and iterated-power laws (Real powers for positive bases, with the zero-base positive-exponent convention, The exponent, product, quotient, and iterated-power laws for positive real bases and real exponents).
For every , is strictly increasing on (Positive real powers preserve measurability).
The inequality for gives by taking ( for every real , hence ).
For a real , its integer part satisfies , so obeys (Integer part: for every real there is exactly one integer with ).
Proof
Given: The class, measure, index, and radii in the statement.
Put . If and two sets differed at a point , their traces on would be both and , so would be shattered, contradicting [F2]. Thus all class members are equal, , and the bound holds.
Suppose . Fix any finite subfamily with pairwise distances greater than , where , and set and . Let from [F15] and ; then . Sample independently from on the finite product probability space supplied by [F4].
For , define . By [F10], , so the mean value theorem makes decreasing on and increasing on . Since by [F9], for every .
For , the probability that and have identical traces on this sample is : strict separation and [F13] give , and then [F4] and [F6] apply. The union bound [F5] makes the probability of any collision at most .
Define . By [F9], ; by [F14], ; also and . Hence .
Consequently some sample has distinct traces on . The induced trace family cannot shatter a set of indices containing a repeated sample value, because those two coordinates always have identical membership. Any shattered set of distinct sampled values is shattered by , so [F2] bounds its size by . Applying [F3] to the induced family gives .
If , then by step 2.2 and monotonicity of the exponential.
If , [F7], [F11], and step 2.2 give , so step 3.1 gives . If , put . For , the recursion and show successively that . Thus [F7] and [F6] give , hence . By step 3.1, .
Suppose . Then , so , and gives . Combining steps 3.1 and 4.1 yields . Set and . By [F9] and [F12], and , hence .
In step 5.1, implies . From , monotonicity and the product law in [F9] give by step 1.3. Thus , and step 5.1 yields . Therefore by [F11].
If , step 1.1 proves the result. If , step 2.2 gives , so one-member separated families satisfy the bound, and steps 4.1, 3.2, 5.1 and 6.1 bound every larger finite -separated subfamily by . Thus the packing number is finite and its largest integer size is attained; [F8] then gives . Substituting proves the statement.
Absolute-value Rademacher contraction
Statement
Let , let be fixed, and let be a nonempty finite class of real-valued functions on their domain. For each , suppose for all , with a common , and . Then
The same holds for a countable class when the two suprema are finite for every sign vector. This is the absolute-value theorem; its factor is separate from the factor in independent-process symmetrization.
Facts & Assumptions
Given: A fixed sample, a nonempty finite class, and -Lipschitz maps satisfying .
The one-sided coordinate contraction inequality applies to every finite class, including the class enlarged by the zero vector (One-sided coordinate Rademacher contraction).
Proof
Given: The sample, class, and coordinate maps in the statement.
Enlarge the evaluation-vector class by adjoining the zero vector. Since , for each sign vector both and are nonnegative. The supremum of the absolute value is .
The map preserves the uniform sign law, so . Therefore the left side is at most . Applying [F1] to the enlarged class gives . Combining proves the claimed factor .
For a countable class, enumerate its members and apply the finite proof to increasing finite initial subclasses. For each sign vector, the finite suprema increase to the corresponding countable supremum; averaging over the finite sign cube passes the inequalities to the limit.
VC-subgraph covering entropy with its finite-r logarithmic bound
Statement
Let be a probability space, let , and let be a nonempty VC-subgraph class of measurable real functions with finite VC index . Suppose a measurable envelope satisfies for every and , and
For every , put and . Then
The exponent in the first bound is the finite-r logarithmic form. No Axiom of Choice or Countable Choice is used in this proof.
Facts & Assumptions
Given: A probability measure , a nonempty VC-subgraph class with index , an envelope with , , and .
The subgraph of is , and the class has first-unshattered index (VC-subgraph classes, envelopes, and the first-unshattered index).
distance is ; covering centers belong to the covered class (Covering, packing, bracketing numbers, and metric entropy).
A nonempty measurable set class of finite VC index satisfies for and any probability measure (Logarithmic L-r covering bound for VC classes of sets).
If is measurable, then is a measure with total mass (The measure with density relative to , The indefinite integral of a nonnegative measurable function is a measure).
Finite products of sigma-finite measures have the rectangle formula, and Tonelli permits iterated integration of nonnegative measurable functions (The product sigma-algebra and its finite iterates, For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique, Tonelli's theorem for nonnegative measurable functions on a sigma-finite product).
For the finite grid with trapezoidal weights from A finite uniform grid approximates interval length, every interval has grid mass within of .
Coordinate lifts on a product space are measurable, and arithmetic and order operations on measurable real functions preserve measurability; strict threshold sets of measurable real functions are measurable (The product sigma-algebra and its finite iterates, Arithmetic and lattice operations preserve measurability whenever they are defined, Threshold characterisations of real-valued and extended-real-valued measurability).
For , is increasing on and sends nonnegative measurable functions to measurable functions (Positive real powers preserve measurability).
For each , there is an integer with (For every in a complete ordered field there is a natural with ).
Positive-base real powers obey the product and exponent laws (Real powers for positive bases, with the zero-base positive-exponent convention, The exponent, product, quotient, and iterated-power laws for positive real bases and real exponents).
The logarithm is increasing, , and for positive ; its derivative is , so the mean value theorem applies to it on positive compact intervals (The natural logarithm as the inverse of the exponential function, 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, Sums, scalar multiples, products and quotients: , , , and when , The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with ).
, since the exponential is strictly increasing and (The real exponential function and the number by a power series, The exponential function is strictly increasing).
Proof
Given: The objects and hypotheses of the statement.
Put . By [F8] is measurable; the hypotheses give . By [F7], the density is measurable. Define by ; its total mass is one by [F4].
Set . Then , so [F9] supplies an integer with . Use the grid and probability of [F6], and form the product probability on using [F5].
Let and define for . The coordinate projections are measurable because their preimages of measurable sets are rectangles; hence [F7] makes and each product-measurable. On , the map is injective and . If a finite set of pairs is shattered by , its image under is a same-size set shattered by . Thus the nonempty set class has finite VC index .
Fix . For , put and . The envelope gives , and the section is exactly . By [F6], its -mass differs from by at most . The set has -measure zero, since the density vanishes there.
Apply [F3] to under at radius . Since , , and makes ; thus the bracketed base is greater than one, so yields . Choose a cover with this many centers , each represented by some . The cover uses finitely many centers, so this uses only finite choice.
Integrating the section estimate under and using [F5] gives . For , put . If the inequality is immediate; if and , [F8] raises to the positive power and multiplication by gives it; for it is equality. Hence [F2] gives . The last inequality uses the discrepancy bound and the definition of .
For every , some center satisfies . Steps 5.1 and 2.1 then give . Thus the function class is covered by the same centers at radius , and its covering number is no larger than the set covering number in step 4.2.
Put . From and (since , so ), the base in step 4.2 is at most . Since this base exceeds one, step 6.1 proves the first asserted entropy bound.
Put . For , the function has and ; the mean value theorem [F11] gives . Hence . Let . From [F12], , so and . Thus and , whence because . This gives .
The first bound is the step 7.1 base raised to . Since , , and , we have . Thus the first bound is at most , proving the second inequality.
5 · Examples, counterexamples and false statements
None yet.
Sources
- David Pollard, Empirical Processes: Theory and Applications, Chapter 2
- David Pollard, Probability Tools, Tricks, and Miracles, 2026 manuscript, Chapter 13
- Jon A. Wellner, Empirical Processes: Theory and Applications, Chapter 1
- L. Babai and P. Frankl, Linear Algebra Methods in Combinatorics, Section 7.4
- Jon A. Wellner, Empirical Processes: Theory and Applications, Chapter 1, Section 8
- Philippe Rigollet and Jan-Christian Hütter, High-Dimensional Statistics: Lecture Notes, Chapter 1, Lemma 1.8
- John Duchi, Lecture Notes on Statistics and Information Theory, Chapter 4, Hoeffding's Lemma
- J. Lebl, Basic Analysis, Logarithm and Exponential
- MIT OpenCourseWare 18.100B Real Analysis, Spring 2025 full lecture notes
- David Pollard, Empirical Processes: Theory and Applications, Chapter 3, Definition 3.3
- Jon A. Wellner, Empirical Processes: Theory and Applications, Chapter 1, Sections 5–6
- Mehryar Mohri, Afshin Rostamizadeh, and Ameet Talwalkar, Foundations of Machine Learning, 2nd ed., Definition 3.1
- David Pollard, Empirical Processes: Theory and Applications, Chapter 5
- Jon A. Wellner, Empirical Processes: Theory and Applications, Chapter 1, Definition 8.1
- David Pollard, Probability Tools, Tricks, and Miracles, 2026 manuscript, Chapter 14, Section 14.2
- Philippe Rigollet and Jan-Christian Hütter, High-Dimensional Statistics: Lecture Notes, Chapter 1
- John Duchi, Lecture Notes on Statistics and Information Theory, Chapter 4
- David Pollard, Empirical Processes: Theory and Applications, Chapter 2, Theorem 2.2
- Jon A. Wellner, Empirical Processes: Theory and Applications, Chapter 1, Lemma 5.1
- David Pollard, Probability Tools, Tricks, and Miracles, 2026 manuscript, Section 13.2
- Jon A. Wellner, Empirical Processes: Theory and Applications, Chapter 1, Definition 3.3
- Mehryar Mohri, Afshin Rostamizadeh, and Ameet Talwalkar, Foundations of Machine Learning, 2nd ed., Lemma 5.7
- Jon A. Wellner, Empirical Processes: Theory and Applications, Chapter 1, Section 8, Theorem 8.1 inequality (2)
- David Pollard, Probability Tools, Tricks, and Miracles, 2026 manuscript, Chapter 14
- David Pollard, Empirical Processes: Theory and Applications, Chapter 5, Theorem 5.7
- Jon A. Wellner, Empirical Processes: Theory and Applications, Chapter 1, Theorem 8.2
- David Pollard, Probability Tools, Tricks, and Miracles, 2026 manuscript, Section 14.5