two_facility_max_cost
def
Given a finite and nonempty set of agents ι, a metric space X, agent positions x, approval preferences p, and facility locations c, the max cost of c is the finite maximum over all agents i ∈ ι of two_facility_cost x p i c.
Statement
noncomputable def two_facility_max_cost {ι X : Type*} [Fintype ι] [Nonempty ι] [MetricSpace X] (x : ι → X) (p : ι → Fin 2 → Bool) (c : Fin 2 → X) : ℝ
- Defined in
- scout/2610-18006-truthful-two-facility-location-with-candidate-locations-in.md:188
- Verified
- 23 Oct 2026
- Axioms
- none listed
- Built on 1
- two_facility_costcost_i(c) = sum over j in {F_1, F_2} of p_ij * d(x_i, c_j).
- Used by 9
- TwoFacilityUniversalMechanismHasApproxRatioGiven types ι, X, and K with DecidableEq ι, Fintype ι, Nonempty ι, MetricSpace X, Fintype K, and Nonempty K, candidate set C : Finset X,…
- two_facility_universal_expected_max_cost_nonnegFor any universally strategyproof two-facility mechanism M with finite nonempty index type K on a finite nonempty agent set ι in a metric…
- two_facility_cost_le_max_costFor a finite nonempty set of agents, every agent i incurs individual cost under solution c that is at most the max cost of c.
- two_facility_universal_expected_max_costGiven types ι, X, and K with DecidableEq ι, Fintype ι, Nonempty ι, MetricSpace X, Fintype K, and Nonempty K, a candidate set C : Finset X,…
- fixed_dictator_max_cost_le_of_doubletonIn the two-facility location problem on a general metric space with candidate set C and a finite nonempty set of agents, if an agent i…
- fixed_dictator_max_cost_leOn general metric spaces, in the two-facility location problem with candidate locations C and a finite nonempty set of n ≥ 2 agents with…
- two_facility_max_cost_nonnegFor a finite nonempty set of agents, the max cost of any two-facility solution is nonnegative.
- fixed_dictator_max_cost_le_of_singletonsIn the two-facility location problem on a metric space with a finite nonempty set of agents, if no agent approves both facilities, agent i…
- fixed_dictator_max_cost_le_of_one_approvedIn the two-facility location problem on a general metric space with candidate set C and a finite nonempty set of agents, if no agent…
Read back from the Lean
A definition of the maximum two-facility cost: given types ι and X with [Fintype ι], [Nonempty ι], and [MetricSpace X], a configuration of points x : ι → X, an assignment indicator p : ι → Fin 2 → Bool, and facility locations c : Fin 2 → X, two_facility_max_cost x p c is the maximum (via Finset.sup') over all i : ι of two_facility_cost x p i c.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The maximum individual cost among all agents for a two-facility solution c. -/ noncomputable def two_facility_max_cost {ι X : Type*} [Fintype ι] [Nonempty ι] [MetricSpace X] (x : ι → X) (p : ι → Fin 2 → Bool) (c : Fin 2 → X) : ℝ := Finset.univ.sup' Finset.univ_nonempty (fun i => two_facility_cost x p i c)