Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

No spacelike data surfaces in worlds with two or more time dimensions

Proved
Tegmark.no_spacelike_hyperplane

by Lucas · Oct 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

linearalgebrapartialdifferentialequationsspacetimedimensionality

The linear-algebra core of the letter's Asgeirsson discussion (page L74): in the ultrahyperbolic case there are no spacelike and no timelike hypersurfaces, and hence no well-posed initial-value problems, since a hypersurface by definition has a dimensionality one less than the spacetime manifold. The theorem states the hyperplane obstruction: when the number m of time dimensions is at least two, no hyperplane of the point space — the kernel of a nonzero linear functional — is spacelike; the kernel must meet the time block in a nonzero purely timelike vector, on which the form is negative, so the kernel cannot be positive definite. And when the number n of space dimensions is at least two, no hyperplane is timelike, by the same argument with the two blocks exchanged. This is what destroys every data surface of the multi-time worlds, including the (1, m) tachyon-symmetric ones that the classification places in the hyperbolic class.

Formalization Note A hyperplane is the kernel of a nonzero linear functional; spacelike means the quadratic form is positive on every nonzero vector of the kernel, timelike that it is negative. The letter's deeper Asgeirsson phenomenon (data in an effectively one-dimensional cylinder determining the solution in a higher-dimensional region, the free-lunch symptom of ill-posedness) is out of scope; the obstruction is the part of the discussion that is linear algebra.

Preamble
import Mathlib
import Definitions.Def_Tegmark_sig
import Definitions.Def_Tegmark_phys
import Definitions.Def_Tegmark_ensemble
Formal statement
namespace Tegmark

/-!
# No spacelike data surfaces in multi-time worlds

The linear-algebra core of the Asgeirsson discussion of Tegmark 1997
(p. L74): in the ultrahyperbolic case there are no spacelike and no
timelike hypersurfaces, hence no well-posed initial-value problems.
A hyperplane is the kernel of a nonzero linear functional; when there
are at least two time dimensions, such a kernel must meet the time
block in a nonzero purely timelike vector, so it cannot be positive
definite; and when there are at least two space dimensions, it must
meet the space block in a nonzero purely spacelike vector, so it
cannot be negative definite.
-/

/-- With at least two time dimensions no hyperplane of the point
space is spacelike, and with at least two space dimensions no
hyperplane is timelike (Tegmark 1997, p. L74): a codimension-one
subspace cannot be positive definite when m is at least 2, and
cannot be negative definite when n is at least 2. -/
theorem no_spacelike_hyperplane (n m : ℕ) :
    (2 ≤ m → ¬ HasSpacelikeHyperplane n m) ∧
    (2 ≤ n → ¬ HasTimelikeHyperplane n m) := by
  sorry

end Tegmark
Source
M. Tegmark, On the dimensionality of spacetime, Class. Quantum Grav. 14 (1997) L69-L75, p. L74 (after Asgeirsson 1936; Courant and Hilbert 1962).
Read-back

What the Lean code literally says, in plain math · glm-5-latest-short

Restate: for every pair of natural numbers n and m, a conjunction of two implications. The first: if m is at least two, then there is no nonzero linear functional from the coordinate space of the world with n space and m time dimensions to the real numbers whose kernel is spacelike, that is, on whose every nonzero vector the quadratic form — the sum of the squares of the space coordinates minus the sum of the squares of the time coordinates — is positive. The second: if n is at least two, then there is no nonzero linear functional whose kernel is timelike, that is, on whose every nonzero vector the form is negative. The negated existentials quantify over all linear functionals; no other hypotheses appear.

Human review
  • Endorsed by Shuze Chen · Oct 21, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 21, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me