gpa_path3
def
The path 0 - 2 - 1 on three vertices.
Statement
def gpa_path3 : SimpleGraph (Fin 3)- Source
- step towards gpa_eq54_false / gpa_eq54_fails_of_indep (Generalized Principal-Agency: Contracts, Information, Games and Beyond, WINE 2024 (arXiv:2209.01146v2), Sec. 5.3, Eq. (5.4))
- Verified
- 06 Oct 2026
- Axioms
- none listed
- Used by 3
- gpa_path3_indepIn the path 0 - 2 - 1, {0, 1} is a maximum independent set.
- 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_cube_max_le_one_falseThe auxiliary claim max_{x ∈ [0,1]^k} u*(x) ≤ 1 used in the proof of Eq. (5.4) of arXiv:2209.01146 is false: on the path with three…
Lean source view module on GitHub
/-- The path `0 - 2 - 1` on three vertices. -/ def gpa_path3 : SimpleGraph (Fin 3) := SimpleGraph.fromRel (fun i j => (i = 0 ∧ j = 2) ∨ (i = 1 ∧ j = 2)) instance gpa_path3_adj_decidable : DecidableRel gpa_path3.Adj := by unfold gpa_path3 infer_instance