An involution is a function, f ( x ) , that "un-does" itself such that f ( f ( x ) ) = x .
Here are three examples:
f ( x ) = x 1 f ( x ) = − x f ( x ) = x − 1 x ⟹ ⟹ ⟹ f ( f ( x ) ) = x 1 1 = x f ( f ( x ) ) = − ( − x ) = x f ( f ( x ) ) = x − 1 x − 1 x − 1 x = x .
How many of these special types of functions are there?
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.
This is incorrect, as this is only 1 type of function. The problem is asking for how many types there are.
Log in to reply
I see that my solution doesn't answer this question completely (partly because the wording has been changed) but it's also dificult to define a type of funtion.
sin x is obviously a type , but are cos x , tan x , … the same type "trigonometric functions" or are sin ( 2 x ) , sin ( x 2 ) , sin ( x 1 ) , … the type "derived from sine"? And what about sin ( sin x ) , sin ( sin ( sin x ) ) , … . Are they the type "composition of sine" or every one a new type "n-times composition"? Are polynomials one type or distinguished by their degree?
Log in to reply
See @Brian Moehring 's solution to see the different types there are.
Log in to reply
@Blan Morrison – His solution is by far more general, but I still think that type is a very vague phrase. All his functions can be seen as the type even function , but of course they're of many different types like squareroots, trigonometric functions, etc.
Log in to reply
@Henry U – This is true. Your solution provides one of infinite subsets, with each subset containing an infinite amount of functions.
If x/(x-1) is a different type than 1/x, then surely is (x-1)/x, (x+1)/x, x^i/x, log 78 /x...........
The thing is that replace <the numerator:a> with any expression, as layer on it will get cancelled by itself!
a is constant number, hence we can change it and can get infinite function
Then, define a "type" of function. I'm fine with he's example.
Consider a new function g ( x ) = h ( f ( h − 1 ( x ) ) ) , with f ( x ) being an involution and h ( x ) being any function with an inverse. g ( g ( x ) ) = h ( f ( h − 1 ( h ( f ( h − 1 ( x ) ) ) ) ) ) = h ( f ( f ( h − 1 ( x ) ) ) ) = h ( h − 1 ( x ) ) = x Thus, g ( x ) is also an involution. Since there are infinitely many invertible functions, there must be infinitely many involutions.
Note that this shows the set of involutions is closed under conjugation. This is definitely an interesting fact.
However, your conclusion requires the map h ↦ h ∘ f ∘ h − 1 to be finite-to-one [for at least one f ]. This is probably true, but it isn't implied by your solution.
Log in to reply
Yeah, that's a hole that I should probably fix. f ( x ) = a − x is one such involution with no singular points, but of course there are others.
Now, this a solution! How did you think of this???
That's a really nice solution, but how do you know that this algorithm creates infinitely many distinct(!) functions?
For example: f(x) = -x and h(x) = 2*x do not create a new function.
Log in to reply
That's a good question - f ( x ) = − x wouldn't generally work, but f ( x ) = a − x will, with the additional constraint that h ( x ) isn't linear - for example a − x 2 , l n ( a − e x ) , and a − 1 / x 1 are all involutions.
A one-dimensional involution can be interpreted graphically as any function which is symmetric over the line y = x . For instance, you can take any continuously differentiable even function g ( x ) such that ∣ g ′ ( x ) ∣ < 1 for every x . Then rotate its graph 4 5 ∘ clockwise and you'll end up with the graph of an involution.
Using this construction, the functions given in the problem are g ( x ) = 2 a ⟹ f ( x ) = a − x g ( x ) = 2 + x 2 ⟹ f ( x ) = 1 / x g ( x ) = 2 + x 2 + 2 ⟹ f ( x ) = x − 1 x
It should be apparent that there are infinitely more g ( x ) . For instance, we could use
Very interesting! Although, how do we know that the first paragraph is true?
Log in to reply
I made a few comments in the first paragraph, but most of them are common or at least direct to show. For instance,
That leaves only one remaining claim: If ∣ g ′ ( x ) ∣ < 1 for all x , then rotating the graph of g by 4 5 ∘ clockwise yields the graph of a function. To show this, suppose the resulting graph is not the graph of a function, so that there are two points that lie on the same vertical line. Rotating this 4 5 ∘ counterclockwise shows two points on the graph of g lie on a line with slope − 1 , which by the mean value theorem implies g ′ ( x 0 ) = − 1 for some x 0 . This provides your contradiction.
This is somewhat more complicated than the typical basic level questions.
The simplest function not on your list is the identity function: f ( x ) = x
Any function that has y = x as a line of symmetry also works.
I believe you mean "any function that has a line of symmetry of y = x ," as f ( x ) = x 2 is not an involution.
Log in to reply
Any function that has this as a line of symmetry also works. "this" being the line defined by f ( x ) = x . I will clarify.
Any homographic function f ( x ) = c x + d a x + b , ( c = 0 , a d = b c ) , is an involution, iff a + d = 0 .
Consider the function f ( x ) = x − 1 x + a , where a is any real. Now, find f ( f ( x ) ) : f ( f ( x ) ) = x − 1 x + a − 1 x − 1 x + a + a Multiplying a (in the numerator) and -1 (in the denominator) by x − 1 x − 1 : x − 1 x + a + x − 1 − x + 1 x − 1 x + a + x − 1 a x − a = x − 1 a + 1 x − 1 x ( a + 1 ) = a + 1 x ( a + 1 ) = x Therefore, since a can be any real, there are uncountably infinitely more solutions. β ⌈ ∣ ⌉
If you are considering that infinite a 's = infinite functions, wouldn't that mean that the question setter's first function itself concludes infinite functions?
Log in to reply
The question asks for how many more functions, not how many.
Log in to reply
If that is the thing, then why did you give f ( f ( x ) ) = x − 1 x + a , you could have given the function f ( x ) = 1 − x or f ( x ) = 2 − x and so on.. they are infinite in number... but in the question all functions of the type f ( x ) = a − x are considered as 1.
And the example you are giving is also a function which just represents one particular type... it doesn't proves that there are infinite functions...
Log in to reply
It depends on how you define function.
@Henry U gave a similar example as mine, and no one is disputing him.
Log in to reply
@Blan Morrison – Well, my point is... even if you give 100 or even 1000 more functions which satisfy f ( f ( x ) ) = x , that doesn't mean there are infinite functions until and unless you prove it. The solution with a proof can be considered as of Brian Moehring and Levi Adam Walker.
for any a f(x)=a-x is an example
f(x)=a-x
f(f(x))= a-(a-x)) = a-a+x = x
Suppose we have such a function, f ( x ) . As is commonly done to functions, let's look at this one as a relationship on the x-y plane. f ( x ) being an involution means that for every x we plug in, we can take the corresponding y , plug it back in, and out comes that same x value we started with. If you pick enough x 's and make up enough y 's... You might notice some kind of mirror symmetry in the picture. But all we need in order to argue that there's infinitely many involutions is this: Imagine the function being built two points at a time, starting at say, x = 0 . We can make up any corresponding y value for x = 0 . And as soon as we get the point ( 0 , s o m e t h i n g ) , we also get a second point ( s o m e t h i n g , 0 ) . We move a little bit to the left of 0, getting two new points. Then we move a little bit to the right of 0, getting two more points. We do this for every number on the x axis, and we have our involution. But since we made up each y value, we had infinitely many choices for a function, no matter how strange-looking.
The family of functions f(x)=a^(1/(log base a of x)) are all involutions, since a^1/log base a of (a^1/log base a of x)=a^log base a of x=x.
In mathematics there exists infinite no. Of invertible functions. Here are just pool of three enlisted.
In fact h(f(x))=x holds if the function h is inverse of f. Inverse functions have property that they are symmetric about y=x.Here we have f in place of h so any function which is symmetric about y=x will hold this property.
I don’t know this type of math. I guessed the right answer :P hahahahahahahaaha.
If a function is an involution, then (from the definition given in the problem) it is its own inverse.
Remember that the graphs of a function and its inverse are mirror images in the line y = x
So any function which is symmetrical in the line y = x is its own inverse, and therefore is an involution.
There are infinitely many such graphs. For example, any of the lines perpendicular to y = x will do, so
y = − x + a represents an infinite family of invloutions.
Let's illustrate this with a specific example. Let's choose y ( x ) = − x + 3 and x = 7 . Then
y ( y ( 7 ) ) = − y ( 7 ) + 3 = − ( − 7 + 3 ) + 3 = − ( − 4 ) + 3 = 4 + 3 = 7
Since we have found an infinite family of involutions (and there other such families) we can certainly say
There are an infinite number of involutions
All functions f ( x ) = x k 1 are example of it
For any A ⊂ R + , the function f defined by f ( x ) = − x if x ∈ A or − x ∈ A and by f ( x ) = x otherwise, is an involution.
Just take
f(x) = x for all x exept for :
f(a) = b
f(b) = a
The first function 1/x will also work with any value (e.g. 2/x, 3/x, 4/x ....)
The question asks for how many types , not just functions. You have only listed 1 type.
A function, f ( x ) , is another function, g ( x ) 's inverse iff you get the graph of g ( x ) when you reflect the graph of f ( x ) over the line x = y . This means that for a function to be an involution, it has to remain the same when reflected over the line x = y . It is obvious that there are infinitely many graphs of this type that aren't of the form a − x . Therefore, there are infinitely many more involutions than the examples provided.
If f ( x ) = n then f ( f ( x ) ) = f ( n ) wich is n .
Problem Loading...
Note Loading...
Set Loading...
The function f ( x ) = x a is an example for all real a = 0 since
f ( f ( x ) ) = x a a = x a ⋅ x a ⋅ x = a a x = x .