Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28
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.

Lebesgue's criterion for Riemann integrability: a bounded ff on [a,b][a,b] is Riemann integrable if and only if its set of discontinuities has measure zero

Statement

Let a<ba < b be reals, let f:[a,b]Rf : [a,b] \to \mathbb{R} be bounded (Lower bound, bounded below, bounded set) and let

D  :=  {x[a,b] : f is discontinuous at x}D \;:=\; \{\, x \in [a,b] \ : \ f \text{ is discontinuous at } x \,\}

(Continuity of f:ARf : A \to \mathbb{R} at a point of AA and on AA: the ε\varepsilon-δ\delta condition, its agreement with limxcf(x)=f(c)\lim_{x \to c} f(x) = f(c) at a limit point, and continuity at an isolated point, Discontinuity of ff at a point of its domain, and its classification: removable discontinuity, jump discontinuity and essential discontinuity, equivalently Rudin's discontinuities of the first and of the second kind). Then

f is Riemann integrable on [a,b]D has measure zerof \text{ is Riemann integrable on } [a,b] \quad \Longleftrightarrow \quad D \text{ has measure zero}

(The lower and upper Darboux integrals of a bounded ff on [a,b][a,b] as supPL(f,P)\sup_P L(f,P) and infPU(f,P)\inf_P U(f,P), Darboux integrability as their equality, and the notation abf\int_a^b f, Measure zero (a countable cover by intervals of total length below every ε\varepsilon) and content zero (a finite such cover)).

The choice cost, named. The implication from integrability to DD being null uses the Axiom of Countable Choice (The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)) exactly once, through A countable union of measure-zero sets has measure zero, by countable choice at step 7.1: DD is exhibited as the union of a sequence of null sets. The converse implication, from DD null to integrability, is a theorem of ZF: it uses no choice principle at all.

"Measure zero" here is the cover condition of Measure zero (a countable cover by intervals of total length below every ε\varepsilon) and content zero (a finite such cover), namely that for every ε>0\varepsilon > 0 there is a sequence of intervals covering DD of total length at most ε\varepsilon. No outer measure, no measurable set and no Lebesgue integral is used or needed; the criterion is a statement about interval covers throughout.

Facts & Assumptions

Given: Reals a<ba < b, a bounded f:[a,b]Rf : [a,b] \to \mathbb{R}, a real M+>0M_{+} > 0 with f(x)M+|f(x)| \le M_{+} for every x[a,b]x \in [a,b], and DD as in the Statement.

[A1]

The Axiom of Countable Choice, used only where [L11] is invoked (The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)).

[L1]

For a partition P=(n,t)P = (n,t) of [a,b][a,b]: n1n \ge 1, Δi=ti+1ti>0\Delta_i = t_{i+1}-t_i > 0, i<nΔi=ba\sum_{i<n}\Delta_i = b-a, Ii=[ti,ti+1][a,b]I_i = [t_i,t_{i+1}] \subseteq [a,b], and appending a point y>tny > t_n to a partition of [a,tn][a,t_n] gives a partition of [a,y][a,y] whose subintervals are the old ones together with [tn,y][t_n,y] (Partition of [a,b][a,b] as a finite strictly increasing list a=t0<t1<<tn=ba = t_0 < t_1 < \dots < t_n = b, its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions).

[L3]

Riemann's criterion: a bounded ff is integrable if and only if for every real ε>0\varepsilon > 0 there is a partition PP with U(f,P)L(f,P)<εU(f,P)-L(f,P) < \varepsilon (Riemann's criterion: a bounded ff on [a,b][a,b] is Darboux integrable if and only if for every real ε>0\varepsilon > 0 there is a partition PP with U(f,P)L(f,P)<εU(f,P) - L(f,P) < \varepsilon).

[L4]

