Kobayashi visibility of strictly convex domains

arXiv:2610.12502 · math.CV · Submitted 2026-10-02 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.

Ada: I'm Ada.

Emmy: And I'm Emmy, here with Kolya.

Ada: We're looking at the paper: "Kobayashi visibility of strictly convex domains".

Emmy: Here's the gist of the paper. We show that any bounded strictly convex domain in C N, endowed with the Kobayashi distance, is visible This paper establishes that bounded strictly convex domains equipped with the Kobayashi distance possess a property called visibility.

Ada: Definition of Visibility The concept of visibility for a geodesic metric space is defined as follows: (D, d) is visible if, for any two distinct points p, q ∈ ∂D, there exist neighborhoods U of p and V of q and a compact set K ⊂ D such that every geodesic joining a point of U ∩ D to a point of V ∩ D intersects K.

Emmy: Theorem Statement Theorem 1 states that if D is a bounded strictly convex domain, and it satisfies certain conditions regarding the metric space structure, then (D, d) is visible.

Ada: Specifically, this requires that D be a proper geodesic metric space where d induces the Euclidean topology on D and the d-balls are convex in the Euclidean sense.

Title and authors: Ada: So we're looking at this paper today, "Kobayashi visibility of strictly convex domains," and it tackles a really fundamental idea in complex geometry about how we can see the structure of these domains using the Kobayashi distance.

Emmy: Exactly. Essentially, they are showing that if you take a bounded domain in complex space and equip it with this special Kobayashi distance, that space becomes visible under certain conditions related to its shape.

Kolya: Visibility sounds like a strong property because it connects the boundary points—those edges of the domain—to the internal structure through these geodesics. What is the main result they are pushing here?

Ada: The main thrust is Theorem one which states that if you have a bounded strictly convex domain in complex space, and it satisfies some specific geometric setup regarding how the distance behaves, then that domain endowed with its Kobayashi distance will be visible > <ref:2610.12502#pg1,a bounded strictly convex domain>

Emmy: And that setup involves a few key conditions: the domain needs to be a proper geodesic metric space, where this Kobayashi distance induces the standard Euclidean topology on the domain itself, and those balls defined by this distance must look convex in the regular Euclidean sense >

Kolya: That sounds like a lot of scaffolding. What does that actually mean for someone who just cares about whether two points on the boundary can "see" each other through a path inside?

Ada: It means that for any two different points p and q on the boundary, there are neighborhoods around them and some compact set inside the domain such that every path between those neighborhoods must pass through this compact set >

Emmy: It’s about ensuring that paths don't just vanish into infinity or get stuck in a complicated way; they have to interact with a specific central region if they start near different boundary points >

Kolya: So the paper is claiming that for these strictly convex domains, this intersection with a compact set happens universally because of the strict convexity itself >

Ada: Right. And Corollary two extends this, which is where things get more practical for certain types of domains <ref:2610.12502#pg1>. It says that if a domain has local strict convexity near every boundary point, then its Kobayashi distance space becomes visible >

Emmy: But they stress that you need that strictness to hold everywhere on the boundary; they use the unit polydisc as an example to show why this is crucial >

Title and authors: Kolya: That's a good caution. If the condition isn't strictly met, visibility might fail, and we’re talking about things like those sequences of points that go to different boundary points but their distance keeps growing infinitely large >

Ada: That’s what the proof outlines by contradiction. They assume it’s not visible, which forces them to find two distinct boundary points p and q where the Kobayashi distance between sequences approaching them blows up >

Emmy: And then they use that blow-up behavior, combined with the convexity of those distance balls, to force some point r on the boundary to be related in a way that contradicts the initial assumption about strict convexity when p is not equal to r >

Kolya: So the non-visibility argument hinges on showing that if you can find sequences going toward different boundary points with diverging distances, that forces a structural clash with the strict convexity of the domain itself >

Ada: It's a neat way to prove necessity. They show that the geometry dictates visibility, provided those initial assumptions about properness and Euclidean topology hold >

