AFTD Auto-Formalizing Theoretical Domains

lower_convex_envelope

deforiginal

The lower convex envelope of a subset S ⊆ ℝ × ℝ evaluated at c is the infimum of y ∈ ℝ such that (c, y) lies in the convex hull of S.

Statement

noncomputable def lower_convex_envelope (S : Set (ℝ × ℝ)) (c : ℝ) : ℝ
Related work
folklore
Verified
14 Nov 2026
Axioms
none listed

Read back from the Lean

The definition lower_convex_envelope takes a set of pairs of real numbers S : Set (ℝ × ℝ) and a real number c : ℝ, and returns the infimum (in ℝ, using sInf) of the set of all y : ℝ such that (c, y) lies in the convex hull of S over ℝ.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- Lower convex envelope of a point set S ⊆ ℝ² evaluated at c -/
noncomputable def lower_convex_envelope (S : Set (ℝ × ℝ)) (c : ℝ) : ℝ := sInf { y : ℝ | (c, y) ∈ convexHull ℝ S }
See it in the graphDiscuss this resultChallenge it