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.

Maximal dyadic cubes covering a proper open set

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let n≥1 and let Ω⊆Rn be a nonempty, open and proper subset of Rn. Use the all-generations dyadic cubes of Dyadic cubes of all generations in R^n; for a dyadic cube Q and λ>0 let λQ denote the concentric cube with side length λ times that of Q, and write ℓ(Q) for the side length. Put F:={ Q dyadic:5n Q⊆Ω }. Then:

  1. F possesses maximal elements, i.e. cubes of F that are contained in no strictly larger cube of F.
  2. The maximal elements of F are pairwise disjoint, they are at most countable, and their union is exactly Ω.
  3. If Q is a maximal element of F and P is its dyadic parent, then P⊆3Q and P∉F, so some y∈5n P satisfies y∉Ω; every such y obeys ∣x−y∣≤6nn ℓ(Q) for all x∈Q. In particular dist⁡(Q,Ωc)≤6nn ℓ(Q) while 5n Q⊆Ω.

Facts & Assumptions

Given: Countable Choice, n≥1, a nonempty open proper Ω, and the family F of the Statement.

[F1]

A dyadic cube Qk,m with k∈Z, m∈Zn is the half-open box { x:mi2−k<xi≤(mi+1)2−k for all i } of side ℓ(Qk,m)=2−k, it contains its centre c(Qk,m)=((mi+12)2−k)i, and two dyadic cubes of generations k≤k′ that meet satisfy Qk′,m′⊆Qk,m (Dyadic cubes of all generations in R^n, All-generation dyadic cubes: partition, volume and nesting).

[F2]

A subset of Rn 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, ℓ1 and ℓ∞ data satisfy d2(x,y)=∥x−y∥2≤∥x−y∥1≤n d∞(x,y) (The finite and reverse triangle inequalities for a norm; and for n≥1 every norm N on Rn satisfies N(x)≤C∥x∥1 and is Lipschitz, hence continuous, for d2).

[F3]

The set Qn is at most countable (Qn is a countable dense subset of Rn, 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).

[F4]

For every real M there is a natural number k with M<k (Every complete ordered field is Archimedean).

Proof

technique · direct
1.1F1F2givenchoose

F is nonempty and covers Ω locally: fix x∈Ω; by [F2] there is r>0 with B2(x,r)⊆Ω. Choose k with 3nn 2−k<r, let Q be the generation-k dyadic cube containing x, and let y∈5n Q. Since x,y∈5nQ and 5nQ has side 5n 2−k, [F1] gives d∞(x,c(Q))≤122−k and d∞(c(Q),y)≤52n 2−k, so by [F2] d2(x,y)≤d2(x,c(Q))+d2(c(Q),y)≤n(12+52n)2−k≤3nn 2−k<r; hence y∈B2(x,r)⊆Ω. Thus 5nQ⊆Ω and Q∈F contains x.

2.1F1F2F4step 1.1algebra

Maximal elements exist: let Q∈F and w∉Ω, which exists because Ω is proper, and fix x∈Q. If an ancestor A of Q of side s lies in F, then 5n A⊆Ω, so w∉5n A; now x∈Q⊆A gives d∞(x,c(A))≤s/2 and every point of 5n A is within ℓ∞-distance (5n/2)s of c(A), so [F2] gives d2(x,c(A))≤ns/2 and, for z=w first, d2(w,x)≥d∞(w,x)≥12(5n−1)s, by the reverse triangle inequality in d∞; that is, s≤2d2(w,x)/(5n−1)=:M. The ancestors of Q have side lengths 2−j with j≤k increasing as j decreases, so by [F4] only finitely many of them have side s≤M; hence only finitely many ancestors of Q lie in F, and among those finitely many there is one of least generation, which is a maximal element of F containing Q. Taking Q arbitrary shows that every cube of F lies below a maximal element, and in particular maximal elements exist.

3.1F1F3step 2.1algebra

The maximal elements are pairwise disjoint: if Q,Q′ are maximal and meet, then by [F1] one contains the other, and maximality forces Q=Q′. 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 Qn because c(Qk,m)i=(mi+12)2−k∈Q, and Qn is at most countable, so [F3] makes the family at most countable.

3.2step 1.1step 2.1given

Their union is exactly Ω: each maximal element lies in F, hence is contained in Ω, so the union is a subset of Ω; conversely, for x∈Ω step 1.1 supplies Q∈F with x∈Q, and step 2.1 supplies a maximal element containing Q, hence containing x. Thus Ω=⋃{Q:Q maximal in F}.

4.1F1F2step 2.1algebra∎

Let Q be maximal in F and let P be its dyadic parent: P has side 2ℓ(Q), its centre differs from c(Q) by at most 12ℓ(Q) in each coordinate, so P⊆3Q. Maximality gives P∉F, that is, 5n P⊈Ω, so there is y∈5n P with y∉Ω; every point of P is within ℓ∞-distance ℓ(Q) and every point of 5n P within ℓ∞-distance 5n ℓ(Q) of the centre of P, so [F2] bounds the d2-distance between any x∈Q⊆P and y by n ℓ(Q)+5nn ℓ(Q)≤6nn ℓ(Q); in particular dist⁡(Q,Ωc)≤6nn ℓ(Q) while 5n Q⊆Ω.

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 Ω=(0,∞)n 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 (0,2−k]n are (0,2−k+1]n,…, all inside Ω), so maximal elements do not exist at all; with the bounded grid of generations k≥0 taken instead, a generation-0 maximal cube can be at distance far exceeding a multiple of its side length from Ωc, so no point y∈Ωc 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 Ω (5n Q⊆Ω), and they retain the near-boundary point y with the uniform bound ∣x−y∣≤6nn ℓ(Q).

Depends on

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