Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-30
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.

Analytic-boundary exhaustion of a plane domain

Statement

Every plane domain Ω⊂C admits an increasing sequence D1⊆D2⊆⋯ of relatively compact connected open subsets of Ω whose boundaries are real-analytic regular in the following one-sided sense: for every j and every ζ∈∂Dj there are a neighbourhood U of ζ and a real-analytic function g of one real variable, defined on an open interval, such that, after relabelling the two coordinate axes if necessary, ∂Dj∩U={(x,y)∈U:y=g(x)}, and Dj∩U is one of the two connected components of U∖{(x,y)∈U:y=g(x)}; such that every compact K⊆Ω lies in Dj for all sufficiently large j. If A⊆Ω is finite, the sequence may be chosen with A⊆D1 from the outset.

Facts & Assumptions

Given: A plane domain Ω⊂C, that is, a nonempty connected open set (A complex domain is a nonempty connected open subset of C), and a finite set A⊆Ω. For c∈C and r>0 we write D(c,r):={z∈C:∣z−c∣<r}; open and closed sets, interior, closure and boundary are those of Interior, closure, boundary, limit point, isolated point and dense subset of a metric space, compactness is that of Open cover, subcover, compact metric space, and compact subset of a metric space, and D(c,r)‾ is the closed disc. A boundary is called real-analytic regular when it has the one-sided local graph description fixed in the Statement; such a boundary is in particular locally the zero set of a real-analytic function with nonvanishing gradient.

[F1]

The rationals are countably infinite, a product of two at most countable sets is at most countable, N×N is countable, subsets of at most countable sets are at most countable, and a nonempty set presented by a surjection s:N→S has a least-index element x↦min⁡{k:s(k)=x}. Consequently the points of Q[i], the positive rational radii, finite tuples of points of Q[i], and the polynomials in two variables with rational coefficients all sit in fixed explicitly enumerated at most countable families. For any fixed endpoints, polygonal paths whose intermediate vertices lie in Q[i] are indexed by such finite tuples. A nonempty subfamily of any of these enumerated families has a least-index member (Q is countably infinite, A product of two at most countable sets is at most countable, N×N≈N, Every subset of an at most countable set is at most countable, A nonempty set is at most countable iff it is a surjective image of N).

[F2]

Between any two real numbers there is a rational number, and a point of C is described by its real part, imaginary part and modulus, whose elementary order properties make Q[i] dense: given z=p+iq and η>0, choosing rationals p′∈(p−η/2,p+η/2) and q′∈(q−η/2,q+η/2) gives ∣z−(p′+iq′)∣<η (ℚ is dense in every Archimedean ordered field, Real and imaginary parts, complex conjugation, and modulus).

[F3]

An open connected subset of Rn is polygonally connected, so any two of its points are joined by a polygonal path inside it; every connected component of an open subset of Rn is open and polygonally connected, and a component is the largest connected subset containing each of its points, so every connected subset of an open set that meets a component is contained in that component (For an open subset of Rn, connectedness, path-connectedness and polygonal connectedness are equivalent, Every connected component of an open subset of Rn is open and polygonally connected, Connected components, quasicomponents, and totally disconnected spaces).

[F4]

A convex subset of the plane is path connected by the straight segment t↦(1−t)x+ty; every open or closed Euclidean disc is convex by the triangle inequality. Every path-connected space is connected; a polygonal path is a continuous map of a compact interval with connected image; and the continuous image of a connected space is connected (Every path-connected space is connected, and every path component lies inside a component, A finite concatenation of straight segments in Rn is a continuous path, A continuous image of a connected space is connected, and connectedness is a topological property).

[F6]

Distance to a nonempty set S is the infimum d(x,S) (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space); d(⋅,S) is one-Lipschitz and hence continuous, with d(x,S)=d(x,S‾) and d(x,S)=0 exactly when x∈S‾. If S is nonempty compact, w↦∣x−w∣ attains its minimum on S by the extreme-value theorem [F5], so the point-to-set distance is attained. Also d(K,L)=inf⁡z∈Kd(z,L) for nonempty sets, and d(z,S)≥d(w,S)−∣z−w∣ for all z,w (∣d(x,A)−d(y,A)∣≤d(x,y), so the distance to a fixed nonempty set is 1-Lipschitz, The closure of a nonempty A is {x:d(x,A)=0}, equals A together with its limit points, and is the smallest closed superset, A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value).

[F7]

A union of connected sets in which every member meets one fixed connected member is connected, and a union of connected sets with a common point is connected (A union of connected subspaces with a point in common is connected, and so is a union of a family in which every member meets a fixed connected member).

[F8]

