Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Approximate γ–tilted convexity (Definition 16)

Definition
TiltedCvx_Supplement_ApproxTiltedConvexWrt

by iris · Nov 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

convex-analysisgeneralized-convexitynonsmooth-analysisoptimizationp2o-gran-per-chapterp2o-plan-bookp2o-v1

Let γ∈(0,1]\gamma\in(0,1]γ∈(0,1], f:Rd→R‾f:\mathbb R^d\to\overline{\mathbb R}f:Rd→R proper and lower semicontinuous, and F:Rd⇉RdF:\mathbb R^d\rightrightarrows\mathbb R^dF:Rd⇉Rd. The function fff is approximately γ\gammaγ–tilted convex with respect to FFF if for every x∈dom⁡(f)∩dom⁡(F)x\in\operatorname{dom}(f)\cap\operatorname{dom}(F)x∈dom(f)∩dom(F) and every ϵ>0\epsilon>0ϵ>0 there is v∈F(x)v\in F(x)v∈F(x) with

f(y)−f(x) ≥ ψγ(⟨y−x,v⟩)−ϵfor all y∈dom⁡(f).f(y)-f(x)\ \ge\ \psi_\gamma(\langle y-x,v\rangle)-\epsilon\qquad\text{for all }y\in\operatorname{dom}(f).f(y)−f(x) ≥ ψγ​(⟨y−x,v⟩)−ϵfor all y∈dom(f).

The supporting vector may depend on ϵ\epsilonϵ; exact γ\gammaγ–tilted convexity with respect to FFF implies the approximate version. It is the tool behind the regularity results (Theorems 35 and 36).

Formalization Note dom⁡(F)={x:F(x)≠∅}\operatorname{dom}(F)=\{x:F(x)\ne\emptyset\}dom(F)={x:F(x)=∅}. Properness, lower semicontinuity and γ∈(0,1]\gamma\in(0,1]γ∈(0,1] are hypotheses of the theorems that use the predicate.

Definition code
import Mathlib
import Definitions.Def_TiltedCvx_effDom
import Definitions.Def_TiltedCvx_psi

open scoped InnerProductSpace

namespace TiltedCvx.Supplement

/-- **Approximate γ–tilted convexity (Definition 16).** Pedramfar–Khanna–Quinn–Aggarwal,
arXiv:2611.03472, Definition 16, p.54: let `γ ∈ (0, 1]`, `f : ℝ^d → ℝ̄` proper lsc and
`F : ℝ^d ⇒ ℝ^d`. `f` is approximately γ–tilted convex with respect to `F` if, for every
`x ∈ dom(f) ∩ dom(F)` and every `ε > 0`, there is `v ∈ F(x)` such that
`f(y) − f(x) ≥ ψγ(⟨y − x, v⟩) − ε` for all `y ∈ dom(f)`.

**Formalization Note** `dom F = {x | F x ≠ ∅}`; the vector `v` may depend on `ε`. The inequality
is in `EReal`; for `γ > 0` and `x, y ∈ dom f` all its terms are real. "Proper lsc" and
`γ ∈ (0, 1]` are hypotheses of the theorems that use the predicate. -/
def ApproxTiltedConvexWrt {E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E]
    (γ : ℝ) (f : E → EReal) (F : E → Set E) : Prop :=
  ∀ x ∈ TiltedCvx.effDom f, (F x).Nonempty → ∀ ε : ℝ, 0 < ε →
    ∃ v ∈ F x, ∀ y ∈ TiltedCvx.effDom f,
      TiltedCvx.psi γ ((⟪y - x, v⟫_ℝ : ℝ) : EReal) - (ε : EReal) ≤ f y - f x

end TiltedCvx.Supplement
Source
Pedramfar–Khanna–Quinn–Aggarwal, Tilted Convexity and an Exact Offline–Online Separation, arXiv:2611.03472, Definition 16, p.54

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