{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Statement\n\nLet $\\Omega \\subseteq \\C^n$ be a bounded [[convex|02AS45T3H9]] domain.\nLet $k_\\Omega$ be its [[Kobayashi pseudodistance|DY8QQ5GTTX]] and $c_\\Omega$ its [[Carathéodory pseudodistance|SYNST4W3FR]], both normalised to equal the Poincaré distance on the unit disc.\nThen:\n\n1. $c_\\Omega(p, q) = k_\\Omega(p, q)$ for all $p, q \\in \\Omega$;\n2. for all $p \\ne q$ in $\\Omega$ there is a [[complex geodesic|275YT975A8]] $\\varphi \\colon \\mathbb{D} \\to \\Omega$ whose image contains $p$ and $q$.\n\n## Remarks\n\nLászló Lempert proved the theorem in 1981.\nThe infinitesimal Kobayashi–Royden and Carathéodory–Reiffen metrics of $\\Omega$ also agree.\nProof idea: an extremal disc through $p$ and $q$ exists by a normal families argument.\nFor smoothly bounded strongly convex domains, Lempert studied the boundary behaviour of extremal discs and constructed, for each one, a holomorphic left inverse $\\Omega \\to \\mathbb{D}$.\nThis left inverse shows that the Carathéodory distance is at least the Kobayashi distance, and the general convex case follows by exhaustion.\nExample: for the unit ball $B$ and $p = 0$, both distances equal $\\tanh^{-1}\\abs{q}$, and the complex geodesics through $0$ include the maps $\\zeta \\mapsto \\zeta v$ for unit vectors $v$.\nConvexity cannot simply be dropped: for an annulus $A \\subset \\C$, which is not simply connected, one has $c_A(p, q) \u003c k_A(p, q)$ for $p \\ne q$.\n\n## Explanations\n\n### L1 human\n\nThere are two natural ways to measure distances in a domain of $\\C^n$ using holomorphic maps.\nOne uses discs mapped into the domain, the other uses functions from the domain to the disc.\nIn general the second way gives smaller numbers.\nLempert's theorem says that for convex domains both ways give the same answer, and that the distance between two points is realised by a single holomorphic disc through them.\n\n### L2 human\n\nThe theorem makes the invariant geometry of convex domains computable: distances are realised by extremal discs, which solve a variational problem with a rich structure.\nIt is used to study biholomorphic maps of convex domains, boundary behaviour of holomorphic maps, and the [[pluricomplex Green function|3MQVKVGYYY]], which on convex domains is determined by the Kobayashi distance.\nFor general pseudoconvex domains the two distances can differ, so the theorem singles out convexity, and later work extended it to strongly linearly convex domains.\n",
  "commit": "ff8a40749dc16545e3d2fc637f6b0196e81d0bfa",
  "front": {
    "about": [
      "DY8QQ5GTTX",
      "SYNST4W3FR"
    ],
    "kind": "statement",
    "msc": [
      "32F45",
      "32H02"
    ],
    "name": "Lempert's theorem on convex domains",
    "role": "theorem",
    "sources": [
      {
        "url": "https://en.wikipedia.org/wiki/Kobayashi_metric"
      }
    ],
    "tag": "2PANNSQ3G6",
    "uses": [
      "DY8QQ5GTTX",
      "SYNST4W3FR",
      "275YT975A8",
      "02AS45T3H9"
    ]
  },
  "kind": "statement",
  "link": "https://tamnd.github.io/math2/node/2PANNSQ3G6/",
  "links": [
    {
      "field": "about",
      "target": "DY8QQ5GTTX"
    },
    {
      "field": "about",
      "target": "SYNST4W3FR"
    },
    {
      "field": "uses",
      "target": "DY8QQ5GTTX"
    },
    {
      "field": "uses",
      "target": "SYNST4W3FR"
    },
    {
      "field": "uses",
      "target": "275YT975A8"
    },
    {
      "field": "uses",
      "target": "02AS45T3H9"
    }
  ],
  "markdown": "https://tamnd.github.io/math2/node/2PANNSQ3G6.md",
  "msc": [
    "32F45",
    "32H02"
  ],
  "name": "Lempert's theorem on convex domains",
  "prov": null,
  "role": "theorem",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/2PA/2PANNSQ3G6.md",
  "status": null,
  "tag": "2PANNSQ3G6",
  "uri": "m2://2PANNSQ3G6",
  "url": "https://tamnd.github.io/math2/wiki/lemperts-theorem-on-convex-domains/",
  "writing": {
    "tag": "2PANNSQ3G6",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      },
      {
        "what": "a source with a locator",
        "have": 0,
        "want": 1
      }
    ]
  }
}