Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck 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 bounded open Jordan set has an increasing exhaustion by compact finite unions of grid rectangles with vanishing content remainder

Statement

Let n≥1 and let V⊆Rn be bounded, open, and Jordan measurable. There are compact Jordan sets K1⊆K2⊆⋯⊆V, each a finite union of closed grid rectangles, such that every compact C⊆V lies in some Kj and cont⁡(V∖Kj)⟶0.

Facts & Assumptions

Given: Bounded open Jordan set V.

[L1]

A bounded set is Jordan measurable exactly when its boundary has content zero (A bounded set in Rm is Jordan measurable iff its boundary is null, equivalently of content zero).

[L2]

A finite cube cover can be replaced by sufficiently fine grid cells with controlled total volume (A finite rectangle cover admits grid control with arbitrarily small volume excess).

[L3]

Jordan content is finitely additive on interior-disjoint Jordan pieces (Jordan content is finitely additive when the overlap has content zero).

Proof

technique · exhaustion
1.1

Enclose V in a rectangle and choose nested dyadic grids whose meshes tend to zero. Let Kj be the union of every closed cell of the jth grid that is contained in V. Only finitely many cells occur. Every child of a retained cell is retained, so Kj⊆Kj+1; each Kj is compact, Jordan, and contained in V.

given
2.1

If compact C⊆V, the distance from C to the closed complement of V is positive. Once the mesh diameter is smaller than that distance, every grid cell meeting C is contained in V, so C⊆Kj.

givenstep 1.1
3.1

Every unretained cell meeting V also meets a mesh-sized neighborhood of ∂V. By [L1], that boundary has content zero; [L2] therefore makes the total volume of all such cells arbitrarily small for fine enough grids. Finite additivity [L3] bounds cont⁡(V∖Kj) by that volume, proving the limit.

L1L2L3∎

Depends on

Used by

Dependency tree · two levels

35 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