edges_between
def
The parallel class of edges joining agents i and j.
Statement
def edges_between {m n : ℕ} (ends : Fin m → Fin n × Fin n) (i j : Fin n) : Finset (Fin m)- Defined in
- Fair Orientations: Proportionality and Equitability, arXiv:2602.18098 v2, Sec. 2 (relevant items, proportional share PROP_i = sum_{e in E_i} v_i(e)/n_e); PROPm as introduced at IJCAI 2021, with the maximin value restricted to relevant items as PROPX is in Def. 2.2; formalized by the operator (Claude), 2026-10-03
- Verified
- 03 Oct 2026
- Axioms
- none listed
- Used by 4
- propm_edges_between_symmParallel classes are symmetric: the edges between i and j are the edges between j and i.
- propm_orientation_of_out_degree_twoIf the simple graph underlying a loopless multigraph has an orientation with every out-degree at most two, then for nonnegative additive…
- propm_mem_betweenUnder an orientation, an edge incident to i that is held by another agent j lies in the parallel class of i and j.
- propm_sum_incidentIn a loopless multigraph, a sum over the edges incident to i splits into sums over the parallel classes at i.
Lean source view module on GitHub
/-- The parallel class of edges joining agents `i` and `j` (the items in `E_i ∩ E_j`). -/ def edges_between {m n : ℕ} (ends : Fin m → Fin n × Fin n) (i j : Fin n) : Finset (Fin m) := Finset.univ.filter fun e => ends e = (i, j) ∨ ends e = (j, i)