Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(20), p. 13 — Bˢ = (1/(nD²)) δδᵀ ∘ (I + E + (1/(nD))(x^δ_clet eᵀ + e(x^δ_clet)ᵀ))

Proved
OffloadGNEP.Mono.eq_20

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

hadamard-productp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1positive-semidefinite

Assume Assumption A and the standing hypotheses, and let x∈R3Nx\in\mathbb R^{3N}x∈R3N with D=1−1n∑tδtxt,clet≠0D=1-\frac1n\sum_t\delta_tx_{t,clet}\ne0D=1−n1​∑t​δt​xt,clet​=0. Write δ=(δ1,…,δN)⊤\delta=(\delta_1,\dots,\delta_N)^\topδ=(δ1​,…,δN​)⊤, xcletδ=(δ1x1,clet,…,δNxN,clet)⊤x^\delta_{clet}=(\delta_1x_{1,clet},\dots,\delta_Nx_{N,clet})^\topxcletδ​=(δ1​x1,clet​,…,δN​xN,clet​)⊤, eee for the all-ones vector of RN\mathbb R^NRN, EEE for the all-ones N×NN\times NN×N matrix, III for the identity and ∘\circ∘ for the Hadamard (entrywise) product. Then the symmetric part Bs=12(B⊤+B)B^s=\frac12(B^\top+B)Bs=21​(B⊤+B) of the clet-block of the Jacobian is

Bs=1nD2(δδ⊤∘(I+E+1nD(xcletδe⊤+e(xcletδ)⊤))).B^s=\frac1{nD^2}\Big(\delta\delta^\top\circ\Big(I+E+\frac1{nD}\big(x^\delta_{clet}e^\top+e(x^\delta_{clet})^\top\big)\Big)\Big).Bs=nD21​(δδ⊤∘(I+E+nD1​(xcletδ​e⊤+e(xcletδ​)⊤))).

This factorisation exhibits BsB^sBs as a Hadamard product with the positive semidefinite matrix δδ⊤\delta\delta^\topδδ⊤, which is what makes the Schur product theorem applicable.

Formalization Note The only hypothesis the identity needs beyond the definitions is D≠0D\neq0D=0, so that the denominators of BuB_uBu​, BuvB_{uv}Buv​ are not Lean's junk value.

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

theorem eq_20 {N : ℕ} (P : Params N) (hA : P.AssumptionA) (hS : P.Standing)
    (x : Fin N → Tier → ℝ) (hD : D P x ≠ 0) :
    Bs P x = (1 / ((P.n : ℝ) * D P x ^ 2)) •
      (Matrix.vecMulVec P.delta P.delta).hadamard
        (1 + Eall + (1 / ((P.n : ℝ) * D P x)) •
          (Matrix.vecMulVec (xdelta P x) ones + Matrix.vecMulVec ones (xdelta P x))) := 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), pp. 12–13, definition of D and (20)
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