Spencer's six-deviations bound in the trivial range
ProvedKomlos.spencer_six_deviations_smallSpencer's theorem in the trivial range .
Spencer's "six standard deviations suffice" theorem states that for any matrix with entries in there exist signs with
This statement restricts the claim to , where it holds for a soft reason and requires none of Spencer's partial-colouring machinery. Every row sum of a -matrix under the all-ones colouring lies in , so the discrepancy of that colouring is at most ; and precisely when . The threshold is sharp for this argument: at the two bounds coincide (), and for the trivial colouring no longer suffices, which is exactly where the real content of Spencer's theorem begins.
It is recorded separately because any proof of the general theorem by induction, by dimension reduction, or by the entropy method needs a base range in which the conclusion is available for free, and because it fixes the arithmetic of the constant against the statement.
import Mathlib import Definitions.Def_Komlos_model
namespace Komlos
theorem spencer_six_deviations_small (n : ℕ) (hn : n ≤ 36) (A : Fin n → Fin n → ℝ)
(h01 : ∀ i j, A i j = 0 ∨ A i j = 1) :
∃ ε : Fin n → ℝ, IsSignVector ε ∧
∀ i, |∑ j, A i j * ε j| ≤ 6 * Real.sqrt n := by sorry
end Komlos