Oscillation: ωf(S)ωf(T)\omega_f(S) \le \omega_f(T) for ST[a,b]S \subseteq T \subseteq [a,b]; 0ωf(x)ωf([a,b]Nρ(x))0 \le \omega_f(x) \le \omega_f([a,b] \cap N_\rho(x)) for every real ρ>0\rho > 0 and every x[a,b]x \in [a,b]; ωf(x)\omega_f(x) is the infimum of those values over ρ>0\rho > 0; and since ff is bounded every one of these values is a real number in [0,2M+][0, 2M_{+}] (The oscillation ωf(S)=sup{f(x)f(y):x,yS}\omega_f(S) = \sup\{\,|f(x) - f(y)| : x, y \in S\,\} of ff on a set and the oscillation ωf(c)=infδ>0ωf(ANδ(c))\omega_f(c) = \inf_{\delta > 0} \omega_f(A \cap N_\delta(c)) at a point, both taken in the extended reals, The extended real line R=R{,+}\overline{\mathbb{R}} = \mathbb{R} \cup \{-\infty, +\infty\}, its order, and the arithmetic that is left undefined, The ε\varepsilon-neighbourhood and the punctured ε\varepsilon-neighbourhood of a point of R\mathbb{R}).

[L6]

For every real σ>0\sigma > 0 there is a closed GRG \subseteq \mathbb{R} with {x[a,b]:ωf(x)σ}=[a,b]G\{x \in [a,b] : \omega_f(x) \ge \sigma\} = [a,b] \cap G (For every real ε>0\varepsilon > 0 the set {xA:ωf(x)ε}\{\,x \in A : \omega_f(x) \ge \varepsilon\,\} is the intersection with AA of a closed subset of R\mathbb{R}; in particular it is closed in R\mathbb{R} when A=RA = \mathbb{R}).

[L8]

AA has content zero when for every real τ>0\tau > 0 there are mNm \in \mathbb{N} and reals c0e0,,cmemc_0 \le e_0, \dots, c_m \le e_m with Ajm[cj,ej]A \subseteq \bigcup_{j \le m}[c_j,e_j] and jm(ejcj)τ\sum_{j \le m}(e_j - c_j) \le \tau; AA has measure zero when the same holds with a sequence of intervals and every partial total length at most τ\tau; a subset of a null set is null (Measure zero (a countable cover by intervals of total length below every ε\varepsilon) and content zero (a finite such cover)).

[L9]

A set of content zero has measure zero (A set of content zero has measure zero), and for a compact set the two notions coincide (For a compact subset of R\mathbb{R}, measure zero and content zero coincide).

[L10]

For every real η>0\eta > 0 there is a natural k1k \ge 1 with 1/ι(k)<η1/\iota(k) < \eta; ι(k)>0\iota(k) > 0 for k1k \ge 1, ι\iota is nonnegative and nondecreasing on N\mathbb{N} (For every ε>0\varepsilon > 0 in a complete ordered field there is a natural n1n \ge 1 with 1/n<ε1/n < \varepsilon, Every complete ordered field is Archimedean, The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field, Canonical naturals are positive and strictly increasing).

[L12]

Finite sums: splitting, additivity, scaling, monotonicity in the terms, and telescoping (Finite sums and finite products, by recursion, Laws of finite sums and finite products). Also the interchange of two finite sums, i<nj<pci,j=j<pi<nci,j\sum_{i<n}\sum_{j<p}c_{i,j} = \sum_{j<p}\sum_{i<n}c_{i,j} for any doubly indexed family of reals; below it is applied with p:=m+1p := m+1, since jm\sum_{j \le m} abbreviates j<m+1\sum_{j<m+1}. That identity is not one of the six clauses of Laws of finite sums and finite products and is therefore proved here, by induction on pp with nn held fixed (The principle of mathematical induction). At p=0p = 0 each inner sum j<0ci,j\sum_{j<0}c_{i,j} is 00 by the recursion clause of Finite sums and finite products, by recursion, so the left side is i<n0=0\sum_{i<n}0 = 0 by clause 2 of Laws of finite sums and finite products taken with λ=0\lambda = 0, while the right side is an empty sum and so is 00 as well. Passing from pp to p+1p+1, the recursion clause and clause 1 of Laws of finite sums and finite products give i<nj<p+1ci,j=i<n(j<pci,j+ci,p)=i<nj<pci,j+i<nci,p\sum_{i<n}\sum_{j<p+1}c_{i,j} = \sum_{i<n}\bigl(\sum_{j<p}c_{i,j} + c_{i,p}\bigr) = \sum_{i<n}\sum_{j<p}c_{i,j} + \sum_{i<n}c_{i,p}, which by the induction hypothesis is j<pi<nci,j+i<nci,p=j<p+1i<nci,j\sum_{j<p}\sum_{i<n}c_{i,j} + \sum_{i<n}c_{i,p} = \sum_{j<p+1}\sum_{i<n}c_{i,j}, again by the recursion clause.

