Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: 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.

A function that is not Riemann integrable although f\lvert f\rvert is

Statement refuted

False claim: if f|f| is Riemann integrable on [a,b][a,b] then so is ff; that is, the first clause of If f,gf,g are integrable on [a,b][a,b] then so are f\lvert f\rvert, f2f^{2}, fgfg, max(f,g)\max(f,g) and min(f,g)\min(f,g), and abfabf\bigl\lvert\int_a^b f\bigr\rvert \le \int_a^b\lvert f\rvert has a converse.

Let 1Q\mathbf{1}_{\mathbb{Q}} be the Dirichlet function (The Dirichlet function 1Q1_{\mathbb{Q}}, and Thomae's function tt with t(x)=1/qt(x) = 1/q at a rational x=p/qx = p/q in lowest terms with q1q \ge 1 and t(x)=0t(x) = 0 at every irrational xx) and put

f:[0,1]R,f(x)  :=  21Q(x)1  =  {1x rational,1x irrational.f : [0,1] \to \mathbb{R}, \qquad f(x) \;:=\; 2\,\mathbf{1}_{\mathbb{Q}}(x) - 1 \;=\; \begin{cases} 1 & x \text{ rational}, \\ -1 & x \text{ irrational}. \end{cases}

Then f|f| is the constant function 11, integrable with 01f=1\int_0^1 |f| = 1, while ff is not Riemann integrable on [0,1][0,1]: every lower Darboux sum of ff is 1-1 and every upper Darboux sum is 11, so the lower and upper integrals are 1-1 and 11.

Facts & Assumptions

Given: The function f=21Q1f = 2\mathbf{1}_{\mathbb{Q}} - 1 on [0,1][0,1], and a partition P=(n,t)P = (n,t) of [0,1][0,1].

[L2]

Both Q\mathbb{Q} and the irrationals are dense in R\mathbb{R}, so every nonempty open interval contains a rational and an irrational (Both Q\mathbb{Q} and RQ\mathbb{R} \setminus \mathbb{Q} are dense in R\mathbb{R}, and every nonempty open subset of R\mathbb{R} is uncountable).

[L3]

For a partition P=(n,t)P = (n,t) of [0,1][0,1]: n1n \ge 1, Δi=ti+1ti>0\Delta_i = t_{i+1}-t_i > 0, i<nΔi=1\sum_{i<n}\Delta_i = 1, and the open interval (ti,ti+1)(t_i,t_{i+1}) is nonempty (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, Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length, Finite sums and finite products, by recursion, Laws of finite sums and finite products).

[L4]

L(u,P)=i<nmiΔiL(u,P) = \sum_{i<n}m_i\Delta_i and U(u,P)=i<nMiΔiU(u,P) = \sum_{i<n}M_i\Delta_i with mi=infu[Ii]m_i = \inf u[I_i] and Mi=supu[Ii]M_i = \sup u[I_i]; a set with a least element has it as its infimum and with a greatest element has it as its supremum (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, Greatest lower bound (infimum), Maximum and minimum of a set).

[L5]

01u=supPL(u,P)\underline{\int_0^1} u = \sup_P L(u,P) and 01u=infPU(u,P)\overline{\int_0^1} u = \inf_P U(u,P); uu is integrable exactly when the two agree (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, Lower bound, bounded below, bounded set).

[L6]

Finite sums: scaling and i<nλΔi=λi<nΔi\sum_{i<n}\lambda\Delta_i = \lambda\sum_{i<n}\Delta_i (Finite sums and finite products, by recursion, Laws of finite sums and finite products, clause 2).

[L8]

Absolute value and ordered-field arithmetic: 1=1=1|1| = |-1| = 1, and the order is total (Absolute value in an ordered field, Ordered field, Complete ordered field (least-upper-bound property)).

Counterexample

technique · direct
1.1

f|f| is the constant function 11 on [0,1][0,1]: at a rational xx, f(x)=211=1f(x) = 2\cdot1 - 1 = 1, and at an irrational xx, f(x)=201=1f(x) = 2\cdot0-1 = -1, and 1=1=1|1| = |-1| = 1 by [L1] and [L8]. Hence f|f| is integrable with 01f=1\int_0^1|f| = 1 by [L7].

givenL1L7L8
1.2

Let P=(n,t)P = (n,t) be any partition of [0,1][0,1] and let i<ni < n. The open interval (ti,ti+1)(t_i,t_{i+1}) is nonempty by [L3], so it contains a rational and an irrational by [L2]; both lie in IiI_i, so 1f[Ii]1 \in f[I_i] and 1f[Ii]-1 \in f[I_i].

givenL2L3
2.1

ff is bounded, with values in {1,1}\{-1,1\}, so its Darboux sums are defined by [L4] and [L5].

step 1.1givenL4L5
3.1

Since f[Ii]{1,1}f[I_i] \subseteq \{-1,1\} and both values occur, mi=1m_i = -1 and Mi=1M_i = 1 by [L4].

step 2.1step 1.2L4
4.1

Hence L(f,P)=i<n(1)Δi=1L(f,P) = \sum_{i<n}(-1)\Delta_i = -1 and U(f,P)=i<n1Δi=1U(f,P) = \sum_{i<n}1\cdot\Delta_i = 1, by [L4], [L6] and [L3].

step 3.1L3L4L6
5.1

That holds for every partition PP, so the set of lower sums is {1}\{-1\} and the set of upper sums is {1}\{1\}; by [L5], 01f=11=01f\underline{\int_0^1}f = -1 \ne 1 = \overline{\int_0^1}f and ff is not integrable.

step 4.1L5
6.1

So f|f| is integrable on [0,1][0,1] while ff is not, and the claim is false.

step 1.1step 5.1

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

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