Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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.

Whitney decomposition of a proper open subset of Euclidean space

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)). Let n≥1 and let Ω⊆Rn be nonempty, open and proper. Write ℓ(Q)=2−k  for the generation-k dyadic cube Q,d(Q)=inf⁡{∣x−y∣:x∈Q, y∈Rn∖Ω} for the all-generations dyadic cubes of Dyadic cubes of all generations in R^n. Then there is a countable family W=(Qj)j∈N of dyadic cubes, with pairwise disjoint interiors, such that

  1. Ω=⋃jQj and n ℓ(Qj)≤d(Qj)≤4n ℓ(Qj) for every j;
  2. if Q,Q′∈W have intersecting closures, then 15ℓ(Q)≤ℓ(Q′)≤5ℓ(Q);
  3. every Q∈W has intersecting closures with at most K(n):=2⋅2n+3n+4n+6n cubes of W (the source [K, Remark 1.11] records the sharper count 12n for its construction; only finiteness of K(n) is used below);
  4. for every 1≤R≤2 the dilated cubes RQj:={cj+R(x−cj):x∈Qj}, cj the centre of Qj, have overlap bounded by a constant Cn<∞ depending only on n (the bound is uniform in R∈[1,2]).

In the diametral normalization the published form [W, Theorem 14.5] records diam⁡Qj≤dist⁡(Qj,Ωc)≤4diam⁡Qj for a family with the same covering and disjointness properties. The dilation restriction R≤2 is not a defect of the construction: for the Whitney family of Ω=(0,∞)⊆R the intervals Qk=(2k,2k+1] have R-dilations containing the fixed point x=1 for infinitely many k as soon as R≥3, so no bound uniform in R can hold.

Facts & Assumptions

Given: n≥1, a nonempty proper open set Ω⊆Rn, Countable Choice, and the dyadic cubes of Dyadic cubes of all generations in R^n with the partition, volume and nesting properties of All-generation dyadic cubes: partition, volume and nesting.

[L1]

The dyadic cube Qk,m of generation k is a half-open box of side 2−k and volume 2−kn; cubes at one generation are pairwise disjoint and cover Rn; two dyadic cubes are disjoint or one contains the other (Dyadic cubes of all generations in R^n, All-generation dyadic cubes: partition, volume and nesting). The closed cube Q‾ is contained in the closed ball of radius n2ℓ(Q) about the centre cQ, and its diameter is n ℓ(Q).

[L2]

For a nonempty set A and z∈Rn one has ∣d(z)−d(z′)∣≤∣z−z′∣ where d(z)=dist⁡(z,Ωc); in particular d is continuous on Ω and d(Q)=inf⁡y∈Qd(y) satisfies d(Q)≤d(y) for every y∈Q. If z lies in the closure of Q, then d(z)≥d(Q).

[L3]

The dilation volume identity ∣rE∣=rn∣E∣ holds for measurable E and r>0 (For a nonzero real c, dilation by c multiplies Lebesgue outer measure by ∣c∣n, and reflection in the origin preserves it).

Proof technique: the distance-compatible dyadic rule, then maximal elements and packing estimates.

Proof

technique · constructive
1.1L1givenalgebraconstruct

The distance rule. For x∈Ω put d(x)=dist⁡(x,Ωc)>0; the positivity uses that Ω is open and Ωc closed. Since the dyadic numbers 2−k, k∈Z, partition (0,∞) into the intervals (2−k−1,2−k], there is exactly one k(x)∈Z with 2−k(x)−1<d(x)/(4n)≤2−k(x), and then d(x)/(4n)≤ℓ(x):=2−k(x)<d(x)/(2n). Let Q(x) be the unique dyadic cube of generation k(x) containing x, which exists because generation k(x) partitions Rn by [L1]. Put G={Q(x):x∈Ω}.

2.1step 1.1L1L2algebra

Cubes of the rule are contained in Ω with controlled distance. If y∈Q(x), then ∣y−x∣≤n ℓ(x)<d(x)/2, so d(y)≥d(x)−∣y−x∣>d(x)/2≥n ℓ(x) by [L2], and therefore d(Q(x))=inf⁡y∈Q(x)d(y)≥n ℓ(x)>0. In particular Q(x)∩Ωc=∅, that is, Q(x)⊆Ω, and Q(x)∈G satisfies the lower bound of claim 1. Thus every point of Ω lies in an element of G.

3.1step 1.1step 2.1L1given

Maximal elements. For each fixed Q∈G, let GQ:={Q′∈G:Q⊆Q′}. Choose the witness x∈Ω with Q=Q(x) supplied by the definition of G. Every member Q′ of this particular set GQ contains x. By step 2.1, n ℓ(Q′)≤d(Q′)≤d(x), while dyadic nesting gives ℓ(Q′)≥ℓ(Q). Thus its side length lies in the finite dyadic range [ℓ(Q),d(x)/n]; at each generation there is only one dyadic cube containing this fixed x. Therefore GQ is finite and nonempty. Its members are nested, so it has a unique largest member by side length, which is maximal in G. Let W be the set of all maximal elements of G. Every Q∈G lies in one of them by the preceding finite-superset argument; the set of all dyadic cubes is countable, hence so is W. This construction uses only G-supersets of each fixed cube, not a maximality principle over all cubes.

