Alphabeta Math
Pipeline-generated
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.

✓ 10 results · all verified · 4 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 6 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Empirical-Process Complexity

1 · Prerequisites

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 L without requiring the coordinate maps to vanish at zero. The separate absolute-value theorem assumes they do vanish at zero and has factor 2L. For a finite class of [0,1]-valued functions, the uniform deviation bound is 2∣F∣e−2nϵ2.

For VC-subgraph classes, the entropy statement gives the exact finite-r logarithmic form for every 1≤r<∞, 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 r. 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

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Empirical, centered, and Rademacher processes

Definition

Let (X,A,P) be a probability space, let n≥1 be an integer, and let Z1,…,Zn be IID random elements with law P. For a class F of measurable, integrable real-valued functions on X, write

Pf:=∫f dP,Pnf:=1n∑i=1nf(Zi),Gn(f):=n (Pnf−Pf).

The map f↦Pnf−Pf is the centered empirical process, and Gn is its n-scaled version. More generally, for independent processes X1(t),…,Xn(t) whose marginal expectations are finite for each index t∈T, the centered process sum is

Sn(t):=∑i=1n(Xi(t)−EXi(t)),t∈T.

On an auxiliary probability-space extension, let σ1,…,σn be independent signs, each taking +1 and −1 with probability 1/2, independent of the observations. The empirical Rademacher process is

Rn(f):=∑i=1nσif(Zi),f∈F.

The centered Rademacher process ∑iσi(f(Zi)−Pf) is a distinct process; no equality between it and Rn 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

P∗(A):=inf⁡{P(B):A⊆B, B∈A}

and, for a nonnegative possibly nonmeasurable random quantity Y, outer expectation

E∗Y:=inf⁡{EU:U is measurable, nonnegative, and U≥Y}.

In particular, measurability of every f separately does not by itself make an uncountable supremum measurable.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Shattering, VC dimension, and first-unshattered index for set classes

Definition

Let C⊆P(X) be a family of subsets of an arbitrary set X. For a finite T⊆X, its trace is

C∣T:={C∩T:C∈C}.

The family C shatters T when C∣T=P(T). This extends the finite-ground-set trace convention of Shattering and the Vapnik–Chervonenkis dimension of a set family: any finite T can be relabeled by [∣T∣], and relabeling preserves all traces and their cardinalities.

For a nonempty class, its VC dimension d(C) is the greatest size of a finite shattered set if those sizes are bounded, is 0 if no singleton is shattered, and is +∞ if finite shattered sets have unbounded size. When the dimension is finite, its VC index is

V(C):=d(C)+1,

equivalently the least positive integer V such that no V-point subset is shattered. The empty class is assigned V=0 by convention and is treated separately in the entropy theorem.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

The Hoeffding MGF bound for a variable in a unit interval

Statement

Let Y be a measurable real random variable on a probability space with 0≤Y≤1 almost surely. Then, for every λ∈R,

Eexp⁡{λ(Y−EY)}≤exp⁡(λ2/8).

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 Y with 0≤Y≤1 almost surely, and λ∈R.

[F1]

If X≤W almost surely for integrable real variables, then EX≤EW (Linearity, monotonicity, and the modulus bound for expectation).

[F2]

For 0≤t≤1 and real x,y, exp⁡((1−t)x+ty)≤(1−t)exp⁡(x)+texp⁡(y) (The two-point convexity inequality for the exponential function).

[F3]

For u>0, log⁡ is differentiable and log⁡′(u)=1/u; exp⁡′=exp⁡ (The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t, The exponential function is smooth and (exp⁡)′=exp⁡).

[F5]

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 G is differentiable on [a,b] with G′=f and f is integrable, then ∫abf=G(b)−G(a)).

[F7]

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 exp⁡(−x)=1/exp⁡(x), The natural logarithm as the inverse of the exponential function).

[F8]

The exponential addition formula is exp⁡(x+y)=exp⁡(x)exp⁡(y) (The exponential addition formula exp⁡(x+y)=exp⁡(x)exp⁡(y)).

[F9]

Absolute values of measurable real functions are measurable. A statement holding almost surely has a measurable null exceptional set. The probability measure satisfies P(Ω)=1. For nonnegative measurable g, the set function B↦∫Bg dP 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 Y with 0≤Y≤1 almost surely, and λ∈R.

1.1F6F7givenalgebra

