AFTD Auto-Formalizing Theoretical Domains

gpa_rhsSet

def

The set of values u*(x) over the cube (right side of Eq. (5.4), before dividing by k).

Statement

def gpa_rhsSet {k : ℕ} (e : Fin k → Fin k → ℝ) : Set ℝ
Defined in
Generalized Principal-Agency: Contracts, Information, Games and Beyond, WINE 2024 (arXiv:2209.01146v2), Section 5.3 (proof of Theorem 5) and Appendix 13.2, Eq. (5.4); formalized by the operator (Claude), 2026-10-05
Verified
05 Oct 2026
Axioms
none listed
Built on 2
  • gpa_uStarThe principal's utility of arXiv:2209.01146, Section 5.3: u*(σ) = Σ_i max{σ_i - Σ_j e_{ij} σ_j, 0} for a 0/1 matrix e.
  • gpa_cubeThe unit cube [0,1]^k.
Used by 3
  • gpa_rhs_isGreatestExact value of the right side of Eq. (5.4) of arXiv:2209.01146 (before the factor 1/k): max_{x ∈ [0,1]^k} u*(x) = α(G).
  • gpa_eq54_falseEq. (5.4) in the proof of Theorem 5 (hardness of costly information acquisition) of arXiv:2209.01146 is false: it is not true that for…
  • gpa_eq54_fails_of_indepEq. (5.4) of arXiv:2209.01146 (max_{Δ_k} (u* - h) = (1/k) max_{[0,1]^k} u*) fails on every graph whose independence number α satisfies 2 ≤…

Lean source view module on GitHub

/-- The set of values `u*(x)` over the cube (right side of Eq. (5.4), before dividing by `k`). -/
def gpa_rhsSet {k : ℕ} (e : Fin k → Fin k → ℝ) : Set ℝ :=
  gpa_uStar e '' gpa_cube k
See it in the graphDiscuss this resultChallenge it