Proposition 12.5 — two-setup sequence characterization
ProvedPochetWolsey.Modes.two_mode_binaryLet consist of setup/startup pairs generated by nonempty repetition-free lists of at most two labels per period, with the last label of one period first in the next. It equals the binary constraint set
where the last two inequalities apply between adjacent periods. This is an equality of discrete feasible sets, not a convex-hull assertion.
Formalization Note There are labels, including idle label , and periods, numbered . Thus means one idle label and one period, not empty index sets. The initial setup is unrestricted. Eliminating its one-hot value with zero initial startup leaves the displayed first-period conditions; no terminal continuation is prescribed.
import Mathlib
namespace PochetWolsey.Modes
theorem two_mode_binary (m n : ℕ) :
{p : (Fin (m + 1) → Fin (n + 1) → ℝ) × (Fin (m + 1) → Fin (n + 1) → ℝ) | ∃ s : Fin (n + 1) → List (Fin (m + 1)),
(∀ t, s t ≠ [] ∧ (s t).Nodup) ∧
(∀ t : Fin n, (s t.castSucc).getLast? = (s t.succ).head?) ∧ (∀ t, (s t).length ≤ 2) ∧ p = ((fun i t => if i ∈ s t then (1 : ℝ) else 0), (fun i t => if i ∈ (s t).tail then (1 : ℝ) else 0))} =
{p | (∀ i, (∀ t, p.1 i t = 0 ∨ p.1 i t = 1)) ∧ (∀ i, (∀ t, p.2 i t = 0 ∨ p.2 i t = 1)) ∧
(∀ t, ∑ i, (p.1 i t - p.2 i t) = 1) ∧
(∀ t, ∑ i, p.2 i t ≤ 1) ∧
(∀ i t, p.2 i t ≤ p.1 i t) ∧
(∀ i (t : Fin n), p.2 i t.succ ≥ p.1 i t.succ - p.1 i t.castSucc) ∧
(∀ i (t : Fin n), p.2 i t.succ + p.2 i t.castSucc ≤ p.1 i t.succ)} := by sorry
end PochetWolsey.Modes
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
For every pair of natural numbers , this theorem asserts an equality of two sets of pairs of real arrays. Both arrays are indexed by an item and a period . The claim is a plain set equality, not a convex-hull statement.
The left-hand side. It is the set of pairs for which there exists an assignment of a finite list of items to each period satisfying all of the following.
- Each is nonempty and has no repeated entries.
- For each , the last entry of equals the first entry of .
- Each has length at most .
- if occurs in , and otherwise.
- if occurs in after removing its first entry, and otherwise.
Given conditions 1 and 3, the list is either:
- , which gives ; or
- with , which gives and all other entries of equal to .
The right-hand side. It is the set of pairs such that:
- every and every is or ;
- for every period :
- for all : ;
- for all and every :
No inequality bounds from below in terms of . Period enters the transition inequalities only as the earlier period.
Claim. The theorem asserts that the left-hand set equals the right-hand set, with both inclusions.
Degenerate cases.
- . There is a single period, and every transition condition on both sides is vacuous.
- The left side is the set of indicator pairs of a single list of one item or of two distinct items.
- The right side is the set of binary pairs satisfying the three per-period conditions.
- . The only admissible list is , so the left side is the single point , . On the right side, with binary entries forces the same values.
- Sums over items are never empty.
- No junk values. No default-valued operation occurs.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.