What can we say about the cardinality of the set of solutions of the functional equation f ( x − 1 1 ) f ( x ) = f ( x − 1 1 ) + 1 ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
How is the assumption of the possible solution made? By observation or is there a standard theorem/method ? Thank you.
Log in to reply
Jacob, in my opinion, this is mostly trials and errors in this case. You might assume, for example, that the solution is a polynomial and then by substitution into the equation you can find the coefficients. When I was solving this problem, I assumed that the solution is a rational function that is also a Mobius transformation, so a function of the form y = c x + d a x + b . Once I found the solutions, I realized that the procedure that I used works even better (easier to explain) if you assume that the function has the form y = b x + c x + a . Of course, this does not prove that all possible solutions can be represented as an f c , but at least I found a family of solutions big enough to make the conclusion that the set of all possible solutions must be uncountable.
An ersatz is when you “try out” a solution known in advance to be the answer. The ersatz here is a special case of the form c x + d a x + b , known as a Möbius transformation.
f(x)=x is solution
Problem Loading...
Note Loading...
Set Loading...
Let us assume that a possible solution of the given functional equation has the form f ( x ) = b x + c x + a . By substituting into the de equation, we can see that we might choose a = b = 1 − c for the equation to hold. Therefore, any function f c ( x ) = ( 1 − c ) x + c x + 1 − c is a solution of the functional equation for any real value of c . Besides that, it easy to see that if c 1 = c 2 , then f c 1 = f c 2 . Then the cardinality of the set of all possible solutions must be uncountable.
Can you show your own solution below?