Let X be any measurable real random variable. For a<0, {eλX>a} is the whole probability space by [F6]. For a≥0 and λ=0, this set is the whole space if a<1 and empty if a≥1. For a≥0 and λ≠0, it is the whole space when a=0; when a>0, strict increase of the exponential and the inverse relation with log⁡ give {eλX>a}={{X>(log⁡a)/λ},λ>0,{X<(log⁡a)/λ},λ<0. Every set on the right is measurable by [F7]. Thus eλX is measurable by the threshold characterization, with no appeal to a continuous-map Borel measurability result qualified by Countable Choice.

2.1F1F2F9step 1.1given

Let A:={∣Y∣≤1}, measurable by [F9], so P(A)=1. Define ν(B):=∫B∣Y∣ dP; by [F9] this is a measure. Since ∣Y∣1A≤1A, [F9] gives ν(A)≤P(A)=1, while P(Ac)=0 gives ν(Ac)=0. Therefore E∣Y∣=ν(Ω)=ν(A)+ν(Ac)≤1, so Y is integrable by [F9]. Put p:=EY; then [F1] gives p∈[0,1]. The shifted variable Y−p is measurable because {Y−p>a}={Y>a+p} for every real a. Applying step 1.1 to X=Y and X=Y−p establishes measurability of both exponentials. Applying [F2] with endpoints 0,λ gives eλy≤1−y+yeλ for every y∈[0,1]; taking expectations yields EeλY≤1−p+peλ.

3.1givenF3F4F6step 2.1algebra

Define g(λ):=1−p+peλ>0 and ψ(λ):=log⁡g(λ)−pλ. Positivity follows from [F6] and p∈[0,1]. With q(λ):=peλ/g(λ)∈[0,1], [F3]–[F4] give ψ(0)=ψ′(0)=0 and ψ′′(λ)=q(λ)(1−q(λ))∈[0,1/4]. The formula also covers p=0 or p=1, since then g remains positive.

4.1F5step 3.1algebra

The function ψ′′ in step 3.1 is continuous. For λ≥0, integrating twice by [F5] gives ψ(λ)=∫0λ(λ−s)ψ′′(s) ds≤λ2/8. For λ<0, the same endpoint formula written from λ to 0 gives ψ(λ)=∫λ0(s−λ)ψ′′(s) ds≤λ2/8.

5.1F8step 2.1step 4.1algebra∎

By step 2.1 and the exponential addition formula [F8], Eeλ(Y−p)=e−λpEeλY≤e−λpg(λ)=eψ(λ); step 4.1 bounds this by eλ2/8. This proves the claim for every real λ, including λ=0.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

A finite uniform grid approximates interval length

Statement

Let J≥1 be an integer, put uj=−1+2j/J for j=0,…,J, and give the finite set UJ={u0,…,uJ} the probability weights

νJ({u0})=νJ({uJ})=12J,νJ({uj})=1J(1≤j<J).

For all −1≤a≤b≤1,

∣νJ([a,b))−b−a2∣≤1J.

Facts & Assumptions

Given: An integer J≥1, the grid UJ, and its specified weights.

[F1]

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).

[F2]

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 J≥1, the grid UJ, and its specified weights.

1.1F1F2givenalgebra

The weights are nonnegative and sum to 1/(2J)+(J−1)/J+1/(2J)=1. Their finite weighted sum therefore defines a probability measure νJ on the full power set of UJ; countable additivity reduces to finite additivity because UJ is finite.

1.2F2givenalgebra

Define GJ(t):=νJ({u∈UJ:u<t}). If t=uk, the included weights have sum 0 for k=0 and (k−12)/J for 1≤k≤J, while (t+1)/2=k/J; the difference is at most 1/(2J). If uk<t<uk+1, then GJ(t)=(k+12)/J and (t+1)/2∈(k/J,(k+1)/J), again giving difference at most 1/(2J). The endpoint t=−1 has both values zero and t=1 is the grid-point case k=J.

2.1step 1.2algebra∎

For a≤b, the grid points in [a,b) are those with u≥a and u<b, so νJ([a,b))=GJ(b)−GJ(a). Subtracting (b−a)/2 and applying step 1.2 at each endpoint gives absolute error at most 1/(2J)+1/(2J)=1/J.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Positive real powers preserve measurability

Statement

Let r>0. The map t↦tr is strictly increasing on [0,∞). Consequently, if (X,A) is a measurable space and h:X→[0,∞) is measurable, then hr is measurable.

Facts & Assumptions

Given: A measurable h:X→[0,∞) and a real exponent r>0.

[F1]

For r>0, t↦tr is continuous and differentiable on (0,∞) with derivative rtr−1; also 0r=0 and tr>0 for t>0 (Continuity and derivatives of positive-base real powers, Real powers for positive bases, with the zero-base positive-exponent convention).

[F2]

Positive-base real powers obey (as)r=asr, so (c1/r)r=c for c>0 (The exponent, product, quotient, and iterated-power laws for positive real bases and real exponents).

[F3]

A real-valued function is measurable exactly when all threshold sets of the form {x:g(x)>c} are measurable (Threshold characterisations of real-valued and extended-real-valued measurability, A measurable function between measurable spaces).

Proof

Given: A real exponent r>0 and, for the measurability clause, a measurable function h:X→[0,∞).

1.1F1F4algebra

The map t↦tr is strictly increasing on [0,∞). If 0<s<t, [F1] gives continuity on [s,t] and positive derivative rur−1 at every u∈(s,t), so [F4] gives sr<tr; if s=0<t, [F1] gives sr=0<tr.

2.1F2F3step 1.1given∎

For a threshold c<0, {hr>c}=X. For c=0, the set is {h>0}. For c>0, [F2] and strict increase from step 1.1 give {hr>c}={h>c1/r}. Each such set is measurable because h is measurable, so [F3] implies hr is measurable.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Covering, packing, bracketing numbers, and metric entropy

Definition

