Alphabeta Math
False statementConstruction: Literature-sourcedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-21
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.

False: every derivative is Riemann integrable

Statement

False claim: Every derivative on a compact interval is Riemann integrable.

Facts & Assumptions

Given: The false universal claim.

[L1]

F(x)=x2sin(1/x2) has an unbounded derivative whose Henstock–Kurzweil integral is sin1 (F(x)=x2sin(1/x2) has an unbounded derivative whose Henstock–Kurzweil integral is sin1).

[L2]

Every derivative is Henstock–Kurzweil integrable (Every derivative is Henstock–Kurzweil integrable and satisfies Newton–Leibniz).

Refutation

technique · contradiction
1.1

Suppose the claim were true; [L1] supplies a derivative unbounded near zero, while [L3] requires boundedness for Riemann integrability, a contradiction.

assume-contraL1L3
2.1

The correct conclusion for the same derivative is [L2]: it is HK integrable and [L1] evaluates its integral by endpoint difference.

L1L2discharge-contradiction

Remarks

The bounded Volterra derivative gives a stronger, distinct failure of Riemann integrability (Volterra's function is differentiable everywhere with bounded derivative, but its derivative is not Riemann integrable); it is not used in this refutation.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

25 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