Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27
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.

R is the union of a meager set and a set of measure zero, so smallness of category and smallness of measure are independent notions

Statement refuted

Refuted claim: meagreness and measure zero are comparable notions of smallness, so that a set small in one sense is small, or at least not co-small, in the other.

The witness is a decomposition R=(R∖G)∪G in which R∖G is meager (Nowhere dense, meager (first category), residual, and second category subsets of R) and G has measure zero (Measure zero (a countable cover by intervals of total length below every ε) and content zero (a finite such cover)). So R, which by Baire category in R, by nested intervals with canonically chosen rational endpoints: a countable intersection of dense open sets is dense, so R is not a countable union of nowhere dense sets is not meager, splits into two pieces each of which is negligible, one in the sense of category and one in the sense of measure. In particular G is residual and null at the same time, and its complement is meager and, being the complement of a null set, in no sense small in measure.

The set is G:=⋂n∈NUn,Un:=⋃k∈N(e(k)−2−k−n−2, e(k)+2−k−n−2), where e:N→QR is a bijection onto the rationals (The rationals embed densely in the reals).

Facts & Assumptions

Given: A bijection e:N→QR onto the rationals inside R, the sets Un and G displayed above.

[A1]

The refuted claim: a meager set and a set of measure zero cannot together exhaust R, meagreness and nullity being comparable notions of smallness.

[L5]

Nullity: A is null when for every real ε>0 there is a sequence of closed intervals covering A with all partial total lengths at most ε; every at most countable set is null (Measure zero (a countable cover by intervals of total length below every ε) and content zero (a finite such cover), Every at most countable subset of R has measure zero).

[L7]

G is an intersection of a sequence of open sets, so it is Gδ (Fσ and Gδ subsets of R).

[L8]

Ordered-field arithmetic: 0<1, so 2>0 and 2−k−n−2>0; adding a constant and multiplying by a positive preserve an inequality (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property)). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.

Counterexample

technique · direct
1.1

Fix e by [L1]. Each Un is an open set, being a union of open intervals by [L2], and each contains QR, since e(k) lies in the k-th interval by [L8]. Hence each Un is dense by [L1] and [L3], a superset of a dense set being dense.

givenL1L2L3L8choose
2.1

G is null. Let the real ε>0 be given and use [L4] to fix n with 2−n≤ε. The closed intervals Ik:=[ e(k)−2−k−n−2, e(k)+2−k−n−2 ] cover Un, hence cover G⊆Un, and each has length 2−k−n−1=2−n−12−k by [L2], [L4] and [L8]; so every partial total length is ∑k<i2−n−12−k=2−n−1∑k<i2−k≤2−n−1⋅2=2−n≤ε by [L4]. By [L5] the set G has measure zero.

step 1.1L4L5L8
2.2

R∖G is meager. By De Morgan R∖G=⋃n(R∖Un), and each R∖Un is closed by [L2]. Its interior is empty: if Nδ(x)⊆R∖Un for some real δ>0, then Nδ(x) would miss QR⊆Un, contradicting the density of QR given by [L1] and [L3]. So each R∖Un is nowhere dense by [L3], and R∖G is meager.

step 1.1L1L2L3
3.1

So R=(R∖G)∪G with the first piece meager and the second null, which is the failure of [A1]. Moreover G is residual, its complement being meager, and G≠∅: were G empty, R=R∖G would be meager, contradicting [L6]. Thus G is a residual, Gδ set of measure zero by [L7], and R∖G is a meager set whose complement is null.

step 2.1step 2.2A1L3L6L7∎

Remarks

  • Both pieces are as small as their notion allows, and they are complementary. G is null and residual; R∖G is meager and its complement is null. So no implication holds between "meager" and "null" in either direction, and neither can be strengthened to a statement about the complement. This is the standard duality between measure and category, and G is the standard witness for it.

  • G contains all the irrationals that are well approximable by rationals. Membership in Un says that some rational e(k) lies within 2−k−n−2 of the point, so G is a set of points approximable by rationals at every accuracy of that shape. Nothing on this page needs that reading; it is recorded because it is what makes the example natural rather than contrived.

  • Baire is used only once, and only for nonemptiness. Steps 2.1 and 2.2 are independent of Baire category in R, by nested intervals with canonically chosen rational endpoints: a countable intersection of dense open sets is dense, so R is not a countable union of nowhere dense sets; it enters in step 3.1 to rule out G=∅, which would make the decomposition vacuous. That is also the precise sense in which the example needs the completeness of R.

  • The individual Un are open, dense and of small total cover length, which is Q is covered by open intervals of total length ε, for every ε>0 with ε=2−n; the example is that construction iterated and intersected.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

96 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