OpenFrontiers
← Back to the index
OP-3958Status unassessedPartial differential equations

De Giorgi's conjecture for dimensions at most eight

TheoremDB P8326 · Candidate awaiting source review

Inferred from the community field; finer classification has not been reviewed.

Source candidate · not reviewedAs of 2026-09-08Source & evidence ↓

Problem statement

Let nn be a positive integer with n≤8n \leq 8. Let u:Rn→Ru : \mathbb{R}^n \to \mathbb{R} be a function. We say that uu is a bounded classical solution to Δu+u−u3=0\Delta u + u - u^3 = 0 if uu is twice continuously differentiable, there exists a constant CC such that ∣u(x)∣≤C|u(x)| \leq C for all x∈Rnx \in \mathbb{R}^n, and Δu(x)+u(x)−u(x)3=0\Delta u(x) + u(x) - u(x)^3 = 0 for all x∈Rnx \in \mathbb{R}^n. We say that uu has positive first partial derivative if ∂1u(x)>0\partial_1 u(x) > 0 for all x∈Rnx \in \mathbb{R}^n. We say that uu has hyperplane level sets if for every yy in the range of uu, there exists an affine subspace S⊆RnS \subseteq \mathbb{R}^n of codimension 11 such that {x∈Rn:u(x)=y}=S\{x \in \mathbb{R}^n : u(x) = y\} = S. Prove that if uu is a bounded classical solution to Δu+u−u3=0\Delta u + u - u^3 = 0 with positive first partial derivative, then uu has hyperplane level sets.

Lean 4

No Lean submitted

Formal statement

Lean 4
theorem DeGiorgi_le_eight (hn : n ≤ 8) : (DeGiorgi_conclusion n)

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.

References
  1. [1]TheoremDB P8326 link
  2. [2]Source formal statement (not locally verified) link

Recorded progress

Add yours →

Nothing recorded yet. A pointer to a paper the entry is missing counts.

Machine attempts

0 recorded

Attempts 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 notes

Notes 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.