The case implies the abc conjecture
OpenNConjecture.n_conjecture_implies_abcThe -conjecture at is exactly the abc conjecture (Browkin–Brzeziński, §1; Hölzl–Kleine–Stephan, §1: " is equivalent with the abc-conjecture"). This lemma records the implication: assuming conjAt 3 — for every a constant bounds every admissible triple by — one recovers the standard Masser–Oesterlé abc statement: for every there is such that all positive pairwise-coprime satisfy
The proof sends a positive coprime triple to the admissible integer triple , notes and , and enlarges to to make the inequality strict.
Formalization Note. The conclusion is verbatim the statement of the platform theorem abc_conjecture_strong, so this lemma literally specializes the mission goal to that theorem.
import Mathlib import Definitions.Def_NConjecture_Defs
namespace NConjecture
theorem n_conjecture_implies_abc (h : conjAt 3) (ε : ℝ) (hε : 0 < ε) :
∃ K : ℝ, 0 < K ∧
∀ a b c : ℕ, 0 < a → 0 < b → 0 < c →
Nat.Coprime a b → Nat.Coprime b c → Nat.Coprime a c →
a + b = c →
(c : ℝ) < K * (∏ p ∈ (a * b * c).primeFactors, (p : ℝ)) ^ (1 + ε) := 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
n_conjecture_implies_abc (h : conjAt 3) (ε : ℝ) (hε : 0 < ε). Assume conjAt 3, i.e. (unfolding) for every real there is such that every admissible integer triple satisfies , where admissible means sum , setwise gcd of absolute values , and no nonempty proper subsum . The conclusion is: for the given real there exists a real such that for all natural numbers with , , , pairwise coprime (), and ,
the product of the distinct prime factors of cast to and raised to . The hypothesis conjAt 3 is assumed, not established here.