Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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 Nonempty Euclidean Open Set Is Not Null

Statement

For every integer m≥1, every nonempty open subset O⊆Rm is not null in the closed-cube-cover sense of Measure zero and content zero in Rm by countable and finite cube covers. The proof uses no choice principle.

Facts & Assumptions

Given: An integer m≥1 and a nonempty Euclidean open set O⊆Rm.

[F1]

A set is null when, for every ε>0, a sequence of closed cubes covers it with total volume at most ε; nullity passes to subsets (Measure zero and content zero in Rm by countable and finite cube covers).

[F3]

A closed rectangle has volume equal to the product of its side lengths; finite coordinate cuts partition it into finitely many subrectangles whose volumes sum to its volume (Axis-parallel rectangles in Rm and their volume).

[F4]

Finite sums are additive and monotone, and a finite subfamily of nonnegative terms is bounded by a partial sum through its largest index (Finite sums and finite products, by recursion, Laws of finite sums and finite products).

[F5]

A nonnegative series whose partial sums are bounded by B converges with sum at most B, and every partial sum is at most the series sum (A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum).

[F6]

For reals x,y and natural m, (x+y)m=∑r=0mι(mr)xrym−r where ι is the canonical embedding of naturals into R (The binomial theorem in R: (x+y)n=∑k<n+1ι ⁣(nk) xky n−k).

Proof

Given: As in Facts & Assumptions.

1.1givenchoosealgebra

Choose x∈O and r>0 with the Euclidean ball B(x,r)⊆O. Put s=r/(2m)>0 and let Q=∏j=1m[xj−s/2,xj+s/2]. For every y∈Q, ∥y−x∥2≤m s/2=r/4<r, so Q⊆O and vol⁡(Q)=sm>0.

2.1F1F4F5F6step 1.1algebraconstructinduction

Suppose O were null. By [F1], with ε=sm/4 there is a sequence of closed cubes Ci covering Q whose side lengths ℓi≥0 have ∑iℓim≤sm/4. For each i≥0, set δi=min⁡{1, sm2−i−5/(3m(1+ℓi)m−1)} and enlarge Ci concentrically to an open cube Ci′ of side ℓi+2δi. By [F6] and δi≤1, 0≤Δi:=(ℓi+2δi)m−ℓim≤di:=sm2−i−5. For every N≥0, induction using the finite-sum recursion gives ∑i<Ndi=sm(1−2−N)/16≤sm/16. Thus every partial sum of the nonnegative enlarged-cost sequence bi=(ℓi+2δi)m=ℓim+Δi satisfies ∑i<Nbi≤sm/4+sm/16=5sm/16, by [F4] and [F5]. A second application of [F5] gives a convergent total enlarged-cost series with sum at most 5sm/16<sm/2.

3.1F2F3F4step 2.1

The open cubes Ci′ cover the closed box Q, so [F2] gives a finite subcover Ci1′,…,Cit′. Order its indices increasingly and take N larger than the largest one. By [F4], the subcover's total cost is at most ∑i<Nbi, which is at most 5sm/16<sm/2 by step 2.1.

4.1F3step 1.1step 3.1contradiction∎

Write Ci′‾ for the closed cube with the same center and side as Ci′, so vol⁡(Ci′‾)=bi. Cut Q and these finitely many closed covering cubes at all their coordinate endpoints. The positive-side grid cells inside Q partition it; the interior of each cell lies in one covering cube because no covering-cube boundary crosses the cell. Assign each cell to the least index of a covering cube containing its interior. By finite cut-additivity from [F3], the assigned cells for each cube have total volume at most that closed cube's volume, while all cells sum to vol⁡(Q)=sm. Thus sm≤∑j=1tvol⁡(Cij′‾)<sm/2, a contradiction. Therefore O is not null.

Depends on

Used by

Dependency tree · two levels

70 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