AFTD Auto-Formalizing Theoretical Domains

IsKKMCover

defimported Lean

The KKM condition for a cover F : Fin n → Set _ of the standard simplex: for each subset σ ⊆ Fin n, the face of the simplex supported on σ (points with zero weight outside σ) is covered by ⋃_{i ∈ σ} F i. This is the combinatorial heart of the KKM lemma: each face is covered by the subfamily indexed by that face's vertices.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Set Finset in
variable {n : ℕ} in
def IsKKMCover (F : Fin n → Set (Fin n → ℝ)) : Prop
Defined in
EconCSLib, `IsKKMCover`
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 **KKM condition** for a cover `F : Fin n → Set _` of the standard simplex: for each subset `σ ⊆ Fin n`, the face of the simplex supported on `σ` (points with zero weight outside `σ`) is covered by `⋃_{i ∈ σ} F i`. This is the combinatorial heart of the KKM lemma: each face is covered by the subfamily indexed by that face's vertices. -/
def IsKKMCover (F : Fin n → Set (Fin n → ℝ)) : Prop :=
  ∀ (σ : Finset (Fin n)),
    (stdSimplex ℝ (Fin n) ∩ {x | ∀ i ∉ σ, x i = 0}) ⊆ ⋃ i ∈ σ, F i
See it in the graphDiscuss this resultChallenge it