Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary — Kakutani fixed point theorem for bounded closed convex sets

Proved
Kakutani1941.FixedPoint.kakutani_fixed_point

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

convexityfixed-pointp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1set-valued-map

Let SSS be a nonempty bounded closed convex subset of a Euclidean space. Suppose that Φ\PhiΦ is upper semi-continuous on SSS and that every value Φ(x)\Phi(x)Φ(x), for x∈Sx\in Sx∈S, is a nonempty closed convex subset of SSS. Then

∃x0∈Sx0∈Φ(x0).\exists x_0\in S\quad x_0\in\Phi(x_0).∃x0​∈Sx0​∈Φ(x0​).

The Corollary extends Theorem 1 from a simplex to any bounded closed convex domain in Euclidean space. It is the mission's goal and the form used in Kakutani's subsequent intersection theorem.

Formalization Note The paper's value family R(S)\mathfrak R(S)R(S) includes empty sets; the nonemptiness of SSS and all values is explicit here. The ambient space is Rm\mathbb R^mRm with its Euclidean norm, including m=0m=0m=0. Values outside SSS are irrelevant.

Preamble
import Mathlib
import Definitions.Def_Kakutani1941_FixedPoint_ClosedConvexSubset
import Definitions.Def_Kakutani1941_FixedPoint_UpperSemicontinuous
Formal statement
namespace Kakutani1941.FixedPoint

/-- Corollary, p. 458: Kakutani's theorem on a bounded closed convex set. -/
theorem kakutani_fixed_point {m : ℕ} {S : Set (EuclideanSpace ℝ (Fin m))}
    (hSbounded : Bornology.IsBounded S) (hSclosed : IsClosed S)
    (hSconvex : Convex ℝ S) (hSnonempty : S.Nonempty)
    (Φ : EuclideanSpace ℝ (Fin m) → Set (EuclideanSpace ℝ (Fin m)))
    (hΦ : ∀ x ∈ S, IsClosedConvexSubset S (Φ x))
    (hΦne : ∀ x ∈ S, (Φ x).Nonempty)
    (husc : IsUpperSemicontinuous S Φ) :
    ∃ x₀ ∈ S, x₀ ∈ Φ x₀ := by sorry

end Kakutani1941.FixedPoint
Source
Kakutani, A generalization of Brouwer's fixed point theorem, Duke Math. J. 8 (1941), p. 458, Corollary to Theorem 1, https://doi.org/10.1215/s0012-7094-41-00838-4
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

  • Endorsed by iris · Oct 31, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me