Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck 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.

FALSE: every set of measure zero has content zero

Statement

False claim: every set of measure zero has content zero (Measure zero (a countable cover by intervals of total length below every ε) and content zero (a finite such cover)).

The converse is true and is A set of content zero has measure zero; the two notions do coincide for compact sets (For a compact subset of R, measure zero and content zero coincide). The claim above drops the compactness, and boundedness alone is not a substitute: the witness below is a bounded set of measure zero with no finite cover by intervals of total length less than 1.

Facts & Assumptions

Given: The set E:=QR∩[0,1], where QR is the image of Q in R (The rationals embed densely in the reals).

[A1]

The false claim: every subset of R of measure zero has content zero.

[L4]

If [a,b]⊆⋃j≤n[cj,dj] with a≤b and cj≤dj, then ∑j≤n(dj−cj)≥b−a (If finitely many intervals cover a closed bounded interval [a,b], the sum of their lengths is at least b−a).

[L5]

A has content zero when for every real ε>0 it has a finite cover by closed intervals of total length at most ε (Measure zero (a countable cover by intervals of total length below every ε) and content zero (a finite such cover)).

[L6]

Every nonempty finite set of reals has a maximum and a minimum (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).

[L7]

Ordered-field arithmetic: 0<1, so 2>0 and 2−1>0 and 2−1<1; adding a constant and multiplying by a positive preserve an inequality; the order is total and transitive (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.

Refutation

technique · direct
1.1

E has measure zero by [L1], and E⊆[0,1] is bounded.

L1
1.2

Every x∈[0,1] is adherent to E: given a real ε>0, put p:=max⁡{0, x−ε} and q:=min⁡{1, x+ε}, which exist by [L6]. Then p<q: indeed p≤x≤q by [L7] and 0≤x≤1, while p=x would need x≤0 hence x=0<min⁡{1,ε}=q, and q=x would need x≥1 hence x=1>max⁡{0,1−ε}=p, and otherwise p<x<q. By [L2] there is a rational strictly between p and q; it lies in [0,1] because 0≤p and q≤1, and within ε of x because x−ε≤p and q≤x+ε. So Nε(x)∩E≠∅.

L2L6L7
2.1

Let n∈N and c0≤d0,…,cn≤dn be any finite family of closed intervals with E⊆⋃j≤n[cj,dj]. The union ⋃j≤n[cj,dj] is a closed set by [L3], and it contains E, hence contains E‾ by [L3]; by step 1.2 every point of [0,1] lies in E‾, so [0,1]⊆⋃j≤n[cj,dj] and [L4] gives ∑j≤n(dj−cj)≥1.

step 1.2L3L4
3.1

So no finite family of closed intervals covers E with total length at most 2−1<1, and E does not have content zero by [L5] and [L7]; yet E has measure zero by step 1.1. The claim [A1] therefore fails at E and is false.

step 1.1step 2.1A1L5L7∎

Remarks

Depends on

Used by

Dependency tree · two levels

76 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