Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-11
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 n1n\ge1. If CURnC\subseteq U\subseteq\mathbb R^n, where CC is compact and UU is open, then there is a compact Jordan set KK such that CintKKU.C\subseteq\operatorname{int}K\subseteq K\subseteq U. The set KK can be chosen as a finite union of closed grid rectangles.

Facts & Assumptions

Proof

technique · finite-cover
1.1

For each xCx\in C, openness gives a closed grid rectangle RxUR_x\subseteq U with xintRxx\in\operatorname{int}R_x. The interiors cover CC, so [L1] selects R1,,RNR_1,\ldots,R_N. Put K=iRiK=\bigcup_iR_i. Then CintKKUC\subseteq\operatorname{int}K\subseteq K\subseteq U.

L1given
2.1

The finite union KK is closed and bounded, hence compact by [L2]. Its boundary is contained in the union of the boundaries of the RiR_i. Each rectangular face is a continuous coordinate graph over a bounded rectangle and is null by [L3]; a finite union remains null.

L2L3step 1.1
3.1

The boundary criterion in [L3] now makes KK 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.

L3step 2.1

Depends on

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