Bounds on
ProvedSaglamGV.sMinus_boundscoding-theorygilbert-varshamov-boundlinear-codesp2o-gran-per-chapterp2o-plan-paperp2o-v1
The function satisfies
Applied with and , these split into a third-moment term and a tail term.
Differences from the source: none.
Preamble
import Mathlib import Definitions.Def_SaglamGV_Analytic
Formal statement
namespace SaglamGV
/-- Bounds on $s(z) = \sinh z − z$ (M. Saglam, *Linear codes exceeding the Gilbert–Varshamov bound*, STOC 2027 submission manuscript (held version, sha256 ac6f2bba…), §3.3, p.4: "We shall use s(z) ≤ 0 (z ≤ 0),
s(z) ≤ (sinh 1 − 1)z^3 (0 ≤ z ≤ 1), s(z) ≤ (1/2)e^z (z ≥ 1)"). -/
theorem sMinus_bounds :
(∀ z : ℝ, z ≤ 0 → sMinus z ≤ 0) ∧
(∀ z : ℝ, 0 ≤ z → z ≤ 1 → sMinus z ≤ (Real.sinh 1 - 1) * z ^ 3) ∧
(∀ z : ℝ, 1 ≤ z → sMinus z ≤ 1 / 2 * Real.exp z) := by sorry
end SaglamGV
Source
M. Saglam, Linear codes exceeding the Gilbert–Varshamov bound, STOC 2027 submission manuscript (held version, sha256 ac6f2bba913aa15cfec8dda07a8e9e37b7186e145fef4719cb623dd04d15baa3), §3.3, p.4 (display s(z) ≤ 0 (z ≤ 0), s(z) ≤ (sinh 1 − 1)z³ (0 ≤ z ≤ 1), s(z) ≤ e^z/2 (z ≥ 1))
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.