Browkin–Brzeziński Theorem 1 ()
OpenNConjecture.bb94_theorem_1Browkin–Brzeziński's Theorem 1 (p. 933): "For every , ." Thus the conjectured exponent cannot be lowered. In -form, for every and every there are infinitely many admissible -tuples whose quality exceeds :
The source proves this by taking in Lemma 1 and substituting to obtain a vanishing sum of terms (equation (7)); choosing , makes only the first summand positive, so no proper subsum vanishes and the gcd is , while and as .
Formalization Note. admissible, (Finset.sup of ) and (Brocard.radical of ) are as in NConjecture_Defs. The strict inequality is equivalent to since ; "infinitely many" is Set.Infinite, which is exactly .
import Mathlib import Definitions.Def_NConjecture_Defs
namespace NConjecture
theorem bb94_theorem_1 (n : ℕ) (hn : 3 ≤ n) (ε : ℝ) (hε : 0 < ε) :
Set.Infinite {a : Fin n → ℤ | admissible n a ∧
(Brocard.radical (∏ i, (a i).natAbs) : ℝ) ^ (2 * (n : ℝ) - 5 - ε) <
((Finset.univ.sup (fun i => (a i).natAbs) : ℕ) : ℝ)} := 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
bb94_theorem_1 (n : ℕ) (hn : 3 ≤ n) (ε : ℝ) (hε : 0 < ε). For every natural number with and every real with , the following set of integer -tuples is infinite:
Unfolding admissible: the entries sum to , the setwise gcd of the is , and no nonempty proper subsum is . The inequality casts both sides to : the left side is (product of distinct prime factors of ) raised to the real power (with cast to ); the right side is (computed as Finset.sup of the natural absolute values over the whole index set). For , ; the exponent may be negative when .