Example 2, Case 2, p. 293 (corrected) — at , with the initial set-ups
ProvedKumarSeidman.TwoType.case2_full_cycleConsider the system of Example 2 with positive processing times and positive set-up times . Assume (7), , and the capacity condition (1), and .
Start at from , with machine 1 set up for buffer 4 and machine 2 set up for buffer 3. Let
There is such that for every every clearing trajectory from this state satisfies
and at machine 1 is again set up for buffer 4 and machine 2 for buffer 3.
The situation at is the initial one with the level of buffer 1 multiplied by and shifted by . Since exactly when , iterating this cycle makes grow without bound.
Formalization Note The printed constant (p. 293) lacks the final . Mirroring Stage 8 (buffers , , machines ) from the level gives , which is with the corrected above; an exact simulation of the sample parameters confirms it. The printed is correct. The closed form of is the mirror of the paper's computation of . The paper's is , and " large enough" is rendered as .
import Mathlib import Definitions.Def_KumarSeidman_TwoType_Example2
namespace KumarSeidman.TwoType
open Example2
/-- Example 2, Case 2, full cycle (p. 293, with the printed constant `α` corrected by `− δ₃`):
under (7) and the capacity condition (1), for every large enough `ξ`, every clearing trajectory
from `x(0) = (ξ, 0, 0, 0)` with machine 1 set up for buffer 4 and machine 2 for buffer 3 reaches
at `t₁₇ = t₉ + (t₉ − δ₁ + τ₄⁻¹(δ₃ + δ₄))/(τ₄⁻¹ − 1)` the state `x(t₁₇) = (λξ + α, 0, 0, 0)`,
again with machine 1 set up for buffer 4 and machine 2 for buffer 3. -/
theorem case2_full_cycle (τ₁ τ₂ τ₃ τ₄ δ₁ δ₂ δ₃ δ₄ : ℝ)
(hτ₁ : 0 < τ₁) (hτ₂ : 0 < τ₂) (hτ₃ : 0 < τ₃) (hτ₄ : 0 < τ₄)
(hδ₁ : 0 < δ₁) (hδ₂ : 0 < δ₂) (hδ₃ : 0 < δ₃) (hδ₄ : 0 < δ₄)
(h7 : τ₂ + τ₄ > 1) (h1₁ : τ₁ + τ₄ < 1) (h1₂ : τ₂ + τ₃ < 1) :
∃ ξ₀ : ℝ, ∀ ξ ≥ ξ₀, ∀ T : (example2 τ₁ τ₂ τ₃ τ₄ δ₁ δ₂ δ₃ δ₄).Schedule,
T.IsClearingFrom (levels ξ 0 0 0) (setups b₄ b₃) →
let t₉ := (ξ + τ₂⁻¹ * (δ₁ + δ₂)) / (τ₂⁻¹ - 1)
let t₁₇ := t₉ + (t₉ - δ₁ + τ₄⁻¹ * (δ₃ + δ₄)) / (τ₄⁻¹ - 1)
let lam := τ₂ * τ₄ / ((1 - τ₂) * (1 - τ₄))
let α := ((δ₁ + δ₂) / (1 - τ₂) - δ₁ + (1 / τ₄) * (δ₃ + δ₄)) * ((1 / τ₄) - 1)⁻¹ - δ₃
(∀ b, T.x b t₁₇ = levels (lam * ξ + α) 0 0 0 b) ∧ T.SetupFor m₁ t₁₇ b₄ ∧
T.SetupFor m₂ t₁₇ b₃ := by sorry
end KumarSeidman.TwoType
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.