§4, proof of Theorem (4.5), second claim — (4.6) satisfies equations (3.1)
ProvedJacksonJobshop.Equilibrium.product_form_satisfies_balanceLet be a jobshop-like queueing system satisfying Assumptions (2.1)–(2.4), and let be the function (4.6). Then is a constant solution of the balance equations (3.1): for every state vector ,
with the conventions of (3.1): sums over , terms whose state argument has a negative component omitted.
This is the second verification the paper names as the proof of Theorem (4.5), and the substantive one.
Formalization Note The paper prints as the arrival-outflow coefficient in (3.1); this is inconsistent with its own transition probabilities on p. 134 whenever , and we use , which is the equation those transition probabilities give. With the printed coefficient the claim is false (e.g. , , , constant rates, at ). The statement carries no hypothesis on : the equations are linear in .
import Mathlib import Definitions.Def_JacksonJobshop_Equilibrium_System
namespace JacksonJobshop.Equilibrium
/-- Jackson (1963), p. 136, second claim of the proof sentence before Theorem (4.5): the
function (4.6) `p(k) = π w(k) W(S(k))` satisfies the stationary equations (3.1) (with the
arrival-outflow coefficient `λ(S(k)) Σ_n r(0, n)`) at every state vector. -/
theorem product_form_satisfies_balance {N : ℕ} (sys : JobshopSystem N) :
∀ k, Balance sys (productForm sys) k := by sorry
end JacksonJobshop.Equilibrium
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Setting. Take any and any jobshop system with centers. Its assumptions are:
- ;
- for all , or is positive up to some and zero after it;
- and for ;
- has non-negative entries, and each row sums to (index is the source, index is the exit);
- is the unique solution of .
The function . Let , where
, and if the series is summable and otherwise, with .
Claim. At every state the following equation holds ( is the -th unit vector):
The claim asserts only these equations. It does not assert that is non-negative, summable, or normalised.
Degenerate cases. There is no hypothesis on . If is not summable, then , so and every equation reads . At , the terms with or are absent. The natural-number subtractions only appear in terms where they do not truncate.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.