A subwindow with a uniform sign pattern
ProvedMonotonicity_Theorem.uniform_pattern_windowOn any interval window, some subwindow has the property that every point of it satisfies the same one of the four local sign patterns (above/below on each side). This selects the uniform pattern driving the four cases of Lemma 2.
import Definitions.Def_Monotonicity_Theorem_Framework
theorem Monotonicity_Theorem.uniform_pattern_window {R : Type} (D : DenseLinearOrderNoEndpoints R)
(M : OMinimalStructure D) {I B : Set (Power R 1)}
(f : DefinableFunction M I B)
(hinj : forall x y (hx : I x) (hy : I y),
f.toFun (Subtype.mk x hx) = f.toFun (Subtype.mk y hy) -> x = y)
{a0 b0 : Endpoint R} (hsub0 : (openInterval D a0 b0).Subset I)
(hlt0 : Endpoint.lt D a0 b0) :
exists a b : Endpoint R, Endpoint.lt D a b /\
(forall x, openInterval D a b x -> openInterval D a0 b0 x) /\
((forall x (hxI : I x), openInterval D a b x ->
exists c1 c2 : Power R 1, openInterval D a b c1 /\ openInterval D a b c2 /\
Lt1 D c1 x /\ Lt1 D x c2 /\
(forall y (hyI : I y), openInterval D a b y -> Lt1 D c1 y -> Lt1 D y x ->
Lt1 D (f.toFun (Subtype.mk x hxI)).1 (f.toFun (Subtype.mk y hyI)).1) /\
(forall y (hyI : I y), openInterval D a b y -> Lt1 D x y -> Lt1 D y c2 ->
Lt1 D (f.toFun (Subtype.mk x hxI)).1 (f.toFun (Subtype.mk y hyI)).1)) \/
(forall x (hxI : I x), openInterval D a b x ->
exists c1 c2 : Power R 1, openInterval D a b c1 /\ openInterval D a b c2 /\
Lt1 D c1 x /\ Lt1 D x c2 /\
(forall y (hyI : I y), openInterval D a b y -> Lt1 D c1 y -> Lt1 D y x ->
Lt1 D (f.toFun (Subtype.mk x hxI)).1 (f.toFun (Subtype.mk y hyI)).1) /\
(forall y (hyI : I y), openInterval D a b y -> Lt1 D x y -> Lt1 D y c2 ->
Lt1 D (f.toFun (Subtype.mk y hyI)).1 (f.toFun (Subtype.mk x hxI)).1)) \/
(forall x (hxI : I x), openInterval D a b x ->
exists c1 c2 : Power R 1, openInterval D a b c1 /\ openInterval D a b c2 /\
Lt1 D c1 x /\ Lt1 D x c2 /\
(forall y (hyI : I y), openInterval D a b y -> Lt1 D c1 y -> Lt1 D y x ->
Lt1 D (f.toFun (Subtype.mk y hyI)).1 (f.toFun (Subtype.mk x hxI)).1) /\
(forall y (hyI : I y), openInterval D a b y -> Lt1 D x y -> Lt1 D y c2 ->
Lt1 D (f.toFun (Subtype.mk x hxI)).1 (f.toFun (Subtype.mk y hyI)).1)) \/
(forall x (hxI : I x), openInterval D a b x ->
exists c1 c2 : Power R 1, openInterval D a b c1 /\ openInterval D a b c2 /\
Lt1 D c1 x /\ Lt1 D x c2 /\
(forall y (hyI : I y), openInterval D a b y -> Lt1 D c1 y -> Lt1 D y x ->
Lt1 D (f.toFun (Subtype.mk y hyI)).1 (f.toFun (Subtype.mk x hxI)).1) /\
(forall y (hyI : I y), openInterval D a b y -> Lt1 D x y -> Lt1 D y c2 ->
Lt1 D (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 a type with a dense linear order without endpoints , an o-minimal structure over , sets of -tuples over , and a definable function from to with respect to ; assume is injective in the sense that for all with and , if the underlying function of takes the same value at (viewed in ) and at (viewed in ) then as -tuples; assume endpoints satisfy in the endpoint order for and as sets, where denotes the -open interval. Then there exist endpoints such that in the endpoint order for and as sets, i.e. every with satisfies , and at least one of the following four uniform local patterns holds on : (1) for every with and there exist with , , and in the -dimensional strict order for , such that for every with and , if and then the first coordinate of is strictly less than the first coordinate of , and if and then the first coordinate of is strictly less than the first coordinate of ; (2) same with the same left-hand clause for but for ; (3) same with for and for ; (4) same with for and for , where in each case and denote -tuples viewed in when applying , abbreviates and , and abbreviates and . If there is no then each universal pattern holds vacuously, and likewise each inner universal over holds vacuously when there is no with respectively .
Confirmed by the mission captain (proposal self-audit).