efx_min_cycle_subset
def
Encode an arbitrary subset of the four goods in old bundle j plus good 12 using four Boolean flags.
Statement
def efx_min_cycle_subset (j : Fin 4) (b : Fin 4 → Bool) : Finset (Fin 13)- Source
- Minimum-cardinality champion-cycle swap obstruction for OP-7, experiments 11442–11449; comparison with arXiv:2002.05119 Section 3.1.
- Verified
- 01 Nov 2026
- Axioms
- none listed
- Built on 1
- efx_min_cycle_goodsFor each target old bundle, list its three goods followed by the unallocated good.
- Used by 5
- efx_nondeg_cycle_no_selfNo agent has an inclusion-minimal self-champion set in the nondegenerate cycle instance.
- efx_min_cycle_subset_completeEvery subset of an old triple plus good 12 has a Boolean-mask encoding.
- efx_min_cycle_two_cycle_classificationEvery inclusion-minimal two-cycle is the pair of agents 0 and 1, with target-0 set {0,1,12} and target-1 set either {3,4,12} or {4,5,12}.…
- efx_min_cycle_no_selfNo source self-champions, even when champion sets are allowed to be arbitrary inclusion-minimal envied subsets.
- efx_nondeg_cycle_classificationThe only inclusion-minimal champion two-cycle in the nondegenerate instance is 0↔1 with the two listed choices of sets.
Lean source view module on GitHub
def efx_min_cycle_subset (j : Fin 4) (b : Fin 4 → Bool) : Finset (Fin 13) := (Finset.univ.filter (fun t : Fin 4 => b t = true)).image (efx_min_cycle_goods j)