A pseudometric d on a set T is a nonnegative symmetric function d:T×T→[0,∞) with d(t,t)=0 and d(s,t)≤d(s,u)+d(u,t); distinct points may have distance zero. For a nonempty subset F⊆T and ϵ>0, the covering number N(ϵ,F,d) is the least finite k for which there are centers f1,…,fk∈F such that every f∈F satisfies d(f,fj)≤ϵ for some j. It is +∞ if no finite cover exists. Set N(ϵ,∅,d)=1.

The packing number D(ϵ,F,d) is the largest size of a finite subset {f1,…,fk}⊆F whose distinct members have pairwise distance strictly greater than ϵ. If the sizes of such finite subsets are unbounded, put D=+∞; put D(ϵ,∅,d)=0. These conventions give the radius comparison proved in Packing and covering numbers with explicit radius conventions ↗. The metric entropy is H(ϵ,F,d):=log⁡N(ϵ,F,d) for nonempty classes, with log⁡(+∞)=+∞.

For a probability measure Q on (X,A) and a measurable real function g, set ∥g∥Q,r:=(∫∣g∣r dQ)1/r for 1≤r<∞ when the integral is finite, using the real-power convention, including 01/r=0, of Real powers for positive bases, with the zero-base positive-exponent convention. If the integral is +∞, define ∥g∥Q,r:=+∞ directly. The function ∣g∣ is measurable by Arithmetic and lattice operations preserve measurability whenever they are defined, and Positive real powers preserve measurability makes ∣g∣r measurable, so this nonnegative extended integral is well-defined. On a class of functions with finite such norms, dQ,r(f,g):=∥f−g∥Q,r is a pseudometric: nonnegativity, symmetry, and zero diagonal follow from the absolute value, and the triangle inequality is Minkowski's inequality for integrals, including p=∞. Functions that agree Q-almost everywhere have distance zero. We write N(ϵ,F,Lr(Q)) for this covering number.

For measurable real endpoints ℓ≤u Q-almost everywhere, the bracket [ℓ,u] is the set of measurable functions f satisfying ℓ≤f≤u Q-almost everywhere. Its Lr(Q) width is ∥u−ℓ∥Q,r. The bracketing number N[](ϵ,F,Lr(Q)) is the least number of such brackets of width at most ϵ that cover F, or +∞ if no finite cover exists; for the empty class set it equal to 1. Centers of metric covers are in F; bracket endpoints need not be.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

One-sided empirical Rademacher complexity

Definition

Let m≥1, let S=(z1,…,zm) be a fixed sample in a measurable space X, and let F 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 σ1,…,σm be independent uniform signs. The one-sided empirical Rademacher complexity is

R^S(F):=1m Eσsup⁡f∈F∑i=1mσif(zi).

There is no absolute value in this definition and 0 need not belong to F. It differs from the absolute-value complexity m−1Eσsup⁡f∈F∣∑iσif(zi)∣.

Remarks

This convention is the one used in One-sided coordinate Rademacher contraction.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

VC-subgraph classes, envelopes, and the first-unshattered index

Definition

Let (X,A) be a measurable space and let F be a class of measurable real-valued functions on it. The subgraph of f∈F is

Cf:={(x,t)∈X×R:t<f(x)}.

It is measurable in A⊗B(R): 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 F is a VC-subgraph class when the set family CF:={Cf:f∈F} has finite VC index as defined in Shattering, VC dimension, and first-unshattered index for set classes. For nonempty F, write d(F) for the greatest size of a finite shattered set (zero if none is shattered) and

V(F):=d(F)+1,

equivalently the least positive integer V for which no V-point set is shattered. If no finite such integer exists, set V=+∞. The empty class is treated separately and assigned index V=0 by convention. Thus for every nonempty finite-index class, the VC dimension is exactly V−1.

A measurable envelope of F is a nonnegative measurable function F on X such that ∣f(x)∣≤F(x) for every f∈F and x∈X. In an Lr(Q) assertion, changing F on a Q-null set does not change its norm or the distances in that assertion.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Uniform deviation bound for a finite unit-range class

Statement

Let n≥1, let Z1,…,Zn be IID observations with law P, and let F be a finite nonempty class of measurable functions f:X→[0,1]. For every ϵ>0,

P(sup⁡f∈F∣Pnf−Pf∣≥ϵ)≤2∣F∣e−2nϵ2.

Here Pnf=n−1∑if(Zi) and Pf=∫f dP. 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 [0,1]-valued class, n≥1, and ϵ>0.

[F1]

Pnf=n−1∑if(Zi) and Pf=∫f dP (Empirical, centered, and Rademacher processes).

[F2]

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).

[F3]

Measurable functions of independent random elements remain independent (Measurable coordinatewise functions preserve independence).

[F4]

If Z has law P, then Ef(Z)=∫f dP for integrable f (Law or distribution of a random element, Change of variables for expectation).

[F5]

If 0≤Y≤1 almost surely, then Eeλ(Y−EY)≤eλ2/8 for all real λ (The Hoeffding MGF bound for a variable in a unit interval).

[F6]

