Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck 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∣ is

Statement refuted

False claim: if ∣f∣ is Riemann integrable on [a,b] then so is f; that is, the first clause of If f,g are integrable on [a,b] then so are ∣f∣, f2, fg, max⁡(f,g) and min⁡(f,g), and ∣∫abf∣≤∫ab∣f∣ has a converse.

Let 1Q be the Dirichlet function (The Dirichlet function 1Q, and Thomae's function t with t(x)=1/q at a rational x=p/q in lowest terms with q≥1 and t(x)=0 at every irrational x) and put

f:[0,1]→R,f(x)  :=  2 1Q(x)−1  =  {1x rational,−1x irrational.

Then ∣f∣ is the constant function 1, integrable with ∫01∣f∣=1, while f is not Riemann integrable on [0,1]: every lower Darboux sum of f is −1 and every upper Darboux sum is 1, so the lower and upper integrals are −1 and 1.

Facts & Assumptions

Given: The function f=21Q−1 on [0,1], and a partition P=(n,t) of [0,1].

[L2]

Both Q and the irrationals are dense in R, so every nonempty open interval contains a rational and an irrational (Both Q and R∖Q are dense in R, and every nonempty open subset of R is uncountable).

[L4]

L(u,P)=∑i<nmiΔi and U(u,P)=∑i<nMiΔi with mi=inf⁡u[Ii] and Mi=sup⁡u[Ii]; a set with a least element has it as its infimum and with a greatest element has it as its supremum (For bounded f on [a,b] and a partition P: the infimum mi and supremum Mi of f on the i-th subinterval, and the lower and upper Darboux sums L(f,P)=∑imiΔi and U(f,P)=∑iMiΔi, Greatest lower bound (infimum), Maximum and minimum of a set).

[L6]

Finite sums: scaling and ∑i<nλΔi=λ∑i<nΔ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, 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∣ is the constant function 1 on [0,1]: at a rational x, f(x)=2⋅1−1=1, and at an irrational x, f(x)=2⋅0−1=−1, and ∣1∣=∣−1∣=1 by [L1] and [L8]. Hence ∣f∣ is integrable with ∫01∣f∣=1 by [L7].

givenL1L7L8
1.2

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

givenL2L3
2.1

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

step 1.1givenL4L5
3.1

Since f[Ii]⊆{−1,1} and both values occur, mi=−1 and Mi=1 by [L4].

step 2.1step 1.2L4
4.1

Hence L(f,P)=∑i<n(−1)Δi=−1 and U(f,P)=∑i<n1⋅Δi=1, by [L4], [L6] and [L3].

step 3.1L3L4L6
5.1

That holds for every partition P, so the set of lower sums is {−1} and the set of upper sums is {1}; by [L5], ∫01‾f=−1≠1=∫01‾f and f is not integrable.

step 4.1L5
6.1

So ∣f∣ is integrable on [0,1] while f 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 · two levels

90 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources