Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Compact convex windows admit rectangle approximations and have negligible translated boundary

Statement

Assume Countable Choice. Let W⊆Rd be compact and convex with nonempty interior. Then 0<∣W∣<∞, ∣aW∣=ad∣W∣ for every a>0, and for each ϵ>0 there is a finite disjoint union R of half-open rectangles with R⊆W and ∣W∖R∣<ϵ. Also, for every fixed x∈Rd,

∣(aW+x)△aW∣∣aW∣⟶0(a→∞).

Here ∣⋅∣ denotes Borel Lebesgue measure and A△B=(A∖B)∪(B∖A).

Facts & Assumptions

Given: Countable Choice, a compact convex set W with nonempty interior, and Borel Lebesgue measure ∣⋅∣ on Rd.

[A1]

Countable Choice is assumed for the Borel Lebesgue measure and its box-value properties. (The Axiom of Countable Choice (ACω))

[F1]

Under Countable Choice, Lebesgue measure on the full Lebesgue sigma-algebra is a measure, its restriction to Borel sets is a measure, every half-open box has its usual product volume, and it is finite on bounded sets. (Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume, A box in Rn with parameters ai≤bi is Lebesgue measurable of measure ∏i<n(bi−ai), whichever of its faces are included)

[F3]

Lebesgue measure is translation invariant, and measures are continuous from below. (Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation, Continuity from below for measures)

Proof

Given: Countable Choice and a compact convex W⊆Rd with nonempty interior.

1.1givenA1construct

Choose x0∈int⁡W and r>0 with the open ball B(x0,r)⊆W. For 0<t<1 put Wt=x0+(1−t)(W−x0). If w∈W and ∥z∥<tr, then x0+z/t∈B(x0,r)⊆W and (1−t)w+t(x0+z/t)=(1−t)w+tx0+z∈W by convexity; thus every point of Wt has an open ball of radius tr contained in W, so Wt⊆int⁡W.

2.1step 1.1givenconstructalgebra

If 0<t′<t<1, put w′=1−t1−t′w+t−t′1−t′x0. The two coefficients are nonnegative and sum to one, so w′∈W by convexity, and x0+(1−t)(w−x0)=x0+(1−t′)(w′−x0). Thus Wt⊆Wt′. Moreover, every y∈int⁡W lies in some Wt: for y≠x0, choose s>0 small enough that w=x0+(1+s)(y−x0)∈W, and then y=x0+(1−t)(w−x0) for t=s/(1+s); x0 lies in every Wt. Hence for any sequence tn↓0, Wtn↑int⁡W.

3.1step 2.1F1F2F3

By [F2] and [F3], ∣Wtn∣=(1−tn)d∣W∣ and the sets increase to int⁡W, so [F3] gives ∣int⁡W∣=∣W∣. Thus the compact boundary ∂W=W∖int⁡W is a null set. Since W contains a nonempty open ball and is bounded, [F1] gives 0<∣W∣<∞.

4.1step 1.1step 3.1F1construct

Given ϵ>0, choose t>0 so that ∣W∣−∣Wt∣=(1−(1−t)d)∣W∣<ϵ. Choose a grid of half-open cubes of side δ<tr/d. Each cube that intersects Wt is contained in W, because its points lie within distance at most dδ<tr of a point whose radius-tr ball lies in W. Only finitely many grid cubes intersect bounded Wt; their union R is disjoint, finite, contains Wt, and is contained in W. Therefore ∣W∖R∣≤∣W∖Wt∣<ϵ.

5.1step 4.1F1F3algebra

Fix ϵ>0 and choose R⊆W as in step 4.1, a finite union of disjoint rectangles. Translation invariance and the symmetric-difference inclusion give ∣(W+h)△W∣≤2∣W∖R∣+∣(R+h)△R∣. For each half-open rectangle, its overlap with a translate by h has volume tending to the rectangle's volume as h→0, by the box-volume formula; the same limit holds for their finite union. Thus lim sup⁡h→0∣(W+h)△W∣≤2ϵ, and arbitrariness of ϵ gives convergence to zero.

6.1step 5.1F2algebra

For a>0, [F2] gives ∣aW∣=ad∣W∣ and ∣(aW+x)△aW∣=ad∣(W+x/a)△W∣. Dividing and applying step 5.1 with h=x/a→0 proves the asserted boundary ratio.

7.1A1F1F2step 3.1step 4.1step 5.1step 6.1∎

Steps 3.1, 4.1, 5.1, and 6.1 prove positive finite volume, the finite inner rectangle approximation, dilation scaling, and the translated-boundary limit. Countable Choice is used only through [F1]–[F2]; no AC or DC is used.

Sources

Last and Penrose, Chapter 8, proof of Theorem 8.14; local details above make the convex-boundary approximation explicit.

Depends on

Used by

Dependency tree · two levels

54 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