Skip to content

feat: show some convexity properties of intervals - #109

Open
kilianar wants to merge 2 commits into
ooovi:mainfrom
kilianar:intervals-convexity
Open

kilianar wants to merge 2 commits into
ooovi:mainfrom
kilianar:intervals-convexity

Conversation

@kilianar

Copy link
Copy Markdown
Contributor

Add some basic results about convexity of intervals in ordered semirings. The statements are somewhat asymmetric because, in this level of generality, the convex hull of two points need not coincide with the interval between them.

Comment thread Polyhedral/Mathlib/Geometry/Convex/ConvexSpace/Set/Order.lean Outdated
Comment thread Polyhedral/Mathlib/Geometry/Convex/ConvexSpace/Set/Order.lean Outdated
Comment thread Polyhedral/Mathlib/Geometry/Convex/ConvexSpace/Set/Order.lean Outdated
@martinwintermath

martinwintermath commented Sep 29, 2026 •

Copy link
Copy Markdown
Collaborator

What is the mathematical story here? I see

  • "convex hull of {a,b} is in Icc a b", but not the other inclusion
  • "Icc 0 1 is in convex hull of {0, 1}", but not for general a,b

Why these restrictions? And when can they be lifted?

@YaelDillies

Copy link
Copy Markdown
Contributor

The question is when x <= y <= z implies that there exist a, b nonnegative summing to 1 such that ax + bz = y. When x = 0, z = 1, ExistsAddOfLE is enough (and is more or less equivalent to it). For general x and z, you probably need to divide, i.e. you need a semifield.

@martinwintermath

Copy link
Copy Markdown
Collaborator

The question is when x <= y <= z implies that there exist a, b nonnegative summing to 1 such that ax + bz = y. When x = 0, z = 1, ExistsAddOfLE is enough (and is more or less equivalent to it). For general x and z, you probably need to divide, i.e. you need a semifield.

So ideally this PR adds the respective equality lemmas under Semifield assumptions.

@kilianar

Copy link
Copy Markdown
Contributor Author

Yes, I think one can show the equality for arbitrary $a,b$ in a semifield. I will try to do so.

For a general ordered convex space $X$, however, we only get $\mathop{\mathrm{convHull}} \{a,b\} \subseteq [a,b]$, and equality need not hold. For example, in $X=\mathbb{R}^2$ with the coordinatewise order, for $a=(0,0)$ and $b=(1,1)$, the convex hull is the diagonal segment, while $[a,b]$ is the whole unit square.

Comment thread Polyhedral/Mathlib/Geometry/Convex/ConvexSpace/Set/Order.lean Outdated
@kilianar
kilianar force-pushed the intervals-convexity branch 2 times, most recently from 506756c to 075eac5 Compare October 2, 2026 13:28
@martinwintermath
martinwintermath self-requested a review October 2, 2026 22:43
@martinwintermath

Copy link
Copy Markdown
Collaborator

LGTM @ooovi
@YaelDillies: is there any unfinished discussion regarding IsOrderedConvexSpace or so that we should wait for?

@YaelDillies

Copy link
Copy Markdown
Contributor

Yes, let's wait for the IsOrderedConvexSpace R R assumption to be gone

YaelDillies and others added 2 commits October 5, 2026 13:51
(cherry picked from commit 878fc97f8bb87dbd10eb04b9a39797706f2c40e1)
@kilianar
kilianar force-pushed the intervals-convexity branch from 075eac5 to 36d807b Compare October 5, 2026 11:54
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

3 participants