Type of the covariant field equations in an -dimensional spacetime
ProvedTegmarkDimensionality.field_equation_type_by_signatureLet and let be a real symmetric matrix (a spacetime metric at a point) with exactly positive and negative eigenvalues, counted with multiplicity. Then is invertible. The covariant field equations (wave, Klein–Gordon, …) have coefficient matrix , and their type is determined by :
This is the paper's classification of spacetimes by the causal structure of their field equations (Figure 1). Only hyperbolic equations admit well-posed initial-value problems, so this result singles out (and the tachyonic mirror case ).
Formalization Note The eigenvalue counts and the three types are those of the definition tegmark_pde_classification. The metric is taken at a single point and is the matrix inverse.
import Mathlib import Definitions.Def_tegmark_pde_classification
namespace TegmarkDimensionality
/-- In an `(n+m)`-dimensional spacetime whose metric `g` has `m` positive (time-like)
and `n` negative (space-like) eigenvalues, the covariant field equations
`g^{μν} ∂_μ ∂_ν u + (lower order) = 0`, whose coefficient matrix is `g⁻¹`, are elliptic iff
`n = 0` or `m = 0`, hyperbolic iff `n = 1` or `m = 1`, and ultrahyperbolic iff `n ≥ 2` and
`m ≥ 2`. -/
theorem field_equation_type_by_signature (n m : ℕ)
(g : Matrix (Fin (n + m)) (Fin (n + m)) ℝ) (hg : g.IsSymm)
(hpos : numPosEigenvalues g = m) (hneg : numNegEigenvalues g = n) :
(IsElliptic g⁻¹ ↔ (n = 0 ∨ m = 0)) ∧
(IsHyperbolic g⁻¹ ↔ (n = 1 ∨ m = 1)) ∧
(IsUltrahyperbolic g⁻¹ ↔ (2 ≤ n ∧ 2 ≤ m)) := by sorry
end TegmarkDimensionalityRead-back
What the Lean code literally says, in plain math · Aristotle (Harmonic)
NON-BLIND READ-BACK — NOT INDEPENDENT TESTIMONY. This read-back was written by the same agent (Aristotle, by Harmonic) that drafted the Lean statement below, with full knowledge of the source paper and of the intended meaning. It was not produced by a blind, independent auditor, so it may share the drafter's blind spots. Reviewers must not treat it as independent confirmation of faithfulness; compare the Lean code against the source directly.
Let be natural numbers (zero allowed) and let be a real square matrix of size . Assume:
- is symmetric ();
- , the characteristic polynomial of has exactly positive real roots counted with multiplicity;
- , it has exactly negative real roots counted with multiplicity.
Let be the matrix inverse of . By Lean's convention this is the zero matrix if is singular; the hypotheses do not explicitly state invertibility. The theorem asserts three equivalences:
- is elliptic or ;
- is hyperbolic or ;
- is ultrahyperbolic and .
The three types are defined as follows, with . Elliptic: symmetric and ( or ). Hyperbolic: symmetric and (, ) or (, ). Ultrahyperbolic: symmetric, and . Here count positive and negative real roots of the characteristic polynomial with multiplicity.
Edge cases: gives the empty matrix, and the claim then is that it is elliptic, not hyperbolic and not ultrahyperbolic. and fall under both "elliptic" and "hyperbolic".
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.