K-304
Near-Kerr implies Kerr with computable constants
open Rigidity / Uniqueness
Statement
Upgrade perturbative uniqueness theorems near Kerr so that the hypotheses are checkable geometric inequalities with explicit constants.
Mathematical prerequisites
Perturbative uniqueness; unique continuation; invariant boundary data; effective estimates.
Why it matters
Current near-Kerr rigidity results are often too implicit for direct geometric use.
Completion criteria
A complete answer must state finite, computable conditions implying exact Kerrness and give quantitative parameter control.
Implications if solved
Would make rigidity much more usable for both analysis and numerical relativity.
Last updated: 2026-04-05 ·
Edit on GitHub →