Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Localized Exposed Contact Set Is Singleton

Proved
FunctionalInequalities.Analysis.contactSet_eq_singleton_of_exposed_of_local_bounds_readable

by Lazyfill · Oct 26, 2026 · Mathlib 0df444a (Lean v4.33.1)

functional-inequalitieskls-conjecturekls-modularkls-readablelog-concave

This is the localized Caffarelli contact-set lemma.

Let EEE be a nontrivial finite-dimensional real inner-product space with its Borel measurable structure, and let u:E→Ru:E\to\mathbb Ru:E→R be convex. For x0,p∈Ex_0,p\in Ex0​,p∈E, assume the affine function u(x0)+⟨p,x−x0⟩u(x_0)+\langle p,x-x_0\rangleu(x0​)+⟨p,x−x0​⟩ supports uuu from below:

u(x0)+⟨p,y−x0⟩≤u(y)for all y∈E.u(x_0)+\langle p,y-x_0\rangle\le u(y)\quad\text{for all }y\in E.u(x0​)+⟨p,y−x0​⟩≤u(y)for all y∈E.

Let

C={x:u(x)=u(x0)+⟨p,x−x0⟩}.C=\{x:u(x)=u(x_0)+\langle p,x-x_0\rangle\}.C={x:u(x)=u(x0​)+⟨p,x−x0​⟩}.

Assume:

  1. CCC is compact.
  2. z∈Cz\in Cz∈C and ∥θ∥=1\|\theta\|=1∥θ∥=1.
  3. Every other contact point is strictly exposed from zzz in direction θ\thetaθ: if x∈Cx\in Cx∈C and x≠zx\ne zx=z, then ⟨x−z,θ⟩<0\langle x-z,\theta\rangle<0⟨x−z,θ⟩<0.
  4. h>0h>0h>0.
  5. There is an open set UUU containing the slab piece C∩{x:−h≤⟨x−z,θ⟩}C\cap\{x:-h\le\langle x-z,\theta\rangle\}C∩{x:−h≤⟨x−z,θ⟩}.
  6. For every compact Q⊆UQ\subseteq UQ⊆U, there are real numbers a,ba,ba,b with a>0a>0a>0 such that every open GGG with G‾⊆Q\overline G\subseteq QG⊆Q satisfies
ofReal⁡(a) vol⁡(G)≤vol⁡(∂u(G))≤ofReal⁡(b) vol⁡(G),\operatorname{ofReal}(a)\,\operatorname{vol}(G)\le\operatorname{vol}(\partial u(G))\le\operatorname{ofReal}(b)\,\operatorname{vol}(G),ofReal(a)vol(G)≤vol(∂u(G))≤ofReal(b)vol(G),

where the measures are ENNReal values and subgradientImage is written as ∂u(G)\partial u(G)∂u(G).

Then

C={z}.C=\{z\}.C={z}.

This is a localized technical form of the exposed-contact argument and is reusable when Alexandrov bounds are available only on compact subsets of an open region.

Original Lean declaration header

Within namespace FunctionalInequalities.Analysis. Shown in its original module context. Proof omitted.

theorem contactSet_eq_singleton_of_exposed_of_local_bounds {u : E → ℝ} (hconv : ConvexOn ℝ univ u) {x₀ p : E}
    (hp : ∀ y, u x₀ + ⟪p, y - x₀⟫ ≤ u y) (hC : IsCompact {x | u x = u x₀ + ⟪p, x - x₀⟫})
    {z θ : E} (hz : u z = u x₀ + ⟪p, z - x₀⟫) (hθ : ‖θ‖ = 1)
    (hexp : ∀ x, u x = u x₀ + ⟪p, x - x₀⟫ → x ≠ z → ⟪x - z, θ⟫ < 0) {h : ℝ} (hh : 0 < h)
    {U : Set E} (hU : IsOpen U)
    (hCU : {x | u x = u x₀ + ⟪p, x - x₀⟫} ∩ {x | -h ≤ ⟪x - z, θ⟫} ⊆ U)
    (hB : ∀ Q : Set E, IsCompact Q → Q ⊆ U → ∃ a b : ℝ, 0 < a ∧ ∀ G : Set E, IsOpen G →
      closure G ⊆ Q →
      ENNReal.ofReal a * (volume : Measure E) G ≤ (volume : Measure E) (subgradientImage u G) ∧
      (volume : Measure E) (subgradientImage u G) ≤ ENNReal.ofReal b * (volume : Measure E) G) :
    {x | u x = u x₀ + ⟪p, x - x₀⟫} = {z}

Module navigation

Module: Analysis/Convex/Caffarelli.

Definition modules: Analysis/Convex/Subgradient.

Selected supporting theorems: exists_affine_normalization, exists_compact_sections_subset_and_shrink, exists_pos_alexandrov_maximum_principle, infDist_frontier_image_le_of_width, volume_subgradientImage_comp_affineEquiv_symm.

Previous: contact_stepA · Next: strictConvexOn_of_contact_eq.

Source excerpt, lines 675–685 · Frozen source 408915f.

Preamble
import Definitions.Def_KLSModular_FunctionalInequalities_Analysis_Convex_Caffarelli

open MeasureTheory Set Metric
open scoped RealInnerProductSpace ENNReal
variable {E : Type*}
variable [NormedAddCommGroup E] [InnerProductSpace ℝ E]
variable [FiniteDimensional ℝ E]
variable [Nontrivial E] [MeasurableSpace E] [BorelSpace E]
set_option maxHeartbeats 4000000
Formal statement

theorem FunctionalInequalities.Analysis.contactSet_eq_singleton_of_exposed_of_local_bounds_readable {u : E → ℝ} (hconv : ConvexOn ℝ univ u) {x₀ p : E}
    (hp : ∀ y, u x₀ + ⟪p, y - x₀⟫ ≤ u y) (hC : IsCompact {x | u x = u x₀ + ⟪p, x - x₀⟫})
    {z θ : E} (hz : u z = u x₀ + ⟪p, z - x₀⟫) (hθ : ‖θ‖ = 1)
    (hexp : ∀ x, u x = u x₀ + ⟪p, x - x₀⟫ → x ≠ z → ⟪x - z, θ⟫ < 0) {h : ℝ} (hh : 0 < h)
    {U : Set E} (hU : IsOpen U)
    (hCU : {x | u x = u x₀ + ⟪p, x - x₀⟫} ∩ {x | -h ≤ ⟪x - z, θ⟫} ⊆ U)
    (hB : ∀ Q : Set E, IsCompact Q → Q ⊆ U → ∃ a b : ℝ, 0 < a ∧ ∀ G : Set E, IsOpen G →
      closure G ⊆ Q →
      ENNReal.ofReal a * (volume : Measure E) G ≤ (volume : Measure E) (subgradientImage u G) ∧
      (volume : Measure E) (subgradientImage u G) ≤ ENNReal.ofReal b * (volume : Measure E) G) :
    {x | u x = u x₀ + ⟪p, x - x₀⟫} = {z} := by sorry
Source
Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/Analysis/Convex/Caffarelli.lean#L670-L1011 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.Analysis.Convex.Caffarelli`, declaration `FunctionalInequalities.Analysis.contactSet_eq_singleton_of_exposed_of_local_bounds`; the repository is private at upload time).

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me