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 ()). Let and let be nonempty, open and proper. Write for the all-generations dyadic cubes of Dyadic cubes of all generations in R^n. Then there is a countable family of dyadic cubes, with pairwise disjoint interiors, such that
- and for every ;
- if have intersecting closures, then ;
- every has intersecting closures with at most cubes of (the source [K, Remark 1.11] records the sharper count for its construction; only finiteness of is used below);
- for every the dilated cubes , the centre of , have overlap bounded by a constant depending only on (the bound is uniform in ).
In the diametral normalization the published form [W, Theorem 14.5] records for a family with the same covering and disjointness properties. The dilation restriction is not a defect of the construction: for the Whitney family of the intervals have -dilations containing the fixed point for infinitely many as soon as , so no bound uniform in can hold.
Facts & Assumptions
Given: , a nonempty proper open set , 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.
The dyadic cube of generation is a half-open box of side and volume ; cubes at one generation are pairwise disjoint and cover ; 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 is contained in the closed ball of radius about the centre , and its diameter is .
For a nonempty set and one has where ; in particular is continuous on and satisfies for every . If lies in the closure of , then .
The dilation volume identity holds for measurable and (For a nonzero real , dilation by multiplies Lebesgue outer measure by , and reflection in the origin preserves it).
Proof technique: the distance-compatible dyadic rule, then maximal elements and packing estimates.
Proof
The distance rule. For put ; the positivity uses that is open and closed. Since the dyadic numbers , , partition into the intervals , there is exactly one with , and then Let be the unique dyadic cube of generation containing , which exists because generation partitions by [L1]. Put .
Cubes of the rule are contained in with controlled distance. If , then , so by [L2], and therefore . In particular , that is, , and satisfies the lower bound of claim 1. Thus every point of lies in an element of .
Maximal elements. For each fixed , let . Choose the witness with supplied by the definition of . Every member of this particular set contains . By step 2.1, , while dyadic nesting gives . Thus its side length lies in the finite dyadic range ; at each generation there is only one dyadic cube containing this fixed . Therefore is finite and nonempty. Its members are nested, so it has a unique largest member by side length, which is maximal in . Let be the set of all maximal elements of . Every lies in one of them by the preceding finite-superset argument; the set of all dyadic cubes is countable, hence so is . This construction uses only -supersets of each fixed cube, not a maximality principle over all cubes.
Covering, disjointness and the lower bound. Every lies in some , hence in a maximal element of containing it, so . Dyadic cubes are nested or disjoint by [L1], and maximality of the elements of rules out proper inclusion, so distinct elements of are disjoint (their interiors are disjoint, indeed the cubes themselves are disjoint as half-open sets). Each belongs to , so by step 2.1.
The upper bound is built into the rule. Fix and with , which exists because . By definition of one has , and because ; with the lower bound of step 4.1 this gives , which proves claim 1.
Touching cubes have comparable sizes. Let have intersecting closures and let be a common point. Then by [L2] and step 4.1. Choose with ; since one has , so the last inequality by step 5.1 applied to . Letting gives , hence ; interchanging the roles of the two cubes gives . This proves claim 2 with the stated factor .
Bounded overlap of small dilates. Fix and , and let be the set of with ; write for the centre, and . Distinct cubes of the family are disjoint and each contains , so the balls are pairwise disjoint. If , then for some , so . Since is 1-Lipschitz and for , this gives . For the other direction, for each choose with and . Lipschitz continuity and give ; letting yields . By step 5.1 and , so . The lower bound for also gives , hence . The disjoint balls therefore have centres in and a common radius . The packing estimate [L3] bounds their number by . Thus the dilated cubes have overlap at most , uniformly for .
Counting touching cubes. Fix with side and generation . By step 6.1, a touching cube has side in , so its generation lies in . At generations , at most coordinate intervals, respectively, have closures meeting a given closed interval of length ; hence the counts are at most . At each of the two coarser generations, the interval of 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 cubes. Summing proves claim 3 with .
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 ; step 6.2 gives the bounded overlap of the dilations with . This proves the lemma.
Depends on
- Dyadic cubes of all generations in R^n
- All-generation dyadic cubes: partition, volume and nesting
- Axis-parallel rectangles in $\mathbb{R}^m$ and their volume
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- For a nonzero real $c$, dilation by $c$ multiplies Lebesgue outer measure by $|c|^n$, and reflection in the origin preserves it
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
- Juha Kinnunen, Harmonic Analysis (Aalto University lecture notes) (standard reference, not scraped)
- Mark Williams, Notes on Harmonic Analysis (January 11, 2022) (standard reference, not scraped)
- Shai Dekel, Gerard Kerkyacharian, George Kyriazis, Pencho Petrushev, A New Proof of the Atomic Decomposition of Hardy Spaces, Constructive Theory of Functions (Sozopol 2016), pp. 59-73 (standard reference, not scraped)