Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Remark — continuity of the best value φ_ι

Proved
SocialEquilibrium.Existence.bestValue_continuousAt

by mikedeng1 · Sep 26, 2026 · Mathlib 0df444a (Lean v4.33.1)

best-responsecontinuitymaximum-theoremp2o-batch-p100ap2o-gran-per-chapterp2o-plan-paperp2o-v1

In Debreu's abstract economy, fix an agent ι\iotaι and a point aˉι0\bar a^0_\iotaaˉι0​. If AιA_\iotaAι​ (with non-void values) has a compact graph GιG_\iotaGι​ and is continuous at aˉι0\bar a^0_\iotaaˉι0​, and fιf_\iotafι​ is a continuous function from GιG_\iotaGι​ to the completed real line, then

φι(aˉι)=max⁡aι∈Aι(aˉι)fι(aˉι,aι)\varphi_\iota(\bar a_\iota)=\max_{a_\iota\in A_\iota(\bar a_\iota)}f_\iota(\bar a_\iota,a_\iota)φι​(aˉι​)=aι​∈Aι​(aˉι​)max​fι​(aˉι​,aι​)

is continuous at aˉι0\bar a^0_\iotaaˉι0​.

The continuity of φι\varphi_\iotaφι​ is a joint hypothesis on fιf_\iotafι​ and AιA_\iotaAι​ in the THEOREM; the Remark replaces it by conditions on each of them separately, and is what the COROLLARY on saddle points uses.

Preamble
import Mathlib
import Definitions.Def_SocialEquilibrium_Existence_graph
import Definitions.Def_SocialEquilibrium_Existence_Game
Formal statement
namespace SocialEquilibrium.Existence

/-- Debreu (1952), §2, p. 889, Remark: if `A_ι` (with non-void values) has a compact graph `G_ι`
and is continuous at `ā⁰_ι`, and `f_ι` is a continuous function from `G_ι` to the completed real
line, then `φ_ι` is continuous at `ā⁰_ι`. -/
theorem bestValue_continuousAt {ι : Type*} [Fintype ι] [DecidableEq ι]
    {E : ι → Type*} [∀ i, NormedAddCommGroup (E i)] [∀ i, NormedSpace ℝ (E i)]
    [∀ i, FiniteDimensional ℝ (E i)]
    (X : ∀ i, Set (E i)) (A : ∀ i : ι, Others X i → Set (X i))
    (f : ι → (∀ j, X j) → EReal) (i : ι) (ā₀ : Others X i)
    (hA : ∀ ā : Others X i, (A i ā).Nonempty)
    (hG : IsCompact (graph (A i)))
    (hf : ContinuousOn (fun p : Others X i × X i => f i (join X i p.1 p.2)) (graph (A i)))
    (hAc : ConstraintContinuousAt A i ā₀) :
    ContinuousAt (bestValue X A f i) ā₀ := by sorry

end SocialEquilibrium.Existence
Source
Debreu, A Social Equilibrium Existence Theorem, Proc. Natl. Acad. Sci. USA 38(10), 1952, p. 889, Remark
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Setting.

  • ι\iotaι is a finite set of agents with decidable equality.
  • Each EjE_jEj​ is a finite-dimensional real normed space, and Xj⊆EjX_j \subseteq E_jXj​⊆Ej​.
  • Aˉi=∏j≠iXj\bar{\mathfrak A}_i = \prod_{j\ne i} X_jAˉi​=∏j=i​Xj​, with product-of-subspace topologies.
  • AjA_jAj​ are constraint maps, and fjf_jfj​ are payoffs into [−∞,+∞][-\infty,+\infty][−∞,+∞], which carries its order topology.
  • An agent iii and a point aˉ0\bar a^0aˉ0 are fixed.

The best value is φi(aˉ)=sup⁡{fi(aˉ,b):b∈Ai(aˉ)}\varphi_i(\bar a) = \sup\{f_i(\bar a, b) : b \in A_i(\bar a)\}φi​(aˉ)=sup{fi​(aˉ,b):b∈Ai​(aˉ)}.

Hypotheses.

  1. Ai(aˉ)≠∅A_i(\bar a) \ne \varnothingAi​(aˉ)=∅ for every aˉ∈Aˉi\bar a \in \bar{\mathfrak A}_iaˉ∈Aˉi​.
  2. The graph Gi={(aˉ,b):b∈Ai(aˉ)}G_i = \{(\bar a,b) : b \in A_i(\bar a)\}Gi​={(aˉ,b):b∈Ai​(aˉ)} is compact.
  3. (aˉ,b)↦fi(aˉ,b)(\bar a, b) \mapsto f_i(\bar a, b)(aˉ,b)↦fi​(aˉ,b) is continuous on GiG_iGi​.
  4. For every a0∈Ai(aˉ0)a^0 \in A_i(\bar a^0)a0∈Ai​(aˉ0) and every sequence aˉn→aˉ0\bar a^n \to \bar a^0aˉn→aˉ0, there is a sequence an→a0a^n \to a^0an→a0 with an∈Ai(aˉn)a^n \in A_i(\bar a^n)an∈Ai​(aˉn) for all nnn.

Claim. φi:Aˉi→[−∞,+∞]\varphi_i : \bar{\mathfrak A}_i \to [-\infty,+\infty]φi​:Aˉi​→[−∞,+∞] is continuous at the point aˉ0\bar a^0aˉ0.

Degenerate cases. Hypotheses 1 and 2 make Aˉi\bar{\mathfrak A}_iAˉi​ compact. Continuity is with respect to the topology of [−∞,+∞][-\infty,+\infty][−∞,+∞], so values ±∞\pm\infty±∞ are allowed and handled by that topology. If Aˉi\bar{\mathfrak A}_iAˉi​ is a single point (for example, when there is one agent), the claim is trivial.

Human review
  • Endorsed by Shuze Chen · Sep 27, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Sep 27, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me