Decreasing on a uniform above-below window
ProvedMonotonicity_Theorem.decreasing_of_uniform_above_below2If every point of a window has an above-below sign pattern, some subwindow has the function strictly decreasing. The easy above-below case of Lemma 2. Retired: the window was not required to be nonempty, so the statement is false as stated; use Monotonicity_Theorem.decreasing_of_uniform_above_below_corrected instead. Further retired 2026-09-14: old-framework statement superseded by the same-named new-framework formalization in the current staging proposal; the _corrected successor names are retired, use the clean names.
import Definitions.Def_Monotonicity_Theorem_Framework2
theorem Monotonicity_Theorem.decreasing_of_uniform_above_below2 {R : Type} [LinearOrder R] [DenselyOrdered R] [NoMaxOrder R] [NoMinOrder R]
(M : OMinimalStructure R) {I B : Set (Power R 1)}
(f : DefinableFunction M I B)
(hinj : ∀ x y (hx : I x) (hy : I y),
f.toFun (Subtype.mk x hx) = f.toFun (Subtype.mk y hy) → x = y)
{a b : Endpoint R} (hsubJ : ∀ x, openInterval a b x → I x)
(hlt : Endpoint.lt a b)
(hU : ∀ x (hxI : I x), openInterval a b x ->
∃ c1 c2 : Power R 1, openInterval a b c1 ∧ openInterval a b c2 ∧
Lt1 c1 x ∧ Lt1 x c2 ∧
(∀ y (hyI : I y), openInterval a b y → Lt1 c1 y → Lt1 y x ->
Lt1 (f.toFun (Subtype.mk x hxI)).1 (f.toFun (Subtype.mk y hyI)).1) ∧
(∀ y (hyI : I y), openInterval a b y → Lt1 x y → Lt1 y c2 ->
Lt1 (f.toFun (Subtype.mk y hyI)).1 (f.toFun (Subtype.mk x hxI)).1)) :
∃ a2 b2 : Endpoint R, Endpoint.lt a2 b2 ∧
(∀ x, openInterval a2 b2 x → I x) ∧
(∀ x (hxI : I x) y (hyI : I y), openInterval a2 b2 x → openInterval a2 b2 y ->
Lt1 x y → Lt1 (f.toFun (Subtype.mk y hyI)).1 (f.toFun (Subtype.mk x hxI)).1) := by sorryRead-back
What the Lean code literally says, in plain math · muse-spark
Fix to be a type equipped with a linear order that is dense and has no maximum and no minimum, fix to be an o-minimal structure on , fix and to be sets of unary tuples over , and fix to be a function definable in from to , whose underlying function takes points of viewed as tuples together with witnesses of membership in to points of ; suppose is injective in the sense that for all unary tuples and all witnesses that is in and that is in , if the value of at with witness equals the value of at with witness then as tuples, which is vacuously true if has fewer than two elements; fix endpoints over and write for the set of unary tuples strictly between them; suppose every unary tuple in is in , so in particular is contained in ; suppose is strictly less than in the endpoint order; suppose that for every unary tuple with a witness of membership in such that is in , there exist unary tuples such that is in and is in and and in the strict order on unary tuples, and both of the following hold: first, for every unary tuple with a witness of membership in such that is in and and , the first and only coordinate of the value of at is the first and only coordinate of the value of at , and second, for every such with witness such that is in and and , the first and only coordinate of the value of at is the first and only coordinate of the value of at , where in each case the values of are taken at the points viewed as elements of via the stated membership witnesses, and this whole uniform two-sided local comparison hypothesis is vacuously true if no point of lies in ; then there exist endpoints over such that is strictly less than and every unary tuple in is in and is strictly decreasing on in the sense that for all unary tuples with respective membership witnesses in such that is in and is in , if then the first and only coordinate of the value of at is the first and only coordinate of the value of at , which decreasing condition is vacuously true if contains fewer than two witnessed points of .
Confirmed by the mission captain (proposal self-audit).