Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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.

Locally finite refinements of Euclidean open covers have order at most the dimension plus one

Physical scope

A topological theorem about Euclidean open sets; no physical model or empirical claim is involved.

Statement

Assume full AC. Let m∈N, m≥1, and let Ω be a nonempty open subset of Rm={x:{0,…,m−1}→R} with the metric d2(x,y):=∑j<m(xj−yj)2,∥x∥2:=∑j<mxj2, and the topology generated by its metric balls. For every open cover U of Ω, there is a locally finite open cover V and a refinement map ρ:V→U with V⊆ρ(V) for every V∈V, such that each point of Ω lies in at most m+1 members of V. Here locally finite means that every point has an open neighborhood meeting only finitely many members, and the order bound means the stated pointwise multiplicity bound.

Facts & Assumptions

Given: Full AC, m∈N with m≥1, a nonempty open set Ω⊆Rm, and an arbitrary open cover U of Ω.

[A1]

The Axiom of Choice: every family of nonempty sets has a choice function.

[F1]

Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it: Rm is the set of coordinate functions on {0,…,m−1} with the metric d2(x,y)=∑j<m(xj−yj)2, which satisfies the metric axioms. 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 defines its open sets by the metric-ball condition.

[F2]

Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space and Greatest lower bound (infimum): for a nonempty set E, dist⁡(x,E):=inf⁡{d2(x,y):y∈E}; for a nonempty bounded set Q, diam⁡(Q):=sup⁡{d2(u,v):u,v∈Q}.

[F3]

Complete ordered field (least-upper-bound property) and Every nonempty set bounded below has an infimum: every nonempty bounded-above subset of R has a supremum, and every nonempty subset bounded below has an infimum.

[F4]

Every nonempty finite set of reals has a maximum and a minimum: every nonempty finite set of real coordinates has a maximum; this makes ∥x∥∞ below well defined.

For E=∅ set dist⁡(x,E)=+∞, with min⁡{1,+∞}=1. A closed dyadic cube of side s=2r, r∈Z, means a set ∏j<m[kj2r,(kj+1)2r] with integers kj; its parent is the unique containing dyadic cube of side 2s. A face is obtained by fixing some coordinates to endpoints, and a proper face fixes at least one coordinate. The open ball is B(x,r)={y:d2(x,y)<r}. Write ∥x∥∞=max⁡j<m∣xj∣, which exists by Every nonempty finite set of reals has a maximum and a minimum. A function f is 1-Lipschitz when ∣f(x)−f(y)∣≤d2(x,y) for all x,y in its domain. We write inf⁡Qε:=inf⁡{ε(y):y∈Q}. For each such cube Q of side s, any u,v∈Q have ∣uj−vj∣≤s for all j<m, so d2(u,v)≤m s; opposite corners attain equality, hence diam⁡(Q)=m s.

Proof

technique · direct
1.1A1F1F2F3givenconstruct

For x∈Ω define δ(x):=sup⁡U∈Umin⁡{1,dist⁡(x,Rm∖U)},ε(x):=min⁡{1,dist⁡(x,Rm∖Ω),δ(x)}. The set in the supremum is nonempty and contained in [0,1], so [F3] makes δ(x) well defined; the empty-complement convention in [F2] covers U=Rm or Ω=Rm. Since U covers Ω and each U is open, δ(x)>0. For any nonempty closed set E, the triangle inequality gives dist⁡(x,E)≤d2(x,y)+dist⁡(y,E) by taking the infimum over E, and interchanging x,y gives the reverse bound; capping at 1 preserves this 1-Lipschitz estimate. The supremum of a family of 1-Lipschitz functions is 1-Lipschitz because fU(x)≤fU(y)+d2(x,y) for every U, hence sup⁡UfU(x)≤sup⁡UfU(y)+d2(x,y), and likewise after interchanging x,y. The minimum of two 1-Lipschitz functions satisfies the same estimate, so ε is 1-Lipschitz. For each x, the definition of the supremum supplies Ux∈U with min⁡{1,dist⁡(x,Rm∖Ux)}>δ(x)/2, hence B(x,δ(x)/2)⊂Ux. Also ε(x)≤dist⁡(x,Rm∖Ω).

2.1F1F2F3step 1.1construct

Let Q be the family of all closed dyadic cubes Q⊂Ω satisfying diam⁡(Q)<116inf⁡y∈Qε(y). The infimum exists by [F3], since ε≥0 and Q is nonempty. Every point of Ω belongs to such a cube at sufficiently fine dyadic scale, because ε is continuous and positive there. Each qualifying cube has diameter <1/16, so along the nested dyadic ancestors of any such cube only finitely many can qualify; choose a maximal qualifying ancestor. The maximal cubes cover Ω and have pairwise disjoint interiors, since two dyadic cubes with intersecting interiors are nested and a contained qualifying cube cannot be maximal.

3.1F1F2F3F4step 1.1step 2.1algebra

The maximal cubes are locally finite. Fix x∈Ω, put a=ε(x)>0, and choose r=a/8. If a maximal cube Q meets B(x,r) and has side length s<a/(512m), its dyadic parent P has diameter 2m s<a/256. Every y∈P then satisfies d2(y,x)<a/8+a/256<a/4, so P⊂Ω and the Lipschitz bound gives ε(y)>3a/4 on P. Thus diam⁡(P)<a/256<(3a/4)/16≤inf⁡Pε/16, so P also qualifies, contradicting maximality of Q. Hence each maximal cube meeting B(x,r) has side at least a/(512m). All such cubes lie in the bounded set B(x,r+1/16) and their centers are separated by at least this lower bound in ∥⋅∥∞: for two cubes with disjoint interiors, some coordinate intervals have disjoint interiors, so the centers differ in that coordinate by at least half the sum of the two side lengths, which is at least the lower bound. Partition a bounded box containing these centers into finitely many boxes of maximum-norm diameter smaller than that separation; each small box contains at most one center. Thus only finitely many such cubes meet B(x,r).