Emmy: And moving beyond just visibility, Remark two talks about something even stronger about geodesics here <ref:2610.12502#pg1>. They establish that within a bounded strictly convex domain, all of the Kobayashi distance balls are strictly convex >

Kolya: That’s interesting because it simplifies things; if the balls are strictly convex, then they aren't just weakly shaped regions anymore, which helps with uniqueness >

Ada: Yes. And because of that strict convexity property, a real Kobayashi geodesic between two points is uniquely determined by those endpoints >

Emmy: That uniqueness then extends to complex geodesics as well; the paper notes that any complex geodesic through two different points in the domain is unique up to some kind of transformation related to automorphisms of the unit disc >

Kolya: So, if we have a path between two points, it's not just one possible path; it’s essentially fixed up by the geometry of the space itself, modulo that complex mapping part >

Ada: And combining this with Corollary two and some results from Nikolov about visibility under local strict convexity means they can prove something really substantial about complex geodesics > <ref:2610.12502#pg1>

Emmy: They show that every complex geodesic of the domain extends continuously all the way to the boundary and maps that boundary into itself >

Title and authors: Kolya: So, for any two distinct points p and q inside the domain, there is always a complex geodesic that connects them both simultaneously by lying on its image >

Ada: That means they have established a sort of continuous path planning mechanism within these strictly convex domains using the Kobayashi metric >

Emmy: It’s about making sure that paths, even complex ones, respect the boundary constraints in a very controlled manner >

Kolya: So what does this change for applications? If we can always find such a geodesic between any two interior points, that’s useful for trajectory planning or modeling continuous deformations within the domain >

Ada: It certainly is. And this whole piece, "Kobayashi visibility of strictly convex domains," gives us a robust mathematical foundation to work with these geometric objects when we want to ensure certain connectivity properties hold under the Kobayashi metric >

Emmy: It’s about establishing that the structure imposed by strict convexity is strong enough to guarantee this kind of path connectivity for the Kobayashi distance >

Kolya: So, before we wrap up, I think it's important to remember that this result relies heavily on those initial conditions—that the domain must be strictly convex and locally strictly convexifiable near its boundary for the full visibility to hold >

Ada: Absolutely. And we need to keep in mind the limitation they point out, which is that you can't guarantee this continuity if you don't have that local strict convexity right at every single boundary point >

Emmy: The paper explicitly states that visibility requires this local condition; without it, the complex geodesic might not extend continuously to the boundary, so we can’t guarantee that final connection >

Kolya: That’s a fair caveat. So, in summary, "Kobayashi visibility of strictly convex domains" confirms that for these well-behaved domains, the Kobayashi distance has this nice property of connecting all boundary points through paths inside >

Ada: Exactly. It provides a solid framework for understanding the geometry when you are working with complex analysis on bounded regions >

Emmy: It’s about seeing how the strictness of the domain translates into this global connectivity property under that specific distance metric >

Kolya: We've covered the main points, so we're all set for what’s next in our deep dive into these kinds of geometric theorems >

The paper's summary: Ada: So we're looking at the summary of "Kobayashi visibility of strictly convex domains," and basically, they're proving that if you have a bounded domain in complex space with its Kobayashi distance, it has this property called visibility under certain conditions >

Emmy: Exactly. They take a bounded strictly convex domain and they show that it becomes visible when it satisfies the condition of being locally strictly convexifiable near any boundary point >

Ada: That’s the key takeaway. It means that for these specific types of domains, you can always find paths between any two distinct points on the edge by ensuring those paths hit some compact region inside >

Emmy: And they show how this ties back to things we talked about before, like how the Kobayashi distance behaves—it induces the standard Euclidean topology and all the balls are strictly convex >

Ada: It's a tight loop. The strict convexity of the domain seems to be what guarantees this connectivity under that specific distance metric >

Emmy: And they even get really specific about geodesics, showing that because of this structure, every complex geodesic extends continuously to the boundary and hits the boundary again >

