Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24
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.

Boundary layers of finite metric outer measure exhaust the complement of a closed set in outer measure

Statement

Let μ∗ be a metric outer measure on (X,d), let F⊆X be closed, and let A⊆X satisfy μ∗(A)<+∞. If F≠∅, define

Bn:={x∈A∖F:d(x,F)≥1/(n+1)},

and if F=∅, put Bn=A. Then Bn⊆Bn+1, ⋃nBn=A∖F, and

sup⁡n∈Nμ∗(Bn)=μ∗(A∖F).

Thus, for a closed set F and a finite-outer-measure test set A, the positive-distance layers inside A∖F increase to A∖F in outer measure.

Facts & Assumptions

Given: The metric outer measure, the closed set F, and the finite-outer-measure set A from the Statement.

[F1]

An outer measure on a metric space is a metric outer measure when μ∗(A∪B)=μ∗(A)+μ∗(B) for all nonempty A,B with d(A,B)>0. (Metric outer measures)

[F2]

In a metric space, d(x,A) is defined exactly when A is nonempty, and d(A,B) exactly when both sets are nonempty; no boundedness is required for either distance. (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space)

[F3]

For a nonnegative extended-real sequence, the series is the supremum of its finite partial sums, and a tail series is formed by shifting the sequence. (Series in the nonnegative extended real line)

Proof

technique · direct
1.1F2construct

If F=∅ or A∖F=∅, the asserted constant layers give the result without set-distance notation. Otherwise [F2] licenses d(x,F), the layers are increasing, and closedness means every x∉F has a ball disjoint from F, hence d(x,F)>0 and x enters some Bn; thus Bn↑A∖F. Put Cn=Bn+1∖Bn.

2.1step 1.1F1algebra

The function x↦d(x,F) is 1-Lipschitz, since the triangle inequality gives d(x,F)≤d(x,y)+d(y,F) and symmetrically. Therefore two nonempty annuli Ci,Cj of the same parity with i<j are positively separated: their distance-to-F ranges are separated by the positive gap between 1/(i+2) and 1/(j+1). Repeated use of [F1] on finite parity unions gives ∑k<mμ∗(C2k)≤μ∗(A) and ∑k<mμ∗(C2k+1)≤μ∗(A), with empty annuli omitted.

3.1step 1.1step 2.1F3algebra∎

By [F3], each parity series is the supremum of its increasing finite partial sums, and step 2.1 bounds that supremum by the finite number μ∗(A). Given ε>0, choose a partial sum within ε/2 of each supremum; every later tail is then below ε/2, so both parity tails tend to zero. Now (A∖F)∖Bn=⋃k≥nCk, so subadditivity bounds its outer measure by those two tails. Thus all sufficiently large n satisfy μ∗(Bn)≤μ∗(A∖F)≤μ∗(Bn)+ε, and taking the supremum over n proves the stated equality.

Depends on

Used by

Dependency tree · two levels

19 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