For n≥2n \ge 2, a proper holomorphic map between unit balls that is sufficiently smooth up to the boundary is automatically rational, and its degree is bounded in terms of the domain and target dimensions alone; the sharp form of this bound is unknown. D'Angelo and Lebl's 2009 study of the complexity of proper ball maps crystallized the problem in two linked forms. First, determine the sharp bound Φ(n,N)\Phi(n,N) on the degree of rational proper maps f:Bn→BNf : B_n \to B_N; the D'Angelo conjecture asserts deg⁡f≤2N−3\deg f \le 2N-3 for n=2n = 2 and deg⁡f≤(N−1)/(n−1)\deg f \le (N-1)/(n-1) for n≥3n \ge 3, the values known to be sharp for monomial maps. Second, classify the valid quadruples (n,r,d,k)(n,r,d,k): those for which there exists a kk-dimensional convex family of proper rational maps from BnB_n of generic degree dd and rank rr (the degree problem is exactly the k=0k = 0 case). The conjecture is confirmed only for monomial maps, geometric rank one, the low-codimension gap intervals (degree ≤2\le 2 up to N=3n−3N = 3n-3 for n≥4n \ge 4; degree ≤3\le 3 up to N=4n−6N = 4n-6 for n≥7n \ge 7), and bounded in the maximal-geometric-rank case; the best general bound, deg⁡f≤N(N−1)/(2(2n−3))\deg f \le N(N-1)/(2(2n-3)) (Meylan; D'Angelo–Lebl), is far from sharp. The problem remains open, with active partial progress through 2025.

Background

Let BnB_n denote the unit ball in Cn\mathbb{C}^n. A holomorphic map f:Bn→BNf : B_n \to B_N is proper precisely when ∥f(z)∥→1\|f(z)\| \to 1 whenever ∥z∥→1\|z\| \to 1 from inside; proper maps between balls are the central model case of the classification and boundary-regularity theory of holomorphic maps in several complex variables. In one complex variable, proper maps of the disc to itself are finite Blaschke products (finite products of disc automorphisms), which exist in every degree, so no degree bound in terms of the target dimension is possible. For n≥2n \ge 2 the picture changes drastically: Forstnerič proved that a proper map between balls that is sufficiently smooth up to a boundary patch is necessarily rational, i.e. a quotient p/qp/q of a vector-valued holomorphic polynomial by a scalar polynomial with q≠0q \ne 0 near the closed ball, and that its degree — the maximum of the degrees of pp and qq after reduction to lowest terms — is bounded by a function of nn and NN alone. Determining the sharp form of this bound has been a driving open problem of the area since the 1980s. The known landmarks are of two kinds. First, low-codimension classifications: when N=n≥2N = n \ge 2 every proper self-map of the ball is an automorphism; Faran classified proper maps B2→B3B_2 \to B_3 (degree at most 3, four equivalence classes); Huang proved that maps Bn→BNB_n \to B_N with n<N≤2n−2n < N \le 2n-2 are linear; Huang–Ji proved degree at most 2 at N=2n−1N = 2n-1; Huang–Ji–Xu initiated the theory of gap intervals and proved degree at most 2 up to N=3n−4N = 3n-4, extended to N=3n−3N = 3n-3 (for n≥4n \ge 4) by Andrews–Huang–Ji–Yin; and Ji–Yin proved degree at most 3 for N≤4n−6N \le 4n-6 when n≥7n \ge 7 (the third gap interval). Second, structured classes: for monomial proper maps (maps whose components are single monomials) the sharp bounds are known — D'Angelo–Kos–Riehl proved deg⁡f≤2N−3\deg f \le 2N-3 for n=2n = 2 and Lebl–Peters proved deg⁡f≤(N−1)/(n−1)\deg f \le (N-1)/(n-1) for n≥3n \ge 3, both sharp. These monomial sharp bounds and the gap results crystallized into the D'Angelo conjecture: every rational proper map f:Bn→BNf : B_n \to B_N satisfies deg⁡f≤2N−3\deg f \le 2N-3 when n=2n = 2 and deg⁡f≤(N−1)/(n−1)\deg f \le (N-1)/(n-1) when n≥3n \ge 3. Related to these classifications is the geometric rank of Huang–Ji–Xu, an integer invariant of a rational proper map, bounded by n−1n-1, measuring how degenerate the map's homogeneous expansion is: the conjecture is known for maps of geometric rank one (Huang–Ji–Xu), and Al Helal proved the bound deg⁡f≤n+1\deg f \le n+1 for maps of maximal geometric rank n−1n-1 at the minimal target dimension N=n(n+1)/2N = n(n+1)/2 where that rank occurs. By contrast, the best general bounds — due to Meylan for n=2n = 2 and to D'Angelo–Lebl for all n≥2n \ge 2 — are deg⁡f≤N(N−1)/(2(2n−3))\deg f \le N(N-1)/(2(2n-3)), quadratic in NN and far from the conjectured linear behavior. D'Angelo–Lebl's 'On the complexity of proper holomorphic mappings between balls' (2009), placed the degree question inside a broader quantitative complexity theory of proper maps. Since a proper map is determined up to unitary changes of target coordinates by its squared norm ∥f∥2\|f\|^2, one can form convex combinations ∑iλi∥fi∥2\sum_i \lambda_i \|f_i\|^2 of squared norms of proper maps; such collections are called convex families. The paper defines the rank of a proper map as the rank of its underlying Hermitian form — equivalently the smallest integer N0N_0 for which there is a norm-equivalent map sending BnB_n properly to BN0B_{N_0} — defines the rank rr of a family as the maximum of the ranks of its members, and defines the generic degree dd as the degree of the maps on a dense open subset of the parameter set. A quadruple of integers (n,r,d,k)(n, r, d, k) is called valid when there exists a kk-dimensional convex family of proper rational maps from BnB_n of generic degree dd and rank rr. D'Angelo–Lebl prove, for example, that for fixed nn and dd every convex family of origin-preserving polynomial proper maps has dimension at most δ(n,d−1)2\delta(n, d-1)^2, where δ(n,m)\delta(n, m) is the dimension of the space of polynomials of degree at most mm in nn variables with vanishing constant term, and they construct many valid quadruples; but they state explicitly that giving necessary and sufficient conditions for validity 'is an extremely difficult problem', of which the degree-estimate problem is exactly the k=0k = 0 case. The same paper contributes the improved general bound above, structural results on inverse images (for a polynomial proper map pp the zero fiber p−1(0)p^{-1}(0) is empty or the single point {0}\{0\}; for a rational map with fixed denominator qq the candidates for f−1(0)f^{-1}(0) form an explicitly determined finite set S(q)S(q)), and a completion construction (Proposition 4) for which the paper asserts, as a proven impossibility, that no bound on the number of completing components or their degree in terms of nn and deg⁡g\deg g exists.

