TheoremBase

Dyadic Cells in Rn\mathbb{R}^n and the Decomposition of an Open Set

Introduces the half-open dyadic cells of Rn\mathbb{R}^n, records that each generation partitions Rn\mathbb{R}^n into countably many cells of measure 2−kn2^{-kn} and small diameter, that two cells are nested or disjoint, and that every open set is a countable disjoint union of dyadic cells.

Statement

We work in the setting of Product Measures and Lebesgue Measure on ℝⁿ: Standing Notation and Background, whose notation is fixed for every dimension and is used here with a natural number nn satisfying 1≤n1\le n: the Euclidean norm ∥ ⋅ ∥\lVert\,\cdot\,\rVert, distance dEd_{E} and notion of openness on Rn\mathbb{R}^{n}, the Borel σ\sigma-algebra B(Rn)\mathcal{B}(\mathbb{R}^{n}), Lebesgue measure λn\lambda_{n} with its conventions for [0,∞][0,\infty] and for sums of sequences there, and the constant σn\sigma_{n} with σn2=n\sigma_{n}^{2}=n, are all as fixed in that setting. As fixed in clause 1 of that setting, Zn\mathbb{Z}^{n} is the set of nn-tuples of integers, countability is as defined there, and 2−k2^{-k} denotes the multiplicative inverse of 2k2^{k} for k∈Nk\in\mathbb{N}.

For k∈Nk\in\mathbb{N} and j=(j1,…,jn)∈Znj=(j_{1},\dots,j_{n})\in\mathbb{Z}^{n} put

Qk,j={x∈Rn:ji2−k≤xi<(ji+1)2−k  for every i∈{1,…,n}},Q_{k,j}=\{x\in\mathbb{R}^{n}: j_{i}2^{-k}\le x_{i}<(j_{i}+1)2^{-k}\ \text{ for every }i\in\{1,\dots,n\}\},

called the dyadic cell of generation kk and index jj, and let Q={Qk,j:k∈N, j∈Zn}\mathcal{Q}=\{Q_{k,j}:k\in\mathbb{N},\ j\in\mathbb{Z}^{n}\} be the set of all dyadic cells. (The similar notation of Uniform Grids on a Half-Open Box and Grid Hulls of a Compact Set in Rn\mathbb{R}^n refers to the cells of a uniform grid on a fixed half-open box, indexed by a finite set; the cells Qk,jQ_{k,j} introduced here are indexed by Zn\mathbb{Z}^{n} and cover all of Rn\mathbb{R}^{n}.) Then the following hold.

1. (Each generation is a countable partition) Let k∈Nk\in\mathbb{N}. Every x∈Rnx\in\mathbb{R}^{n} lies in exactly one set Qk,jQ_{k,j} with j∈Znj\in\mathbb{Z}^{n}; the sets Qk,jQ_{k,j} with j∈Znj\in\mathbb{Z}^{n} are pairwise disjoint members of B(Rn)\mathcal{B}(\mathbb{R}^{n}) whose union is Rn\mathbb{R}^{n}; the index set Zn\mathbb{Z}^{n} and the set N×Zn\mathbb{N}\times\mathbb{Z}^{n} are countable and infinite, and the map (k,j)↦Qk,j(k,j)\mapsto Q_{k,j} from N×Zn\mathbb{N}\times\mathbb{Z}^{n} to Q\mathcal{Q} is injective; and for every j∈Znj\in\mathbb{Z}^{n},

λn(Qk,j)=(2−k)n,∥x−y∥≤σn2−k  for all x,y∈Qk,j.\lambda_{n}(Q_{k,j})=(2^{-k})^{n},\qquad \lVert x-y\rVert\le\sigma_{n}2^{-k}\ \text{ for all }x,y\in Q_{k,j}.

2. (Nesting) Let k,k′∈Nk,k'\in\mathbb{N} with k≤k′k\le k' and let j,j′∈Znj,j'\in\mathbb{Z}^{n}. Then either Qk′,j′⊆Qk,jQ_{k',j'}\subseteq Q_{k,j} or Qk′,j′∩Qk,j=∅Q_{k',j'}\cap Q_{k,j}=\varnothing; and there is exactly one j′′∈Znj''\in\mathbb{Z}^{n} with Qk′,j′⊆Qk,j′′Q_{k',j'}\subseteq Q_{k,j''}. Consequently any two dyadic cells are either disjoint or one of them is contained in the other.

3. (Decomposition of an open set) Let U⊆RnU\subseteq\mathbb{R}^{n} be open. Then there is a sequence (Pm)m∈N(P_{m})_{m\in\mathbb{N}} of pairwise disjoint members of B(Rn)\mathcal{B}(\mathbb{R}^{n}), each of which is either empty or a dyadic cell contained in UU, whose union is UU; and for every such sequence

λn(U)=∑m∈Nλn(Pm).\lambda_{n}(U)=\sum_{m\in\mathbb{N}}\lambda_{n}(P_{m}).

4. (Small cells around a point) Let x∈Rnx\in\mathbb{R}^{n} and let r∈Rr\in\mathbb{R} with 0<r0<r. Then there is k∈Nk\in\mathbb{N} with σn2−k≤r\sigma_{n}2^{-k}\le r, and for every such kk the cell of generation kk containing xx satisfies

∥y−x∥≤rfor every y∈Qk,j with x∈Qk,j.\lVert y-x\rVert\le r\qquad\text{for every }y\in Q_{k,j}\text{ with }x\in Q_{k,j}.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…