Proposition 8.1 — simple mixed-integer rounding and hull
ProvedPochetWolsey.Mixing.simple_mir_hullLet , , and . The simple mixed-integer rounding inequality is valid on , and the following system describes its convex hull:
This scalar case provides the rounding constraint underlying the mixing inequalities.
Formalization Note Both parts of Proposition 8.1 are included. The integer variable is unrestricted, the hull is taken in real two-dimensional space, and integral or negative is allowed. When , the rounding inequality is simply .
import Mathlib import Definitions.Def_PochetWolsey_Mixing_Model
namespace PochetWolsey.Mixing
theorem simple_mir_hull (b : ℝ) :
(∀ p ∈ basicSet b, frac b * ((⌈b⌉ : ℝ) - p.2) ≤ p.1) ∧
convexHull ℝ (basicSet b) =
{p : ℝ × ℝ | b ≤ p.1 + p.2 ∧
frac b * (⌈b⌉ : ℝ) ≤ p.1 + frac b * p.2 ∧ 0 ≤ p.1} := by sorry
end PochetWolsey.Mixing
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
For every real number , write and
The theorem asserts two statements.
- Validity. Every satisfies
- Convex hull. The convex hull of in equals
This is the plain convex hull: the set of finite convex combinations, with no closure taken.
Degenerate case: an integer. Then , and the two parts become:
- Part 1 reads .
- Part 2's middle inequality reads , so the claimed hull is .
There are no other hypotheses and no junk values.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.