Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, proof of THEOREM A, p. 1136 — the support function of ℝ^L_− is 0 on ℝ^L_+ and +∞ otherwise

Proved
RegretMatching.Approach.support_negOrthant

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

blackwell-approachabilityconvex-analysisp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1support-function

Let LLL be a finite set and R−L={x∈RL:x≤0}\mathbb R^L_-=\{x\in\mathbb R^L: x\le0\}R−L​={x∈RL:x≤0} the nonpositive orthant. Its support function w(λ)=sup⁡{λ⋅c:c∈R−L}w(\lambda)=\sup\{\lambda\cdot c: c\in\mathbb R^L_-\}w(λ)=sup{λ⋅c:c∈R−L​} satisfies

w(λ)=0  for λ∈R+L,w(λ)=+∞  otherwise.w(\lambda)=0\ \text{ for }\lambda\in\mathbb R^L_+,\qquad w(\lambda)=+\infty\ \text{ otherwise.}w(λ)=0  for λ∈R+L​,w(λ)=+∞  otherwise.

Precisely:

  1. if every coordinate of λ\lambdaλ is nonnegative, then 000 is the least upper bound of {λ⋅c:c≤0}\{\lambda\cdot c: c\le 0\}{λ⋅c:c≤0};
  2. if some coordinate of λ\lambdaλ is negative, then {λ⋅c:c≤0}\{\lambda\cdot c: c\le0\}{λ⋅c:c≤0} is unbounded above.

Consequently only λ∈R+L\lambda\in\mathbb R^L_+λ∈R+L​ need to be considered in Blackwell's condition (3.2) for R−L\mathbb R^L_-R−L​.

Formalization Note. The value +∞+\infty+∞ is expressed as "not bounded above" and the value 000 as a least upper bound, so no real-valued supremum (which Lean sets to 000 on unbounded sets) is used.

Preamble
import Mathlib
import Definitions.Def_RegretMatching_Approach_Setting

open MeasureTheory ProbabilityTheory Filter Topology
Formal statement
namespace RegretMatching.Approach

theorem support_negOrthant
    {L : Type} [Fintype L] (lam : EuclideanSpace ℝ L) :
    ((∀ l, 0 ≤ lam l) → IsLUB ((fun c => inner ℝ lam c) '' negOrthant L) 0) ∧
      ((∃ l, lam l < 0) → ¬ BddAbove ((fun c => inner ℝ lam c) '' negOrthant L)) := by sorry

end RegretMatching.Approach
Source
Hart and Mas-Colell, A simple adaptive procedure leading to correlated equilibrium, Econometrica 68 (2000), p. 1136, proof of THEOREM A
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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