Dragonfall
- 1,023
- 5
Is there an easy description for all the real to real functions that are order-preserving? I can only think of linear functions
What do you mean by "order-preserving?" Is it the idea that if a < b, then f(a) < f(b)? If so any function that is strictly increasing satisfies the latter inequality. If you mean something different, you need to clarify your question.Dragonfall said:Is there an easy description for all the real to real functions that are order-preserving? I can only think of linear functions
mfb said:Uniformly random where?
Every f is "decomposable" that way, simply set f_1(x)=f(x), f_2(x)=x (or vice versa).
Knowing only one of an arbitrary and unknown "decomposition" makes the task impossible - see my example, one of the functions could be just the identify function.
I think it would really help if you give more context. What do you actually want to do?
So who is supposed to know what? What is the protocol you want to use, and what is the result?Dragonfall said:I'm trying to come up with something similar for two ordered committed numbers.