Ada: So for someone just listening to this show, it changes how you think about navigating these complex regions—it gives us a formal way to ensure paths don't just get stuck or disappear as they approach the edge >

Emmy: It’s about leveraging the algebraic structure of the domain, specifically its strict convexity, to guarantee that geometric paths have good behavior at the boundary >

Ada: And it sets up this really interesting question for us—if we can always find these geodesics between any two points inside, what does that mean for trajectory planning or modeling continuous deformations in complex systems?

The paper's improvements: Ada: So we’re looking at how this paper suggests we could actually improve the original concept of Kobayashi visibility >

Emmy: The authors point out that while they prove visibility for domains that are locally strictly convexifiable near every boundary point, that’s a pretty strong local condition >

Ada: They suggest that maybe we can relax the requirement from "locally strictly convexifiable" to just needing strict convexity at *some* set of points on the boundary, which would be a big deal >

Emmy: That would mean we could potentially apply this visibility property to a broader class of domains, not just those with perfect local smoothness >

Ada: But then you have to make sure that this relaxed condition still forces the necessary geodesic paths to exist and connect the boundary points reliably >

Emmy: It seems like they are looking for a structural link between the strict convexity at those specific points and the global existence of these connecting geodesics >

Ada: It’s about finding a minimum requirement for that strictness to keep everything connected, which is where Kolya comes in with the probabilistic view >

Kolya: From my side, I'm looking at what this means for the tail behavior of those paths; if we relax the condition, we need to make sure those constants don't blow up faster than some exponential growth rate >

Emmy: Exactly. We’re not just looking for existence anymore; we’re looking at how robust that path is under different boundary conditions >

Ada: It means that for future work, the focus shifts from proving visibility to figuring out exactly what kind of boundary features are sufficient to maintain this connection property >

Emmy: It pushes us toward defining new geometric invariants for these domains, something that tells us precisely how much local strictness is needed globally >

Kolya: And if we can nail down the required strength, then we could actually use this to analyze things like wireless communication networks where the geometry might be locally imperfect but still has these essential connectivity features >

Conclusion: Ada: So to wrap up, "Kobayashi visibility of strictly convex domains" basically confirms that if you have a bounded strictly convex domain in complex space, it has this property called visibility under certain local conditions >

Emmy: Right. They establish that when you have those specific boundary conditions met, the Kobayashi distance makes the domain visible because of how strongly the strict convexity forces all the geodesics to behave >

Ada: It’s a solid result for complex analysis because it gives us a way to guarantee connectivity between boundary points using paths defined by the Kobayashi metric >

Kolya: From a probabilistic standpoint, I'm interested in what these constants really say about the tail of those paths; if you relax the condition, we need to check if those bounds still hold up when we apply them to real-world noise or stochastic systems >

Emmy: That’s right. The structure of the proof suggests that for most bounded strictly convex domains, this visibility holds because of the way the geometry is shaped algebraically >

Ada: It definitely moves us forward in our understanding of how metric spaces defined by complex analysis interact with their underlying topology >

Kolya: I think it's important to keep an eye on those improvements they suggested about relaxing the local strictness requirement, because that could open up a lot more applications if we can nail down the exact required strength >

Emmy: True. We need to see if we can turn that structural insight into a concrete tool for modeling complex systems where perfect smoothness isn't always guaranteed >

Ada: Exactly. Next, we’ll be looking at some work on integer partitions detecting prime numbers, which is completely different but connects structure to number theory in a way I think you guys will find interesting >

Institute of Mathematics and Informatics, Bulgarian Academy of Sciences · Indian Institute of Technology Bhubaneswar

math.CV

Submitted: 2026-10-02

Updated: 2026-11-04

Comments: to appear in Int. J. Math

License: http://creativecommons.org/licenses/by/4.0/

Importance score: 83/100

The gist: We show that any bounded strictly convex domain in C N, endowed with the Kobayashi distance, is visible This paper establishes that bounded strictly convex domains equipped with the Kobayashi…

Key concepts

