Is Differentiation an Operator That Forms a Group?

[TylerH]

I'm learning about group theory and wanted to apply it to something other than + and *, and I'm having trouble understanding how it can be applied to differentiation. I can see that integration would be the inverse, but is it binary of unary? Since you would write it as d(f), it appears unary, but you also have to know what variable to differentiate with respect to... Do you see the paradox?

I also noticed it is distributive but I don't think it's associative...

 

[TylerH]

What about the sets it operates on, how could you make a set with elements that are expressions? (maybe I should study set theory some more...)

 

[chiro]

I'm learning about group theory and wanted to apply it to something other than + and *, and I'm having trouble understanding how it can be applied to differentiation. I can see that integration would be the inverse, but is it binary of unary? Since you would write it as d(f), it appears unary, but you also have to know what variable to differentiate with respect to... Do you see the paradox?

I also noticed it is distributive but I don't think it's associative...

Like you said, groups involve binary operators: differentiation does not: it is an unary operator.

 

[Fredrik]

Since you would write it as d(f), it appears unary, but you also have to know what variable to differentiate with respect to... Do you see the paradox?

There is no paradox. Let X be the set of functions from ℝ into ℝ, and let S be the set of all f in X such that for all x in ℝ, the limit

\lim_{h\rightarrow 0}\frac{f(x+h)-f(x)}{h}

exists. The derivative operator D is a function from S into X, defined as follows. For each function f in S, we define a function f' by

f'(x)=\lim_{h\rightarrow 0}\frac{f(x+h)-f(x)}{h}

for all x. Then we define D:S→X by Df=f'.

(Note that the expressions f and f' represent functions while the expressions f(x) and f'(x) represent numbers in the ranges of those functions).

A good example of a group that doesn't have addition or multiplication as the group operation is the group of permutations on a set X (i.e. the set of bijections from X into X with composition of functions as the binary operation).

 

[slider142]

Also, the set of all smooth (continuously differentiable to all degrees) bijective functions is a group under the group operation of function composition.

 

[micromass]

What you probably can do is look at the set of all smooth functions. Then the integers \mathbb{Z} act on this set by differentiation.Thus we put an action on the smooth functions as

n\cdot f=f^{(n)}

However, this would also require negative derivatives, but I don't think that will pose a problem.

Using fractional calculus, we can even let \mathbb{R} act on the set of smooth functions. Using the same action.

I'll leave it to you to fill in the details

 

[adriank]

micromass: Somehow you will have to deal with the fact that two different functions can have the same derivative (if they differ by a constant). If you restrict yourself to functions where, say, f(0) = 0, then you could indeed allow Z to act on the set of such functions (where 1 acts by differentiation).

Also, the set of all smooth (continuously differentiable to all degrees) bijective functions is a group under the group operation of function composition.

False. The function f: R -> R, f(x) = x³, is smooth and bijective but does not have a smooth inverse.