For independent real random variables Xi and Borel maps gi, the expectation of a finite product of the nonnegative variables gi(Xi) factors into the product of expectations; also, exp⁡(x+y)=exp⁡(x)exp⁡(y) (Expectations factor over finite products of independent random variables, The exponential addition formula exp⁡(x+y)=exp⁡(x)exp⁡(y)).

[F7]

For nonnegative W and a>0, P(W≥a)≤EW/a (Markov's inequality for random variables).

[F8]

A finite union of events has probability at most the sum of their probabilities (Basic identities for a probability measure).

[F9]

For c∈R, the translation t↦t−c is Borel measurable because its strict upper threshold set at a is (a+c,∞). For λ∈R, the map t↦eλt is Borel measurable: its upper threshold set is R for a≤0; for a>0 it is R if λ=0 and a<1, empty if λ=0 and a≥1, (log⁡(a)/λ,∞) if λ>0, and (−∞,log⁡(a)/λ) if λ<0. These formulas use exp⁡(0)=1, positivity, strict increase, and the inverse relation of exp⁡ and log⁡. Borel maps preserve measurability under composition, and finite arithmetic and lattice operations preserve measurability (The exponential is positive and satisfies exp⁡(−x)=1/exp⁡(x), The natural logarithm as the inverse of the exponential function, The real exponential function and the number e 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 [0,1]-valued class, n≥1, and ϵ>0.

1.1F1F2F3F4F9given

Fix f∈F and put Yi=f(Zi). By [F2]–[F3], the Yi are measurable independent real random variables. By [F4], EYi=Pf. The translation in [F9] is Borel measurable, so applying [F3] to Wi:=Yi−Pf shows that the Wi are measurable, independent, and centered. Also 0≤Yi≤1 almost surely.

2.1F5F6F9step 1.1

For every λ∈R, apply [F5] to Yi, whose range is [0,1], to obtain EeλWi=Eeλ(Yi−EYi)≤eλ2/8. By [F9], t↦eλt is Borel measurable, so applying [F3] to the independent Wi shows that eλWi 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 Eeλ∑iWi=E∏ieλWi=∏iEeλWi≤enλ2/8. The sum in the left exponential is measurable by [F9]'s arithmetic-measurability clause and composition clause.

3.1F1F7step 2.1algebra

For λ>0, [F7] and step 2.1 give P(∑iWi≥nϵ)≤exp⁡(−λnϵ+nλ2/8). Setting λ=4ϵ gives P(Pnf−Pf≥ϵ)≤e−2nϵ2.

4.1F1F5F7F8step 2.1step 3.1algebra

Applying step 3.1's Markov argument to −∑iWi uses the bound from step 2.1 at λ=−4ϵ (obtained by applying [F5] to each Yi) and gives P(Pnf−Pf≤−ϵ)≤e−2nϵ2. The finite union bound [F8] therefore gives P(∣Pnf−Pf∣≥ϵ)≤2e−2nϵ2.

5.1F8step 4.1∎

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 2∣F∣.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Independent-process symmetrization for convex moments

Statement

Let n≥1, let Z1,…,Zn be IID observations with law P, and let Z1′,…,Zn′ be an independent IID copy. Let σ1,…,σn be independent uniform signs, independent of both samples. Let F be a nonempty countable class of measurable P-integrable real functions. Assume the two suprema below are finite almost surely. If Φ:[0,∞)→[0,∞) is finite, convex, and nondecreasing, then

EΦ ⁣(sup⁡f∈F∣∑i=1n(f(Zi)−Pf)∣)≤EΦ ⁣(2sup⁡f∈F∣∑i=1nσif(Zi)∣).

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 Φ≥0.

[F1]

Pf=Ef(Zi), Pnf=n−1∑if(Zi), and Gn(f)=n(Pnf−Pf); the general centered independent-process sum is ∑i(Xi(t)−EXi(t)) (Empirical, centered, and Rademacher processes).

[F2]

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).

[F3]

For an integrable real random variable X and a convex Φ with Φ(X) integrable or nonnegative, Φ(EX)≤EΦ(X) (Jensen's inequality for expectation).

[F5]

Increasing nonnegative measurable functions pass to the limit under integration (Monotone convergence for the integral).

[F6]

IID means independent and identically distributed; each observation and its copy therefore have the same law P (Identical distribution and IID families).

[F7]

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).

[F8]

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.

1.1F1F3F4F8given

First let F0⊂F be finite. For fixed observed values z1,…,zn, write Df:=∑i(f(zi)−f(Zi′)). Then ∑i(f(zi)−Pf)=EZ′Df. For each f, ∣EZ′Df∣≤EZ′∣Df∣≤EZ′max⁡g∈F0∣Dg∣; taking the finite maximum and applying monotonicity of Φ and Jensen [F3] gives Φ(max⁡f∣∑i(f(zi)−Pf)∣)≤EZ′Φ(max⁡f∣Df∣). By [F8], these finite statistics and their Φ-compositions are measurable, so Tonelli [F4] applies when integrating over observations and copy. It gives EΦ(max⁡f∣∑i(f(Zi)−Pf)∣)≤EZ,Z′Φ(max⁡f∣∑i(f(Zi)−f(Zi′))∣).

2.1F2F6F7step 1.1

By [F6], each Zi and Zi′ has law P; by [F2] and the independent-copy hypothesis, all 2n 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 ∑iσi(f(Zi)−f(Zi′)) 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 f(Zi)−f(Zi′) is replaced by σi(f(Zi)−f(Zi′)).

3.1F8givenstep 1.1step 2.1algebra

For every outcome, put A:=max⁡f∣∑iσif(Zi)∣ and B:=max⁡f∣∑iσif(Zi′)∣. By [F8] these statistics and their Φ-compositions are measurable. The triangle inequality gives max⁡f∣∑iσi(f(Zi)−f(Zi′))∣≤A+B. Monotonicity and convexity yield Φ(A+B)≤12Φ(2A)+12Φ(2B); since A and B have the same distribution, the resulting expectation is EΦ(2A). Combining with steps 1.1 and 2.1 proves the desired inequality for finite F0.

4.1F1F5F8step 3.1given∎

Enumerate the countable class and let Fk be its first k members. The finite-class inequality applies to every Fk, and its suprema increase to those over F. To justify the limit, fix c>0 and b>c. For c<x<b, monotonicity and convexity give 0≤Φ(x)−Φ(c)≤x−cb−c(Φ(b)−Φ(c)); for 0<x<c, writing c=b−cb−xx+c−xb−xb gives 0≤Φ(c)−Φ(x)≤c−xb−c(Φ(b)−Φ(c)). Thus Φ is continuous on (0,∞). At zero, for any a>0 and t↓0, monotonicity and convexity give Φ(0)≤Φ(ta)≤(1−t)Φ(0)+tΦ(a), 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.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Packing and covering numbers with explicit radius conventions

Statement

Let F be a nonempty subset of a pseudometric space (T,d), with covering and packing numbers as in Covering, packing, bracketing numbers, and metric entropy. For every ϵ>0,

N(ϵ,F,d)≤D(ϵ,F,d)≤N(ϵ/2,F,d).

The packing convention is strict separation d(f,g)>ϵ; covers use closed balls of radius at most ϵ centered in F.

Facts & Assumptions

Given: A nonempty subset F of a pseudometric space and ϵ>0.

[F1]

N(ϵ,F,d) is the least number of closed radius-ϵ balls centered in F covering F, while D(ϵ,F,d) 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.

1.1F1given

Suppose a cover of F by k<∞ closed balls of radius ϵ/2 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 k, and D(ϵ,F,d)≤k. Taking the least such k proves D(ϵ,F,d)≤N(ϵ/2,F,d); if no finite cover exists the inequality is automatic.

1.2F1given

If D(ϵ,F,d)=+∞, then N(ϵ,F,d)≤D(ϵ,F,d) 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 G⊆F.

2.1F1step 1.2∎

Maximality of G means each f∈F has d(f,g)≤ϵ for some g∈G; if all distances were greater, adding f would make a larger separated subfamily. Thus the balls centered at G with radius ϵ cover F, so N(ϵ,F,d)≤∣G∣=D(ϵ,F,d).

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

One-sided coordinate Rademacher contraction

Statement

Let m≥1, let z1,…,zm be fixed, and let F be a nonempty finite class of real-valued functions on their domain. For each i, let Φi:R→R satisfy ∣Φi(x)−Φi(y)∣≤L∣x−y∣ for all x,y∈R, with a common L≥0. Then

1m Eσsup⁡f∈F∑i=1mσiΦi(f(zi))≤L R^S(F).

Here S=(z1,…,zm) and R^S(F):=m−12−m∑σ∈{−1,1}msup⁡f∈F∑iσif(zi). 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 L 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 Φi(0)=0 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 Φi with common Lipschitz constant L≥0.

[F1]

The fixed-sample finite-average convention in the statement gives R^S(F)=m−1Eσsup⁡f∈F∑iσif(zi), 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.

1.1givenalgebra

Fix a coordinate k, arbitrary real offsets af for f∈F, and xf:=f(zk). Averaging over σk gives Eσksup⁡f(af+σkΦk(xf))=12sup⁡f,g(af+ag+Φk(xf)−Φk(xg)). The Lipschitz bound makes the last summand at most L∣xf−xg∣. Because ordered pairs include both (f,g) and (g,f), the supremum with L∣xf−xg∣ equals the supremum with L(xf−xg): swap the pair whenever xf<xg. Factoring this last supremum gives 12sup⁡f(af+Lxf)+12sup⁡g(ag−Lxg)=Eσksup⁡f(af+σkLxf).

2.1F1step 1.1algebra

Apply step 1.1 successively for k=m,m−1,…,1. At stage k, condition on all other signs and use af:=∑i<kσiΦi(f(zi))+∑i>kσiLf(zi), so the offsets include both unreplaced and replaced coordinates. Averaging the inequality over the other signs shows that replacing coordinate k cannot decrease the expected supremum. Thus Eσsup⁡f∑iσiΦi(f(zi))≤LEσsup⁡f∑iσif(zi). Dividing by m and using [F1] gives the statement.

3.1step 2.1given∎

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 ci to the coordinate maps adds the same sign sum ∑iσici 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.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Logarithmic L-r covering bound for VC classes of sets

Statement

Let C be a nonempty class of measurable subsets of a measurable space, with finite VC index V as in Shattering, VC dimension, and first-unshattered index for set classes. Let Q be a probability measure, 1≤r<∞, and 0<δ<1. Put K:=3e2/(e−1). Then

N(δ,C,Lr(Q))≤[Kδ−rlog⁡(3eδr)]V−1.

For sets, ∥1C−1D∥Q,r=Q(C△D)1/r. In the case V=1, the exponent is zero and the class consists of one set modulo equality, so the bound is N=1.

Facts & Assumptions

Given: A nonempty measurable set class C with finite VC index V, a probability measure Q, 1≤r<∞, and 0<δ<1.

[F1]

For a set class, the Lr(Q) distance is Q(C△D)1/r; N is the covering number with centers in the class, and D uses strict pairwise separation (Covering, packing, bracketing numbers, and metric entropy).

[F2]

A nonempty class has VC dimension d=V−1 when V is its least positive unshattered size; traces on arbitrary finite ground sets define shattering (Shattering, VC dimension, and first-unshattered index for set classes).

[F3]

A family of subsets of [n] with VC dimension at most d has size at most ∑j=0d(nj) (Sauer–Shelah: a family on [n] of VC dimension at most d has at most ∑i=0d(ni) members).

[F4]

The finite product probability Q⊗n exists and assigns a measurable rectangle A1×⋯×An mass ∏iQ(Ai) (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).

[F5]

A finite union of events has probability at most the sum of their probabilities (Basic identities for a probability measure).

[F6]

For 0≤u≤1 and a natural n, (1−u)n≤e−nu, and 1+x≤ex for real x (1+x≤exp⁡(x) for every real x, hence (1−p)m≤exp⁡(−mp)).

[F8]

N(ϵ,C,d)≤D(ϵ,C,d)≤N(ϵ/2,C,d) with strict separation and closed-ball radii as stated (Packing and covering numbers with explicit radius conventions).

[F11]

Natural powers obey their recursive definition and are monotone in nonnegative bases (Integer powers am, Monotonicity of x↦xn and of n↦an).

[F12]

For a>0, ar=exp⁡(rlog⁡a) 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).