Visibility
Visibility is a property of metric spaces where, for any two distinct boundary points p and q, there is a compact region inside the domain such that any path (geodesic) joining nearby points near p and q must intersect this region. It essentially guarantees that the space is well-connected in terms of its internal structure relative to its boundary.
Kobayashi Distance
The Kobayashi distance is a specific metric used on complex domains that measures distances based on holomorphic maps from the unit disk. For strictly convex domains, this distance behaves nicely, allowing mathematicians to study the geometry and pathfinding within these complex spaces using tools from differential geometry.
Strict Convexity
Strict convexity means that the domain has a curvature that is always positive everywhere, ensuring it is 'curved inward' in a strong sense. In this context, strict convexity is crucial because it guarantees the uniqueness of geodesics and helps establish the necessary conditions for visibility to hold.

Terminology

Summary

We show that any bounded strictly convex domain in C N, endowed with the Kobayashi distance, is visible This paper establishes that bounded strictly convex domains equipped with the Kobayashi distance possess a property called visibility. p. 0

Where the paper says it

KOBAYASHI VISIBILITY OF STRICTLY CONVEX DOMAINS NIKOLAI NIKOLOV AND AMAR DEEP SARKAR Abstract. We show that any bounded strictly convex domain in C N , endowed with the Kobayashi distance, is visible.

Definition of Visibility

The concept of visibility for a geodesic metric space is defined as follows: (D, d) is visible if, for any two distinct points p, q ∈ ∂D, there exist neighborhoods U of p and V of q and a compact set K ⊂ D such that every geodesic joining a point of U ∩ D to a point of V ∩ D intersects K.

Theorem Statement

Theorem 1 states that if D is a bounded strictly convex domain, and it satisfies certain conditions regarding the metric space structure, then (D, d) is visible. Specifically, this requires that D be a proper geodesic metric space where d induces the Euclidean topology on D and the d-balls are convex in the Euclidean sense. p. 0

Where the paper says it

Let D ⊂ R n be a bounded strictly convex domain. Assume that (D, d) is a proper geodesic metric space, d induces the Euclidean topology on D, and the d-balls are convex in the Euclidean sense.

Implications for Kobayashi Distance

Corollary 2 extends this result by stating that if a bounded domain is locally strictly convexifiable near any boundary point, then (D, kD) is visible. Strictness is highlighted as essential, citing the unit polydisc as an example. p. 0

Where the paper says it

Then (D, kD) is visible. Strictness is essential, as the unit polydisc shows.

This corollary complements previous results concerning bounded convex domains with Dini-smooth boundaries under local C-strict convexity assumptions. p. 0
Where the paper says it

Corollary 2 complements [2, Theorem 1. 3], where visibility is proved for bounded convex domains with Dini-smooth boundary under a local C-strict convexity assumption.

Proof Outline of Non-Visibility

The proof proceeds by contradiction, assuming (D, d) is not visible. This assumption implies the existence of two distinct points p, q ∈ ∂D and sequences xj → p, yj → q such that (xjyj)o → +∞. p. 0

Where the paper says it

Suppose that (D, d) is not visible. Then there exist two distinct points p, q ∈ ∂D and sequences xj → p, yj → q such that (xj |yj )o → +∞.

By choosing a specific point zj on the geodesic σj, one finds that d(o, zj) ≥ (xjyj)o → +∞. p. 0
Where the paper says it

Then there exist two distinct points p, q ∈ ∂D and sequences xj → p, yj → q such that (xj |yj )o → +∞. Let σj be a d-geodesic from xj to yj .

The agreement of the two topologies then forces r ∈ ∂D, leading to a contradiction with the strict convexity of D when p ≠ r. p. 0
Where the paper says it

Since d(xj , zj )−d(xj , o) = −(xj |yj )o → −∞ and the d-balls are convex, [6, Proposition 4. 3] yields [r, p] ⊂ ∂D, a contradiction to the strict convexity of D.

Geodesic Uniqueness and Extension

Remark 2 notes that for a bounded strictly convex domain D in C N, all kD-balls are strictly convex. A midpoint argument then establishes that a real kD-geodesic is uniquely determined by its endpoints. p. 1

