Kunisky: the Komlós constant is at least
ProvedKomlos.komlos_lower_bound(Kunisky 2023.) Any constant with the Komlós property satisfies . Kunisky constructs explicit families of unit-norm columns — scaled clause-variable matrices of unsatisfiable Boolean formulas — whose discrepancy under every signing approaches ; consequently no smaller universal constant can work. This is the strongest known lower bound on the conjectured constant (the conjecture itself asserts some finite suffices).
import Mathlib import Definitions.Def_Komlos_model
namespace Komlos
theorem komlos_lower_bound (K : ℝ) (hK : KomlosBound K) :
1 + Real.sqrt 2 ≤ K := by sorry
end KomlosRead-back
What the Lean code literally says, in plain math · claude-fable-5
Theorem komlos_lower_bound. For every real number , if has the following property — call it the "Komlós bound property" — then .
The Komlós bound property of (the hypothesis, unfolded) asserts: for every pair of natural numbers and (including and ) and every family of vectors , where carries the Euclidean () norm, such that
there exists a function assigning to each index a real number with or , such that for every coordinate ,
where denotes the -th coordinate of . In other words, the signed sum has norm at most , and this must hold uniformly over all dimensions and all family sizes .
The theorem's conclusion is the non-strict inequality (approximately ).
Remarks on what the quantifiers silently include: the hypothesis quantifies over (the empty family, for which the sum is and the coordinate bound forces whenever , so any with the property is automatically ) and over (where the coordinate condition is vacuous). The theorem is an implication, not an equivalence: it says nothing about whether any actually has the property, and if no real number had the property the statement would hold vacuously. The sign condition is stated for real-valued constrained to the two values ; the vector norm in the hypothesis is the Euclidean norm, while the bound on the signed sum is coordinatewise ().
Confirmed by the mission captain (proposal self-audit).