Theorems · Definition · convex and discrete geometry

QuasiconvexOn

(𝕜 : Type u_1) →
  {E : Type u_2} →
    {β : Type u_3} → [Semiring 𝕜] → [PartialOrder 𝕜] → [AddCommMonoid E] → [LE β] → [SMul 𝕜 E] → Set E → (E → β) → Prop

A function is quasiconvex if all its sublevels are convex. This means that, for all r, {x ∈ s | f x ≤ r} is 𝕜-convex.

Defined in

Mathlib.Analysis.Convex.Quasiconvex

Cited by

25 results in Mathlib

Foundations

Depth 14 from the axioms · uses no axioms

Assumes

SemiringPartialOrderAddCommMonoidLESMul