Admissible tuples and the fixed- conjecture
DefinitionNConjecture_DefsFix an integer . This file introduces the two predicates on which the -conjecture mission rests.
An -tuple of integers , represented as a function , is admissible when it satisfies the three Browkin–Brzeziński conditions:
The gcd is taken setwise over the absolute values . The subsum condition ranges over nonempty proper subsets; applied to singletons it forces .
For an admissible tuple put and , where is the product of the distinct prime divisors (the published Brocard.radical). The predicate conjAt n asserts the -conjecture at in -form:
The constant may depend on and . For this is equivalent to ; together with the proved lower bound it yields the conjectured equality .
Formalization Note. The maximum is Finset.sup of the natural absolute values (cast to ); the radical is applied to . Admissibility gives , so all real powers are well defined. The exponent is written in real arithmetic as to avoid natural-number truncation.
import Mathlib
import Definitions.Def_Brocard_Defs
namespace NConjecture
/-- An admissible `n`-tuple of integers for the Browkin–Brzeziński `n`-conjecture
(Browkin–Brzeziński 1994, §2, conditions (i)–(iii)): the entries sum to zero, their
greatest common divisor is `1`, and no nonempty proper subsum vanishes. -/
def admissible (n : ℕ) (a : Fin n → ℤ) : Prop :=
(∑ i, a i = 0) ∧
(Finset.univ.gcd (fun i => (a i).natAbs) = 1) ∧
(∀ s : Finset (Fin n), s.Nonempty → s ≠ Finset.univ → ∑ i ∈ s, a i ≠ 0)
/-- The Browkin–Brzeziński `n`-conjecture for a fixed `n`, in `ε`-form: for every
`ε > 0` there is a constant `C > 0` such that every admissible `n`-tuple satisfies
`max |aᵢ| ≤ C · rad(a₁ ⋯ aₙ) ^ (2n − 5 + ε)`. For `n ≥ 3` this is equivalent to
`limsup Lₙ ≤ 2n − 5`; combined with the proved lower bound `limsup Lₙ ≥ 2n − 5`
(Browkin–Brzeziński Theorem 1) it gives the conjectured equality `limsup Lₙ = 2n − 5`. -/
def conjAt (n : ℕ) : Prop :=
∀ ε : ℝ, 0 < ε → ∃ C : ℝ, 0 < C ∧
∀ a : Fin n → ℤ, admissible n a →
((Finset.univ.sup (fun i => (a i).natAbs) : ℕ) : ℝ) ≤
C * (Brocard.radical (∏ i, (a i).natAbs) : ℝ) ^ (2 * (n : ℝ) - 5 + ε)
end NConjecture
Read-back
What the Lean code literally says, in plain math · GLM (Z.ai), blind code-only pass — NOT an independent sub-agent
admissible (n : ℕ) (a : Fin n → ℤ) : Prop. For a natural number and an -tuple of integers (a function from to ), this is the conjunction of three assertions: (1) ; (2) the greatest common divisor, taken over the entire index set, of the natural absolute values equals ; (3) for every finite subset that is nonempty and not the whole index set, . Edge cases: when the index set is empty, the gcd over an empty set is , so clause (2) reads and admissible 0 a is false; the subsum quantifier is then vacuous. When clause (3) is vacuous (the only nonempty subset is the whole set), clause (1) forces and clause (2) forces , which are incompatible, so admissible 1 a is also false.
conjAt (n : ℕ) : Prop. For a natural number , this asserts: for every real with , there exists a real with such that for every integer -tuple , if admissible n a then
Here the maximum is Finset.sup over the whole index set of the natural numbers (returning on an empty index set), cast to ; is the product of the distinct prime factors of (with by Mathlib's convention); the product is over the whole index set (equal to when empty); and the exponent is computed in with cast to a real. The implication is vacuous for any admitting no admissible tuple.