[F13]

For every r>0, t↦tr is strictly increasing on [0,∞) (Positive real powers preserve measurability).

[F14]

The inequality 1+x≤ex for x≥0 gives e≥2 by taking x=1 (1+x≤exp⁡(x) for every real x, hence (1−p)m≤exp⁡(−mp)).

[F15]

For a real s, its integer part k satisfies k≤s<k+1, so n:=k+1 obeys s<n≤s+1 (Integer part: for every real x there is exactly one integer m with m≤x<m+1).

Proof

Given: The class, measure, index, and radii in the statement.

1.1F2given

Put d:=V−1. If d=0 and two sets C,D∈C differed at a point x, their traces on {x} would be both ∅ and {x}, so {x} would be shattered, contradicting [F2]. Thus all class members are equal, N(δ,C,Lr(Q))=1, and the bound holds.

1.2F1F4F15given

Suppose d≥1. Fix any finite subfamily C1,…,Cm with pairwise Lr(Q) distances greater than δ, where m≥2, and set η:=δr∈(0,1) and s:=2log⁡(m)/η>0. Let k:=⌊s⌋ from [F15] and n:=k+1; then s<n≤s+1. Sample X1,…,Xn independently from Q on the finite product probability space supplied by [F4].

1.3F9F10algebra

For u≥1, define h(u):=u/e−log⁡u. By [F10], h′(u)=1/e−1/u, so the mean value theorem makes h decreasing on [1,e] and increasing on [e,∞). Since h(e)=0 by [F9], log⁡u≤u/e for every u≥1.

