pub fn check_minimize_claim(claim: &MinimizeClaim) -> boolExpand description
Judge a minimize claim by THEOREM, not trust: for symmetric Q with spectrum ≥ μ > 0
(verified against the exact Gershgorin row bound, which this checker recomputes itself),
strong convexity gives f(x̂) − f* ≤ ‖∇f(x̂)‖² / (2μ) — the gradient is re-derived with
this crate’s own arithmetic and the inequality checked exactly. Fail-closed throughout.