[L13]

Every nonempty subset of N\mathbb{N} has a least element (The well-ordering principle); every nonempty subset of R\mathbb{R} bounded above has a supremum (Complete ordered field (least-upper-bound property)).

[L14]

Ordered-field arithmetic and the absolute value: adding a constant and multiplying by a positive quantity preserve an inequality; the order is total and transitive; an open interval is order-convex (Basic properties of the absolute value, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property), Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.

Proof

technique · direct
1.1

For a real σ>0\sigma > 0 put Eσ:={x[a,b]:ωf(x)σ}E_\sigma := \{\, x \in [a,b] : \omega_f(x) \ge \sigma \,\}. By [L5], EσDE_\sigma \subseteq D for every σ>0\sigma > 0.

L4L5construct
2.1

Each EσE_\sigma has content zero, assuming ff integrable. Let σ>0\sigma > 0 and τ>0\tau > 0 be real. By [L3] fix a partition P=(n,t)P = (n,t) with U(f,P)L(f,P)<στ21U(f,P) - L(f,P) < \sigma\tau \cdot 2^{-1}. Let B:={i<n:(ti,ti+1)Eσ}B := \{\, i < n : (t_i,t_{i+1}) \cap E_\sigma \ne \varnothing \,\} and put χi:=1\chi_i := 1 for iBi \in B and χi:=0\chi_i := 0 otherwise.

step 1.1L3L14chooseconstruct
2.2

The exhaustion of DD. Put σk:=1/ι(k+1)\sigma_k := 1/\iota(k+1) for kNk \in \mathbb{N}, a positive real by [L10]. Then D=kNEσkD = \bigcup_{k \in \mathbb{N}} E_{\sigma_k}. For the inclusion from left to right, let xDx \in D, so ωf(x)>0\omega_f(x) > 0 by [L5] and ωf(x)\omega_f(x) is a real by [L4]; if ωf(x)1=σ0\omega_f(x) \ge 1 = \sigma_0 then xEσ0x \in E_{\sigma_0}, and otherwise [L10] gives a natural k+11k+1 \ge 1 with 1/ι(k+1)<ωf(x)1/\iota(k+1) < \omega_f(x), so xEσkx \in E_{\sigma_k}. For the reverse inclusion, xEσkx \in E_{\sigma_k} gives ωf(x)σk>0\omega_f(x) \ge \sigma_k > 0, hence xDx \in D by [L5].

step 1.1L4L5L10L14
2.3

