Hall's conjecture
HallIneqdef
def HallIneq (C : ℝ) (e : ℝ) : Prop :=
∀ x y : ℤ, y ^ 2 ≠ x ^ 3 → |y ^ 2 - x ^ 3| > C * (|x| : ℝ) ^ eHallConjectureExpdef
def HallConjectureExp (e : ℝ) : Prop := ∃ C : ℝ, C > 0 ∧ HallIneq C ehall_conjecturetheorem
Original Hall's conjecture with exponent .
theorem hall_conjecture : HallConjectureExp 2⁻¹ := by
sorryelkies_boundtheorem
Elkies' example shows that such must be less than . Note that simple linarith does not work here.
theorem elkies_bound (C : ℝ) : HallIneq C 2⁻¹ → C < 0.0215 := by
intro h
by_cases hC : C ≤ 0
· linarith
· rw [HallIneq] at h
specialize h 5853886516781223 447884928428402042307918
simp at h
have h1 : 76510695 < (5853886516781223 : ℝ) ^ (2 : ℝ)⁻¹ := by
norm_num
rw [← sqrt_eq_rpow]
refine lt_sqrt_of_sq_lt ?_
norm_num
have h2 : C * 76510695 < 1641843 := by
nlinarith
linarithdanilovtheorem
Danilov proved that one cannot replace the exponent with larger number. In other words, for any , there is no positive constant such that for all integers with .
theorem danilov (δ : ℝ) (h : δ > 0) : ¬ HallConjectureExp (2⁻¹ + δ) := by sorryweak_hall_conjecturetheorem
Weak form of Hall's conjecture: relax the exponent from to .
theorem weak_hall_conjecture (ε : ℝ) (hε : ε > 0) : HallConjectureExp (2⁻¹ - ε) := by
sorrygoaldef
Original Hall's conjecture with exponent .
def goal : Prop :=
HallConjectureExp 2⁻¹From Mathlib
import Conjectura.Problems.WP0016.Statement · maintainer — open · raw source
Adapted for Conjectura from formal-conjectures (Google DeepMind), `Wikipedia/Hall.lean`. The problem is catalogued at https://en.wikipedia.org/wiki/Hall%27s_conjecture. LOCKED: solvers cannot modify this file.
Copyright (c) 2025 The Formal Conjectures Authors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: The Formal Conjectures Authors