Proposition 1 (i), p. 9 — the network equilibria form a complete lattice, with a minimal and a maximal equilibrium
ProvedSaturatedNet.Uniqueness.proposition_1_iLet be a network ( entrywise, ) and any exogenous flow, and let be the set of network equilibria . Then , ordered entrywise, is a complete lattice: every subset has
In particular there are a minimal network equilibrium and a maximal network equilibrium in (so is nonempty).
The maximal equilibrium is the comparison point in the proof of Theorem 1, and the existence of an equilibrium of a sub-network is what lets a solution on one class be completed to an equilibrium of the whole network.
Formalization Note. The bounds are taken within : for every the set of upper bounds of lying in has a least element, and the set of lower bounds lying in has a greatest element. is not claimed to be closed under the entrywise supremum of . The recursion (13) mentioned in the preamble of the proposition is not part of item (i) and is not formalized.
import Mathlib import Definitions.Def_SaturatedNet_Uniqueness_Model open Matrix
namespace SaturatedNet.Uniqueness
theorem proposition_1_i {n : Type*} [Fintype n] [DecidableEq n]
(P : Matrix n n ℝ) (hP : ∀ i j, 0 ≤ P i j) (w : n → ℝ) (hw : 0 ≤ w) (c : n → ℝ) :
(∀ S ⊆ equilibria P w c,
(∃ u, IsLeast (upperBounds S ∩ equilibria P w c) u) ∧
(∃ l, IsGreatest (lowerBounds S ∩ equilibria P w c) l)) ∧
(∃ xmin, IsLeast (equilibria P w c) xmin) ∧
(∃ xmax, IsGreatest (equilibria P w c) xmax) := by sorry
end SaturatedNet.Uniqueness
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.