Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passverified 2026-08-10 (gpt-5.6-terra-codex-subscription)
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.

Integrable functions on [a,b][a,b] form a set closed under sums and scalar multiples, and ab(λf+μg)=λabf+μabg\int_a^b(\lambda f+\mu g) = \lambda\int_a^b f + \mu\int_a^b g

Statement

Let a<ba < b be reals and let f,g:[a,b]Rf, g : [a,b] \to \mathbb{R} be integrable (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). Then:

  1. f+gf + g is integrable on [a,b][a,b] and ab(f+g)=abf+abg\int_a^b (f+g) = \int_a^b f + \int_a^b g;
  2. for every real λ\lambda, λf\lambda f is integrable on [a,b][a,b] and abλf=λabf\int_a^b \lambda f = \lambda \int_a^b f;
  3. consequently, for all reals λ,μ\lambda, \mu the function λf+μg\lambda f + \mu g is integrable and ab(λf+μg)  =  λabf  +  μabg;\int_a^b(\lambda f + \mu g) \;=\; \lambda\int_a^b f \;+\; \mu\int_a^b g ;
  4. the same identity holds with oriented limits: if u,v[a,b]u, v \in [a,b] and f,gf, g are integrable between uu and vv (The integral with oriented limits: aaf:=0\int_a^a f := 0 and baf:=abf\int_b^a f := -\int_a^b f), then uv(λf+μg)=λuvf+μuvg\int_u^v(\lambda f + \mu g) = \lambda\int_u^v f + \mu\int_u^v g.

Linearity of the integral is not linearity of the Darboux sums, and the proof of claim 1 has to squeeze rather than compute. On a subinterval the inequality sup(f+g)supf+supg\sup(f+g) \le \sup f + \sup g can be strict — take f(x)=xf(x) = x and g(x)=xg(x) = -x on [0,1][0,1], where the left side is 00 and the right side is 11 — so U(f+g,P)U(f+g,P) is in general strictly below U(f,P)+U(g,P)U(f,P) + U(g,P) and no identity between upper sums is available. Claim 2, by contrast, is an identity at the level of the sums, with the roles of sup\sup and inf\inf exchanged when λ<0\lambda < 0.

Facts & Assumptions

Given: Reals a<ba < b, integrable f,g:[a,b]Rf, g : [a,b] \to \mathbb{R}, reals λ,μ\lambda, \mu, and a real ε>0\varepsilon > 0.

[L1]

Riemann's criterion: a bounded hh on [a,b][a,b] is integrable if and only if for every real η>0\eta > 0 there is a partition PP with U(h,P)L(h,P)<ηU(h,P) - L(h,P) < \eta (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).

[L2]

For every partition PP and bounded hh: L(h,P)abhabhU(h,P)L(h,P) \le \underline{\int_a^b} h \le \overline{\int_a^b} h \le U(h,P), and hh is integrable exactly when the two integrals agree, their common value being abh\int_a^b h; the lower integral is supPL(h,P)\sup_P L(h,P) and the upper is infPU(h,P)\inf_P U(h,P) (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, Suprema and infima are unique).

[L3]

L(h,P)=i<nmi(h)ΔiL(h,P) = \sum_{i<n} m_i(h)\Delta_i and U(h,P)=i<nMi(h)ΔiU(h,P) = \sum_{i<n}M_i(h)\Delta_i, where mi(h)=infh[Ii]m_i(h) = \inf h[I_i] and Mi(h)=suph[Ii]M_i(h) = \sup h[I_i] over the subintervals IiI_i of P=(n,t)P = (n,t), with Δi>0\Delta_i > 0; an integrable function is bounded, and a sum of two bounded functions and a scalar multiple of a bounded function are bounded (For bounded ff on [a,b][a,b] and a partition PP: the infimum mim_i and supremum MiM_i of ff on the ii-th subinterval, and the lower and upper Darboux sums L(f,P)=imiΔiL(f,P) = \sum_i m_i \Delta_i and U(f,P)=iMiΔiU(f,P) = \sum_i M_i \Delta_i, 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, Lower bound, bounded below, bounded set).

[L5]

Finite sums are additive and homogeneous: i<n(xi+yi)=i<nxi+i<nyi\sum_{i<n}(x_i + y_i) = \sum_{i<n}x_i + \sum_{i<n}y_i and i<nλxi=λi<nxi\sum_{i<n}\lambda x_i = \lambda\sum_{i<n}x_i (Finite sums and finite products, by recursion, Laws of finite sums and finite products, clauses 1 and 2).

[L6]

A supremum is the least upper bound and an infimum the greatest lower bound; both exist for a nonempty bounded set and are unique (Complete ordered field (least-upper-bound property), Greatest lower bound (infimum), Suprema and infima are unique).

[L7]

Reflection: writing S={s:sS}-S = \{-s : s \in S\}, a real uu is an upper bound of SS exactly when u-u is a lower bound of S-S, and conversely; hence sup(S)=infS\sup(-S) = -\inf S and inf(S)=supS\inf(-S) = -\sup S for nonempty bounded SS, by [L6] (Reflection through zero exchanges upper and lower bounds).

[L9]

Ordered-field arithmetic: adding a constant and multiplying by a positive quantity preserve an inequality, the order is total and transitive, and a real xx with x<η|x| < \eta for every real η>0\eta > 0 is 00 (Ordered field, Complete ordered field (least-upper-bound property)). These order facts are used in their nonstrict form as well, obtained by adjoining the case of equality.

[L10]

With oriented limits, vuh=uvh\int_v^u h = -\int_u^v h and uuh=0\int_u^u h = 0 (The integral with oriented limits: aaf:=0\int_a^a f := 0 and baf:=abf\int_b^a f := -\int_a^b f).

Proof

technique · direct
1.1

ff, gg, f+gf+g and λf\lambda f are bounded on [a,b][a,b], so all their Darboux sums and integrals are defined.

givenL3
1.2

For every partition P=(n,t)P = (n,t) and every i<ni < n: f(x)+g(x)Mi(f)+Mi(g)f(x) + g(x) \le M_i(f) + M_i(g) for xIix \in I_i, so Mi(f)+Mi(g)M_i(f) + M_i(g) is an upper bound of (f+g)[Ii](f+g)[I_i] and Mi(f+g)Mi(f)+Mi(g)M_i(f+g) \le M_i(f) + M_i(g) by [L6]; dually mi(f+g)mi(f)+mi(g)m_i(f+g) \ge m_i(f) + m_i(g).

L3L6
1.3

Fix partitions P1P_1 and P2P_2 with U(f,P1)L(f,P1)<ε21U(f,P_1) - L(f,P_1) < \varepsilon \cdot 2^{-1} and U(g,P2)L(g,P2)<ε21U(g,P_2) - L(g,P_2) < \varepsilon \cdot 2^{-1}, and put P:=P1P2P := P_1 \vee P_2.

givenL1L4choose
1.4

Claim 2, the case λ=0\lambda = 0. Then λf\lambda f is the constant function 00, integrable with integral 0=0abf0 = 0 \cdot \int_a^b f.

L8
1.5

Claim 2, the case λ>0\lambda > 0. For every partition PP and every i<ni < n, λMi(f)\lambda M_i(f) is an upper bound of (λf)[Ii](\lambda f)[I_i], and any upper bound ww of (λf)[Ii](\lambda f)[I_i] gives the upper bound w/λw/\lambda of f[Ii]f[I_i], whence Mi(f)w/λM_i(f) \le w/\lambda and λMi(f)w\lambda M_i(f) \le w; so Mi(λf)=λMi(f)M_i(\lambda f) = \lambda M_i(f) by [L6], and dually mi(λf)=λmi(f)m_i(\lambda f) = \lambda m_i(f).

L3L6L9
1.6

Claim 2, the case λ=1\lambda = -1. For every PP and i<ni < n, (f)[Ii]=(f[Ii])(-f)[I_i] = -\bigl(f[I_i]\bigr), so Mi(f)=mi(f)M_i(-f) = -m_i(f) and mi(f)=Mi(f)m_i(-f) = -M_i(f) by [L7].

L3L7
2.1

By [L4], U(f,P)L(f,P)<ε21U(f,P) - L(f,P) < \varepsilon\cdot 2^{-1} and U(g,P)L(g,P)<ε21U(g,P) - L(g,P) < \varepsilon \cdot 2^{-1}.

step 1.3L4
2.2

Summing the inequalities of step 1.2 over i<ni < n against the positive weights Δi\Delta_i and using [L5] gives L(f,P)+L(g,P)L(f+g,P)U(f+g,P)U(f,P)+U(g,P)L(f,P) + L(g,P) \le L(f+g,P) \le U(f+g,P) \le U(f,P) + U(g,P).

