Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A bad direction of a non-parallelogram plane lies near a corner where two edges meet

Proved
Plasticity.Plane.exists_corner_of_bad

by scanstone · Oct 19, 2026 · Mathlib 0df444a (Lean v4.33.1)

Let VVV be a real normed space of dimension 222 whose closed unit ball DDD has more than four extreme points. Let e∈Ve\in Ve∈V with ∥e∥=1\|e\|=1∥e∥=1 be bad: at most one extreme point ppp of DDD has ∥p−e∥<1\|p-e\|<1∥p−e∥<1. Then there are extreme points x,x1,x2x,x_1,x_2x,x1​,x2​ of DDD and functionals f1,f2f_1,f_2f1​,f2​ of norm 111 with

∥x−e∥<1,x1≠x,x2≠x,f1(x1)=f1(x)=1,f2(x)=f2(x2)=1,f1(x2)<1,f2(x1)<1,∥x2−x∥<2.\|x-e\|<1,\quad x_1\ne x,\quad x_2\ne x,\quad f_1(x_1)=f_1(x)=1,\quad f_2(x)=f_2(x_2)=1,\quad f_1(x_2)<1,\quad f_2(x_1)<1,\quad \|x_2-x\|<2.∥x−e∥<1,x1​=x,x2​=x,f1​(x1​)=f1​(x)=1,f2​(x)=f2​(x2​)=1,f1​(x2​)<1,f2​(x1​)<1,∥x2​−x∥<2.

So xxx is the only extreme point within distance less than one of eee, and the edges [x1,x][x_1,x][x1​,x] and [x,x2][x,x_2][x,x2​] of DDD meet at xxx; these are the hypotheses of the card Plasticity.Plane.corner_cover.

Preamble
import Mathlib.Analysis.Convex.Extreme
import Mathlib.Analysis.Normed.Module.Basic
import Mathlib.Analysis.Normed.Operator.NormedSpace
import Mathlib.LinearAlgebra.Dimension.Finrank
Formal statement
namespace Plasticity.Plane
theorem exists_corner_of_bad {V : Type*} [NormedAddCommGroup V] [NormedSpace ℝ V]
    (hV : Module.finrank ℝ V = 2)
    (hpar : 4 < (Set.extremePoints ℝ (Metric.closedBall (0 : V) 1)).encard)
    (e : V) (he : ‖e‖ = 1)
    (hbad : ∀ p ∈ Set.extremePoints ℝ (Metric.closedBall (0 : V) 1),
      ∀ q ∈ Set.extremePoints ℝ (Metric.closedBall (0 : V) 1), ‖p - e‖ < 1 → ‖q - e‖ < 1 → p = q) :
    ∃ x ∈ Set.extremePoints ℝ (Metric.closedBall (0 : V) 1), ‖x - e‖ < 1 ∧
      ∃ x₁ ∈ Set.extremePoints ℝ (Metric.closedBall (0 : V) 1),
      ∃ x₂ ∈ Set.extremePoints ℝ (Metric.closedBall (0 : V) 1),
      ∃ f₁ f₂ : StrongDual ℝ V, ‖f₁‖ = 1 ∧ ‖f₂‖ = 1 ∧ x₁ ≠ x ∧ x₂ ≠ x ∧
        f₁ x₁ = 1 ∧ f₁ x = 1 ∧ f₂ x = 1 ∧ f₂ x₂ = 1 ∧ f₁ x₂ < 1 ∧ f₂ x₁ < 1 ∧
        ‖x₂ - x‖ < 2 := by sorry
end Plasticity.Plane
Source
This repository: claim CUB102(2) (claims/cub.md), proof in expositions/c0_planes_front.md §2.2

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