Strictly increasing functions extend to a closed right endpoint
ProvedMonotonicity_Theorem.increasing_extends_to_right_endpoint_closedGluing a strictly increasing function to its closed right 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 increasing on pairs of points both lying strictly left of ;
- for every point of at or right of but strictly left of , and every point of at , the value lies strictly below .
Then
This is the order-theoretic core of sup-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. The decreasing analogue is stated separately.
Formalization Note The boundary hypothesis quantifies over arbitrary points at rather than fixing one, so no choice of coordinates is needed. This version supersedes an earlier draft whose boundary hypothesis missed the left-endpoint pair.
import Definitions.Def_Monotonicity_Theorem_Framework
theorem Monotonicity_Theorem.increasing_extends_to_right_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})
(x₀ s : R) (hxs : D.lt x₀ s)
(hI : ∀ x : Power R 1, I x → Power.coord1 x = x₀ ∨
(D.lt x₀ (Power.coord1 x) ∧ D.lt (Power.coord1 x) s) ∨ Power.coord1 x = s)
(hleft : ∀ x y (hx : I x) (hy : I y),
D.lt (Power.coord1 x) s → D.lt (Power.coord1 y) s →
Lt1 D x y → Lt1 D (f ⟨x, hx⟩).1 (f ⟨y, hy⟩).1)
(hbound : ∀ u (hu : I u) y (hy : I y),
(Power.coord1 u = x₀ ∨ D.lt x₀ (Power.coord1 u)) →
D.lt (Power.coord1 u) s → Power.coord1 y = s →
Lt1 D (f ⟨u, hu⟩).1 (f ⟨y, hy⟩).1) :
StrictlyIncreasingOn D I B f := by sorry