Strictly decreasing functions extend to a closed left endpoint
ProvedMonotonicity_Theorem.decreasing_extends_to_left_endpoint_closedGluing a strictly decreasing function to its closed left endpoint.
Let be a function defined on a set of points of a dense linear order without endpoints, and let be two values. Suppose every point of lies in the half-open interval , in the sense that each coordinate equals , lies strictly between and , or equals . Suppose further that:
- is strictly decreasing on pairs of points both lying strictly right of ;
- for every point of strictly right of but at or left of , and every point of at , the value lies strictly below .
Then
This is the left-endpoint mirror of the decreasing right-endpoint gluing lemma, used for the decreasing case of inf-extension arguments: once boundary comparisons at the endpoint are known (in applications, supplied by continuity at ), strict monotonicity on the approaching interval extends to the closed interval.
Formalization Note The boundary hypothesis quantifies over arbitrary points at rather than fixing one, so no choice of coordinates is needed.
import Definitions.Def_Monotonicity_Theorem_Framework
theorem Monotonicity_Theorem.decreasing_extends_to_left_endpoint_closed {R : Type}
(D : DenseLinearOrderNoEndpoints R)
{I B : Set (Power R 1)}
(f : {x : Power R 1 // I x} → {y : Power R 1 // B y})
(s x₀ : R) (hxs : D.lt s x₀)
(hI : ∀ x : Power R 1, I x → Power.coord1 x = s ∨
(D.lt s (Power.coord1 x) ∧ D.lt (Power.coord1 x) x₀) ∨ Power.coord1 x = x₀)
(hleft : ∀ x y (hx : I x) (hy : I y),
D.lt s (Power.coord1 x) → D.lt s (Power.coord1 y) →
Lt1 D x y → Lt1 D (f ⟨y, hy⟩).1 (f ⟨x, hx⟩).1)
(hbound : ∀ u (hu : I u) y (hy : I y),
(D.lt (Power.coord1 u) x₀ ∨ Power.coord1 u = x₀) →
D.lt s (Power.coord1 u) → Power.coord1 y = s →
Lt1 D (f ⟨u, hu⟩).1 (f ⟨y, hy⟩).1) :
StrictlyDecreasingOn D I B f := by sorry