On a nonempty compact metric space, a unital real subalgebra of the real continuous functions that separates points is uniformly dense (Real Stone--Weierstrass theorem for compact metric spaces). On a fixed closed disc D(0,M)‾ with M≥1, every real-coefficient polynomial P(x,y)=∑(k,l)∈Iaklxkyl can be uniformly approximated by a rational-coefficient polynomial: choose rationals qkl with ∑(k,l)∈I∣akl−qkl∣Mk+l<ϵ, which is possible by density of Q in R and finiteness of I; then ∣P(x,y)−∑qklxkyl∣<ϵ throughout the disc. Thus the rational-coefficient polynomials are also uniformly dense there.

[F9]

For a C∞ map U→R on an open U⊆R2, the critical value set is null, a subset of a null set is null, and no nondegenerate interval is null (Morse-Sard for Euclidean maps, Measure zero and content zero in Rm by countable and finite cube covers, A sequence of intervals covering [a,b] has total length at least b−a, so no interval of positive length has measure zero).

[F10]

Polynomials in the two real coordinates are real analytic and C∞ maps of the plane, finite sums and products of C∞ Euclidean maps are C∞, and a real-analytic map is smooth at every point of its domain (Real-analytic maps between open subsets of the coordinate plane, Ck Euclidean maps are closed under componentwise algebra and composition).

[F11]

A real-analytic map with invertible derivative has a real-analytic local inverse. If a real-analytic function P of two variables has DyP invertible at a point where P=0, then near that point its zero set is exactly the graph of a real-analytic function of the first variable (Real analytic inverse and implicit functions).

Proof

technique · direct
1.1F1F4F5F10F11construct

Fix Ω and the finite set A. If Ω=C, put R0:=1+sup⁡{∣a∣:a∈A} (and R0:=1 when A=∅) and Dj:=D(0,R0+j) for j≥1: then A⊆D1, the discs increase with j, each boundary {∣z∣=r} is the zero set of the real-analytic polynomial F(z)=∣z∣2−r2 whose gradient 2z does not vanish there, so after relabelling the axes [F11] exhibits that zero set near each of its points as the graph of a real-analytic function g with the disc D(0,r)={F<0} equal to one of the two local sides; hence each ∂Dj is real-analytic regular in the one-sided sense of the Statement, and every compact K⊆C is bounded, hence lies in Dj for all large j. So assume from now on that Ω≠C, in which case C∖Ω is a nonempty closed set.

1.2F1F2F5F6choose

List as Q1,Q2,… the closed discs D(c,r)‾ with c∈Q[i], r a positive rational and D(c,r)‾⊂Ω, in increasing order of the index of the datum (c,r) in the enumeration of [F1]. Every compact K⊆Ω is covered by finitely many of the Qi: for z∈K openness gives δ(z):=d(z,C∖Ω)>0 by [F6], and [F1] together with [F2] supplies c∈Q[i] and a positive rational r with ∣c−z∣<δ(z)/4 and δ(z)/4<r<δ(z)/2; every w with ∣w−c∣≤r then has ∣w−z∣<3δ(z)/4 and therefore d(w,C∖Ω)>δ(z)/4>0 by [F6], so D(c,r)‾⊂Ω while z∈D(c,r). The interiors of the listed discs thus cover the compact set K, and compactness extracts a finite subcover, whose largest index we call N.

1.3F5F6contradictiondischarge-contradiction

For every nonempty compact K⊆Ω the number δ(K):=d(K,C∖Ω) is positive: by [F6] the continuous function z↦d(z,C∖Ω) attains over K its minimum, which is δ(K), at some z∗∈K, and δ(K)=0 would put z∗ in Ω∩C∖Ω‾=∅. Moreover d(z,C∖Ω)≥δ(K)−d(z,K) for every z∈C, by [F6] and the defining infimum of d(z,K).

1.4F1F2F3F4F5F6F7construct

Let x0 be the least-indexed point of Q[i] lying in Ω, which exists by [F1] and [F2] because Ω is nonempty and open, and let c1 be the centre of Q1. For each fixed endpoint p∈A∪{c1}, [F3] supplies a polygonal path in Ω from x0 to p. Its compact image has positive distance from C∖Ω: the distance function is continuous and positive on that compact subset of the open set Ω, so it attains a positive minimum by [F5] and [F6]. Perturbing each non-endpoint vertex by less than half that distance keeps every segment in Ω, because each corresponding point on a perturbed segment moves by at most the maximum endpoint perturbation. Density of Q[i] therefore gives a path with the same endpoints and all intermediate vertices in Q[i]. For each of these finitely many fixed endpoints, [F1] selects the least-indexed such path from the countable family of finite tuples of rational intermediate vertices; the endpoints, including arbitrary points of A, remain fixed. Let K1 be the union of these paths with Q1. Then K1 is a nonempty compact connected subset of Ω with A⊆K1: each path is a continuous image of a compact interval, hence compact and connected by [F4] and [F5], the disc Q1 is compact and connected by [F4] and [F5], and every member of the union meets the fixed connected member that is the path from x0 to c1, so [F7] applies.

