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

A null set can fail to be the discontinuity set of any function

Statement refuted

Every Lebesgue null subset of R is the discontinuity set of some function RR.

Facts & Assumptions

Given: The Axiom of Countable Choice.

[L1]

The rationals are countably infinite. (Q is countably infinite)

[L2]

Countable subadditivity bounds the measure of a countable union by the sum of the individual measures. (Finite and countable subadditivity of measures)

[L3]

Every Borel subset of R is Lebesgue measurable. (Assuming countable choice, every Borel subset of Rn is Lebesgue measurable)

[L4]

A Gδ set is a countable intersection of open sets and an Fσ set is a countable union of closed sets. (Gδ and Fσ subsets of a topological space, agreeing with the real-line notion)

[L7]

A closed set with empty interior is nowhere dense, and a countable union of nowhere dense sets is meager. (Nowhere dense, meager (first category), residual, and second category subsets of R)

[L9]

Measures are monotone. (Measures are monotone)

Counterexample

technique · contradiction
1.1

By [L1], fix an enumeration (qj)j0 of Q. For each natural number k1, put Uk:=j0(qj2jk2,qj+2jk2). Every Uk is open and dense, because it contains every rational. Each interval in the union has length 2jk1, so [L2], [L3], and [L10] give λ1(Uk)j=02jk1=2k1j=02j=2k. Let G:=k1Uk. Then [L4] makes G a Gδ set, and [L6] makes it dense. Since GUk for every k, [L9] gives λ1(G)2k for all k, so λ1(G)=0.

L1L2L3L4L6L9L10construct
2.1

Suppose, for contradiction, that G is the discontinuity set of some function f:RR. Then [L5] makes G an Fσ set, so by [L4] write G=n0Fn with each Fn closed. Because FnG and λ1(G)=0, monotonicity [L9] gives λ1(Fn)=0 for every n. A closed null set cannot contain a nondegenerate interval, by [L8], so each Fn has empty interior and is nowhere dense by [L7]. Therefore G is meager.

step 1.1L4L5L7L8L9assume-contra
3.1

Step 1.1 writes G as a dense Gδ set, so RG is meager by [L7]. If G were also meager, then R=G(RG) would be a union of two meager sets and therefore meager, contradicting [L6]. So G is a Lebesgue null set that is not the discontinuity set of any real-valued function, and the statement is false.

step 1.1step 2.1L6L7discharge-contradiction

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

81 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