Proof of Corollary 3.2, p. 10 — a node with an incoming and an outgoing channel makes any network non-cost-minimizing
ProvedLNTopology.Local.in_and_outLet be a channel cost function satisfying (MO), (SY), (CI) and (SA), let be a Lightning Network on a finite node set supporting the flow , and suppose some node has an incoming and an outgoing channel: there are nodes with
Then is not cost-minimizing for : some Lightning Network on supporting has strictly smaller cost.
This is Theorem 3.1 as the paper uses it in the proofs of Corollaries 3.2 and 3.3 and in Appendix C: inside an arbitrary network, where and may already share a channel and other channels are present, a relaying node still makes the network non-optimal.
Formalization Note Nothing is assumed about the rest of , in particular may be nonzero. Node distinctness need not be assumed: and follow from anti-symmetry. (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
namespace LNTopology.Local
/-- The in-and-out claim (proof of Corollary 3.2, SSRN 4439190, p. 10), i.e. Theorem 3.1 inside
an arbitrary network: if a node `v` of a Lightning Network `Λ` supporting `f` has an incoming
channel (`0 < Λ u v`) and an outgoing channel (`0 < Λ v w`), then `Λ` is not cost-minimizing
for `f`. -/
theorem in_and_out {V : Type*} [Fintype V] (c : ℝ → ℝ) (hc : IsChannelCost c)
(f : V → ℝ) (Λ : V → V → ℝ) (hΛ : IsLN Λ) (hsupp : Supports Λ f) (u v w : V)
(huv : 0 < Λ u v) (hvw : 0 < Λ v w) :
¬ IsCostMinimizing c f Λ := by sorry
end LNTopology.Local
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.