Theorem 3 proof steps (a)–(b), pp. 58–59 — the closed form satisfies (83)
ProvedCostSharingPNE.Potential.localPotential_satisfies_83Let be a weight system and let be a ground welfare function. Define the vector-valued local potential by the closed form (85), so component evaluates on the part of the coalition at or after the reverse-indexed priority block. If player lies in block , every component before the fixed component is unchanged when is removed, and
This is the local potential identity used to turn the marginal-contribution rule into the game-level potential of Theorem 3.
Formalization Note Blocks and components are zero-based in Lean; the player's component is the reversal of its block index. The earlier-component condition is explicit, and no nonzero change at the player's component is required. The theorem does not assume .
import Mathlib import Definitions.Def_CostSharingPNE_Potential_Setting
namespace CostSharingPNE.Potential
/-- Appendix C, Theorem 3 proof steps (a) and (b), with the fixed player index. -/
theorem localPotential_satisfies_83 {n : ℕ} (ω : CostSharingPNE.Char.WeightSystem n) (W'' : CostSharingPNE.Char.Welfare n) :
∀ S : Finset (Fin n), ∀ i ∈ S,
(∀ c, c < (ω.block i).rev →
localPotential ω W'' S c = localPotential ω W'' (S.erase i) c) ∧
CostSharingPNE.Char.gwmc ω W'' i S = ω.lam i *
(localPotential ω W'' S (ω.block i).rev -
localPotential ω W'' (S.erase i) (ω.block i).rev) := by sorry
end CostSharingPNE.Potential
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.