Strictly decreasing functions extend to a right endpoint
OpenMonotonicity_Theorem.decreasing_extends_to_right_endpointGluing a strictly decreasing function to its 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 decreasing on pairs of points both lying strictly left of ;
- the value of at lies strictly below every value of at a point strictly between and .
Then
This is the exact mirror of the increasing endpoint-gluing lemma, used for the decreasing case of sup-extension (inf-extension) arguments: once a boundary comparison at the endpoint is known (in applications, supplied by continuity at ), strict monotonicity on the approaching interval extends to the closed interval.
Retired: the boundary hypothesis misses the pair with at itself, so the statement as given is false (two-point counterexample with ). Superseded by Monotonicity_Theorem.decreasing_extends_to_right_endpoint_closed, whose boundary hypothesis covers at or right of and arbitrary points at .
import Definitions.Def_Monotonicity_Theorem_Framework
theorem Monotonicity_Theorem.decreasing_extends_to_right_endpoint {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 ⟨y, hy⟩).1 (f ⟨x, hx⟩).1)
(hbound : ∀ u (hu : I u),
D.lt x₀ (Power.coord1 u) → D.lt (Power.coord1 u) s →
∀ (hs : I (fun _ => s)),
Lt1 D (f ⟨(fun _ => s), hs⟩).1 (f ⟨u, hu⟩).1)
(hsI : I (fun _ => s)) :
StrictlyDecreasingOn D I B f := by sorry