2.1F1F4F5F6F13step 1.2algebra

For j≠k, the probability that Cj and Ck have identical traces on this sample is [1−Q(Cj△Ck)]n≤(1−η)n≤e−nη: strict separation and [F13] give Q(Cj△Ck)>δr=η, and then [F4] and [F6] apply. The union bound [F5] makes the probability of any collision at most (m2)e−nη≤(m2)m−2<1.

2.2F9F14givenalgebrastep 1.2

Define B:=Kη−1log⁡(3e/η). By [F9], K=3e2/(e−1)>e; by [F14], e≥2; also η−1>1 and log⁡(3e/η)>log⁡e=1. Hence B>e≥2.

3.1F2F3step 2.1choose

Consequently some sample has m distinct traces on [n]. 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 C, so [F2] bounds its size by d. Applying [F3] to the induced family gives m≤∑j=0d(nj).

3.2F9F11step 2.2algebrastep 1.2

If log⁡m≤d, then m≤ed<Bd by step 2.2 and monotonicity of the exponential.

4.1F6F7F11step 3.1algebrastep 2.2

If d≥n, [F7], [F11], and step 2.2 give ∑j=0d(nj)=2n≤2d<Bd, so step 3.1 gives m<Bd. If d<n, put x:=d/n∈(0,1). For j≤d, the recursion xk+1=xkx and 0<x<1 show successively that xd≤xj. Thus [F7] and [F6] give xd∑j=0d(nj)≤∑j=0d(nj)xj≤(1+x)n≤enx=ed, hence ∑j=0d(nj)≤(en/d)d. By step 3.1, m≤(en/d)d.

