Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 12 — a map whose Jacobian is positive semidefinite on a convex set is monotone there

Proved
OffloadGNEP.Mono.isMonotoneOn_of_jacobian_psd

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

monotone-mapp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1variational-inequality

Let S⊆R3NS\subseteq\mathbb R^{3N}S⊆R3N be convex and let G:R3N→R3NG:\mathbb R^{3N}\to\mathbb R^{3N}G:R3N→R3N be Fréchet differentiable at every point of SSS, with derivative G′(x)G'(x)G′(x) at xxx. If the derivative is positive semidefinite on SSS in the sense that

h⊤G′(x) h ≥ 0for all x∈S, h∈R3N,h^\top G'(x)\,h\ \ge\ 0\qquad\text{for all }x\in S,\ h\in\mathbb R^{3N},h⊤G′(x)h ≥ 0for all x∈S, h∈R3N,

then GGG is monotone on SSS: (G(y)−G(x))⊤(y−x)≥0(G(y)-G(x))^\top(y-x)\ge0(G(y)−G(x))⊤(y−x)≥0 for all x,y∈Sx,y\in Sx,y∈S.

This is the criterion the paper invokes (citing Facchinei–Pang) to reduce the monotonicity of the VI map FFF to a property of its Jacobian JFJFJF.

Formalization Note Differentiability is required at the points of SSS only (as HasFDerivAt, i.e. in a full neighbourhood in R3N\mathbb R^{3N}R3N), which is how the criterion is applied: the paper's FFF is differentiable on an open set containing KKK, while KKK itself has empty interior. The inner product is the Euclidean one, summed over all 3N3N3N coordinates.

Preamble
import Mathlib
import Definitions.Def_OffloadGNEP_Mono_Setting
Formal statement
namespace OffloadGNEP.Mono

theorem isMonotoneOn_of_jacobian_psd {N : ℕ} (S : Set (Fin N → Tier → ℝ))
    (G : (Fin N → Tier → ℝ) → (Fin N → Tier → ℝ))
    (G' : (Fin N → Tier → ℝ) → ((Fin N → Tier → ℝ) →L[ℝ] (Fin N → Tier → ℝ)))
    (hS : Convex ℝ S) (hG : ∀ x ∈ S, HasFDerivAt G (G' x) x)
    (hpsd : ∀ x ∈ S, ∀ h : Fin N → Tier → ℝ, 0 ≤ pair h (G' x h)) :
    IsMonotoneOn S G := by sorry

end OffloadGNEP.Mono
Source
Cardellini et al., A game-theoretic approach to computation offloading in mobile cloud computing, accepted manuscript (IRIS Sapienza 11573/779661; DOI 10.1007/s10107-015-0881-6), p. 12, paragraph before (16) (citing [17])
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

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