betaFeedback

WorksMathematics

Regular closedness off the real axis for root closures of bounded-height integer polynomials

Abstract

For each integer h≥1h\ge1, let ZhZ_h be the closure in the complex plane of the roots of nonzero integer polynomials whose coefficients have absolute value at most hh, with no degree restriction. We prove that ZhZ_h is regular closed off the real axis: every non-real point of ZhZ_h is a limit of interior points. The root-closure identification of Espigulé and Juher, for which we include a self-contained proof, shows that the same closure arises from monic polynomials and that outside the closed unit disc it is the connectedness locus of h+1h+1 equally spaced collinear similarities. The main step proves that this locus is regular closed off the real axis; this was known for h=1h=1 by Calegari, Koch and Walker, for h≥19h\ge19, and inside an explicit lens. The symmetry z↦1/zz\mapsto1/z then gives the full-plane statement. The proof adapts the method of traps of Calegari, Koch and Walker, using a neighboring-piece criterion, short chains through consecutive digits, and Rouché's theorem. We also classify the convex attractors.

Introduction

Fix an integer h≥1h \ge1. The height of a nonzero polynomial P(z)=∑j=0majzj∈Z[z]P(z) = \sum_{j=0}^{m} a_j z^j \in\mathbb{Z}[z] is H(P):=max⁡0≤j≤m∣aj∣H(P) := \max_{0 \le j \le m} |a_j|. Allowing arbitrary degrees, define the planar root closure

Zh:=cl⁡C{z∈C:P(z)=0 for some 0≠P∈Z[z] with H(P)≤h}.(1)\mathcal{Z}_h := \operatorname{cl}_{\mathbb{C}}\{z \in\mathbb{C} : P(z) = 0\text{ for some }0 \ne P \in\mathbb{Z}[z]\text{ with }H(P) \le h\}. \tag*{(1)}

where cl⁡C\operatorname{cl}_{\mathbb{C}} and int⁡C\operatorname{int}_{\mathbb{C}} denote closure and interior in the plane. Our main result is the following.

Theorem 1.1 (Regular closedness of polynomial root closures). For every integer h≥1h \ge1,

Zh∖R=cl⁡C(int⁡C(Zh))∖R.(2)\mathcal{Z}_h \setminus\mathbb{R} = \operatorname{cl}_{\mathbb{C}}\bigl(\operatorname{int}_{\mathbb{C}}(\mathcal{Z}_h)\bigr) \setminus\mathbb{R}. \tag*{(2)}

Equivalently, Zh∖R\mathcal{Z}_h \setminus\mathbb{R} is regular closed in C∖R\mathbb{C} \setminus\mathbb{R}.

Thus every non-real point of the root closure can be approximated by interior points; the theorem concerns both sides of the unit circle. Espigulé and Juher [9 Proposition 1.1] identify Zh\mathcal{Z}_h with the closure obtained from monic polynomials and express it through the connectedness locus Mh+1\mathcal{M}_{h+1} of the collinear family introduced below and its image under z↦1/zz \mapsto1/z. The new geometric step is regular closedness of Mh+1\mathcal{M}_{h+1} throughout its non-real part. We state this step as Theorem 1.2 and deduce Theorem 1.1 in Section 5, where Proposition 5.2 also gives a self-contained proof of the root-closure identification. The restriction to non-real points is necessary: 00 is an isolated point of Zh\mathcal{Z}_h, and for h≥2h \ge2 the real points zz with 1+h<∣z∣≤h+11+\sqrt{h}<|z|\le h+1 lie in Zh\mathcal{Z}_h but are not limits of interior points, because near them Zh\mathcal{Z}_h coincides with Mh+1\mathcal{M}_{h+1} (Proposition 6.1(iii)).

