OpenFrontiers
← Back to the index
OP-11434Status unassessedGeometry and topology

Volume Bounds for Sublevel Sets

PDE methods in complex geometry · AIMPL workshop record

Editorial mapping of AIMPL list topic: PDE methods in complex geometry. http://aimpl.org/pdecomplexgeom/ Not an author-supplied MSC code.

Workshop record · status unassessedAs of 2026-09-10 source snapshot; not a current-status certificationSource & evidence ↓

Problem statement

It is known that given a bounded pseudoconvex domain Ω⊆Cn\Omega\subseteq\mathbb{C}^{n}, there exist C=C(Ω)C=C(\Omega) and α=α(Ω)\alpha=\alpha(\Omega) such that for any u∈PSH(Ω)u\in PSH(\Omega) satisfying u∣∂Ω≡0u|_{\partial\Omega}\equiv0 and ∫Ω(ddcu)n=1\int_{\Omega}(dd^{c}u)^{n}=1 (and this is defined), we have

∫Ωe−αuωn≤C. \int_{\Omega}e^{-\alpha u}\omega^{n}\leq C.

A more precise estimate is

Vol({u<−s})≤C(Ω)sn−1e−2πs. \text{Vol}(\{u<-s\})\leq C(\Omega)s^{n-1}e^{-2\pi s}.

Can one remove the sn−1s^{n-1} on the right hand side? Given a compact Kahler manifold (M,ω)(M,\omega) with boundary (and ω\omega extends smoothly across the boundary), do these estimates generalize if instead one assume u∈PSH(M,ω)u\in PSH(M,\omega), u∣∂M≡0u|_{\partial M}\equiv0, and ∫Ωωn=1\int_{\Omega}\omega^{n}=1? That is, can one bound

∫Xe−α(φ−sup⁡Xφ)ωn≤C∫Xωn. \int_{X}e^{-\alpha\left(\varphi-\sup_{X}\varphi\right)}\omega^{n}\leq C\int_{X}\omega^{n}.

One could also ask this question for the complete noncompact case, with appropriately modified assumptions/conclusion.

Lean 4

Not yet attached

No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.

Progress & source assessment

Dated source record, inspected 2026-09-10. Current status has not been independently reassessed. Source-reported results have not been independently verified.

The source supplies no separate status note for this question.

References
  1. [1]PDE methods in complex geometry · Original question link
  2. [2]AIMPL source bibliography link
  3. [3]AIMPL text license · CC BY-SA 3.0 linkAIM Problem Lists (AIMPL), original contributors; CC BY-SA 3.0. Adaptation: structural TeX converted to Markdown, documented source macros expanded, and source bibliography links added. Mathematical wording retained. These adapted source texts remain under CC BY-SA 3.0.

Recorded progress

Add yours →

Nothing recorded yet. A pointer to a paper the entry is missing counts.

Machine attempts

0 recorded

Attempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.

No machine attempts recorded.

Sign in to run an attempt. New accounts start with enough credits for ten.

Discussion

0 notes

Notes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.

No notes yet.

Sign in to add a note.