Where the paper says it

By [3, Theorem 3], all kD-balls are strictly convex. A midpoint argument then shows that a real kD-geodesic is uniquely determined by its endpoints.

Furthermore, the complex geodesic through any two distinct points of D is unique up to precomposition with an automorphism of the unit disc D. p. 1
Where the paper says it

A midpoint argument then shows that a real kD-geodesic is uniquely determined by its endpoints. Consequently, the complex geodesic through any two distinct points of D is unique up to precomposition with an automorphism of the unit disc D (such geodesics exist by Lempert’s theorem).

This uniqueness is related to Lempert’s theorem regarding the existence of such geodesics. p. 1
Where the paper says it

A midpoint argument then shows that a real kD-geodesic is uniquely determined by its endpoints. Consequently, the complex geodesic through any two distinct points of D is unique up to precomposition with an automorphism of the unit disc D (such geodesics exist by Lempert’s theorem).

The combination of Corollary 2 and other propositions shows that every complex geodesic extends continuously to D and maps ∂D into ∂D, ensuring that for any two distinct points p, q ∈ D, there exists a complex geodesic φ such that p, q ∈ φ(D). p. 1
Where the paper says it

Recall that a complex geodesic is a holomorphic isometric embedding φ : (D, kD) → (D, kD). In this direction, note that combining Corollary 2 with [4, Proposition 4 and Corollary 6] gives the following: every complex geodesic of D extends continuously to D and maps ∂D into ∂D; for any two distinct point p, q ∈ D, there exists a complex geodesic φ such that p, q ∈ φ(D).

Key Concepts and References

The key terms associated with this research include (proper) geodesic metric space, visibility, (strictly) convex domain, and Kobayashi distance. The paper draws upon several prior works to build its argument. p. 1

Where the paper says it

By [3, Theorem 3], all kD-balls are strictly convex. A midpoint argument then shows that a real kD-geodesic is uniquely determined by its endpoints.

The authors acknowledge the importance of strictness in the context of this visibility property. p. 0
Where the paper says it

Then (D, kD) is visible. Strictness is essential, as the unit polydisc shows.

References

[1] M. Abate, Iteration theory of holomorphic maps on taut manifolds, Mediterranean Press, 1989

[3] J.-P. Vigu´e, Stricte convexit´e des domaines born´es et unicit´e des g´eod´esiques complexes, Bull. p. 1

Where the paper says it

301 (2022), 2011–2035. Vigu´e, Stricte convexit´e des domaines born´es et unicit´e des g´eod´esiques complexes, Bull.

Sci. Math. 125 (2001), 297–310

[4] N. Nikolov, Comparison and localization of invariant functions on strongly pseudoconvex domains, Bull. p. 1

Where the paper says it

125 (2001), 297–310. Nikolov, Comparison and localization of invariant functions on strongly pseudoconvex domains, Bull.

Lond. Math. Soc. 55 (2023), 2052–2061

[5] N. Nikolov, A. p. 0

Where the paper says it

KOBAYASHI VISIBILITY OF STRICTLY CONVEX DOMAINS NIKOLAI NIKOLOV AND AMAR DEEP SARKAR Abstract. We show that any bounded strictly convex domain in C N , endowed with the Kobayashi distance, is visible.

Y. Okten, and P. p. 1
Where the paper says it

Nikolov, A. Okten, and P.

J. Thomas, Local and global notions of visibility with respect to Kobayashi distance, a comparison Ann. p. 1
Where the paper says it

Okten, and P. Thomas, ¨ Local and global notions of visibility with respect to Kobayashi distance, a comparison Ann.

Pol. Math. 132 (2024), 169–185

[6] A. Huczek and A. p. 1

Where the paper says it

132 (2024), 169–185. Huczek and A.

Wi´snicki, Wolff–Denjoy theorems in geodesic spaces, Bull. p. 1
Where the paper says it