Problem Statement

Determine the sharp quantitative complexity of rational proper holomorphic maps between unit balls, as posed by D'Angelo–Lebl (2009) in two linked forms. (1) Sharp degree bounds. For each pair (n,N)(n, N) with n≥2n \ge 2 and N≥nN \ge n, determine Φ(n,N)=max⁡{deg⁡f:f∈Rat⁡(Bn,BN)}\Phi(n,N) = \max \{ \deg f : f \in \operatorname{Rat}(B_n, B_N) \}, the maximal degree of a rational proper holomorphic map from the unit ball Bn⊂CnB_n \subset \mathbb{C}^n to the unit ball BN⊂CNB_N \subset \mathbb{C}^N (the maximum exists: Forstnerič proved degree is bounded in terms of nn and NN alone). In particular, prove or refute the D'Angelo conjecture: deg⁡f≤2N−3\deg f \le 2N - 3 for n=2n = 2, and deg⁡f≤(N−1)/(n−1)\deg f \le (N-1)/(n-1) for n≥3n \ge 3. Determine Φ(n,N)\Phi(n,N) explicitly: prove that every rational proper map Bn→BNB_n \to B_N has deg⁡f\deg f at most Φ(n,N)\Phi(n,N), and exhibit explicit proper maps of degree Φ(n,N)\Phi(n,N) showing that no smaller bound is possible. No structural hypothesis — monomial, group-invariant, bounded geometric rank, gap-interval codimension, or boundary regularity beyond what rationality already provides — may be imposed. (2) Valid quadruples. Give necessary and sufficient conditions on a quadruple of integers (n,r,d,k)(n, r, d, k) for it to be valid: for there to exist a kk-dimensional convex family of proper rational mappings from BnB_n of generic degree dd and rank rr (the rank of a family is the maximum of the ranks of its members). Part (1) is the k=0k = 0 case of part (2): a valid quadruple (n,r,d,0)(n, r, d, 0) certifies a single proper rational map from BnB_n of degree dd and rank rr, where the rank rr is the minimal norm-equivalent target dimension rather than the ambient target dimension NN, so recovering Φ(n,N)\Phi(n,N) from the quadruple classification requires translating between the rank parameter rr and the target dimension NN; a solution of (2) therefore contains a solution of (1).