5.1F9F12step 3.1step 4.1algebrastep 1.2

Suppose log⁡m>d. Then n≥2log⁡(m)/η>2d, so d<n, and log⁡(m)/η>1 gives n≤3log⁡(m)/η. Combining steps 3.1 and 4.1 yields m≤(3elog⁡(m)/(dη))d. Set y:=3e/η and z:=exp⁡((log⁡m)/d)>e. By [F9] and [F12], zd=m and log⁡z=(log⁡m)/d, hence z/log⁡z≤y.

6.1F9F11step 5.1step 1.3algebra

In step 5.1, z>e implies u:=log⁡z>1. From z≤ylog⁡z, monotonicity and the product law in [F9] give u≤log⁡y+log⁡u≤log⁡y+u/e by step 1.3. Thus u≤ee−1log⁡y, and step 5.1 yields z≤ee−1ylog⁡y=Kη−1log⁡(3e/η)=B. Therefore m=zd≤Bd by [F11].

7.1F8step 1.1step 2.2step 4.1step 3.2step 5.1step 6.1∎

If d=0, step 1.1 proves the result. If d≥1, step 2.2 gives B>1, 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 Bd. Thus the packing number is finite and its largest integer size is attained; [F8] then gives N(δ,C,Lr(Q))≤D(δ,C,Lr(Q))≤Bd. Substituting d=V−1 proves the statement.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Absolute-value Rademacher contraction

Statement

Let m≥1, let z1,…,zm be fixed, and let F be a nonempty finite class of real-valued functions on their domain. For each i, suppose ∣Φi(x)−Φi(y)∣≤L∣x−y∣ for all x,y∈R, with a common L≥0, and Φi(0)=0. Then

Eσsup⁡f∈F∣∑i=1mσiΦi(f(zi))∣≤2L Eσsup⁡f∈F∣∑i=1mσif(zi)∣.

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 2 is separate from the factor 2 in independent-process symmetrization.

Facts & Assumptions

Given: A fixed sample, a nonempty finite class, and L-Lipschitz maps Φi satisfying Φi(0)=0.

[F1]

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.

1.1givenalgebra

Enlarge the evaluation-vector class by adjoining the zero vector. Since Φi(0)=0, for each sign vector both A:=sup⁡f∈F∪{0}∑iσiΦi(f(zi)) and B:=sup⁡f∈F∪{0}−∑iσiΦi(f(zi)) are nonnegative. The supremum of the absolute value is max⁡(A,B)≤A+B.

2.1F1step 1.1algebra

The map σ↦−σ preserves the uniform sign law, so EσA=EσB. Therefore the left side is at most 2EσA. Applying [F1] to the enlarged class gives EσA≤LEσsup⁡f∈F∪{0}∑iσif(zi)≤LEσsup⁡f∈F∣∑iσif(zi)∣. Combining proves the claimed factor 2L.

3.1step 2.1given∎

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.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

VC-subgraph covering entropy with its finite-r logarithmic bound

Statement

Let (X,A,Q) be a probability space, let 1≤r<∞, and let F be a nonempty VC-subgraph class of measurable real functions with finite VC index V. Suppose a measurable envelope F satisfies ∣f(x)∣≤F(x) for every f∈F and x∈X, and

0<∥F∥Q,r:=(∫Fr dQ)1/r<∞.

For every 0<ϵ<1, put K0:=3e2/(e−1) and K:=4K0. Then

N ⁣(ϵ∥F∥Q,r,F,Lr(Q))≤[K(2/ϵ)rlog⁡ ⁣(3e(2/ϵ)r)]V−1≤(Aϵ)ArV,A:=12eK+2.

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 Q, a nonempty VC-subgraph class F with index V, an envelope F with 0<∥F∥Q,r<∞, 1≤r<∞, and 0<ϵ<1.

[F1]

The subgraph of f is Cf={(x,t):t<f(x)}, and the class has first-unshattered index V (VC-subgraph classes, envelopes, and the first-unshattered index).

[F2]

Lr(Q) distance is ∥f−g∥Q,r; covering centers belong to the covered class (Covering, packing, bracketing numbers, and metric entropy).

[F3]

A nonempty measurable set class of finite VC index W satisfies N(δ,C,L1(μ))≤[K0δ−1log⁡(3e/δ)]W−1 for 0<δ<1 and any probability measure μ (Logarithmic L-r covering bound for VC classes of sets).

[F4]

If h≥0 is measurable, then h dQ is a measure with total mass ∫h dQ (The measure with density f relative to μ, The indefinite integral of a nonnegative measurable function is a measure).

[F6]

For the finite grid UJ with trapezoidal weights from A finite uniform grid approximates interval length, every interval [a,b)⊆[−1,1] has grid mass within 1/J of (b−a)/2.

[F7]

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).

[F8]

For r>0, t↦tr is increasing on [0,∞) and sends nonnegative measurable functions to measurable functions (Positive real powers preserve measurability).

[F9]

For each δ>0, there is an integer J≥1 with 1/J≤δ (For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε).

