AFTD Auto-Formalizing Theoretical Domains

MatrixGame.optimalRowSet_isCompact

theoremverifiedformalizationimported Lean

MatrixGame.optimalRowSet_isCompact

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators Set in
set_option linter.unusedSectionVars false in
universe u in
variable {I J : Type u} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in
variable (A : MatrixGame I J ℝ) in
theorem MatrixGame.optimalRowSet_isCompact : IsCompact A.optimalRowSet
Formalizes
EconCSLib, `MatrixGame.optimalRowSet_isCompact`
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
Classical.choiceQuot.soundpropext
Built on 7
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Finset BigOperators Set inset_option linter.unusedSectionVars false inuniverse u invariable {I J : Type u} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] invariable (A : MatrixGame I J ℝ) intheorem MatrixGame.optimalRowSet_isCompact : IsCompact A.optimalRowSet := by  have hsimplex : IsCompact (stdSimplex ℝ I) := isCompact_stdSimplex ℝ I  exact hsimplex.of_isClosed_subset A.optimalRowSet_isClosed inter_subset_left
See it in the graphDiscuss this resultChallenge it