The converse; this half of the proof is steps 2.3, 3.2, 4.2, 5.2, 6.2, 7.2, 8.1, 9.1, 10.1, 11.1, 12.1 and 13.1, and its symbols are its own. Assume DD null and let a real ε>0\varepsilon > 0 be given. Put σ:=ε(2(ba))1\sigma' := \varepsilon \cdot \bigl(2(b-a)\bigr)^{-1} and τ:=ε(8M+)1\tau' := \varepsilon \cdot \bigl(8M_{+}\bigr)^{-1}, both positive by [L14]. By step 1.1 and [L8], EσDE_{\sigma'} \subseteq D is null.

step 1.1givenL8L14
3.1

For iBi \in B one has MimiσM_i - m_i \ge \sigma: fix x(ti,ti+1)Eσx \in (t_i,t_{i+1}) \cap E_\sigma; since (ti,ti+1)(t_i,t_{i+1}) is open there is a real ρ>0\rho > 0 with Nρ(x)(ti,ti+1)N_\rho(x) \subseteq (t_i,t_{i+1}), so [a,b]Nρ(x)Ii[a,b] \cap N_\rho(x) \subseteq I_i and [L4] gives σωf(x)ωf([a,b]Nρ(x))ωf(Ii)=Mimi\sigma \le \omega_f(x) \le \omega_f([a,b] \cap N_\rho(x)) \le \omega_f(I_i) = M_i - m_i by [L2].

step 2.1L1L2L4L7choose
3.2

EσE_{\sigma'} is compact: by [L6] there is a closed GG with Eσ=[a,b]GE_{\sigma'} = [a,b] \cap G, an intersection of two closed sets, hence closed; and Eσ[a,b]E_{\sigma'} \subseteq [a,b] is bounded. So [L7] applies.

step 2.3L6L7
4.1

Hence σχiΔi(Mimi)Δi\sigma\chi_i\Delta_i \le (M_i - m_i)\Delta_i for every i<ni < n, the case iBi \notin B because both Mimi0M_i - m_i \ge 0 and Δi>0\Delta_i > 0. Summing and using [L12] and [L2]: σi<nχiΔiU(f,P)L(f,P)<στ21\sigma \sum_{i<n}\chi_i\Delta_i \le U(f,P) - L(f,P) < \sigma\tau \cdot 2^{-1}, so λ:=i<nχiΔi<τ21\lambda := \sum_{i<n}\chi_i\Delta_i < \tau \cdot 2^{-1}.

step 2.1step 3.1L2L12L14
4.2

By [L9] applied to the compact null set EσE_{\sigma'}, it has content zero, so by [L8] there are mNm \in \mathbb{N} and reals c0e0,,cmemc_0 \le e_0, \dots, c_m \le e_m with Eσjm[cj,ej]E_{\sigma'} \subseteq \bigcup_{j \le m}[c_j,e_j] and jm(ejcj)τ21\sum_{j\le m}(e_j-c_j) \le \tau' \cdot 2^{-1}. Put μ:=τ(4(ι(m)+1))1>0\mu := \tau' \cdot \bigl(4(\iota(m)+1)\bigr)^{-1} > 0 and Oj:=(cjμ, ej+μ)O_j := (c_j - \mu,\ e_j + \mu), an open interval containing [cj,ej][c_j,e_j], of length (ejcj)+2μ(e_j - c_j) + 2\mu. Then jm((ejcj)+2μ)τ21+2μ(ι(m)+1)=τ21+τ21=τ\sum_{j\le m}\bigl((e_j-c_j)+2\mu\bigr) \le \tau' \cdot 2^{-1} + 2\mu(\iota(m)+1) = \tau' \cdot 2^{-1} + \tau' \cdot 2^{-1} = \tau', by [L12] and [L10].

step 2.3step 3.2L8L9L10L12L14construct
5.1

EσE_\sigma is covered by the finite list of 2n+12n+1 closed intervals [pj,qj][p_j,q_j], j2nj \le 2n, defined by [pj,qj]:=[tj,tj+1][p_j,q_j] := [t_j,t_{j+1}] for j<nj < n with jBj \in B, [pj,qj]:=[a,a][p_j,q_j] := [a,a] for j<nj < n with jBj \notin B, and [pj,qj]:=[tjn,tjn][p_j,q_j] := [t_{j-n},t_{j-n}] for nj2nn \le j \le 2n: indeed a point of EσE_\sigma lies in [a,b][a,b], hence is one of t0,,tnt_0,\dots,t_n or lies in some (ti,ti+1)(t_i,t_{i+1}), and in the latter case iBi \in B. Its total length is j2n(qjpj)=i<nχiΔi+0=λ<τ\sum_{j \le 2n}(q_j - p_j) = \sum_{i<n}\chi_i\Delta_i + 0 = \lambda < \tau, by splitting the sum at nn ([L12]).

step 2.1step 4.1L1L12L14construct
5.2

The family of good intervals. Let W\mathcal{W} be the set of all open intervals (u,v)(u,v) with u<vu < v such that either (u,v)Oj(u,v) \subseteq O_j for some jmj \le m, or ωf([a,b](u,v))<σ\omega_f([a,b]\cap(u,v)) < \sigma'. Every x[a,b]x \in [a,b] lies in a member: if xEσx \in E_{\sigma'} then x[cj,ej]Ojx \in [c_j,e_j] \subseteq O_j for some jmj \le m by step 4.2, and OjO_j is itself a member; and if xEσx \notin E_{\sigma'} then ωf(x)<σ\omega_f(x) < \sigma', so by [L4] some real ρ>0\rho > 0 has ωf([a,b]Nρ(x))<σ\omega_f([a,b]\cap N_\rho(x)) < \sigma', and Nρ(x)=(xρ,x+ρ)N_\rho(x) = (x-\rho,x+\rho) is a member containing xx.

step 4.2L4L7L14construct
6.1

As τ>0\tau > 0 was arbitrary, EσE_\sigma has content zero by [L8], hence measure zero by [L9]; this used only that ff is integrable.

step 2.1step 5.1L8L9
6.2

Cousin's construction: a partition each of whose subintervals lies in a member of W\mathcal{W}. Let SS be the set of y(a,b]y \in (a,b] such that some partition of [a,y][a,y] has every subinterval contained in a member of W\mathcal{W}. SS is nonempty: by step 5.2 fix (α,β)W(\alpha,\beta) \in \mathcal{W} with a(α,β)a \in (\alpha,\beta) and put y0:=min{(a+b)21, (a+β)21}y_0 := \min\{(a+b)\cdot 2^{-1},\ (a+\beta)\cdot 2^{-1}\}, so a<y0ba < y_0 \le b, y0<βy_0 < \beta and α<a\alpha < a; the one-subinterval partition of [a,y0][a,y_0] has [a,y0](α,β)[a,y_0] \subseteq (\alpha,\beta), so y0Sy_0 \in S. Also SS is bounded above by bb, so s:=supSs := \sup S exists by [L13] and a<y0sba < y_0 \le s \le b.

step 5.2L1L13L14choose
7.1

Integrability implies DD null. Assume ff integrable. By step 6.1 each EσkE_{\sigma_k} is null, and kEσkk \mapsto E_{\sigma_k} is a sequence of subsets of R\mathbb{R}, so [L11] applies and kEσk=D\bigcup_k E_{\sigma_k} = D is null by step 2.2. This is the only use of [A1] in the proof.

step 6.1step 2.2A1L11
7.2

s=bs = b. By step 5.2 fix (α,β)W(\alpha',\beta') \in \mathcal{W} with s(α,β)s \in (\alpha',\beta'). Since supS=s>α\sup S = s > \alpha' there is xSx \in S with x>αx > \alpha', and xsx \le s. Suppose s<bs < b and choose a real yy with s<y<min{b,β}s < y < \min\{b, \beta'\}, possible because s<bs < b and s<βs < \beta'. Then α<xs<y<β\alpha' < x \le s < y < \beta', so [x,y](α,β)[x,y] \subseteq (\alpha',\beta'), and appending yy to a partition of [a,x][a,x] witnessing xSx \in S gives one for [a,y][a,y] by [L1]; hence ySy \in S with y>supSy > \sup S, which is impossible.

step 6.2L1L13L14choose
8.1

bSb \in S. By step 5.2 fix (α,β)W(\alpha'',\beta'') \in \mathcal{W} with b(α,β)b \in (\alpha'',\beta''). Since supS=b>α\sup S = b > \alpha'' there is xSx \in S with x>αx > \alpha'' and xbx \le b. If x=bx = b there is nothing to prove; otherwise α<x<b<β\alpha'' < x < b < \beta'' gives [x,b](α,β)[x,b] \subseteq (\alpha'',\beta''), and appending bb as in step 7.2 puts bb in SS. So there is a partition P=(n,t)P' = (n',t') of [a,b][a,b], with subintervals IiI'_i and lengths Δi\Delta'_i for i<ni < n', every subinterval of which lies in a member of W\mathcal{W}.

step 5.2step 7.2L1L13L14choose
9.1

Good and bad subintervals. Write Mi:=supf[Ii]M'_i := \sup f[I'_i] and mi:=inff[Ii]m'_i := \inf f[I'_i]. Call i<ni < n' good when IiWI'_i \subseteq W for some W=(u,v)WW = (u,v) \in \mathcal{W} with ωf([a,b](u,v))<σ\omega_f([a,b]\cap(u,v)) < \sigma', and bad otherwise. For a good ii, Ii[a,b]WI'_i \subseteq [a,b] \cap W, so Mimi=ωf(Ii)ωf([a,b]W)<σM'_i - m'_i = \omega_f(I'_i) \le \omega_f([a,b]\cap W) < \sigma' by [L2] and [L4]. For a bad ii, step 8.1 supplies a member containing IiI'_i, and it is not of the second kind, so IiOjI'_i \subseteq O_j for some jmj \le m.

step 8.1L1L2L4
10.1

Bounding the bad lengths. For jmj \le m put Jj:={i<n:cjμti and ti+1ej+μ}J_j := \{\, i < n' : c_j - \mu \le t'_i \text{ and } t'_{i+1} \le e_j + \mu \,\} and hij:=Δih^{j}_i := \Delta'_i for iJji \in J_j, hij:=0h^{j}_i := 0 otherwise; a bad ii lies in some JjJ_j by step 9.1. Each JjJ_j consists of consecutive indices, since i<i<ii < i^{\dagger} < i^{\ddagger} with i,iJji,i^{\ddagger} \in J_j gives cjμtitic_j - \mu \le t'_i \le t'_{i^{\dagger}} and ti+1ti+1ej+μt'_{i^{\dagger}+1} \le t'_{i^{\ddagger}+1} \le e_j + \mu.

step 9.1L1L14construct
11.1

i<nhij(ejcj)+2μ\sum_{i<n'}h^{j}_i \le (e_j - c_j) + 2\mu for each jmj \le m: the sum is 00 when Jj=J_j = \varnothing; otherwise let p:=minJjp := \min J_j and let qq be the least natural with q>pq > p and qJjq \notin J_j, which exists by [L13] since nJjn' \notin J_j, so that Jj={i:pi<q}J_j = \{\, i : p \le i < q \,\} by step 10.1. Splitting the sum at pp and at qq and discarding the vanishing outer parts, then telescoping ([L12]), gives i<nhij=i=pq1Δi=tqtp(ej+μ)(cjμ)\sum_{i<n'}h^{j}_i = \sum_{i=p}^{q-1}\Delta'_i = t'_q - t'_p \le (e_j+\mu) - (c_j-\mu), using pJjp \in J_j and q1Jjq-1 \in J_j.

step 10.1L12L13L14
12.1

Put βi:=Δi\beta_i := \Delta'_i for bad ii and βi:=0\beta_i := 0 for good ii. Then βijmhij\beta_i \le \sum_{j \le m}h^{j}_i pointwise by step 10.1, all terms being nonnegative, so by [L12] and step 11.1, i<nβijmi<nhijjm((ejcj)+2μ)τ\sum_{i<n'}\beta_i \le \sum_{j\le m}\sum_{i<n'}h^{j}_i \le \sum_{j\le m}\bigl((e_j-c_j)+2\mu\bigr) \le \tau', the last step by step 4.2.

step 4.2step 10.1step 11.1L12L14
13.1

For every i<ni < n', (Mimi)ΔiσΔi+2M+βi(M'_i-m'_i)\Delta'_i \le \sigma'\Delta'_i + 2M_{+}\beta_i: for good ii by step 9.1 and βi0\beta_i \ge 0, for bad ii by Mimi2M+M'_i - m'_i \le 2M_{+} from [L2] and βi=Δi\beta_i = \Delta'_i. Summing over i<ni < n' and using [L12], [L1] and step 12.1: U(f,P)L(f,P)σ(ba)+2M+τ=ε21+ε41<εU(f,P')-L(f,P') \le \sigma'(b-a) + 2M_{+}\tau' = \varepsilon\cdot 2^{-1} + \varepsilon \cdot 4^{-1} < \varepsilon.

step 2.3step 9.1step 12.1L1L2L12L14
14.1

The real ε>0\varepsilon > 0 of step 2.3 was arbitrary and step 13.1 produced a partition with UL<εU - L < \varepsilon, so ff is integrable by [L3]. With step 7.1 this proves both implications, and the criterion is established; the forward half is steps 1.1, 2.1, 2.2, 3.1, 4.1, 5.1, 6.1 and 7.1, working with σ,τ,P,B,χ,λ\sigma, \tau, P, B, \chi, \lambda, and the converse half is the steps named in step 2.3, working with σ,τ,P,W,S\sigma', \tau', P', \mathcal{W}, S.

step 7.1step 2.3step 13.1L3

Remarks

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 154 results over 32 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources