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

Changing an integrable function at finitely many points changes neither its integrability nor its integral

Statement

Let a<ba < b be reals, let f:[a,b]Rf : [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), let E[a,b]E \subseteq [a,b] be finite (Finite, countably infinite, countable, uncountable, Equinumerous sets, ABA \approx B and ABA \preceq B), and let g:[a,b]Rg : [a,b] \to \mathbb{R} satisfy

g(x)  =  f(x)for every x[a,b]E.g(x) \;=\; f(x) \qquad \text{for every } x \in [a,b] \setminus E .

Then gg is integrable on [a,b][a,b] and

abg  =  abf.\int_a^b g \;=\; \int_a^b f .

In particular the values of an integrand at the endpoints of the interval, and at any finite set of points, are irrelevant to both questions.

Facts & Assumptions

Given: Reals a<ba < b, an integrable f:[a,b]Rf : [a,b] \to \mathbb{R}, a finite E[a,b]E \subseteq [a,b], and g:[a,b]Rg : [a,b] \to \mathbb{R} agreeing with ff off EE. Finite means: there are rNr \in \mathbb{N} and a bijection ee from {jN:j<r}\{\, j \in \mathbb{N} : j < r \,\} onto EE (Finite, countably infinite, countable, uncountable, Equinumerous sets, ABA \approx B and ABA \preceq B).

[L2]

For a partition R=(n,t)R = (n,t) and a bounded function hh on the interval: L(h,R)=i<nmiΔiL(h,R) = \sum_{i<n}m_i\Delta_i, U(h,R)=i<nMiΔiU(h,R) = \sum_{i<n}M_i\Delta_i with mi=infh[Ii]Mi=suph[Ii]m_i = \inf h[I_i] \le M_i = \sup h[I_i], and L(h,R)abhabhU(h,R)L(h,R) \le \underline{\int_a^b} h \le \overline{\int_a^b} h \le U(h,R) (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, 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).

[L3]

The uniform partition UNU_N of [a,b][a,b] into N1N \ge 1 parts has n=Nn = N and every Δi\Delta_i equal to (ba)/ι(N)(b-a)/\iota(N), and its subintervals cover [a,b][a,b]; the index list tt is strictly increasing on indices N\le N, hence injective there (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, The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field, Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length).

[L4]

Finite sums: monotonicity in the terms, scaling, additivity, and splitting; consequently, if xi=0x_i = 0 for every i<ni < n except i=ji = j, then i<nxi=xj\sum_{i<n}x_i = x_j, by splitting at jj and at j+1j+1 and 0=0\sum 0 = 0 (Finite sums and finite products, by recursion, Laws of finite sums and finite products, clauses 1 to 4).

[L6]

For every real η>0\eta > 0 there is a natural N1N \ge 1 with 1/ι(N)<η1/\iota(N) < \eta, and ι(N)>0\iota(N) > 0 for N1N \ge 1 (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, Canonical naturals are positive and strictly increasing).

[L7]

Induction on N\mathbb{N} (The principle of mathematical induction).

[L8]

Ordered-field arithmetic: multiplying an inequality by a nonnegative quantity and adding constants preserve it, the order is total and transitive, and a real of absolute value below every positive real is 00 (Ordered field, Complete ordered field (least-upper-bound property)).

Proof

technique · induction
1.1

The one-point case is proved first, for a function called ww so that no symbol is reused. Let p[a,b]p \in [a,b] and let w:[a,b]Rw : [a,b] \to \mathbb{R} satisfy w(x)=0w(x) = 0 for every xpx \ne p; put K:=w(p)K := |w(p)|, so w(x)K|w(x)| \le K for every xx and ww is bounded.

givenL1
1.2

Fix N1N \ge 1 and write UN=(N,t)U_N = (N,t) with subintervals IiI_i and lengths Δi=(ba)/ι(N)\Delta_i = (b-a)/\iota(N). Define θi:=1\theta_i := 1 if pIip \in I_i and θi:=0\theta_i := 0 otherwise, for i<Ni < N.

L3construct
1.3

Setting up the induction. Put h:=gfh := g - f, so that h(x)=0h(x) = 0 for every xEx \notin E, and for j<rj < r define hj:[a,b]Rh_j : [a,b] \to \mathbb{R} by hj(x):=h(x)h_j(x) := h(x) if x=e(j)x = e(j) and hj(x):=0h_j(x) := 0 otherwise. Each hjh_j vanishes off the single point e(j)e(j).

givenconstruct
2.1

At most two indices i<Ni < N have θi=1\theta_i = 1, and they are consecutive: if pIiIjp \in I_i \cap I_j with i<ji < j then tjpti+1t_j \le p \le t_{i+1} and ti+1tjt_{i+1} \le t_j, so ti+1=tjt_{i+1} = t_j and j=i+1j = i+1 by injectivity of tt. Also some index has θi=1\theta_i = 1, since the subintervals cover [a,b][a,b]; let i0i_0 be the least such.

step 1.2L3choose
2.2

For every x[a,b]x \in [a,b] and every krk \le r, j<khj(x)=h(x)\sum_{j<k} h_j(x) = h(x) when x=e(j0)x = e(j_0) for some j0<kj_0 < k, and j<khj(x)=0\sum_{j<k}h_j(x) = 0 otherwise: in the first case all terms with jj0j \ne j_0 vanish, because ee is injective, and [L4] evaluates the sum; in the second every term is 00.

step 1.3L4
3.1

For every i<Ni < N: if θi=0\theta_i = 0 then ww vanishes on IiI_i, so mi=Mi=0m_i = M_i = 0, where mim_i and MiM_i are the extreme values of ww on IiI_i; and always KθimiMiKθi-K\theta_i \le m_i \le M_i \le K\theta_i.

step 1.2step 2.1L2L8
3.2

Define yi:=Δiy_i := \Delta_i for i=i0i = i_0 and yi:=0y_i := 0 otherwise, and zi:=Δiz_i := \Delta_i for i=i0+1i = i_0+1 with i0+1<Ni_0 + 1 < N, and zi:=0z_i := 0 otherwise. Then θiΔiyi+zi\theta_i\Delta_i \le y_i + z_i for every i<Ni < N by step 2.1, and i<N(yi+zi)2(ba)/ι(N)\sum_{i<N}(y_i+z_i) \le 2(b-a)/\iota(N) by [L4] and [L3].

step 1.2step 2.1L3L4construct
3.3

Let Q(k)Q(k), for krk \le r, be the statement that the function Hk:xj<khj(x)H_k : x \mapsto \sum_{j<k}h_j(x) is integrable on [a,b][a,b] with abHk=0\int_a^b H_k = 0.

step 2.2construct
4.1

By step 3.1 and monotonicity of finite sums, U(w,UN)L(w,UN)=i<N(Mimi)Δii<N2KθiΔi4K(ba)/ι(N)U(w,U_N) - L(w,U_N) = \sum_{i<N}(M_i-m_i)\Delta_i \le \sum_{i<N}2K\theta_i\Delta_i \le 4K(b-a)/\iota(N), and likewise 2K(ba)/ι(N)L(w,UN)-2K(b-a)/\iota(N) \le L(w,U_N) and U(w,UN)2K(ba)/ι(N)U(w,U_N) \le 2K(b-a)/\iota(N).

step 3.1step 3.2L2L4L8
4.2

Base. H0H_0 is the constant function 00, integrable with integral 00 by [L5], so Q(0)Q(0) holds.

basestep 3.3L5
4.3

Induction hypothesis. Fix k<rk < r and assume Q(k)Q(k).

ihstep 3.3
5.1

Given a real η>0\eta > 0, [L6] supplies NN with 4K(ba)/ι(N)<η4K(b-a)/\iota(N) < \eta, so ww satisfies Riemann's criterion and is integrable by [L1].

step 4.1L1L6L8
5.2

Moreover abw2K(ba)/ι(N)|\int_a^b w| \le 2K(b-a)/\iota(N) for every N1N \ge 1 by step 4.1 and [L2], and the right-hand side is below every positive real by [L6]; hence abw=0\int_a^b w = 0. Steps 1.1 to 5.2 therefore prove: every function on [a,b][a,b] vanishing off a single point is integrable with integral 00.

step 4.1L2L6L8
6.1

Hk+1=Hk+hkH_{k+1} = H_k + h_k pointwise by [L4], and hkh_k is integrable with integral 00 by steps 5.1 and 5.2 applied to w:=hkw := h_k and p:=e(k)p := e(k); so Hk+1H_{k+1} is integrable with abHk+1=0+0=0\int_a^b H_{k+1} = 0 + 0 = 0 by [L5], which is Q(k+1)Q(k+1).

step 5.1step 5.2step 1.3step 4.3L4L5
7.1

By [L7] with steps 4.2 and 6.1, Q(k)Q(k) holds for every krk \le r; at k=rk = r, and by step 2.2, Hr=hH_r = h, so hh is integrable with abh=0\int_a^b h = 0.

step 2.2step 4.2step 4.3step 6.1L7
8.1

Hence g=f+hg = f + h is integrable with abg=abf+0=abf\int_a^b g = \int_a^b f + 0 = \int_a^b f by [L5].

step 7.1L5discharge-induction

Remarks

Depends on

Used by

Dependency tree · next 3 levels

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