Connectedness loci, also called Mandelbrot sets, record the parameters for which an iterated function system has connected attractor. For a pair of complex similarities, such a locus was introduced by Barnsley and Harrington [3], and Bousch proved that it is connected and locally connected [5, 6]. Bandt studied its topology and algorithms and asked whether every non-real connected parameter can be approximated by interior parameters [1]. Solomyak and Xu proved this near the imaginary axis [22], and Calegari, Koch and Walker proved it in general by the method of traps [7]. Regular closedness is known for the connectedness loci of fractal nn-gons with n≥3n \ge3: Bandt and Hung proved it for n≠4n \ne4 [2] and Himeki and Ishii for n=4n=4 [12]; almost regular closedness for pairs of affine maps of the plane was proved by Rosler [18]. Descriptions by zeros of power series were obtained by Solomyak and Xu [22], Shmerkin and Solomyak [19], and Solomyak [21].

We consider the following collinear family. Fix an integer n≥2n \ge2 and let

An:={0,1,…,n−1}.A_n := \{0,1,\ldots,n-1\}.

For a complex parameter cc with ∣c∣>1|c|>1, let K(c,n)K(c,n) be the attractor of

fj,c(z)=j+zc,j∈An,(3)f_{j,c}(z)=j+\frac{z}{c},\qquad j\in A_n, \tag*{(3)}

or equivalently

K(c,n)={∑k=0∞akc−k:ak∈An}.(4)K(c,n)=\left\{\sum_{k=0}^{\infty}a_kc^{-k}:a_k\in A_n\right\}. \tag*{(4)}

For an infinite address α=(α0α1…)∈AnN0\alpha=(\alpha_0\alpha_1\ldots)\in A_n^{\mathbb{N}_0}, set

πc(α):=∑j=0∞αjc−j.\pi_c(\alpha):=\sum_{j=0}^{\infty}\alpha_jc^{-j}.

Here N0={0,1,2,…}\mathbb{N}_0=\{0,1,2,\ldots\}, so addresses are indexed from zero. Set

Mn:={c∈C:∣c∣>1 and K(c,n) is connected}.\mathcal{M}_n:=\{c\in\mathbb{C}:|c|>1\text{ and }K(c,n)\text{ is connected}\}.

Closures, interiors and boundaries of subsets of {c∈C:∣c∣>1}\{c\in\mathbb{C}:|c|>1\}, such as Mn\mathcal{M}_n, are taken relative to this open set, so relative interiors are planar interiors. Operations on the planar root closure Zh\mathcal{Z}_h are explicitly marked by C\mathbb{C} and are taken in the full plane.

The digits 0,1,…,n−10,1,\ldots,n-1 are convenient both geometrically and from the viewpoint of numeration. They are affinely equivalent, for each fixed parameter, to the symmetric spacing-two alphabet used in [10]; consequently the connectedness locus is unchanged. The difference attractor is

D(c,n):=K(c,n)−K(c,n)={∑k=0∞dkc−k:dk∈{−(n−1),…,n−1}}.D(c,n):=K(c,n)-K(c,n)=\left\{\sum_{k=0}^{\infty}d_kc^{-k}:d_k\in\{-(n-1),\ldots,n-1\}\right\}.

This set contains the marked point cc precisely when K(c,n)K(c,n) is connected. In reciprocal coordinates this becomes a zero condition for a power series with bounded integer coefficients. Proposition 2.5 proves this marked-point criterion; its proof includes a planar crossing argument showing that connectedness forces overlap of neighboring first-level pieces.

For the collinear family, Espigulé, Juher and Saldaña [10 Theorem 2] proved that every non-real connected parameter in the closed lens ∣c±1∣≤2n|c\pm1|\le\sqrt{2n} is a limit of interior parameters, and established the same conclusion throughout the non-real locus when n≥21n\ge21. They conjectured regular closedness of the off-lens part Mn∖(R∪Xn)\mathcal{M}_n\setminus(\mathbb{R}\cup\mathcal{X}_n) for 3≤n≤203\le n\le20 [10 Section 5]; here Xn\mathcal{X}_n is the closed lens, the closure in parameter space of the open lens Xn\mathcal{X}_n defined in (6.3) below. Espigulé, Juher and Saldaña added the case n=20n=20, with an explicit dense set of certified interior parameters formed by semialgebraic capture levels [9 Corollary 5.4], and showed that the lens contains the whole non-real locus exactly when n≥20n\ge20 [9 Theorem 5.3]. The theorem below proves regular closedness away from the real axis for every n≥2n\ge2, without a lens restriction; for n=2n=2 it is the theorem of [7], for n≥20n\ge20 it follows from [10, 9], and the cases 3≤n≤193\le n\le19 are new.

