Failure of abc propagates to every
OpenNConjecture.abc_false_implies_n_falseHölzl–Kleine–Stephan, Theorem 3 (arXiv:2409.13439v2, p. 2), attributed there to Browkin–Brzeziński: "If the abc-conjecture is false then the -conjecture is false for every ." Equivalently (contrapositive), the -conjecture at any single implies abc. In -form: if abc fails — some admits arbitrarily large coprime triples with for every — then conjAt n fails for every .
The mechanism (HKS Remark 5(2), Browkin–Brzeziński Remark 2) is the quadruple built from an abc triple: it is admissible and has quality , so quality for abc triples forces quality for quadruples; higher use the analogous identities.
Formalization Note. The hypothesis is the negation of the full platform abc statement abc_conjecture_strong; the conclusion is ¬ conjAt n. The statement is the -rendering of HKS Theorem 3 (the source phrases it via , equivalent to conjAt n given the proved lower bound).
import Mathlib import Definitions.Def_NConjecture_Defs
namespace NConjecture
theorem abc_false_implies_n_false (n : ℕ) (hn : 4 ≤ n)
(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 + ε)) :
¬ conjAt n := 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_false_implies_n_false (n : ℕ) (hn : 4 ≤ n) (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+ε)) : ¬ conjAt n. For every natural number with , assume the negation of the abc statement: it is not the case that for every real there exists such that all positive pairwise-coprime natural numbers with satisfy (where ). The conclusion is that conjAt n is false, i.e. the -conjecture -bound fails at this : there exists some for which no constant bounds by over all admissible -tuples.