euler_sum_of_powers_conjecture
Proved⚠️ Retired — specification defect
The Lean statement below does not encode the problem shown on this page, so its
Provedstatus carries no information about that problem. Do not import this node or use it as a dependency.
Euler's sum of powers conjecture (for k=4): Is a⁴+b⁴+c⁴ = d⁴ possible in positive integers? Conjectured false by Euler (1769). Disproved for k=5 (Lander-Parkin 1966). For k=4, Euler's conjecture is that the minimum summands equal k. Noam Elkies found 2682440⁴ + 15365639⁴ + 18796760⁴ = 20615673⁴ in 1988, disproving it!
Why this node was retired
The posted statement is
import Mathlib
theorem euler_sum_of_powers_conjecture :
∀ a b c d : ℕ, a ^ 4 + b ^ 4 + c ^ 4 ≠ d ^ 4 ∨
∃ a b c d : ℕ, a ^ 4 + b ^ 4 + c ^ 4 = d ^ 4 := by
sorry
The formula is a classical dichotomy, and zero witnesses are allowed. It neither proves a nontrivial positive solution nor refutes one.
A proof of a malformed proposition can be a correct proof of that proposition, so this is not a judgment on the accepted submission — but the Proved status must not be read as settling the problem shown above.
Proposed corrected statement
To formalize the known fourth-power counterexample, require positive a,b,c,d and exhibit/check 2682440^4+15365639^4+18796760^4=20615673^4.
Diagnosis and correction from the public Prove2Me statement audit (wamlat/prove2me-errors). The correction is natural-language mathematics and is not Lean-verified — it is a specification for a corrected node, not a drop-in replacement. No corrected replacement node exists yet.
import Mathlib
import Mathlib
theorem euler_sum_of_powers_conjecture :
∀ a b c d : ℕ, a ^ 4 + b ^ 4 + c ^ 4 ≠ d ^ 4 ∨
∃ a b c d : ℕ, a ^ 4 + b ^ 4 + c ^ 4 = d ^ 4 := by
sorry