Corollary 3.11, p. 9 — with two net payers and two net payees, no star is cost-minimizing
ProvedLNTopology.Local.corollary_3_11Let be a channel cost function satisfying (MO), (SY), (CI) and (SA), and let be a payment flow on a finite node set with . Suppose there are distinct nodes and distinct nodes with
Then for every hub , the star with hub (each node joined only to , by a channel carrying its own net flow) is not cost-minimizing for .
The star topology is the natural guess for a globally cheapest network; this corollary of Theorem 3.1 shows it is cost-minimizing only when there is a single net payer or a single net payee.
Formalization Note The hypothesis (p. 4: "the sum of all the flows is 0") is stated because no network is given: it is what makes the star support . Under the row-sum convention a node with is a net payer; the statement is symmetric under , so the paper's opposite sign convention gives the same theorem. (SA) is used in the corrected form for all (the printed range is unsatisfiable). Cost-minimizing compares with networks on the same node set.
import Mathlib import Definitions.Def_LNTopology_Local_Model import Definitions.Def_LNTopology_Local_Star
namespace LNTopology.Local
/-- Corollary 3.11 (SSRN 4439190, p. 9; proof p. 13): if the flow `f` (summing to zero) has two
distinct nodes with positive flow and two distinct nodes with negative flow, then no star
network, whatever its hub, is cost-minimizing for `f`. -/
theorem corollary_3_11 {V : Type*} [Fintype V] [DecidableEq V] (c : ℝ → ℝ)
(hc : IsChannelCost c) (f : V → ℝ) (hsum : ∑ i, f i = 0)
(i₁ i₂ j₁ j₂ : V) (hi : i₁ ≠ i₂) (hj : j₁ ≠ j₂)
(hi₁ : 0 < f i₁) (hi₂ : 0 < f i₂) (hj₁ : f j₁ < 0) (hj₂ : f j₂ < 0) :
∀ h : V, ¬ IsCostMinimizing c f (star f h) := by sorry
end LNTopology.Local
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.