Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Predictability forces exactly one time dimension

Proved
Tegmark.predictable_m1

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

anthropicprinciplepartialdifferentialequationsspacetimedimensionality

The predictability prong of the letter (pages L72-L74): a world with the same laws of physics as ours and an (n + m)-dimensional spacetime can contain observers only if the number of time dimensions is m = 1, regardless of the number n of space dimensions. An observer must be able to make at least some predictions: by measuring various nearby field values, to compute field values at more distant spacetime points with non-infinite error bars. This predictability requirement — the field equations are hyperbolic, so that initial-value problems are well posed, and a spacelike hyperplane exists on which to pose the data — holds exactly for the single-time worlds with at least one space dimension. With no time dimension the equations are elliptic and initial-value problems are ill posed: an observer could not make any inferences at all about other parts of space. With two or more time dimensions the equations are ultrahyperbolic, or hyperbolic in the (1, m) tachyon-symmetric cases, but no hypersurface carries well-posed data.

Formalization Note The requirement is the conjunction hyperbolic class ∧ a spacelike hyperplane over the coordinate model; the well-posedness theory behind it (Hadamard, Asgeirsson, via Courant and Hilbert) is the letter's citation and is deliberately represented by the classification, as disclosed in the mission description. The hypothesis n ≥ 1 is the letter's standing setting — a world with observers has at least one space dimension; for n = 0 the requirement already fails at the elliptic clause.

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

/-!
# Predictability forces exactly one time dimension

The predictability prong of Tegmark 1997 (pp. L72-L74): a world with
the same laws of physics as ours and an "(n, m)"-dimensional
spacetime can contain observers only if "m" is 1, regardless of the
number "n" of space dimensions. The requirement is that the field
equations be hyperbolic, so that initial-value problems are well
posed, and that a spacelike hyperplane exist on which to pose the
data. With "m = 0" the equations are elliptic and initial-value
problems are ill posed; with "m" at least 2 there is no spacelike
hyperplane, including the tachyon-symmetric "(1, m)" worlds.
-/

/-- For a world with "n" space dimensions with "n" at least 1 and
"m" time dimensions, the predictability requirement, hyperbolic
field equations together with a spacelike hyperplane on which
initial data can be posed, holds exactly when "m" is 1 (Tegmark
1997, pp. L72-L74). -/
theorem predictable_m1 (n m : ℕ) (_hn : 1 ≤ n) :
    Predictable n m ↔ m = 1 := by
  sorry

end Tegmark
Source
M. Tegmark, On the dimensionality of spacetime, Class. Quantum Grav. 14 (1997) L69-L75, pp. L72-L74.
Read-back

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

Restate: for all natural numbers n and m, under the hypothesis that n is at least one, the defined predictability predicate holds for the pair (n, m) exactly when m equals one. The predictability predicate is the conjunction of two conditions: the defined classifier of the field equations equals the hyperbolic class, and there exists a nonzero linear functional of the coordinate space whose kernel is spacelike (the quadratic form positive on every nonzero vector of the kernel). One hypothesis appears: n at least one.

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