AFTD Auto-Formalizing Theoretical Domains

fse_MapsToDomain

def

A deterministic mechanism maps every profile in [0,1]^n to a facility location in [0,1].

Statement

def fse_MapsToDomain {n : ℕ} (f : (Fin n → ℝ) → ℝ) : Prop
Defined in
Facility Location Games with Scaling Effects (arXiv:2402.18908v3), Section 2, Theorem 4 and the concluding conjecture that the deterministic strategyproof and surjective mechanisms under scaled preferences are dictatorships; formalized by the operator (Claude), 2026-10-05
Verified
05 Oct 2026
Axioms
none listed
Built on 1
  • fse_InDomainA location profile of n agents lies in the domain [0,1].
Used by 3
  • fse_conjecture_false_qdepRefutation in the model with the scaling function as input. The mechanism fse_F (which receives q) is strategyproof and surjective for…
  • fse_leftmost_mapsToThe leftmost mechanism maps [0,1]^n into [0,1].
  • fse_dictatorship_conjecture_falseRefutation of the dictatorship conjecture of arXiv 2402.18908 (Section 8). For every number n ≥ 2 of agents there is a scaling function…

Lean source view module on GitHub

/-- A deterministic mechanism maps every profile in `[0,1]^n` to a facility location in `[0,1]`. -/
def fse_MapsToDomain {n : ℕ} (f : (Fin n → ℝ) → ℝ) : Prop :=
  ∀ x : Fin n → ℝ, fse_InDomain x → f x ∈ Set.Icc (0 : ℝ) 1
See it in the graphDiscuss this resultChallenge it