Is this correct proving function addition is associative?

SMA_01
Messages
215
Reaction score
0
Is this correct...proving function addition is associative?

Homework Statement



Let F be the set of all real-valued functions having as domain the set ℝ of all real number. Prove that function addition + on F is associative.

Homework Equations






The Attempt at a Solution



I'm not sure if I approached this correctly, but here is how I did it:

For all f,g,h in F:

(f+g)(x)+h(x)
=f(x)+g(x)+h(x) [by definition of function addition]

and

f(x)+(g+h)(x)
=f(x)+g(x)+h(x) [by definition of function addition]

so that, (f+g)(x)+h(x)=f(x)+(g+h)(x) for all x in ℝ

Did I do this correctly? Any help is appreciated, thanks.
 
Physics news on Phys.org


SMA_01 said:

Homework Statement



Let F be the set of all real-valued functions having as domain the set ℝ of all real number. Prove that function addition + on F is associative.

Homework Equations



The Attempt at a Solution



I'm not sure if I approached this correctly, but here is how I did it:

For all f,g,h in F:

(f+g)(x)+h(x)
=f(x)+g(x)+h(x) [by definition of function addition]

and

f(x)+(g+h)(x)
=f(x)+g(x)+h(x) [by definition of function addition]

so that, (f+g)(x)+h(x)=f(x)+(g+h)(x) for all x in ℝ

Did I do this correctly? Any help is appreciated, thanks.
In my opinion, you skipped some steps.

I would say that:
(f+g)(x)+h(x)
=(f(x)+g(x))+h(x) [by definition of function addition]​
Anything beyond that result requires the mention of or convention for "order of operations".
I admit this is being a little picky.

The following is not being picky.
Your other statement should say:
f(x)+(g+h)(x)
=f(x)+(g(x)+h(x)) [by definition of function addition]​
To go beyond this requires you to call on the associativity of ordinary addition.
 


SammyS- Thank you, I am not fully understanding what you mean by order of operations though, can you please clarify?
 


Also, should I mention associativity of addition after both results?
 


For functions f and g, the sum, f+ g, is defined by (f+ g)(x)= f(x)+ g(x). Do you understand the notation? f and g are the functions, f(x) and g(x) are the values of the functions. f+ g is a sum of functions, f(x)+ g(x) is a sum of numbers.

(f+ g)+ h is the function such that ((f+ g)+ h)(x)= (f(x)+ g(x))+ h(x). Now, because addition of numbers is associative, (f(x)+ g(x))+ h(x)= f(x)+ (g(x)+ h(x))= (f+ (g+h))(x).
 


SMA_01 said:
SammyS- Thank you, I am not fully understanding what you mean by order of operations though, can you please clarify?
What I meant by "order of operations" was that: if all operations are the same, in this case they're all addition, then a + b + c is the same as (a + b) + c .
 
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