TEMP compile-check (will be deprecated): n-conjecture definitions
DefinitionNConjecture_Defs_checkpubnumber-theory
Temporary compile-check scaffold used to verify that the Lean statement type-checks in the default environment before drafting the mission proposal. Retired now that verification succeeded; the canonical declaration is published as NConjecture_Defs (definition) within the n-conjecture mission proposal. Do not use this node.
Definition code
import Mathlib
import Definitions.Def_Brocard_Defs
namespace NConjCheck
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)
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 NConjCheck
Source
Browkin-Brzezinski 1994, Math. Comp. 62(206), 931-939, Section 2, p. 933.