[F12]

e=exp⁡(1)>1, since the exponential is strictly increasing and exp⁡(0)=1 (The real exponential function and the number e by a power series, The exponential function is strictly increasing).

Proof

Given: The objects and hypotheses of the statement.

1.1F4F7F8givenalgebra

Put M:=∫Fr dQ=∥F∥Q,rr. By [F8] Fr is measurable; the hypotheses give 0<M<∞. By [F7], the density Fr/M is measurable. Define R by dR=(Fr/M) dQ; its total mass is one by [F4].

2.1F5F6F9givenalgebrastep 1.1

Set δ:=ϵr/2r+1. Then 0<δ<1, so [F9] supplies an integer J≥1 with 1/J≤δ. Use the grid UJ and probability νJ of [F6], and form the product probability Q~:=R⊗νJ on X×UJ using [F5].

3.1F1F7givenstep 2.1

Let X+:={x:F(x)>0} and define Af:={(x,u):x∈X+, uF(x)<f(x)} for f∈F. The coordinate projections are measurable because their preimages of measurable sets are rectangles; hence [F7] makes X+ and each Af product-measurable. On X+×UJ, the map ψ(x,u):=(x,F(x)u) is injective and Af=ψ−1(Cf). If a finite set of pairs is shattered by {Af:f∈F}, its image under ψ is a same-size set shattered by {Cf:f∈F}. Thus the nonempty set class CJ:={Af:f∈F} has finite VC index VJ≤V.

4.1F6F8step 1.1step 3.1given

Fix f,g∈F. For x∈X+, put a(x):=min⁡(f(x),g(x))/F(x) and b(x):=max⁡(f(x),g(x))/F(x). The envelope gives −1≤a(x)≤b(x)≤1, and the section (Af△Ag)x is exactly {u∈UJ:a(x)≤u<b(x)}. By [F6], its νJ-mass differs from ∣f(x)−g(x)∣/(2F(x)) by at most 1/J. The set X∖X+ has R-measure zero, since the density Fr/M vanishes there.

4.2F3F12givenchoosestep 2.1step 3.1

Apply [F3] to CJ under Q~ at radius δ. Since e>1, K0=3e2/(e−1)>1, and δ<1 makes log⁡(3e/δ)>1; thus the bracketed base is greater than one, so VJ≤V yields N(δ,CJ,L1(Q~))≤[K0δ−1log⁡(3e/δ)]V−1<∞. Choose a cover with this many centers Ag1,…,Agk, each represented by some gj∈F. The cover uses finitely many centers, so this uses only finite choice.

5.1F2F5F8F10step 1.1step 4.1algebra

Integrating the section estimate under R and using [F5] gives ∣Q~(Af△Ag)−12∫X+∣f−g∣F dR∣≤1J. For x∈X+, put a:=∣f(x)−g(x)∣≤2F(x). If a=0 the inequality ar≤2r−1F(x)r−1a is immediate; if a>0 and r>1, [F8] raises a≤2F(x) to the positive power r−1 and multiplication by a gives it; for r=1 it is equality. Hence [F2] gives ∥f−g∥Q,rr≤2r−1M∫X+∣f−g∣F dR≤2rM(Q~(Af△Ag)+1J). The last inequality uses the discrepancy bound and the definition of R.

6.1step 2.1step 5.1step 4.2algebra

For every f∈F, some center satisfies Q~(Af△Agj)≤δ. Steps 5.1 and 2.1 then give ∥f−gj∥Q,rr≤2rM(δ+1/J)≤2r+1Mδ=ϵrM. Thus the function class is covered by the same k centers at radius ϵ∥F∥Q,r, and its covering number is no larger than the set covering number in step 4.2.

7.1F11F12step 4.2step 6.1algebra

Put L:=log⁡(3e(2/ϵ)r). From δ−1=2(2/ϵ)r and log⁡(3e/δ)=L+log⁡2≤2L (since 3e(2/ϵ)r>2, so L>log⁡2), the base in step 4.2 is at most 4K0(2/ϵ)rL=K(2/ϵ)rL. Since this base exceeds one, step 6.1 proves the first asserted entropy bound.

8.1F11F12step 7.1algebra

Put η:=(ϵ/2)r∈(0,1). For u≥1, the function h(u):=u−log⁡u has h(1)=1 and h′(u)=1−1/u≥0; the mean value theorem [F11] gives log⁡u≤u. Hence Kη−1log⁡(3e/η)≤3eKη−2=3eK(2/ϵ)2r. Let A:=12eK+2. From [F12], e−1<e, so K0=3e2/(e−1)>3e>3 and K=4K0>4. Thus x:=3eK>1 and A/2=6eK+1≥x, whence (A/2)2r≥x2r≥x because r≥1. This gives 3eK(2/ϵ)2r≤(A/ϵ)2r.

9.1step 7.1step 8.1algebra∎

The first bound is the step 7.1 base raised to V−1. Since A/ϵ>1, A≥2, and V≥1, we have 2r(V−1)≤ArV. Thus the first bound is at most (A/ϵ)ArV, proving the second inequality.

5 · Examples, counterexamples and false statements

None yet.

Sources