Research collection / 01
The uniqueness of smooth stationary black holes
Huang, Yishen, Li, Jiongyue, Li, Junbin, Zhu, Xi-Ping
The article studies uniqueness of smooth stationary vacuum black holes without assuming analyticity. This collection presents a conditional theorem with explicit exterior-section, end-access, and Kerr-identification hypotheses.
The proof uses a Harrison transformation and area–charge estimates. In the limiting geometry, the bifurcation sphere has area radius one and constant electric and magnetic flux densities when the original ADM mass is normalized to one.
Read the original articleResearch & notes
28 entriesPrerequisites
Harrison fields, horizons and uniqueness inputs
Maximal slices, causal cuts and stability
Stationary geometry and analytic data
Supporting prerequisites · 01 — Gauss lemma
Supporting prerequisites · 02 — Local compactness of full weighted Hölder inputs
Supporting prerequisites · 03 — Komar flux equals the original stationary mass coefficient
Article items and immediate prerequisites
View the article page dependency graphLevel 0
6 pagesPresents 28 items from the article and its immediate prerequisites, covering published library prerequisites.
Presents 28 items from the article and its immediate prerequisites, covering published library prerequisites.
Presents 28 items from the article and its immediate prerequisites, covering published library prerequisites.
Presents 28 items from the article and its immediate prerequisites, covering published library prerequisites.
Presents 28 items from the article and its immediate prerequisites, covering published library prerequisites.
Presents 28 items from the article and its immediate prerequisites, covering published library prerequisites.
Level 1
1 pagePresents 29 items from the article and its immediate prerequisites, covering dependency level 0.
Level 2
1 pagePresents 28 items from the article and its immediate prerequisites, covering dependency levels 0–1.
Level 3
1 pagePresents 28 items from the article and its immediate prerequisites, covering dependency levels 1–2.
Level 4
1 pagePresents 28 items from the article and its immediate prerequisites, covering dependency level 2.
Level 5
1 pagePresents 28 items from the article and its immediate prerequisites, covering dependency levels 2–3.
Level 6
1 pagePresents 28 items from the article and its immediate prerequisites, covering dependency levels 3–4.
Level 7
1 pagePresents 29 items from the article and its immediate prerequisites, covering dependency levels 4–5.
Level 8
1 pagePresents 28 items from the article and its immediate prerequisites, covering dependency level 5.
Level 9
1 pagePresents 28 items from the article and its immediate prerequisites, covering dependency levels 5–6.
Level 10
1 pagePresents 28 items from the article and its immediate prerequisites, covering dependency levels 6–8.
Level 11
1 pagePresents 28 items from the article and its immediate prerequisites, covering dependency levels 8–10.
Level 12
1 pagePresents 28 items from the article and its immediate prerequisites, covering dependency levels 10–19.
Level 13
1 pagePresents 29 items from the article and its immediate prerequisites, covering dependency levels 19–40.