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.
Bracketing maximal inequality for the empirical process
Statement
Let be iid with law , and let be a nonempty countable class of measurable real functions with a nonnegative measurable envelope , so -almost everywhere for every , and . Use as in Empirical, centered, and Rademacher processes. Suppose that for some integer there are nested finite partitions of , for all , with nonempty cells. For each cell choose a representative and define its pointwise oscillation
Assume is measurable, -almost everywhere, and . If is contained in , then pointwise by definition. Put
The refinement property gives , so is nonincreasing.
There is a universal constant such that
This is a local maximal estimate: the nested partitions and their oscillation bounds are hypotheses. Empirical-process notation uses Empirical, centered, and Rademacher processes.
Facts & Assumptions
Given: The iid experiment, the countable class and square-integrable envelope, and the nested partitions and oscillation bounds in the statement.
Empirical, centered, and Rademacher processes: , , and . Its current batch-15 carrier and manifest entry agree; no Step 1 readiness record was present at this handoff.
Bernstein inequality for bounded independent sums: independent centered summands with total variance and absolute bound satisfy the two-sided Bernstein tail bound .
For 0 < p < infinity, the layer-cake formula computes the integral of |f|^p from the distribution function: for a nonnegative measurable random variable , , allowing infinite values.
Basic identities for a probability measure: finite and countable subadditivity give the union bounds for events.
Dominated convergence: almost-everywhere convergence dominated by one integrable function implies convergence of integrals.
Monotone convergence for the integral: increasing limits of nonnegative measurable functions pass through the integral.
Cauchy-Schwarz inequality for : on a probability space, for every .
Proof
Given: The objects and hypotheses in the statement.
First let be measurable functions with and . Applying [F2] to , whose variance is at most and whose absolute value is at most , gives Put and . By [F4], for , Using [F3] to integrate this tail after the increasing change of variable gives , since and . The same bound follows by continuity if or .
For , abbreviate its cell oscillation by . The sequence decreases pointwise and is dominated by , while . By [F7], ; by [F5] and the integrable majorant , the pointwise limit of consequently has integral zero and is zero -almost everywhere. Countability of and finiteness of each partition give one common full-measure set on which all envelope and oscillation bounds hold and every oscillation tends to zero; iid observations avoid its null complement almost surely. Define Nestedness makes these indicators constant on the corresponding cells. At each point either every cutoff passes or there is a unique first failed cutoff. In the first case, by the vanishing oscillation; in the second, the sum stops at that first failure. In either case, pointwise telescoping gives
The representatives have norm at most . Clip each representative to zero on . The clipped functions have absolute bound and the same bound, so step 1.1 bounds their expected maximum by . The unclipped remainders are bounded by , whose empirical-process maximum has expectation at most . Since , the definition of absorbs the second term into . Thus the coarse representatives contribute at most the first and tail terms in the claimed bound, up to a universal factor.
The first term on the right of step 1.2 is bounded by , because and . For any integrable , the triangle inequality and give . Thus this first term contributes at most .
Fix . Because is constant on its level- cell, the functions take at most distinct values. On , and , so and . Step 1.1 therefore bounds the expected maximum of by For each residual , , whence . The cutoff also gives . Since and , these bounds are at most a universal multiple of . Summing over is bounded by a universal multiple of the entropy tail in the statement.
The functions take at most distinct values by nestedness. On , both representatives lie in the level- cell, so and . Step 1.1 bounds their expected maximum by a universal multiple of Summing over gives the same entropy-tail bound.
If the entropy tail in the claimed bound is infinite, the result is immediate. Otherwise take finite partial sums in the decomposition of step 1.2: they stabilize at a first failed cutoff or telescope to , and their absolute values are bounded by outside the common null set from step 1.2. Dominated convergence [F5] and convergence of the finite sample averages therefore let the linear empirical-process map pass to the decomposition for each . Now take the supremum over the countable class. Step 2.1 bounds the coarse representatives, step 2.2 bounds the first failed-cutoff term, and steps 2.3–2.4 bound the two series; [F6] justifies summing the nonnegative expected maxima by monotone convergence. Combining these estimates and increasing the universal constant gives the stated inequality.
Remarks
The supremum in the Statement need not be attained, so replacing it by a maximum would leave the claim undefined for some permitted countable classes. For an explicit instance satisfying all the partition hypotheses, let be iid Bernoulli, put , , and take , with . For every , partition the coefficients into the dyadic half-open intervals , , restricted to . Each cell is nonempty, the partitions refine one another, and any supplied rational representative in each cell is permitted. The oscillation of each cell is exactly , hence is measurable, bounded by , and has norm . Here , so the entropy series in the bound is finite. At sample size , for either observation. Its supremum is , but no coefficient in the class attains that value. This explicitly refutes maximum attainment under the original hypotheses; the proof above bounds the measurable countable supremum throughout.
Depends on
- Empirical, centered, and Rademacher processes
- Basic identities for a probability measure
- Dominated convergence
- Bernstein inequality for bounded independent sums
- For 0 < p < infinity, the layer-cake formula computes the integral of |f|^p from the distribution function
- Monotone convergence for the integral
- Cauchy-Schwarz inequality for $L^2$
Used by
Dependency tree · two levels
55 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Jon A. Wellner, Empirical Processes: Theory and Applications, Chapter 1, §7, Theorem 7.6 and preceding proof (standard reference, not scraped)
- David Pollard, Empirical Processes: Theory and Applications, Section 8 (standard reference, not scraped)