4.1step 2.1step 3.1L1

Covering, disjointness and the lower bound. Every x∈Ω lies in some Q(x)∈G, hence in a maximal element of G containing it, so Ω=⋃Q∈WQ. Dyadic cubes are nested or disjoint by [L1], and maximality of the elements of W rules out proper inclusion, so distinct elements of W are disjoint (their interiors are disjoint, indeed the cubes themselves are disjoint as half-open sets). Each Q∈W belongs to G, so n ℓ(Q)≤d(Q) by step 2.1.

5.1step 1.1step 4.1L2algebra

The upper bound is built into the rule. Fix Q∈W and x∈Ω with Q=Q(x), which exists because W⊆G. By definition of ℓ(x) one has d(x)≤4n ℓ(x), and d(Q)≤d(x) because x∈Q; with the lower bound of step 4.1 this gives n ℓ(Q)≤d(Q)≤d(x)≤4n ℓ(Q), which proves claim 1.

6.1step 4.1step 5.1L1L2algebra

Touching cubes have comparable sizes. Let Q,Q′∈W have intersecting closures and let z be a common point. Then d(z)≥d(Q)≥n ℓ(Q) by [L2] and step 4.1. Choose y∈Q′ with d(y)<d(Q′)+ε; since z∈Q′‾ one has ∣z−y∣≤diam⁡(Q′)=n ℓ(Q′), so d(z)≤∣z−y∣+d(y)<n ℓ(Q′)+d(Q′)+ε≤n ℓ(Q′)+4n ℓ(Q′)+ε=5n ℓ(Q′)+ε, the last inequality by step 5.1 applied to Q′. Letting ε↓0 gives n ℓ(Q)≤5n ℓ(Q′), hence ℓ(Q)≤5ℓ(Q′); interchanging the roles of the two cubes gives ℓ(Q′)≤5ℓ(Q). This proves claim 2 with the stated factor 5.

6.2step 4.1step 5.1L2L3givenalgebra

Bounded overlap of small dilates. Fix 1≤R≤2 and x∈Rn, and let J be the set of j with x∈RQj; write cj for the centre, ℓj=ℓ(Qj) and Bj=B(cj,ℓj/2). Distinct cubes of the family are disjoint and each contains Bj, so the balls Bj are pairwise disjoint. If x∈RQj, then x=cj+R(y−cj) for some y∈Qj, so dist⁡(x,Qj)≤∣x−y∣=(R−1)∣y−cj∣≤n2ℓj. Since d is 1-Lipschitz and d(z)≥d(Qj) for z∈Qj, this gives d(x)≥d(Qj)−dist⁡(x,Qj)≥n2ℓj>0. For the other direction, for each δ>0 choose u,v∈Qj with ∣x−u∣<dist⁡(x,Qj)+δ and d(v)<d(Qj)+δ. Lipschitz continuity and ∣u−v∣≤diam⁡(Qj) give d(x)≤d(v)+∣x−v∣≤d(Qj)+dist⁡(x,Qj)+diam⁡(Qj)+2δ; letting δ↓0 yields d(x)≤d(Qj)+dist⁡(x,Qj)+diam⁡(Qj). By step 5.1 and diam⁡(Qj)=nℓj, d(x)≤4nℓj+nℓj+n2ℓj=112nℓj, so ℓj≥2d(x)/(11n). The lower bound for d(x) also gives ℓj≤2d(x)/n, hence ∣x−cj∣≤Rn2ℓj≤nℓj≤2d(x). The disjoint balls B(cj,d(x)/(11n))⊆Bj therefore have centres in B(x,3d(x)) and a common radius d(x)/(11n). The packing estimate [L3] bounds their number by (66n+1)n. Thus the dilated cubes have overlap at most Cn=(66n+1)n, uniformly for 1≤R≤2.

7.1step 6.1L1algebra

Counting touching cubes. Fix Q∈W with side ℓ and generation k. By step 6.1, a touching cube has side in [ℓ/5,5ℓ], so its generation lies in {k−2,k−1,k,k+1,k+2}. At generations k,k+1,k+2, at most 3,4,6 coordinate intervals, respectively, have closures meeting a given closed interval of length ℓ; hence the counts are at most 3n,4n,6n. At each of the two coarser generations, the interval of Q lies inside a single dyadic interval of that generation. Its closure can meet at most that interval and one adjacent interval, because ℓ is strictly less than the coarse side length and all endpoints lie on the fine grid. Thus each coarser generation contributes at most 2n cubes. Summing proves claim 3 with K(n)=2⋅2n+3n+4n+6n.

8.1step 4.1step 5.1step 6.1step 7.1step 6.2discharge-construct∎

Conclusion. Steps 4.1 and 5.1 provide a countable family of dyadic cubes with pairwise disjoint interiors, union Ω and the two-sided distance estimate; step 6.1 gives the touching size comparison; step 7.1 gives the explicit touching count K(n)=2⋅2n+3n+4n+6n; step 6.2 gives the bounded overlap of the dilations with 1≤R≤2. This proves the lemma.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

38 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