Existence of a Constant n in Integer Function Proof

  • Thread starter Thread starter icestone111
  • Start date Start date
  • Tags Tags
    General Proof
icestone111
Messages
10
Reaction score
0

Homework Statement


Let f: Z → Z be a function such that f(a + b) = f(a) + f(b) for all a,b ε Z. Prove that there exists an integer n such that f(a) = an for all a ε Z.

The Attempt at a Solution


I'm a little bit confused here if this is just supposed to be really simple, or if there's more to it that I'm just completely missing.

What I am thinking right now is that, couldn't n be any integer and you can just define f as a function f(x) = xn and therefore f(a + b) = (a + b)n = an + bn = f(a) + f(b) which satisfies the original statement?

Thanks!
 
Physics news on Phys.org
icestone111 said:

Homework Statement


Let f: Z → Z be a function such that f(a + b) = f(a) + f(b) for all a,b ε Z. Prove that there exists an integer n such that f(a) = an for all a ε Z.

The Attempt at a Solution


I'm a little bit confused here if this is just supposed to be really simple, or if there's more to it that I'm just completely missing.

What I am thinking right now is that, couldn't n be any integer and you can just define f as a function f(x) = xn and therefore f(a + b) = (a + b)n = an + bn = f(a) + f(b) which satisfies the original statement?

Thanks!
So, you're saying that not only is this true for a particular integer, n, but it's true no matter what integer is used for n?

That does appear to be true.
 
Thanks for your reply, so I do not have to analyze this question any further?
 
SammyS may be misinterpreting your problem. As stated, with the function from Z to Z, this is true: if f(x+y)= f(x)+ f(y), there exist n such that f(x)= nx.

I recommend you do this in "sections". First prove that for k any positive integer, f(k)= kf(1) by induction on k. Then show, by looking at f(k+ 0), that f(0)= 0. Finally, show, by looking at f(k+(-k)), that f(-k)= -f(k)= -kf(1). Of course, "n" is just f(1).
 
i think the point of this problem is to show that f is completely determined by f(1).

as HallsofIvy pointed out, it's best to prove this first for the natural numbers using induction, and then show that f(0) must be 0, and then that f(-k) must be -(f(k)).

alternatively, any integer m is (m)(1). you could handle all 3 cases (positive integers, 0 and negative integers) by using induction on |m|, although this is a bit trickier, and would involve proving the cases f(m+1) and f(m-1) separately, from the induction hypothesis (you'd still have to show that f(-1) = -f(1)). it pretty much works out to be the same amount of work.
 
Thanks guys, this was a bunch of help. So there was more than expected, and it makes sense now!
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top