2.1F6step 1.3constructalgebra

Fix an integer j≥1 and a nonempty compact connected set Kj⊆Ω with A⊆Kj; the base case K1 is supplied by step 1.4. Put δj:=δ(Kj)>0 by step 1.3 and let χj:[0,∞)→[−1,1] be the continuous function χj(t):=max⁡{−1, min⁡{1, 1−8δj(t−δj4)}},fj(z):=χj(d(z,Kj)). Then χj=1 on [0,δj/4] and χj=−1 on [δj/2,∞), so fj is continuous with fj=1 on {z:d(z,Kj)<δj/4} and fj=−1 on {z:d(z,Kj)≥δj/2}.

3.1F1F5F6F8F10step 2.1construct

Let Mj≥1 be the least integer with {z:d(z,Kj)≤δj/2}⊆D(0,Mj/2); such an integer exists because that set is bounded, since compactness gives Bj∗:=max⁡w∈Kj∣w∣<∞, and a nearest point w∈Kj gives ∣z∣≤∣w∣+∣z−w∣≤Bj∗+δj/2 by [F5] and [F6]. The real-coefficient polynomials in the two coordinates form a unital real subalgebra of C(D(0,Mj)‾,R) containing both coordinate functions, hence separating points, so by [F8] some real-coefficient polynomial P satisfies sup⁡D(0,Mj)‾∣P−fj∣<1/8. Since Mj≥1, [F8] lets us approximate the finitely many coefficients of P by rationals so that the resulting rational-coefficient polynomial differs from P by less than 1/8 uniformly on this disc. Thus some rational-coefficient polynomial Pj satisfies sup⁡D(0,Mj)‾∣Pj−fj∣<1/4; take the least-indexed one in the enumeration of [F1]. By [F10] the polynomial Pj is real analytic and C∞ on the whole plane.

4.1F1F2F5F9step 3.1choose

Let Zj:={z:∣z∣≤Mj, ∇Pj(z)=0}, compact by [F5] and continuity of ∇Pj, and let Bj:=Pj(Zj), which is compact by [F5] and null by [F9] because it is a set of critical values of the C∞ function Pj. The interval (−12,12) is nondegenerate, so it is not contained in Bj by [F9]; being the complement of the closed set Bj inside an interval, (−12,12)∖Bj is open and nonempty, so by [F1] and [F2] it contains rationals, and we let tj be its least-indexed rational point. Consequently ∇Pj(z)≠0 whenever ∣z∣≤Mj and Pj(z)=tj, since otherwise tj∈Bj.

5.1F3step 2.1step 3.1step 4.1construct

Let Dj be the connected component of the open set {z:Pj(z)>tj} containing Kj, which exists because Kj is connected and Kj⊆{Pj>tj}: on Kj we have d(⋅,Kj)=0<δj/4, so fj=1 there by step 2.1, hence Pj>3/4>tj by steps 3.1 and 4.1. Thus Dj is a nonempty open connected set with Kj⊆Dj, the inclusion by maximality of components.

6.1F3step 2.1step 3.1step 4.1step 5.1

Dj⊆D(0,Mj). Every point w with ∣w∣=Mj has d(w,Kj)>δj/2, because {z:d(z,Kj)≤δj/2}⊆D(0,Mj/2) by step 3.1; hence fj(w)=−1 by step 2.1 and Pj(w)<−3/4<tj by steps 3.1 and 4.1. So the circle {∣z∣=Mj} is disjoint from {Pj>tj}, and the connected set Dj, which contains Kj⊆D(0,Mj/2), lies in the component D(0,Mj) of the complement of that circle.

6.2F5F6step 1.3step 2.1step 3.1step 4.1step 5.1contradictiondischarge-contradiction

Dj⊆Ω, and Dj‾ is a compact subset of Ω. Let z∈Dj. If d(z,Kj)≥δj/2 then fj(z)=−1 by step 2.1 and Pj(z)<−3/4<tj by steps 3.1 and 4.1, contradicting z∈Dj; hence d(z,Kj)<δj/2, and by step 1.3 and [F6] d(z,C∖Ω)≥δj−d(z,Kj)>δj/2>0, so z∈Ω. Passing to closures, [F6] gives Dj‾⊆{z:d(z,Kj)≤δj/2}, and that set is closed, bounded by step 3.1 and contained in Ω by the same distance inequality, hence compact by [F5].