The proof uses traps in the sense of Calegari, Koch and Walker [7]: stable crossings in enclosures of cylinder sets force overlap. These topological traps differ from the canonical trap of [9], a self-covering parallelogram that contains the covering rectangle of [10]: entry of a finite inverse orbit of the marked point into the canonical trap certifies an interior parameter, whereas a topological trap forces overlap without necessarily providing such an entry region. The adaptation uses a neighboring-piece criterion, short chains through consecutive digits, and a classification of convex attractors.

Theorem 1.2. For every integer n≥2n\geq2,

Mn∖R=int⁡(Mn)∖R.(5)\mathcal{M}_n\setminus\mathbb{R}=\operatorname{int}(\mathcal{M}_n)\setminus\mathbb{R}. \tag*{(5)}

Equivalently, Mn∖R\mathcal{M}_n\setminus\mathbb{R} is regular closed in {c∈C∖R:∣c∣>1}\{c\in\mathbb{C}\setminus\mathbb{R}:|c|>1\}.

An interior parameter has a neighborhood throughout which the attractor remains connected. Thus Theorem 1.2 says that every non-real connected parameter can be approximated by parameters with this stability property. We call

Kn:=int⁡(Mn)\mathcal{K}_n:=\operatorname{int}(\mathcal{M}_n)

the regular core. Any point of Mn\mathcal{M}_n outside Kn\mathcal{K}_n lies on the real axis. In Corollary 5.1 we identify Kn\mathcal{K}_n with the closure of the non-real roots of modulus greater than 1 of monic integer polynomials of height at most n−1n-1, and we show that the non-real boundary of Mn\mathcal{M}_n is the boundary of its interior. In § 6 we describe the internal structure of the locus that results: the real and imaginary traces, the real parameters that leave the core, and, inside the lens, the identification of the core with the closure of the semialgebraic capture levels of [9]. Figure 1 illustrates these statements for n=3n=3.

Figure 1. The connectedness locus M3\mathcal{M}_3 and its regular core. Blue: the annulus 1<∣c∣<31<|c|<\sqrt{3}, interior by Lemma 2.7 and optimal on the imaginary axis by Proposition 6.1(iv), with the interior disc B(b,0.12)B(b,0.12), b=1.35ib=1.35i, and a radial sequence converging to c∗=3eπi/4∈K3c_*=\sqrt{3}e^{\pi i/4}\in\mathcal{K}_3. Black and red: the real trace [−3,−1)∪(1,3][-3,-1)\cup(1,3] of Proposition 6.1; its red part 1+2<∣σ∣≤31+\sqrt{2}<|\sigma|\leq3 lies outside the core, since M3∖R\mathcal{M}_3\setminus\mathbb{R} is inside the red circle ∣c∣=1+2|c|=1+\sqrt{2}. Dotted: the boundary of the lens X3\mathcal{X}_3, inside which the core is the closure of the capture levels Θk(3)\Theta_k(3) (Corollary 6.5). The triangle is the parameter c0c_0 of Figure 3 and Example 5.3, a polynomial root outside both the lens and the annulus.

We also determine the convexity locus. Convexity occurs exactly on rational-direction radial segments: if c=ρeπip/qc=\rho e^{\pi ip/q} with p/qp/q reduced, then the attractor is convex if and only if ρq≤n\rho^q\le n. Convexity does not occur in irrational directions. For n=2n=2, this specializes to [7 Lemma 7.2.3]. For general nn, the necessity of ρq≤n\rho^q\le n and the absence of convexity in irrational directions also appear in Silvestri and Pérez [20 Section 3.5], which describes the extreme points of planar self-affine attractors with a common linear part by sofic systems; Theorem 3.4 adds the converse and the equivalence with convexity of the filled hull (defined below), which is the form the trap argument uses.

