Alphabeta Math
False statementConstruction: Literature-sourcedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-28
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: assuming countable choice, Lusin's theorem says measurable functions are continuous off a null set

Statement refuted

Assume the Axiom of Countable Choice.

Lusin's theorem says measurable functions are continuous off a null set.

Facts & Assumptions

Given: The Axiom of Countable Choice and the Dirichlet function D:=1Q[0,1]:[0,1]R.

[L1]

Assuming countable choice, Lusin's theorem provides large closed sets on which a measurable real-valued function is continuous. (Assuming countable choice, Lusin's theorem on finite-measure subsets of R^n)

[L2]

Refutation

technique · direct
1.1

The function D is measurable and, by [L1], for every ε>0 there is a closed set F[0,1] with λ([0,1]F)<ε such that DF is continuous.

L1
1.2

Fix x[0,1]. By [L2], every neighbourhood of x contains both a rational point q and an irrational point u. Then D(q)=1 and D(u)=0, so D is not continuous at x. Thus D is nowhere continuous on [0,1].

L2
2.1

Step 1.1 is exactly Lusin's conclusion, while step 1.2 shows that no null set deletion can make D continuous at the remaining points as a function on [0,1]. So the stated reading of Lusin's theorem is false.

step 1.1step 1.2

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

20 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