Cauchy problem for the Laplace equation with data on a line is ill-posed
ProvedTegmarkDimensionality.elliptic_cauchy_problem_ill_posedThere is a sequence of functions , , such that:
- each solves the Laplace equation on ;
- the Cauchy data on the line tend to zero uniformly: for every there is with and for all and all ;
- off the line the solutions blow up: for every and every there is such that for every some has .
So arbitrarily small changes in the data on the line produce arbitrarily large changes in the solution at any distance from it. An observer in a world with no time dimension (, elliptic field equations) can make no inferences from local data.
Formalization Note The statement is the simplest instance of the paper's claim: the two-dimensional Laplace equation with data on a line.
import Mathlib
namespace TegmarkDimensionality
/-- Initial data on the line `y = 0` for the Laplace equation `u_xx + u_yy = 0` in the plane
is an ill-posed problem: there are smooth solutions `u_k` whose Cauchy data
`u_k(x,0), ∂_y u_k(x,0)` tend to `0` uniformly in `x`, while for every `y ≠ 0` the solutions
`u_k(·, y)` become unbounded (their supremum over `x` tends to infinity). -/
theorem elliptic_cauchy_problem_ill_posed :
∃ u : ℕ → ℝ → ℝ → ℝ,
(∀ k, ContDiff ℝ 2 (fun p : ℝ × ℝ => u k p.1 p.2)) ∧
(∀ k x y, deriv (fun x' => deriv (fun x'' => u k x'' y) x') x +
deriv (fun y' => deriv (fun y'' => u k x y'') y') y = 0) ∧
(∀ ε > 0, ∃ K, ∀ k ≥ K, ∀ x,
|u k x 0| ≤ ε ∧ |deriv (fun y => u k x y) 0| ≤ ε) ∧
(∀ y ≠ 0, ∀ M : ℝ, ∃ K, ∀ k ≥ K, ∃ x, M < |u k x y|) := 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.
The theorem asserts the existence of a family , indexed by natural numbers , of real functions of two real variables such that:
- for each , is twice continuously differentiable on ;
- for all : , with each second derivative computed as an iterated one-variable derivative;
- for every there is such that for all and all real : and ;
- for every real and every real there is such that for all there exists with .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.