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.
Maximal dyadic cubes covering a proper open set
Statement
Assume the Axiom of Countable Choice (The Axiom of Countable Choice ()). Let and let be a nonempty, open and proper subset of . Use the all-generations dyadic cubes of Dyadic cubes of all generations in R^n; for a dyadic cube and let denote the concentric cube with side length times that of , and write for the side length. Put Then:
- possesses maximal elements, i.e. cubes of that are contained in no strictly larger cube of .
- The maximal elements of are pairwise disjoint, they are at most countable, and their union is exactly .
- If is a maximal element of and is its dyadic parent, then and , so some satisfies ; every such obeys for all . In particular while .
Facts & Assumptions
Given: Countable Choice, , a nonempty open proper , and the family of the Statement.
A dyadic cube with , is the half-open box of side , it contains its centre , and two dyadic cubes of generations that meet satisfy (Dyadic cubes of all generations in R^n, All-generation dyadic cubes: partition, volume and nesting).
A subset of is open in the metric topology when every point of it has a Euclidean ball around it contained in it (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement, Open ball, closed ball and sphere in a metric space), and the Euclidean, and data satisfy (The finite and reverse triangle inequalities for a norm; and for every norm on satisfies and is Lipschitz, hence continuous, for ).
The set is at most countable ( is a countable dense subset of , and rational open boxes form a countable basis) and a subset of an at most countable set is at most countable (Every subset of an at most countable set is at most countable).
For every real there is a natural number with (Every complete ordered field is Archimedean).
Proof
is nonempty and covers locally: fix ; by [F2] there is with . Choose with , let be the generation- dyadic cube containing , and let . Since and has side , [F1] gives and , so by [F2] ; hence . Thus and contains .
Maximal elements exist: let and , which exists because is proper, and fix . If an ancestor of of side lies in , then , so ; now gives and every point of is within -distance of , so [F2] gives and, for first, , by the reverse triangle inequality in ; that is, . The ancestors of have side lengths with increasing as decreases, so by [F4] only finitely many of them have side ; hence only finitely many ancestors of lie in , and among those finitely many there is one of least generation, which is a maximal element of containing . Taking arbitrary shows that every cube of lies below a maximal element, and in particular maximal elements exist.
The maximal elements are pairwise disjoint: if are maximal and meet, then by [F1] one contains the other, and maximality forces . They are at most countable: the map sending a dyadic cube to its centre is injective on any family of pairwise disjoint cubes (a cube contains its own centre), its values are points of because , and is at most countable, so [F3] makes the family at most countable.
Their union is exactly : each maximal element lies in , hence is contained in , so the union is a subset of ; conversely, for step 1.1 supplies with , and step 2.1 supplies a maximal element containing , hence containing . Thus .
Let be maximal in and let be its dyadic parent: has side , its centre differs from by at most in each coordinate, so . Maximality gives , that is, , so there is with ; every point of is within -distance and every point of within -distance of the centre of , so [F2] bounds the -distance between any and by ; in particular while .
Scaffold repair recorded. The scaffolded form of this lemma asked for the dyadic cubes contained in that are maximal under inclusion, with the parent of a maximal cube not contained in . That form is false: for the nonempty open proper set and the all-generations grid, every dyadic cube contained in is contained in a strictly larger ancestor also contained in (the ancestors of the cube are , all inside ), so maximal elements do not exist at all; with the bounded grid of generations taken instead, a generation- maximal cube can be at distance far exceeding a multiple of its side length from , so no point can be found near it. The version proved above is the Whitney-type statement actually needed by the good- estimate: the cubes are maximal in the family adapted to (), and they retain the near-boundary point with the uniform bound .
Depends on
- Dyadic cubes of all generations in R^n
- All-generation dyadic cubes: partition, volume and nesting
- 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
- $\mathbb{Q}^n$ is a countable dense subset of $\mathbb{R}^n$, and rational open boxes form a countable basis
- Every subset of an at most countable set is at most countable
- Open ball, closed ball and sphere in a metric space
- The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement
- The finite and reverse triangle inequalities for a norm; and for $n \ge 1$ every norm $N$ on $\mathbb{R}^n$ satisfies $N(x) \le C\lVert x\rVert_1$ and is Lipschitz, hence continuous, for $d_2$
- Every complete ordered field is Archimedean
Used by
Dependency tree · two levels
85 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
- Loukas Grafakos, Classical Fourier Analysis, 3rd ed. (Springer GTM 249, 2014) (standard reference, not scraped)
- Juha Kinnunen, Harmonic Analysis (Aalto University lecture notes) (standard reference, not scraped)