References

  1. John P. D'Angelo and Jiří Lebl. On the complexity of proper holomorphic mappings between balls. Complex Variables and Elliptic Equations 54 (2009), no. 3–4, 187–204. DOI: 10.1080/17476930902759403. https://doi.org/10.1080/17476930902759403 (preprint: arXiv:0802.1739, https://arxiv.org/abs/0802.1739)
  2. Franc Forstnerič. Extending proper holomorphic mappings of positive codimension. Inventiones Mathematicae 95 (1989), no. 1, 31–61. DOI: 10.1007/BF01394144. https://doi.org/10.1007/BF01394144
  3. James J. Faran. Maps from the two-ball to the three-ball. Inventiones Mathematicae 68 (1982), no. 3, 441–475. DOI: 10.1007/BF01389412. https://doi.org/10.1007/BF01389412
  4. Xiaojun Huang. On a linearity problem for proper holomorphic maps between balls in complex spaces of different dimensions. Journal of Differential Geometry 51 (1999), no. 1, 13–33. DOI: 10.4310/jdg/1214425024. https://doi.org/10.4310/jdg/1214425024
  5. Xiaojun Huang and Shanyu Ji. Mapping B_n into B_{2n-1}. Inventiones Mathematicae 145 (2001), no. 2, 219–250. DOI: 10.1007/s002220100140. https://doi.org/10.1007/s002220100140
  6. Xiaojun Huang, Shanyu Ji, and Dekang Xu. A new gap phenomenon for proper holomorphic mappings from B^n into B^N. Mathematical Research Letters 13 (2006), no. 4, 515–529. DOI: 10.4310/mrl.2006.v13.n4.a2. https://doi.org/10.4310/mrl.2006.v13.n4.a2
  7. Jared Andrews, Xiaojun Huang, Shanyu Ji, and Wanke Yin. Mapping B^n into B^{3n-3}. Communications in Analysis and Geometry 24 (2016), no. 2, 279–300. DOI: 10.4310/cag.2016.v24.n2.a2. https://doi.org/10.4310/cag.2016.v24.n2.a2
  8. Francine Meylan. Degree of a holomorphic map between unit balls from C^2 to C^n. Proceedings of the American Mathematical Society 134 (2006), no. 4, 1023–1030. DOI: 10.1090/S0002-9939-05-08476-5. https://doi.org/10.1090/S0002-9939-05-08476-5
  9. John P. D'Angelo, Šimon Kos, and Emily Riehl. A sharp bound for the degree of proper monomial mappings between balls. Journal of Geometric Analysis 13 (2003), no. 4, 581–593. DOI: 10.1007/BF02921879. https://doi.org/10.1007/BF02921879
  10. Jiří Lebl and Han Peters. Polynomials constant on a hyperplane and CR maps of spheres. Illinois Journal of Mathematics 56 (2012), no. 1, 155–175. DOI: 10.1215/IJM/1380287465. https://doi.org/10.1215/IJM/1380287465 (preprint: arXiv:1105.2343, https://arxiv.org/abs/1105.2343)
  11. Shanyu Ji and Wanke Yin. D'Angelo conjecture in the third gap interval. Mathematische Zeitschrift 295 (2020), no. 3–4, 1583–1595. DOI: 10.1007/s00209-019-02428-0. https://doi.org/10.1007/s00209-019-02428-0 (preprint: arXiv:1904.11661, https://arxiv.org/abs/1904.11661)
  12. John P. D'Angelo, Dusty Grundmeier, and Jiří Lebl. Rational sphere maps, linear programming, and compressed sensing. Complex Analysis and its Synergies 6 (2020), no. 1, Paper No. 4. DOI: 10.1007/s40627-020-0041-5. https://doi.org/10.1007/s40627-020-0041-5 (preprint: arXiv:1911.05559, https://arxiv.org/abs/1911.05559)
  13. John P. D'Angelo and Jiří Lebl. Homotopy equivalence for proper holomorphic mappings. Advances in Mathematics 286 (2016), 160–180. DOI: 10.1016/j.aim.2015.09.007. https://doi.org/10.1016/j.aim.2015.09.007 (preprint: arXiv:1408.1104, https://arxiv.org/abs/1408.1104)
  14. John P. D'Angelo and Jiří Lebl. Complexity results for CR mappings between spheres. International Journal of Mathematics 20 (2009), no. 2, 149–166. DOI: 10.1142/S0129167X09005248. https://doi.org/10.1142/S0129167X09005248
  15. Abdullah Al Helal. Degree of ball maps with maximum geometric rank. Preprint (2024), arXiv:2410.14959. https://arxiv.org/abs/2410.14959
  16. Abdullah Al Helal, Jiří Lebl, and Achinta Kumar Nandi. Proper maps of ball complements & differences and rational sphere maps. Preprint (2024), arXiv:2401.06364. https://arxiv.org/abs/2401.06364
  17. John P. D'Angelo, Dusty E. Grundmeier, and Daniel A. Lichtblau. Invariant polynomials, gaps, and sparseness. Preprint (2025), arXiv:2512.05892. https://arxiv.org/abs/2512.05892