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 compact subset of an open Euclidean set has a compact Jordan neighborhood inside that open set
Statement
Let . If , where is compact and is open, then there is a compact Jordan set such that The set can be chosen as a finite union of closed grid rectangles.
Facts & Assumptions
Given: Compact contained in open .
Compactness is intrinsic and supplies a finite subcover from every relative open cover (Open cover, subcover, compact metric space, and compact subset of a metric space, A subset of a metric space is open in the subspace metric exactly when it is the trace of an open set of the ambient space, and it is compact as a metric space in its own right exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it).
Closed bounded subsets of Euclidean space are compact (Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line).
Continuous coordinate graphs have content zero, and a bounded set is Jordan measurable exactly when its boundary is null (The graph of a continuous function on a closed nondegenerate rectangle in has content zero in , A bounded set in is Jordan measurable iff its boundary is null, equivalently of content zero).
Proof
For each , openness gives a closed grid rectangle with . The interiors cover , so [L1] selects . Put . Then .
The finite union is closed and bounded, hence compact by [L2]. Its boundary is contained in the union of the boundaries of the . Each rectangular face is a continuous coordinate graph over a bounded rectangle and is null by [L3]; a finite union remains null.
The boundary criterion in [L3] now makes Jordan measurable. Subdividing the finitely many rectangles by their common coordinate endpoints expresses the same set as a finite union of closed cells from one grid.
Depends on
- Open cover, subcover, compact metric space, and compact subset of a metric space
- A subset of a metric space is open in the subspace metric exactly when it is the trace of an open set of the ambient space, and it is compact as a metric space in its own right exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it
- The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement
- Grid partitions of a rectangle in $\mathbb{R}^m$, their cells, refinements and mesh
- Jordan content is finitely additive when the overlap has content zero
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
- The graph of a continuous function on a closed nondegenerate rectangle in $\mathbb{R}^m$ has content zero in $\mathbb{R}^{m+1}$
- A bounded set in $\mathbb{R}^m$ is Jordan measurable iff its boundary is null, equivalently of content zero
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 146 results over 28 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- A. Leibman, Multidimensional Real Analysis, §5.5 (standard reference, not scraped)