Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1: a network is rationalizable as pairwise stable with kkk-anonymous preferences iff it satisfies kkk-WARPS

Proved
ProcNetStab.theorem_1

by iris · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

graph-theorynetwork-formationp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1pairwise-stabilityrevealed-preference

Let VVV be a set of agents, each with a type given by L:V→TL : V \to TL:V→T, let ggg be the observed network on VVV, and let k∈Nk \in \mathbb Nk∈N. Then ggg is rationalizable as pairwise stable with preferences that satisfy kkk-anonymity if and only if ggg satisfies kkk-WARPS:

∃ (⪰a)a∈V weak orders on networks, k-anonymous, with g pairwise stable  ⟺  g satisfies k-WARPS.\exists\, (\succeq_a)_{a \in V} \text{ weak orders on networks},\ k\text{-anonymous, with } g \text{ pairwise stable} \iff g \text{ satisfies } k\text{-WARPS}.∃(⪰a​)a∈V​ weak orders on networks, k-anonymous, with g pairwise stable⟺g satisfies k-WARPS.

Here kkk-WARPS says that for all agents i,ji, ji,j there is no non-link i′j′∉gi'j' \notin gi′j′∈/g with (i,g)≃k(i′,g+i′j′)(i, g) \simeq_k (i', g + i'j')(i,g)≃k​(i′,g+i′j′) and (j,g)≃k(j′,g+i′j′)(j, g) \simeq_k (j', g + i'j')(j,g)≃k​(j′,g+i′j′), where ≃k\simeq_k≃k​ is rooted, type-preserving isomorphism of kkk-neighborhoods in networks adjacent to ggg.

This is the paper's main result: it characterizes the testable content of pairwise stability under the assumption that agents with the same local network position have the same incentives to form links, and it turns that content into a check on the observed network alone.

Differences from the source:

  • generalization: node set N = {1,...,n} and a finite set T of types → arbitrary node type V, arbitrary type space T and type map L : V → T; reason: the finite case is an instance; T = Unit is the untyped Definition 3.4
  • reading: g − ij, introduced only as removing a link (p.6), used for all agents in Definitions 3.1 and 3.9 → edge deletion h.deleteEdges {s(i,j)}, a no-op when ij ∉ h, with j ranging over all nodes; reason: literal notation; under it the theorem holds for every k, while restricting Definition 3.9 to ij ∈ h makes Theorem 1 false at k = 0 (two nodes, g empty: rationalizable but not 0-WARPS)
  • reading: k-WARPS: "for all pairs of nodes i and j in the network" → i and j arbitrary nodes, not required to be linked or distinct; reason: Definition A.4 and the proof of Lemma 1 use no link ij; restricting to linked or distinct pairs makes Theorem 1 false (n = 5, k = 1, g = {01, 03, 24}, i = j = 0, i′j′ = 12)
  • reading: Definition 3.9 with networks g, g′ → g, g′ of Definition 3.9 are universally quantified networks h, h′; the observed g enters only through the adjacency clause of ≃k; reason: Definition 3.9 binds g, g′; the proof of Lemma 1 applies it with h′ = g + i′j′
  • encoding: networks (N,E), k-neighborhoods, preference relations ⪰_i ⊂ G × G → SimpleGraph V, the k-ball via the extended distance edist and the induced subgraph, relations pref a x y read as x ⪰_a y; reason: Lean conventions; same instances
Preamble
import Mathlib
import Definitions.Def_ProcNetStab_Rationalizable
import Definitions.Def_ProcNetStab_KWARPS
Formal statement
namespace ProcNetStab

/-- **Theorem 1** (Chiong, Qi, *Stability of Procurement Networks* (authors' manuscript, 2025),
Theorem 1, p.15): an observed network `g` is rationalizable as pairwise stable with preferences
that satisfy `k`-anonymity if and only if `g` satisfies `k`-WARPS.

**Formalization Note** Stated for every `k ∈ ℕ` (including `k = 0`), every observed network `g`,
every node type `V`, type space `T` and type map `L` (`T = Unit` gives untyped networks). `g − ij`
is edge deletion, a no-op when `ij ∉ g`; the `k`-ball uses the extended distance `edist`;
preferences are relations on all networks on `V`. -/
theorem theorem_1 {V T : Type*} (L : V → T) (g : SimpleGraph V) (k : ℕ) :
    Rationalizable L g k ↔ KWARPS L g k := by sorry

end ProcNetStab
Source
Chiong, Qi, Stability of Procurement Networks (authors' manuscript, 2025), Theorem 1, p.15
Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 1, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me