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 admits an increasing sequence of relatively compact connected open subsets of whose boundaries are real-analytic regular in the following one-sided sense: for every and every there are a neighbourhood of and a real-analytic function of one real variable, defined on an open interval, such that, after relabelling the two coordinate axes if necessary, and is one of the two connected components of ; such that every compact lies in for all sufficiently large . If is finite, the sequence may be chosen with from the outset.
Facts & Assumptions
Given: A plane domain , that is, a nonempty connected open set (A complex domain is a nonempty connected open subset of ), and a finite set . For and we write ; 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 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.
The rationals are countably infinite, a product of two at most countable sets is at most countable, is countable, subsets of at most countable sets are at most countable, and a nonempty set presented by a surjection has a least-index element . Consequently the points of , the positive rational radii, finite tuples of points of , 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 are indexed by such finite tuples. A nonempty subfamily of any of these enumerated families has a least-index member ( is countably infinite, A product of two at most countable sets is at most countable, , 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 ).
Between any two real numbers there is a rational number, and a point of is described by its real part, imaginary part and modulus, whose elementary order properties make dense: given and , choosing rationals and gives (ℚ is dense in every Archimedean ordered field, Real and imaginary parts, complex conjugation, and modulus).
An open connected subset of 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 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 , connectedness, path-connectedness and polygonal connectedness are equivalent, Every connected component of an open subset of is open and polygonally connected, Connected components, quasicomponents, and totally disconnected spaces).
A convex subset of the plane is path connected by the straight segment ; 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 is a continuous path, A continuous image of a connected space is connected, and connectedness is a topological property).
A subset of is compact exactly when it is closed and bounded, every open cover of a compact set has a finite subcover, the continuous image of a compact set is compact, a continuous real function on a nonempty compact metric space attains its infimum, and a finite union of compact sets is compact (Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line, Open cover, subcover, compact metric space, and compact subset of a metric space, A continuous image of a compact space is compact; a continuous real-valued map on a nonempty compact space attains a maximum and a minimum; and a continuous bijection from a compact space to a Hausdorff space is a homeomorphism, A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value).
Distance to a nonempty set is the infimum (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space); is one-Lipschitz and hence continuous, with and exactly when . If is nonempty compact, attains its minimum on by the extreme-value theorem [F5], so the point-to-set distance is attained. Also for nonempty sets, and for all (, so the distance to a fixed nonempty set is -Lipschitz, The closure of a nonempty is , equals 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).
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).
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 with , every real-coefficient polynomial can be uniformly approximated by a rational-coefficient polynomial: choose rationals with , which is possible by density of in and finiteness of ; then throughout the disc. Thus the rational-coefficient polynomials are also uniformly dense there.
For a map on an open , 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 by countable and finite cube covers, A sequence of intervals covering has total length at least , so no interval of positive length has measure zero).
Polynomials in the two real coordinates are real analytic and maps of the plane, finite sums and products of Euclidean maps are , and a real-analytic map is smooth at every point of its domain (Real-analytic maps between open subsets of the coordinate plane, Euclidean maps are closed under componentwise algebra and composition).
A real-analytic map with invertible derivative has a real-analytic local inverse. If a real-analytic function of two variables has invertible at a point where , 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
Fix and the finite set . If , put (and when ) and for : then , the discs increase with , each boundary is the zero set of the real-analytic polynomial whose gradient 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 with the disc equal to one of the two local sides; hence each is real-analytic regular in the one-sided sense of the Statement, and every compact is bounded, hence lies in for all large . So assume from now on that , in which case is a nonempty closed set.
List as the closed discs with , a positive rational and , in increasing order of the index of the datum in the enumeration of [F1]. Every compact is covered by finitely many of the : for openness gives by [F6], and [F1] together with [F2] supplies and a positive rational with and ; every with then has and therefore by [F6], so while . The interiors of the listed discs thus cover the compact set , and compactness extracts a finite subcover, whose largest index we call .
For every nonempty compact the number is positive: by [F6] the continuous function attains over its minimum, which is , at some , and would put in . Moreover for every , by [F6] and the defining infimum of .
Let be the least-indexed point of lying in , which exists by [F1] and [F2] because is nonempty and open, and let be the centre of . For each fixed endpoint , [F3] supplies a polygonal path in from to . Its compact image has positive distance from : 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 therefore gives a path with the same endpoints and all intermediate vertices in . 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 , remain fixed. Let be the union of these paths with . Then is a nonempty compact connected subset of with : each path is a continuous image of a compact interval, hence compact and connected by [F4] and [F5], the disc is compact and connected by [F4] and [F5], and every member of the union meets the fixed connected member that is the path from to , so [F7] applies.
Fix an integer and a nonempty compact connected set with ; the base case is supplied by step 1.4. Put by step 1.3 and let be the continuous function Then on and on , so is continuous with on and on .
Let be the least integer with ; such an integer exists because that set is bounded, since compactness gives , and a nearest point gives by [F5] and [F6]. The real-coefficient polynomials in the two coordinates form a unital real subalgebra of containing both coordinate functions, hence separating points, so by [F8] some real-coefficient polynomial satisfies . Since , [F8] lets us approximate the finitely many coefficients of by rationals so that the resulting rational-coefficient polynomial differs from by less than uniformly on this disc. Thus some rational-coefficient polynomial satisfies ; take the least-indexed one in the enumeration of [F1]. By [F10] the polynomial is real analytic and on the whole plane.
Let , compact by [F5] and continuity of , and let , which is compact by [F5] and null by [F9] because it is a set of critical values of the function . The interval is nondegenerate, so it is not contained in by [F9]; being the complement of the closed set inside an interval, is open and nonempty, so by [F1] and [F2] it contains rationals, and we let be its least-indexed rational point. Consequently whenever and , since otherwise .
Let be the connected component of the open set containing , which exists because is connected and : on we have , so there by step 2.1, hence by steps 3.1 and 4.1. Thus is a nonempty open connected set with , the inclusion by maximality of components.
. Every point with has , because by step 3.1; hence by step 2.1 and by steps 3.1 and 4.1. So the circle is disjoint from , and the connected set , which contains , lies in the component of the complement of that circle.
, and is a compact subset of . Let . If then by step 2.1 and by steps 3.1 and 4.1, contradicting ; hence , and by step 1.3 and [F6] , so . Passing to closures, [F6] gives , and that set is closed, bounded by step 3.1 and contained in by the same distance inequality, hence compact by [F5].
, and at every point of . Let . Since and is continuous, while lies in the closure of , we get ; and by steps 6.1 and 6.2. If , then contains a disc around ; is connected by [F4] and meets because is a boundary point of , so by maximality of components, making an interior point of and contradicting . Hence , and by step 4.1.
Construction of the next compact set. Let be the least-indexed point of lying in , which exists by [F1] and [F2] because is nonempty and open, let be the centre of , and let be the union of the two least-indexed polygonal paths whose intermediate vertices lie in , from to and from to . These paths exist by the argument of step 1.4; their endpoints are rational as well. Then is a nonempty compact connected subset of with , 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 meets at , while meets at , and each of the three members is connected by [F3], [F4] and step 6.2. Moreover .
The boundary is real-analytic regular. Fix . By step 7.1, after relabelling axes, . Apply the inverse assertion of [F11] to , whose Jacobian determinant at is . Restrict its analytic inverse to a rectangle about and put . The first coordinate identity forces . Thus the zero set in is the graph , and the positive and negative sides are respectively and . Both are connected, being continuous images of convex rectangles; they are the two components of the complement of the graph in . The positive side meets since , so maximality of the component puts that whole side in . Conversely 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 is exactly the graph. This proves the required one-sided regularity without assuming the sign of . The same local argument with the negative side applies to the discs in step 1.1.
Applying the construction of steps 2.1 through 5.1 to the admissible set of step 7.2 produces the connected component of containing , so . Since by step 7.2 and is a component, maximality of components yields .
Every compact lies in for all sufficiently large . By step 1.2 there is with . For each the set satisfies by steps 1.4 and 7.2, and by step 5.1 applied to , while for by step 8.2; hence for every .
The sequence obtained by applying steps 2.1 through 7.2 inductively, starting from 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 in because 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
- Every connected component of an open subset of $\mathbb{R}^n$ is open and polygonally connected
- Real and imaginary parts, complex conjugation, and modulus
- A complex domain is a nonempty connected open subset of $\mathbb C$
- Connected components, quasicomponents, and totally disconnected spaces
- Open ball, closed ball and sphere in a metric space
- Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space
- Open cover, subcover, compact metric space, and compact subset of a metric space
- Interior, closure, boundary, limit point, isolated point and dense subset of a metric space
- Measure zero and content zero in $\mathbb{R}^m$ by countable and finite cube covers
- Real-analytic maps between open subsets of the coordinate plane
- A nonempty set is at most countable iff it is a surjective image of $\mathbb{N}$
- $|d(x,A) - d(y,A)| \le d(x,y)$, so the distance to a fixed nonempty set is $1$-Lipschitz
- A finite concatenation of straight segments in $\mathbb{R}^n$ is a continuous path
- A sequence of intervals covering $[a,b]$ has total length at least $b - a$, so no interval of positive length has measure zero
- ℚ is dense in every Archimedean ordered field
- Every subset of an at most countable set is at most countable
- $C^k$ Euclidean maps are closed under componentwise algebra and composition
- A continuous image of a compact space is compact; a continuous real-valued map on a nonempty compact space attains a maximum and a minimum; and a continuous bijection from a compact space to a Hausdorff space is a homeomorphism
- A continuous image of a connected space is connected, and connectedness is a topological property
- A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
- 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
- Morse-Sard for Euclidean maps
- $\mathbb{N} \times \mathbb{N} \approx \mathbb{N}$
- For an open subset of $\mathbb{R}^n$, connectedness, path-connectedness and polygonal connectedness are equivalent
- Every path-connected space is connected, and every path component lies inside a component
- A product of two at most countable sets is at most countable
- $\mathbb{Q}$ is countably infinite
- Real analytic inverse and implicit functions
- Real Stone--Weierstrass theorem for compact metric spaces
- 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
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
- Mikhail Lyubich, Dynamics of Quadratic Polynomials, Vol. I, Appendix 1, Sections 10.1-10.9 (standard reference, not scraped)
- E. B. Saff, Logarithmic Potential Theory with Applications to Approximation Theory, Section 3 (standard reference, not scraped)