De Giorgi's conjecture in dimension four
TheoremDB P8320 · Candidate awaiting source review
Inferred from the community field; finer classification has not been reviewed.
Problem statement
Consider the semilinear elliptic equation on , where denotes the Laplacian. A function is called a bounded classical solution if is twice continuously differentiable, there exists a constant such that for all , and satisfies at every point . A bounded classical solution is said to have positive first partial derivative if for all , meaning the directional derivative in the direction of the first standard basis vector is strictly positive everywhere. The solution is said to have hyperplane level sets if for every value in the range of , there exists an affine subspace of codimension (that is, whose direction has dimension ) such that the level set coincides with . De Giorgi's conjecture asserts that in dimension , every bounded classical solution with positive first partial derivative has hyperplane level sets. For , does this rigidity property hold? In other words, does every bounded classical solution to satisfying everywhere necessarily have hyperplane level sets?
Lean 4
Formal statement
Lean 4theorem DeGiorgi_four : (DeGiorgi_conclusion 4)On-site verification needs an executable Lean target. None is attached yet.
A source attachment or link is not a verified proof. The statement’s correspondence with the original question needs human review.
Proofs & verification
No Lean has been submitted for this problem yet. A Lean file can be attached to a submission for review, though with no target here it cannot be machine-checked.
Progress & source assessment
Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution.
This record is in the source backlog; its novelty and unresolved status have not passed source review.
Recorded progress
Add yours →Nothing recorded yet. A pointer to a paper the entry is missing counts.
Machine attempts
0 recordedAttempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.
No machine attempts recorded.
Sign in to run an attempt. New accounts start with enough credits for ten.
Discussion
0 notesNotes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.
No notes yet.
Sign in to add a note.