AFTD Auto-Formalizing Theoretical Domains

simplexFaceOpp

defimported Lean

The face of the standard simplex opposite vertex i: the set of simplex points whose i-th coordinate is zero. In cake-cutting language (Stromquist 1980): simplexFaceOpp i is the face Sᵢ consisting of all divisions where the i-th piece has measure zero (is "empty"). The KKM open-cover condition requires Uᵢ ∩ simplexFaceOpp i = ∅ — no division in Uᵢ has an empty i-th piece.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Set Finset in
variable {n : ℕ} in
def simplexFaceOpp (i : Fin n) : Set (Fin n → ℝ)
Defined in
EconCSLib, `simplexFaceOpp`
Lean proof
By xbei (from the file's git history), from github.com/gametheoryinlean/EconCSLib at 1a88f809b538 (Copyright (c) 2026 EconCSLib contributors. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.30.0.
Verified
08 Oct 2026
Axioms
none listed

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Set Finset in
variable {n : ℕ} in
/-- The **face of the standard simplex opposite vertex `i`**: the set of simplex points whose `i`-th coordinate is zero. In cake-cutting language (Stromquist 1980): `simplexFaceOpp i` is the face `Sᵢ` consisting of all divisions where the `i`-th piece has measure zero (is "empty"). The KKM open-cover condition requires `Uᵢ ∩ simplexFaceOpp i = ∅` — no division in `Uᵢ` has an empty `i`-th piece. -/
def simplexFaceOpp (i : Fin n) : Set (Fin n → ℝ) :=
  {x | x i = 0} ∩ stdSimplex ℝ (Fin n)
See it in the graphDiscuss this resultChallenge it