4.1F1F2F3F4step 1.1step 2.1step 3.1constructalgebra

A geometric k-simplex is the convex hull of vertices v0,…,vk, where the convex hull is the set of sums ∑itivi with ti≥0 and ∑iti=1, and the vertices are affinely independent, meaning that ∑itivi=0 and ∑iti=0 imply ti=0 for all i; its faces are the convex hulls of subsets of its vertices. A triangulation of Ω is a locally finite family of closed simplices of dimensions at most m covering Ω such that two simplices meet only in a common face or not at all. A cubical cell here is a product of closed intervals, some possibly singletons, with dyadic endpoints; its boundary is the union of its proper faces, and its center is the coordinatewise midpoint. We construct a compatible triangulation of the maximal cubes and their shared face pieces. First, touching maximal cubes have side lengths differing by at most a factor of two. Indeed, let z∈Q∩R, let their sides be S≥s, and let P be the dyadic parent of R. The qualification of Q gives ε(z)>16mS. Since diam⁡(P)=2ms≤2mS<ε(z)≤dist⁡(z,Rm∖Ω), every point of P lies in Ω; if Ω=Rm, this containment is automatic. Thus P is an admissible cube in the maximality comparison for R. Maximality of R implies that P fails the diameter inequality. The Lipschitz bound and d2(y,z)≤diam⁡(P) for y∈P give inf⁡Pε≥ε(z)−2ms, so 2ms=diam⁡(P)≥116inf⁡Pε≥ε(z)−2ms16>mS−ms8. Hence S<17s/8, and since the side lengths are dyadic their ratio is at most two. Now fix a face F of a maximal cube Q of side S. Every maximal cube R meeting F touches Q, so the side of R is at least S/2. Their centers lie in a bounded box around Q, since each qualifying cube has diameter less than 1/16. Two distinct maximal cubes have disjoint interiors, so in some coordinate their intervals have disjoint interiors and their centers differ by at least half the sum of their side lengths, hence by at least S/2 in ∥⋅∥∞. Partitioning a bounded box containing these centers into finitely many boxes of maximum-norm diameter less than S/2 shows that only finitely many maximal cubes meet F. Their intersections with F are products of dyadic intervals and cover F; collecting their endpoints gives a finite rectangular subdivision. If F is shared by two maximal cubes, the same set of cubes meets F, so both sides induce the same subdivision. Repeat this construction on the lower-dimensional faces. Include the maximal cubes as top-dimensional cells and the rectangular pieces in their subdivided faces as lower-dimensional cells; a partitioned face is represented by its pieces, not also by the unsplit face. Include all faces of these pieces. The rectangular boundary pieces have common-face intersections after the indicated lower-dimensional subdivisions; an unsplit maximal cube can meet another cube along a union of such pieces, rather than along a single unsplit face. All pieces on a shared overlap use the same dyadic endpoint grid: touching cubes have sides S or S/2 relative to a largest incident cube of side S, so the only possible interior coordinate cut of one of its faces is its midpoint. Thus restricting that grid to a smaller incident face gives its induced subdivision as well. The cell family is locally finite because every neighborhood meeting only finitely many maximal cubes meets only finitely many of their finite subdivisions. Triangulate the boundary pieces inductively by dimension, choosing the center of each positive-dimensional cell and coning it to its already triangulated boundary. Here coning a boundary simplex to a point means taking their convex hull. In dimension one this subdivides each interval into the two segments from its center to its endpoints; in every higher dimension convexity makes the cones cover the cell, and distinct cones meet only along their common triangulated boundary cones. Use a single center and boundary triangulation for each shared cell. Finally cone each maximal cube from its center to its triangulated boundary. This gives a locally finite triangulation of Ω of dimension at most m, with every simplex contained in a maximal cube. No infinite hyperplane is extended across unrelated cubes and no finite compact subcomplex is substituted for Ω.

5.1step 4.1

For a simplex with vertices v0,…,vk, its barycentric coordinates on that simplex are the unique coefficient functions λ0,…,λk satisfying y=∑iλi(y)vi, ∑iλi(y)=1, and λi(y)≥0; these functions are affine on the simplex; its relative interior is the set where every λi>0. For a vertex v of the triangulation, define λv on each simplex to be its barycentric coordinate when v is a vertex of that simplex, and zero otherwise. The common-face condition makes these definitions agree on intersections, and local finiteness makes λv continuous on Ω. Let st⁡(v):={y∈Ω:λv(y)>0}, equivalently the union of the relative interiors of simplices containing v; it is open. Because intersections are common faces, each point lies in the relative interior of a unique simplex of the triangulation, its carrier. If a point lies in st⁡(v0),…,st⁡(vk), then v0,…,vk are vertices of that same simplex, whose dimension is at most m; hence k+1≤m+1. A neighborhood meeting only finitely many simplices meets stars of only their finitely many vertices; hence the star cover is locally finite and has order at most m+1.

6.1A1F1F2step 1.1step 2.1step 4.1step 5.1∎

If y∈st⁡(v), then y and v lie in a simplex contained in a maximal cube Q containing v. By step 2.1, d2(y,v)≤diam⁡(Q)<ε(v)/16≤δ(v)/16<δ(v)/2. Step 1.1 supplies Uv∈U with B(v,δ(v)/2)⊂Uv, so st⁡(v)⊂Uv. Choosing one such Uv for each vertex defines a refinement map ρ; AC [A1] supplies these simultaneous choices. The star cover is therefore a locally finite open refinement of U with the required order.

Depends on

Dependency tree · 2 levels

Sources