Sharpness of the abc exponent ()
OpenNConjecture.abc_exponent_sharpBrowkin–Brzeziński (§1, p. 931) observe that the abc exponent is sharp: "it is not difficult to show that there is a limit point of this set which is ," i.e. over coprime triples. In -form this says that for every there are infinitely many coprime positive triples whose quality exceeds :
Here is the product of the distinct primes dividing . An explicit witness family is , whose quality is for every (Ramaekers, §1.1). This is the base case of the sharp lower bound .
Formalization Note. A triple is stored as with ; the radical is Brocard.radical. The strict inequality is equivalent to because .
import Mathlib import Definitions.Def_Brocard_Defs
namespace NConjecture
theorem abc_exponent_sharp (ε : ℝ) (hε : 0 < ε) :
Set.Infinite {t : ℕ × ℕ × ℕ | 0 < t.1 ∧ 0 < t.2.1 ∧ Nat.Coprime t.1 t.2.1 ∧
t.1 + t.2.1 = t.2.2 ∧
(Brocard.radical (t.1 * t.2.1 * t.2.2) : ℝ) ^ (1 - ε) < (t.2.2 : ℝ)} := by sorry
end NConjectureRead-back
What the Lean code literally says, in plain math · GLM (Z.ai), blind code-only pass — NOT an independent sub-agent
abc_exponent_sharp (ε : ℝ) (hε : 0 < ε). For every real with , the following set of triples of natural numbers is infinite:
The triple is stored as with , , . The conditions are: and strictly positive; and coprime (Nat.Coprime); equal to (so follows, not separately assumed); and the real inequality , where is the product of distinct prime factors, cast to , raised to the real power . When the exponent , so holds automatically for every such triple.