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 E⊆Rn be Lebesgue measurable with λn(E)<∞. For every ε>0 there exist a compact set K and a bounded open set O such that

K⊆E,K⊆O,λn(E∖K)<ε,andλn(O∖K)<ε.

Facts & Assumptions

Given: The Axiom of Countable Choice, n≥1, a finite-measure measurable set E⊆Rn, and ε>0.

[L3]

Continuity from below applies to the exhaustion E∩B(0,R)‾↑E (Continuity from below for measures).

Proof

technique · direct
1.1L2L3givenchoose

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

2.1L1L4step 1.1chooseconstruct

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

3.1step 1.1step 2.1L4algebra

Because K=B(0,R)‾∖V, one has [step 1.1, step 2.1, L4, algebra] E∖K⊆(E∖B(0,R)‾)∪(ER∩V). Also ER∩V⊆V∖(B(0,R)‾∖E), so λn(E∖K)<ε/3+ε/3<ε.

4.1step 2.1L4algebra∎

Since K⊆ER⊆O, one also has [step 2.1, L4, algebra] O∖K⊆(O∖ER)∪(ER∖K). But ER∖K=ER∩V⊆V∖(B(0,R)‾∖E), so λn(O∖K)<ε/3+ε/3<ε. Thus K⊆E, K⊆O, and both required excess bounds hold.

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