Proposition 12.7 — arbitrary-count setup sequence hull
DisprovedPochetWolsey.Modes.arbitrary_mode_hullLet consist of setup, startup and switch-off triples generated by nonempty lists of distinct items in each period. The last item of each period is the first of the next; indicates membership, membership except the first item, and membership except the last item. Let be the following unit-box extension in :
The continuity equation applies between adjacent periods and all other inequalities in every period. The printed claim is
This asserts an exact projection formula without a bound on the number of distinct items within a period. Finding F2 records a terminal counterexample to the printed system under the ordered-list semantics; the faithful claim is retained for disproof rather than silently repaired.
Formalization Note There are labels, including idle label , and periods, numbered . Thus means one idle label and one period, not empty index sets. The final item is retained as the last setup. No equation is added to the printed right-hand side. Only the diagonal auxiliary coordinates are present.
import Mathlib
namespace PochetWolsey.Modes
theorem arbitrary_mode_hull (m n : ℕ) :
convexHull ℝ ({p : ((Fin (m + 1) → Fin (n + 1) → ℝ) × (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?) ∧ p = ((fun i t => if i ∈ s t then (1 : ℝ) else 0), (fun i t => if i ∈ (s t).tail then (1 : ℝ) else 0), (fun i t => if i ∈ (s t).dropLast then (1 : ℝ) else 0))}) =
{p | ∃ φ : (Fin (m + 1) → Fin (n + 1) → ℝ),
(∀ i, (∀ t, 0 ≤ p.1 i t ∧ p.1 i t ≤ 1)) ∧
(∀ i, (∀ t, 0 ≤ p.2.1 i t ∧ p.2.1 i t ≤ 1)) ∧
(∀ i, (∀ t, 0 ≤ p.2.2 i t ∧ p.2.2 i t ≤ 1)) ∧
(∀ i, (∀ t, 0 ≤ φ i t ∧ φ i t ≤ 1)) ∧
(∀ t, ∑ j, (p.1 j t - p.2.1 j t) = 1) ∧
(∀ i (t : Fin n), p.1 i t.succ - p.2.1 i t.succ =
p.1 i t.castSucc - p.2.2 i t.castSucc) ∧
(∀ i t, p.1 i t - p.2.1 i t ≥ φ i t) ∧
(∀ i t, p.1 i t - p.2.2 i t ≥ φ i t) ∧
(∀ i t, φ i t ≥ p.1 i t - p.2.1 i t - p.2.2 i t) ∧
(∀ i t, p.1 i t + ∑ j ∈ Finset.univ.erase i, φ j t ≤ 1)} := by sorry
end PochetWolsey.Modes
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
For natural numbers and , write for a set of indices (call them modes) and for a set of indices (call them periods). There are no other hypotheses: the statement is claimed for every pair . Points live in the real vector space
and a point is written with real entries , , for , .
The generating set . A point belongs to exactly when there is a choice of a finite list of modes for each period satisfying all of the following:
- Each is nonempty and has no repeated entries.
- For every , the last entry of equals the first entry of .
- For all and , the coordinates are the indicators
Here is without its first entry, and is without its last entry.
Because entries are distinct, three consequences follow:
- iff appears in and is not its first entry.
- iff appears in and is not its last entry.
- If has a single entry, then .
Only the set of entries, the first entry and the last entry of each list affect the point. The order of the middle entries does not. Since and are finite and lists have no repeats, is a finite set of points.
The claim. The convex hull of over (the set of all finite convex combinations of points of , with no closure taken) is equal, as a set, to the set defined below. Equality means both inclusions hold.
The set . A point belongs to exactly when there exists an auxiliary array satisfying all of the following. The array is existentially quantified and is not part of the point.
- Bounds. For all :
- Per-period sum. For every :
- Linking consecutive periods. For every and every :
- Upper bounds on . For all :
- Lower bound on . For all :
- Packing. For all :
Degenerate cases. No division, natural-number subtraction, integrals or suprema occur, so no default or junk values arise. All sums are over finite index sets, and all inequalities are non-strict.
- (one mode). Every list must be the one-element list . So is the single point with and , and the convex hull is that one point. In , the sum in constraint 6 is empty, so constraint 6 reduces to . Constraint 2 reads .
- (one period). Constraint 3 and the first-equals-last condition on lists are vacuous. consists of the indicator triples of single nonempty repetition-free lists .
- . Both reductions above apply together. The statement asserts that the convex hull of the single point equals the set of that satisfy constraints 1–6 for some , with constraint 3 vacuous and the sum in constraint 6 empty.
The statement asserts equality of these two sets in every one of these cases, exactly as written.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.