Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-01
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 finite-measure measurable set in Rn has a compact core and a bounded open neighbourhood of arbitrarily small excess

Statement

Assume the Axiom of Countable Choice.

Let ERn be Lebesgue measurable with λn(E)<. For every ε>0 there exist a compact set K and a bounded open set O such that

KE,KO,λn(EK)<ε,andλn(OK)<ε.

Facts & Assumptions

Given: The Axiom of Countable Choice, n1, a finite-measure measurable set ERn, and ε>0.

[L3]

Continuity from below applies to the exhaustion EB(0,R)E (Continuity from below for measures).

Proof

technique · direct
1.1

By [L3], choose R>0 so large that [L2, L3, given, choose] λn(EB(0,R))<ε/3. Put ER:=EB(0,R). Then ER has finite measure and lies in a compact ball.

L2L3givenchoose
2.1

Apply [L1] to choose an open set UER with [L1, L4, step 1.1, choose, construct] λn(UER)<ε/3. Put O:=UB(0,R+1). Then O is bounded and open, and it still contains ER because ERB(0,R)B(0,R+1). Next choose an open set VB(0,R)E with λn(V(B(0,R)E))<ε/3. Define K:=B(0,R)V. Then KE and K is compact, being closed in the compact ball B(0,R).

L1L4step 1.1chooseconstruct
3.1

Because K=B(0,R)V, one has [step 1.1, step 2.1, L4, algebra] EK(EB(0,R))(ERV). Also ERVV(B(0,R)E), so λn(EK)<ε/3+ε/3<ε.

step 1.1step 2.1L4algebra
4.1

Since KERO, one also has [step 2.1, L4, algebra] OK(OER)(ERK). But ERK=ERVV(B(0,R)E), so λn(OK)<ε/3+ε/3<ε. Thus KE, KO, and both required excess bounds hold.

step 2.1L4algebra

Depends on

Used by

Dependency tree · two levels

56 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