For a compact set L⊂CL\subset\mathbb{C}, its filled hull L^\widehat{L} is the union of LL and all bounded components of C∖L\mathbb{C}\setminus L. A continuum is a nonempty compact connected set; it is full if its complement is connected.

The proof of Theorem 1.2 is organized as follows. The annulus 1<∣c∣<n1<|c|<\sqrt{n} lies in int⁡(Mn)\operatorname{int}(\mathcal{M}_n) by a similarity-dimension argument (Lemma 2.7). For ∣c∣>n|c|>\sqrt{n}, the convexity theorem of Section 3 implies that a non-real connected attractor has nonconvex filled hull. The planar trap lemma (Proposition 4.1, proved in Section A) then provides a stable crossing configuration for a translate of that hull. A short-hop argument converts this configuration into overlap of adjacent cylinders (Section 4), and Rouché’s theorem realizes the required cylinder translation at parameters arbitrarily close to the original one (Lemma 2.10). Section 5 completes the proofs of Theorems 1.1 and 1.2, and Section 6 combines them with the closure of polynomial roots and with the capture levels of [9] to describe the internal structure of Mn\mathcal{M}_n.

Neighbor overlaps and adjacent translations

Affine normalization and the marked point

2.1. Affine normalization and the marked point. We first record the affine equivalence with the symmetric alphabet used in [10].

Lemma 2.1 (Affine normalization). Let

Ansym:={−n+1,−n+3,…,n−1}A_n^{\mathrm{sym}}:=\{-n+1,-n+3,\ldots,n-1\}

and let E(c,n)E(c,n) be the corresponding attractor. Then

E(c,n)=2K(c,n)−(n−1)cc−1.(6)E(c,n)=2K(c,n)-(n-1)\frac{c}{c-1}. \tag*{(6)}

In particular, E(c,n)E(c,n) and K(c,n)K(c,n) are affinely homeomorphic for each cc with ∣c∣>1|c|>1 and have the same connectedness locus.

Proof. Write each symmetric digit as 2a−(n−1)2a-(n-1) with a∈Ana\in A_n and sum the resulting geometric series. □

We use the following standard planar crossing fact; the horizontal-chord lemma derived from it is the additive part of Hopf’s theorem on chords of plane continua [13 Satz I].

Lemma 2.2 (Rectangle crossing). Let R=[a,b]×[u,v]R=[a,b]\times[u,v] be a nondegenerate closed rectangle. If H,V⊂RH,V\subset R are compact connected sets such that HH meets both vertical sides of RR and VV meets both horizontal sides, then H∩V≠∅H\cap V\ne\varnothing.

