Can Any Function Be Decomposed into Odd and Even Subfunctions?

In summary, the conversation discusses how to show that any given function can be broken down into the sum of odd and even subfunctions. The speaker suggests using a continuous, differentiable function and proving that its Taylor series alternates between even and odd functions. However, the other speaker points out that this only works for functions with Taylor series expansions at every point. They suggest considering the definitions of odd and even functions to better understand the problem.
  • #1
thenewbosco
187
0
Hello, the question here says:

Show that any given function can be decomposed into the sum of manifestly odd and even subfunctions.

What i have done is just assumed a continuous, differentiable function, with a number a in the domain of the function, then shown that a taylor series for a function alternates between even and odd functions as the powers of x change from even to odd numbers. Is this enough for this question or is there something i haven't seen?

thanks
 
Physics news on Phys.org
  • #2
Is this enough for this question or is there something i haven't seen?
No! Surely you see that you have only proven it for functions that have Taylor series expansions at every point?

(Incidentally, even infinitely differentiabe functions can fail to have Taylor series)



This is the sort of problem where you just write down what things mean, and ideas should become evident. What does it mean for the function f(x) to be decomposed into an odd and an even subfunction? What does it mean for a function to be even? What does it mean for a function to be odd?

(Incidentally, you should always ask yourself questions like this anytime you get stuck. In fact, it usually helps to ask these questions before you get stuck)
 
  • #3


Hi there,

Thank you for sharing your approach to solving this question. Your idea of using the Taylor series expansion to show that a function can be decomposed into even and odd subfunctions is a valid approach. However, it would be helpful to provide a more formal proof to support your assumption. Additionally, it would be beneficial to provide an example of a specific function and its decomposition into even and odd subfunctions to further illustrate your point.

Another approach to proving this statement is to use the definition of even and odd functions. An even function is one that satisfies f(-x) = f(x) for all x in the domain, while an odd function satisfies f(-x) = -f(x) for all x in the domain. Using this definition, you can show that any given function can be decomposed into an even and odd subfunction by splitting the function into its even and odd parts, f(x) = g(x) + h(x), where g(x) is the even part and h(x) is the odd part. This can be done by plugging in -x and x into the original function and solving for g(x) and h(x) separately.

In summary, while your approach using the Taylor series expansion is a valid one, it would be helpful to provide a more formal proof and an example to support your argument. Alternatively, you can use the definition of even and odd functions to show the decomposition. I hope this helps!
 

What is function decomposition?

Function decomposition is a problem-solving technique used in computer science and mathematics to break down a complex problem into smaller, more manageable sub-problems. It involves breaking down a larger function into smaller, more specific functions that work together to solve the larger problem.

What is the purpose of function decomposition?

The purpose of function decomposition is to simplify complex problems and make them easier to solve. By breaking down a larger function into smaller, more specific functions, it allows for more efficient problem solving and also makes the code more organized and easier to maintain.

What are the benefits of using function decomposition?

Some benefits of using function decomposition include improved readability and maintainability of code, easier debugging and error handling, and more efficient problem solving. It also allows for code reuse, as the smaller functions can be used in multiple places within the larger function.

How is function decomposition different from recursion?

Function decomposition and recursion are both problem-solving techniques that involve breaking down a larger problem into smaller sub-problems. However, recursion involves a function calling itself, while function decomposition involves breaking down a larger function into smaller functions that work together to solve the larger problem.

When should function decomposition be used?

Function decomposition is especially useful for solving complex problems that are difficult to solve as a whole. It is also beneficial when working with larger functions that have multiple tasks or steps, as breaking them down into smaller functions can improve readability and organization of the code.

Similar threads

Replies
28
Views
5K
  • Calculus and Beyond Homework Help
Replies
1
Views
1K
  • Calculus and Beyond Homework Help
Replies
4
Views
2K
  • General Math
Replies
1
Views
2K
Replies
4
Views
407
  • Special and General Relativity
Replies
8
Views
1K
  • Engineering and Comp Sci Homework Help
Replies
17
Views
4K
  • Differential Equations
Replies
4
Views
2K
  • Programming and Computer Science
Replies
4
Views
741
Back
Top