step 1.2L3L5L9
2.3

With step 1.5 and [L5], U(λf,P)=λU(f,P)U(\lambda f,P) = \lambda U(f,P) and L(λf,P)=λL(f,P)L(\lambda f, P) = \lambda L(f,P) for λ>0\lambda > 0; hence U(λf,P)L(λf,P)=λ(U(f,P)L(f,P))U(\lambda f,P)-L(\lambda f,P) = \lambda\bigl(U(f,P)-L(f,P)\bigr), which [L1] makes smaller than any prescribed positive number by choosing PP suitably, so λf\lambda f is integrable.

step 1.5L1L3L5L9
2.4

With step 1.6 and [L5], U(f,P)=L(f,P)U(-f,P) = -L(f,P) and L(f,P)=U(f,P)L(-f,P) = -U(f,P), so U(f,P)L(f,P)=U(f,P)L(f,P)U(-f,P)-L(-f,P) = U(f,P)-L(f,P) and f-f is integrable by [L1]; and by [L7] applied to the sets of Darboux sums, ab(f)=abf\overline{\int_a^b}(-f) = -\underline{\int_a^b} f and ab(f)=abf\underline{\int_a^b}(-f) = -\overline{\int_a^b} f, so ab(f)=abf\int_a^b(-f) = -\int_a^b f.

step 1.6L1L2L5L7
3.1

Hence U(f+g,P)L(f+g,P)(U(f,P)L(f,P))+(U(g,P)L(g,P))<εU(f+g,P) - L(f+g,P) \le \bigl(U(f,P)-L(f,P)\bigr) + \bigl(U(g,P)-L(g,P)\bigr) < \varepsilon, so f+gf+g is integrable by [L1], ε>0\varepsilon > 0 having been arbitrary.

step 1.1step 2.1step 2.2L1L9
3.2

Moreover the set of lower sums of λf\lambda f is λ\lambda times the set of lower sums of ff, and a supremum scales by a positive factor, by the argument of step 1.5 applied to that set; so abλf=λabf\underline{\int_a^b}\lambda f = \lambda \underline{\int_a^b} f, and likewise for the upper integrals, giving abλf=λabf\int_a^b \lambda f = \lambda\int_a^b f.

step 1.5step 2.3L2L6L9
4.1

Both ab(f+g)\int_a^b(f+g) and abf+abg\int_a^b f + \int_a^b g lie in the interval from L(f,P)+L(g,P)L(f,P)+L(g,P) to U(f,P)+U(g,P)U(f,P)+U(g,P): the first by [L2] and step 2.2, the second by [L2] applied to ff and to gg separately.

step 2.1step 2.2step 3.1L2
4.2

Claim 2 for λ<0\lambda < 0. Then λ>0-\lambda > 0 and λf=(λ)(f)\lambda f = (-\lambda)(-f), so steps 2.3, 2.4 and 3.2 give integrability and the required identities and abλf=(λ)ab(f)=(λ)(abf)=λabf\int_a^b \lambda f = (-\lambda)\int_a^b(-f) = (-\lambda)\bigl(-\int_a^b f\bigr) = \lambda\int_a^b f.

step 2.3step 3.2step 2.4L9
5.1

That interval has length less than ε\varepsilon by step 2.1, so ab(f+g)abfabg<ε\bigl|\int_a^b(f+g) - \int_a^b f - \int_a^b g\bigr| < \varepsilon; as ε>0\varepsilon > 0 was arbitrary the difference is 00, which is claim 1.

step 2.1step 4.1L9
5.2

Claim 2 is now proved in all three cases λ=0\lambda = 0, λ>0\lambda > 0 and λ<0\lambda < 0, which are exhaustive by trichotomy.

step 1.4step 2.3step 3.2step 4.2L9
6.1

Claim 3. By claim 2 the functions λf\lambda f and μg\mu g are integrable with integrals λabf\lambda\int_a^b f and μabg\mu\int_a^b g, and by claim 1 their sum is integrable with the sum of those integrals.

step 5.1step 5.2
7.1

Claim 4. If u<vu < v then u,v[a,b]u, v \in [a,b] and claim 3 applies verbatim on [u,v][u,v]; if u=vu = v both sides are 00 by [L10]; and if u>vu > v then applying the case u<vu < v to the pair (v,u)(v,u) and multiplying by 1-1 gives the identity, by [L10].

step 6.1L10

Remarks

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 64 results over 17 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