What if any are the benefits, of presuming or  deriving that a function:F

 :F:[0,1] → [0,1] .

F being a tandard real valued function of one argument, -not a partial function, that assigns exactly one element of its co-domain, to each elements of its domain.

is 'strictly monotone increasing on its domain  in contrast to 'monotone increasing (B): (A)∀ (x  ∈ [0,1]=Dom(F): x>y ⟺ F(x)>F(y) 

(B) (x ∈ [0,1]=Dom(F) x>y → F(x)≥F(y);

That is, as a tool in deriving that the function F is continuous or linear? 

Particularly in the case, where a  function is already quite homogeneous already?

 For example, where∀ (x)∈ { Dℚ]∩   [0,1]}:F(x)=x.

where, F(1)=1 and F(0)=0, and  Dℚ, denotes the set of all dyadic rational numbers∈[0,1]=Dom(F) ?

Tat is  to show that∀ (x ∈ [0,1]=Dom (F) ):  F(x)=x,?

Generally F need only be presumed, monotone increasing  over its  domain(F)=[0,1]. Where  G  is identity function, ∀ (x ∈ [0,1]∩ Dℚ]: F(x)=G(x)=x 

That is, when dense set, arguments are applied to show that F=G(x)=x for all reals in [0,1] or (0,1)as,  F=G, over all dyadic rationals,  a dense subset ofdom(F)= [0,1], , and as G is is strictly monotone increasing and continous and as F is monotone increasing ,and preserves limits: Then generally it is concluded, that

∀ (x) ∈ (0,1) :F(x)=G(x)=x  (for all reals in the open interval) and is continuous on (0,1).

Are there any benefits for these kinds of results, in already having that F is strictly monotone increasing (that is beforehand, and not as a consequence of the fact that F=G, and G the identity function, is strictly monotone increasing). Ie, to achieve said result. or something like it.?

More William Balthes's questions See All
Similar questions and discussions