References

  1. [1]C. Bandt, On the Mandelbrot set for pairs of linear maps, Nonlinearity 15 (2002), no. 4, 1127–1147, doi:10.1088/0951-7715/15/4/309.DOI
  2. [2]C. Bandt and N. V. Hung, Fractal n-gons and their Mandelbrot sets, Nonlinearity 21 (2008), no. 11, 2653–2670, doi:10.1088/0951-7715/21/11/009.DOI
  3. [3]M. F. Barnsley and A. N. Harrington, A Mandelbrot set for pairs of linear maps, Physica D 15 (1985), no. 3, 421–432, doi:10.1016/S0167-2789(85)80008-7.DOI
  4. [4]F. BeaucouP, P. Borwein, D. W. Boyd and C. Pinner, Power series with restricted coefficients and a root on a given ray, Math. Comp. 67 (1998), no. 222, 715–736, doi:10.1090/S0025-5718-98-00960-0.DOI
  5. [5]T. Bousch, Sur quelques problèmes de dynamique holomorphe, Ph.D. thesis, Université Paris-Sud, 1992, https://www.imo.universite-paris-saclay.fr/~thierry.bousch/preprints/these-tb.pdf.
  6. [6]T. Bousch, Connexité locale et par chemins hôlderiens pour les systèmes itérés de fonctions, preprint, 1993.
  7. [7]D. Calegari, S. Koch and A. Walker, Roots, Schottky semigroups, and a proof of Bandt’s conjecture, Ergodic Theory Dynam. Systems 37 (2017), no. 8, 2487–2555, doi:10.1017/etds.2016.17.DOI
  8. [8]B. Espigulé, Infinitely many holes in connectedness loci for collinear affine iterated function systems, preprint, arXiv:2606.01467v1, 2026.arxiv.org/abs/2606.01467
  9. [9]B. Espigulé and D. Juhér, Semialgebraic interior layers in root closures of bounded-height integer polynomials, preprint, arXiv:2603.07397v2, 2026; statement numbers refer to this version.arxiv.org/abs/2603.07397
  10. [10]B. Espigulé, D. Juhér and J. Saldaña, Collinear fractals and Bandt’s conjecture, Fractal Fract. 8 (2024), no. 12, Art. 725, doi:10.3390/fractalfract8120725.DOI
  11. [11]M. Hata, On the structure of self-similar sets, Japan J. Appl. Math. 2 (1985), no. 2, 381–414, doi:10.1007/BF03167083.DOI
  12. [12]Y. Himeki and Y. Ishii, M₄ is regular-closed, Ergodic Theory Dynam. Systems 40 (2020), no. 1, 213–220, doi:10.1017/etds.2018.27.
  13. [13]H. Hopf, Über die Sehnen ebener Kontinuen und die Schleifen geschlossener Wege, Comment. Math. Helv. 9 (1936), 303–319, doi:10.1007/BF01258195.DOI
  14. [14]J. E. Hutchinson, Fractals and self-similarity, Indiana Univ. Math. J. 30 (1981), no. 5, 713–747, doi:10.1512/iumj.1981.30.30055.DOI
  15. [15]J. Kewarth, On the rigidity of the roots of power series with constrained coefficients, Int. Math. Res. Not. IMRN (2026), no. 9, rnag086, doi:10.1093/imrn/rnag086; preprint version arXiv:2505.18317v1.DOI
  16. [16]R. Maehara, The Jordan curve theorem via the Brouwer fixed point theorem, Amer. Math. Monthly 91 (1984), no. 10, 641–643, doi:10.1080/00029890.1984.11971517.DOI
  17. [17]A. Pascoletti and F. Zanolini, A crossing lemma for annular regions and invariant sets with an application to planar dynamical systems, J. Math. 2013 (2013), Art. 267393, doi:10.1155/2013/267393.DOI
  18. [18]O. Rosler, Almost regular closeness of the connectedness locus for pairs of affine maps on R², preprint, arXiv:2411.06953v2, 2025.arxiv.org/abs/2411.06953
  19. [19]P. Shmerkin and B. Solomyak, Zeros of {−1, 0, 1} power series and connectedness loci for self-affine sets, Experiment. Math. 15 (2006), no. 4, 499–511, doi:10.1080/10586458.2006.10128977.DOI
  20. [20]S. Silvestri and R. A. Pérez, Sofic systems and extreme points of self-affine limit sets, preprint, arXiv:2609.23174v1, 2026.arxiv.org/abs/2609.23174
  21. [21]B. Solomyak, Connectedness locus for pairs of affine maps and zeros of power series, J. Fractal Geom. 2 (2015), no. 3, 281–308, doi:10.4171/JFG/22.DOI
  22. [22]B. Solomyak and H. Xu, On the “Mandelbrot set” for a pair of linear maps and complex Bernoulli convolutions, Nonlinearity 16 (2003), no. 5, 1733–1749, doi:10.1088/0951-7715/16/5/311.DOI

Paper details

vlnc:W_xvncv9vg
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 1

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

ChatGPT, Codex, Claude

View statement
Looking for related papers…
Contents