Suita conjecture
Suita conjecture
In mathematics, the Suita conjecture is a conjecture related to the theory of the Riemann surface, the boundary behavior of conformal maps, the theory of Bergman kernel, and the theory of the L2 extension. The conjecture states the following: Suita (1972): Let R be an Riemann surface, which admits a nontrivial Green function . Let be a local coordinate on a neighborhood of satisfying . Let be the Bergman kernel for holomorphic (1, 0) forms on R. We define , and . Let be the logarithmic capacity which is locally defined by on R. Then, the inequality holds on the every open Riemann surface R, and also, with equality, then or, R is conformally equivalent to the unit disc less a (possible) closed set of inner capacity zero.
Sources & referencesView supporting material
Primary source
Progress summary
The conjecture was proved in full more than a decade ago, including the precise description of when equality occurs.
Suita posed the conjecture in 1972 for open Riemann surfaces admitting a Green function. It asserts the capacity–Bergman-kernel inequality and characterizes equality by a disc with at most a closed polar set removed, apart from the case .
Known results
- Błocki (2013) proved the inequality for bounded planar domains.
- Guan and Zhou (2013–2015) proved the inequality for open Riemann surfaces and established the equality characterization through optimal extension theorems.
- The result was published in the 2015 Annals of Mathematics paper on optimal extension.
2018–2022 further proofs
Guan and Zhou gave a 2018 proof of the equality case independent of extension, and their 2022 work treats the conjecture as solved while placing it in a broader minimal-integral framework. No counterexample, retraction, or unresolved objection was found.
Current status (as of August 2026): The inequality and its equality characterization are settled for the stated class of open Riemann surfaces; no substantive part of the original conjecture remains open.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.