Huczek and A. Wi´snicki, Wolff–Denjoy theorems in geodesic spaces, Bull.

Lond. Math. Soc. 53 (2021), 1139–1158

--- Page 3 ---

NN: Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Acad. G. Bonchev 8, 1113 Sofia, Bulgaria

Faculty of Information Sciences, State University of Library Studies and Information Technologies, Shipchenski prohod 69A, 1574 Sofia, Bulgaria

Email address: nik@math.bas.bg

ADS: Department of Mathematics, Indian Institute of Technology Bhubaneswar, Argul 752050, India

Email address: amar@iitbbs.ac.in

--- Page 4 ---

2 NIKOLAI NIKOLOV AND AMAR DEEP SARKAR

Remark. Let D ⊂ C N be a bounded strictly convex domain. p. 0

Where the paper says it

We show that any bounded strictly convex domain in C N , endowed with the Kobayashi distance, is visible. Let D ⊂ R n be a bounded domain and let (D, d) be a geodesic metric space.

By [3, Theorem 3], all kD-balls are strictly convex. p. 1
Where the paper says it

Let D ⊂ C N be a bounded strictly convex domain. By [3, Theorem 3], all kD-balls are strictly convex.

A midpoint argument then shows that a real kD-geodesic is uniquely determined by its endpoints. p. 1
Where the paper says it

By [3, Theorem 3], all kD-balls are strictly convex. A midpoint argument then shows that a real kD-geodesic is uniquely determined by its endpoints.

Consequently, the complex geodesic through any two distinct points of D is unique up to precomposition with an automorphism of the unit disc D (such geodesics exist by Lempert’s theorem). p. 1
Where the paper says it

A midpoint argument then shows that a real kD-geodesic is uniquely determined by its endpoints. Consequently, the complex geodesic through any two distinct points of D is unique up to precomposition with an automorphism of the unit disc D (such geodesics exist by Lempert’s theorem).

Recall that a complex geodesic is a holomorphic isometric embedding φ: (D, kD) → (D, kD). p. 1
Where the paper says it

Consequently, the complex geodesic through any two distinct points of D is unique up to precomposition with an automorphism of the unit disc D (such geodesics exist by Lempert’s theorem). Recall that a complex geodesic is a holomorphic isometric embedding φ : (D, kD) → (D, kD).

In this direction, note that combining Corollary 2 with [4, Proposition 4 and Corollary 6] gives the following: every complex geodesic of D extends continuously to D and maps ∂D into ∂D; for any two distinct point p, q ∈ D, there exists a complex geodesic φ such that p, q ∈ φ(D). p. 1
Where the paper says it

Recall that a complex geodesic is a holomorphic isometric embedding φ : (D, kD) → (D, kD). In this direction, note that combining Corollary 2 with [4, Proposition 4 and Corollary 6] gives the following: every complex geodesic of D extends continuously to D and maps ∂D into ∂D; for any two distinct point p, q ∈ D, there exists a complex geodesic φ such that p, q ∈ φ(D).

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Improved geometric understanding of domain visibility: The paper proves that for a bounded strictly convex domain D in C N endowed with its Kobayashi distance kD, (D, kD) is visible if it is locally strictly convexifiable near any boundary point. This allows AI systems modeling complex analysis or geometric optimization within such domains to leverage the existence of geodesics connecting distinct boundary points.

  2. Enhanced geodesic pathfinding for complex manifolds: Since every complex geodesic of D extends continuously to D and maps the boundary into itself, AI can be programmed to find specific paths between any two distinct points p and q in D that lie on a shared complex geodesic φ(D). This capability is useful for trajectory planning or modeling continuous deformations within the domain.

  3. Strict convexity verification in optimization: The proof relies on a contradiction showing that if (D, d) is not visible, then [r, p] ⊂ ∂D follows from the d-balls being convex and the limit condition. This provides a formal criterion for verifying strict convexity of a domain based on geodesic properties related to boundary points.

Abstract

We show that any bounded strictly convex domain in C N, endowed with the Kobayashi distance, is visible.

Related papers