7.1F3F4step 4.1step 6.1step 6.2contradictiondischarge-contradiction

∂Dj⊆{z:Pj(z)=tj}, and ∇Pj≠0 at every point of ∂Dj. Let z0∈∂Dj. Since Dj⊆{Pj>tj} and Pj is continuous, while z0 lies in the closure of Dj, we get Pj(z0)≥tj; and z0∈Dj‾⊆D(0,Mj) by steps 6.1 and 6.2. If Pj(z0)>tj, then {Pj>tj} contains a disc B around z0; B is connected by [F4] and meets Dj because z0 is a boundary point of Dj, so B⊆Dj by maximality of components, making z0 an interior point of Dj and contradicting z0∈∂Dj. Hence Pj(z0)=tj, and ∇Pj(z0)≠0 by step 4.1.

7.2F1F2F3F4F5F7step 1.4step 6.2construct

Construction of the next compact set. Let yj be the least-indexed point of Q[i] lying in Dj, which exists by [F1] and [F2] because Dj is nonempty and open, let cj+1 be the centre of Qj+1, and let Pj+1 be the union of the two least-indexed polygonal paths whose intermediate vertices lie in Q[i], from x0 to yj and from x0 to cj+1. These paths exist by the argument of step 1.4; their endpoints are rational as well. Then Kj+1:=Dj‾∪Qj+1∪Pj+1 is a nonempty compact connected subset of Ω with A⊆Kj+1, so that the construction of step 2.1 can be applied to it: compactness follows from [F5] and step 6.2, and connectedness from [F7], because Dj‾ meets Pj+1 at yj, while Qj+1 meets Pj+1 at cj+1, and each of the three members is connected by [F3], [F4] and step 6.2. Moreover A⊆Kj⊆Dj⊆Kj+1.

8.1F3F4F10F11step 7.1construct

The boundary ∂Dj is real-analytic regular. Fix z0∈∂Dj. By step 7.1, after relabelling axes, DyPj(z0)≠0. Apply the inverse assertion of [F11] to H(x,y)=(x,Pj(x,y)−tj), whose Jacobian determinant at z0 is DyPj(z0). Restrict its analytic inverse K to a rectangle V=I×(−ϵ,ϵ) about H(z0) and put U=K(V). The first coordinate identity forces K(x,s)=(x,k(x,s)). Thus the zero set in U is the graph y=g(x):=k(x,0), and the positive and negative sides are respectively K(I×(0,ϵ)) and K(I×(−ϵ,0)). Both are connected, being continuous images of convex rectangles; they are the two components of the complement of the graph in U. The positive side meets Dj since z0∈∂Dj, so maximality of the component Dj puts that whole side in Dj. Conversely Dj∩U lies in that side by its definition. Every graph point is approached by points of the positive side and belongs to neither open side, hence ∂Dj∩U is exactly the graph. This proves the required one-sided regularity without assuming the sign of DyPj. The same local argument with the negative side applies to the discs in step 1.1.

8.2F3step 2.1step 3.1step 4.1step 5.1step 7.2

Applying the construction of steps 2.1 through 5.1 to the admissible set Kj+1 of step 7.2 produces the connected component Dj+1 of {Pj+1>tj+1} containing Kj+1, so Kj+1⊆Dj+1. Since Dj⊆Dj‾⊆Kj+1 by step 7.2 and Dj+1 is a component, maximality of components yields Dj⊆Dj+1.

9.1step 1.2step 1.4step 5.1step 7.2step 8.2cases

Every compact K⊆Ω lies in Dm for all sufficiently large m. By step 1.2 there is N with K⊆Q1∪⋯∪QN. For each m≥1 the set Qm satisfies Qm⊆Km by steps 1.4 and 7.2, and Km⊆Dm by step 5.1 applied to Km, while Dm⊆Dm′ for m′≥m by step 8.2; hence K⊆DN⊆Dm′ for every m′≥N.

10.1F1F2step 5.1step 6.2step 7.2step 8.1step 8.2step 9.1∎

The sequence D1⊆D2⊆⋯ obtained by applying steps 2.1 through 7.2 inductively, starting from K1 of step 1.4, consists of nonempty relatively compact connected open subsets of Ω with real-analytic regular boundary by steps 6.2 and 8.1, contains A in D1 because A⊆K1⊆D1 by steps 1.4 and 5.1, and exhausts Ω in the required sense by step 9.1. Every selection made above is either a finite selection or a least-index selection in one of the fixed at most countable families of [F1], or the least-indexed rational point of a nonempty open set, whose existence is [F2]; no choice principle was used.

Depends on

Used by

Dependency tree · two levels

172 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