Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
25 changes: 25 additions & 0 deletions LeanEval/NumberTheory/Sylvester.lean
Original file line number Diff line number Diff line change
@@ -0,0 +1,25 @@
import Mathlib
import EvalTools.Markers

/-!
# Sylvester's conjecture

Every prime number congruent to 4, 7 or 8 modulo 9 is the sum of two rational cubes.
In fact squares of such primes are also the sum of two rational cubes.
The proof uses Heegner points and Rankin–Selberg L-functions.

## References

* Hongbo Yin. A proof of the 4,7 cases of Sylvester’s conjecture on cube sums. https://arxiv.org/abs/2605.25917
* Ashay Burungale, Ye Tian. A proof of Sylvester's conjecture. https://arxiv.org/abs/2609.14893
* http://arxiv.org/abs/2304.09806 is an earlier but problematic claim, see https://x.com/samit_dasgupta/status/2100283036088606910.
-/

namespace LeanEval.NumberTheory

@[eval_problem]
theorem sylvester (p : ℕ) (h : p.Prime) (h' : p % 9 ∈ ({4, 7, 8} : Set ℕ)) :
(∃ a b : ℚ, p = a ^ 3 + b ^ 3) ∧ (∃ a b : ℚ, p ^ 2 = a ^ 3 + b ^ 3) := by
sorry

end LeanEval.NumberTheory
15 changes: 15 additions & 0 deletions manifests/problems/sylvester.toml
Original file line number Diff line number Diff line change
@@ -0,0 +1,15 @@
id = "sylvester"
title = "Sylvester's conjecture"
group = "formalization-evaluation"
status = "active"
visible = true
statement_revision = 1
tags = []
module = "LeanEval.NumberTheory.Sylvester"
holes = ["sylvester"]
submitter = "Junyan Xu"

[[status_history]]
status = "active"
effective_date = "2026-09-23"
reason = "policy"
Loading