Proposition 8.4 — validity of both mixing inequalities
ProvedPochetWolsey.Mixing.mixing_cuts_validLet and let be a nonempty coordinate subset with an enumeration such that , where and . Every satisfies both inequalities
These are companion validity results on the same mixing model.
Formalization Note An injective map from Fin (t+1) enumerates the nonempty subset, with weak monotonicity preserving ties. Nonemptiness is implicit in the printed use of first and last elements. The bounds follow from the definition of fractional part and are not additional assumptions. The singleton case is included.
import Mathlib import Definitions.Def_PochetWolsey_Mixing_Cuts
namespace PochetWolsey.Mixing
theorem mixing_cuts_valid {K t : ℕ} (b : Fin K → ℝ)
(i : Fin (t + 1) → Fin K) (hi : Function.Injective i)
(horder : Monotone (fun j => frac (b (i j)))) :
∀ p ∈ mixingSet b, cutRhs b i p.2 ≤ p.1 ∧ wrapCutRhs b i p.2 ≤ p.1 := by sorry
end PochetWolsey.Mixing
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Inputs and hypotheses.
- Natural numbers .
- .
- A map that is injective.
- The values are nondecreasing: .
Conclusion. Every in
satisfies both and . Written out with , these two inequalities are
and
Degenerate cases.
- Injectivity forces .
- If , no such exists and the statement is vacuous.
- If , monotonicity is automatic and the sum is empty. The claims become:
- ;
- .
- If every (all selected integers), the first inequality reads . The second reads .
There are no junk values.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.