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 , let be closed, and let satisfy . If , define
and if , put . Then , , and
Thus, for a closed set and a finite-outer-measure test set , the positive-distance layers inside increase to in outer measure.
Facts & Assumptions
Given: The metric outer measure, the closed set , and the finite-outer-measure set from the Statement.
An outer measure on a metric space is a metric outer measure when for all nonempty with . (Metric outer measures)
In a metric space, is defined exactly when is nonempty, and 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)
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
If or , the asserted constant layers give the result without set-distance notation. Otherwise [F2] licenses , the layers are increasing, and closedness means every has a ball disjoint from , hence and enters some ; thus . Put .
The function is -Lipschitz, since the triangle inequality gives and symmetrically. Therefore two nonempty annuli of the same parity with are positively separated: their distance-to- ranges are separated by the positive gap between and . Repeated use of [F1] on finite parity unions gives and , with empty annuli omitted.
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 . Given , choose a partial sum within of each supremum; every later tail is then below , so both parity tails tend to zero. Now , so subadditivity bounds its outer measure by those two tails. Thus all sufficiently large satisfy , and taking the supremum over 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
- G. Folland, Real Analysis, 2nd ed., proof of Proposition 11.16 (standard reference, not scraped)