Hubbry Logo
Even and odd functionsEven and odd functionsMain
Open search
Even and odd functions
Community hub
Even and odd functions
logo
8 pages, 0 posts
0 subscribers
Be the first to start a discussion here.
Be the first to start a discussion here.
Even and odd functions
Even and odd functions
from Wikipedia
The sine function and all of its Taylor polynomials are odd functions.
The cosine function and all of its Taylor polynomials are even functions.

In mathematics, an even function is a real function such that for every in its domain. Similarly, an odd function is a function such that for every in its domain.

They are named for the parity of the powers of the power functions which satisfy each condition: the function is even if n is an even integer, and it is odd if n is an odd integer.

Even functions are those real functions whose graph is self-symmetric with respect to the y-axis, and odd functions are those whose graph is self-symmetric with respect to the origin.

If the domain of a real function is self-symmetric with respect to the origin, then the function can be uniquely decomposed as the sum of an even function and an odd function.

Early history

[edit]

The concept of even and odd functions appears to date back to the early 18th century, with Leonard Euler playing a significant role in their formalization. Euler introduced the concepts of even and odd functions (using Latin terms pares and impares) in his work Traiectoriarum Reciprocarum Solutio from 1727. Before Euler, however, Isaac Newton had already developed geometric means of deriving coefficients of power series when writing the Principia (1687), and included algebraic techniques in an early draft of his Quadrature of Curves, though he removed it before publication in 1706. It is also noteworthy that Newton didn't explicitly name or focus on the even-odd decomposition, his work with power series would have involved understanding properties related to even and odd powers.

Definition and examples

[edit]

Evenness and oddness are generally considered for real functions, that is real-valued functions of a real variable. However, the concepts may be more generally defined for functions whose domain and codomain both have a notion of additive inverse. This includes abelian groups, all rings, all fields, and all vector spaces. Thus, for example, a real function could be odd or even (or neither), as could a complex-valued function of a vector variable, and so on.

The given examples are real functions, to illustrate the symmetry of their graphs.

Even functions

[edit]
is an example of an even function.

A real function f is even if, for every x in its domain, x is also in its domain and[1]: p. 11  or equivalently

Geometrically, the graph of an even function is symmetric with respect to the y-axis, meaning that its graph remains unchanged after reflection about the y-axis.

Examples of even functions are:

  • The absolute value
  • for any even integer
  • cosine
  • hyperbolic cosine
  • Gaussian function

Odd functions

[edit]
is an example of an odd function.

A real function f is odd if, for every x in its domain, x is also in its domain and[1]: p. 72  or equivalently

Geometrically, the graph of an odd function has rotational symmetry with respect to the origin, meaning that its graph remains unchanged after rotation of 180 degrees about the origin.

If is in the domain of an odd function , then .

Examples of odd functions are:

  • The sign function
  • The identity function
  • for any odd integer
  • for any odd positive integer
  • sine
  • hyperbolic sine
  • The error function
is neither even nor odd.

Basic properties

[edit]

Uniqueness

[edit]
  • If a function is both even and odd, it is equal to 0 everywhere it is defined.
  • If a function is odd, the absolute value of that function is an even function.

Addition and subtraction

[edit]
  • The sum of two even functions is even.
  • The sum of two odd functions is odd.
  • The difference between two odd functions is odd.
  • The difference between two even functions is even.
  • The sum of an even and odd function is not even or odd, unless one of the functions is equal to zero over the given domain.

Multiplication and division

[edit]
  • The product and quotient of two even functions is an even function.
    • This implies that the product of any number of even functions is also even.
    • This implies that the reciprocal of an even function is also even.
  • The product and quotient of two odd functions is an even function.
  • The product and both quotients of an even function and an odd function is an odd function.
    • This implies that the reciprocal of an odd function is odd.

Composition

[edit]
  • The composition of two even functions is even.
  • The composition of two odd functions is odd.
  • The composition of an even function and an odd function is even.
  • The composition of any function with an even function is even (but not vice versa).

Inverse function

[edit]
  • If an odd function is invertible, then its inverse is also odd.

Even–odd decomposition

[edit]

If a real function has a domain that is self-symmetric with respect to the origin, it may be uniquely decomposed as the sum of an even and an odd function, which are called respectively the even part (or the even component) and the odd part (or the odd component) of the function, and are defined by and

It is straightforward to verify that is even, is odd, and

This decomposition is unique since, if

where g is even and h is odd, then and since

For example, the hyperbolic cosine and the hyperbolic sine may be regarded as the even and odd parts of the exponential function, as the first one is an even function, the second one is odd, and

.

Fourier's sine and cosine transforms also perform even–odd decomposition by representing a function's odd part with sine waves (an odd function) and the function's even part with cosine waves (an even function).

Further algebraic properties

[edit]
  • Any linear combination of even functions is even, and the even functions form a vector space over the reals. Similarly, any linear combination of odd functions is odd, and the odd functions also form a vector space over the reals. In fact, the vector space of all real functions is the direct sum of the subspaces of even and odd functions. This is a more abstract way of expressing the property in the preceding section.
    • The space of functions can be considered a graded algebra over the real numbers by this property, as well as some of those above.
  • The even functions form a commutative algebra over the reals. However, the odd functions do not form an algebra over the reals, as they are not closed under multiplication.

Analytic properties

[edit]

A function's being odd or even does not imply differentiability, or even continuity. For example, the Dirichlet function is even, but is nowhere continuous.

In the following, properties involving derivatives, Fourier series, Taylor series are considered, and these concepts are thus supposed to be defined for the considered functions.

Basic analytic properties

[edit]
  • The derivative of an even function is odd.
  • The derivative of an odd function is even.
  • If an odd function is integrable over a bounded symmetric interval , the integral over that interval is zero; that is[2]
    .
  • If an even function is integrable over a bounded symmetric interval , the integral over that interval is twice the integral from 0 to A; that is[3]
    .
    • This property is also true for the improper integral when , provided the integral from 0 to converges.

Series

[edit]

Harmonics

[edit]

In signal processing, harmonic distortion occurs when a sine wave signal is sent through a memory-less nonlinear system, that is, a system whose output at time t only depends on the input at time t and does not depend on the input at any previous times. Such a system is described by a response function . The type of harmonics produced depend on the response function f:[4]

  • When the response function is even, the resulting signal will consist of only even harmonics of the input sine wave;
    • The fundamental is also an odd harmonic, so will not be present.
    • A simple example is a full-wave rectifier.
    • The component represents the DC offset, due to the one-sided nature of even-symmetric transfer functions.
  • When it is odd, the resulting signal will consist of only odd harmonics of the input sine wave;
  • When it is asymmetric, the resulting signal may contain either even or odd harmonics;
    • Simple examples are a half-wave rectifier, and clipping in an asymmetrical class-A amplifier.

This does not hold true for more complex waveforms. A sawtooth wave contains both even and odd harmonics, for instance. After even-symmetric full-wave rectification, it becomes a triangle wave, which, other than the DC offset, contains only odd harmonics.

Generalizations

[edit]

Multivariate functions

[edit]

Even symmetry:

A function is called even symmetric if:

Odd symmetry:

A function is called odd symmetric if:

Complex-valued functions

[edit]

The definitions for even and odd symmetry for complex-valued functions of a real argument are similar to the real case. In signal processing, a similar symmetry is sometimes considered, which involves complex conjugation.[5][6]

Conjugate symmetry:

A complex-valued function of a real argument is called conjugate symmetric if

A complex valued function is conjugate symmetric if and only if its real part is an even function and its imaginary part is an odd function.

A typical example of a conjugate symmetric function is the cis function

Conjugate antisymmetry:

A complex-valued function of a real argument is called conjugate antisymmetric if:

A complex valued function is conjugate antisymmetric if and only if its real part is an odd function and its imaginary part is an even function.

Finite length sequences

[edit]

The definitions of odd and even symmetry are extended to N-point sequences (i.e. functions of the form ) as follows:[6]: p. 411 

Even symmetry:

A N-point sequence is called conjugate symmetric if

Such a sequence is often called a palindromic sequence; see also Palindromic polynomial.

Odd symmetry:

A N-point sequence is called conjugate antisymmetric if

Such a sequence is sometimes called an anti-palindromic sequence; see also Antipalindromic polynomial.

See also

[edit]

Notes

[edit]

References

[edit]
Revisions and contributorsEdit on WikipediaRead on Wikipedia
from Grokipedia
In mathematics, even functions are those that satisfy the condition f(x)=f(x)f(-x) = f(x) for all xx in their domain, meaning their graphs are symmetric about the y-axis. Odd functions, in contrast, satisfy f(x)=f(x)f(-x) = -f(x), resulting in graphs symmetric about the origin. These classifications apply to functions from the real numbers to the real numbers and are fundamental in analyzing symmetry in calculus and beyond. Graphically, an even function mirrors itself across the y-axis, so if the point (x,y)(x, y) lies on the graph, then (x,y)(-x, y) does as well. For odd functions, the about the origin implies that if (x,y)(x, y) is on the graph, then (x,y)(-x, -y) is also present, and such functions must pass through the origin with f(0)=0f(0) = 0. Algebraically, one tests for evenness or oddness by substituting x-x into the function and comparing the result to f(x)f(x) or f(x)-f(x). Common examples include polynomials where even powers like x2x^2 or x4x^4 yield even functions, while odd powers such as xx or x3x^3 produce odd functions. follow suit: cos(ax)\cos(ax) is even, and sin(ax)\sin(ax) is odd. A function that is both even and odd must be the zero function everywhere it is defined. Any function can be uniquely decomposed into its even part, f(x)+f(x)2\frac{f(x) + f(-x)}{2}, and odd part, f(x)f(x)2\frac{f(x) - f(-x)}{2}. Key properties include rules for products: the product of two even functions or two odd functions is even, while the product of an even and an odd function is odd. In integration, the integral of an odd function over a symmetric interval [L,L][-L, L] is zero, whereas for an even function, it equals twice the integral from 0 to LL. These symmetries extend to applications in , where even functions expand using only cosines and odd functions using only sines, simplifying series representations.

Definitions and Examples

Even Functions

An even function is a univariate real-valued function ff that satisfies the condition f(x)=f(x)f(-x) = f(x) for every xx in its domain. This definition captures the inherent symmetry of the function with respect to input negation. Geometrically, the graph of an even function exhibits mirror symmetry across the y-axis, meaning that the point (x,f(x))(x, f(x)) on the graph has a corresponding point (x,f(x))(-x, f(x)) that is its reflection over the y-axis. This property allows the function's behavior to the right of the y-axis to precisely mirror its behavior to the left. Common examples illustrate this symmetry clearly. The f(x)=x2f(x) = x^2 is even, since f(x)=(x)2=x2=f(x)f(-x) = (-x)^2 = x^2 = f(x), and its graph forms a parabola opening upward, symmetric about the y-axis. The cosine function f(x)=cosxf(x) = \cos x is also even, as cos(x)=cosx\cos(-x) = \cos x, resulting in a periodic wave that repeats symmetrically on both sides of the y-axis. Additionally, the f(x)=xf(x) = |x| qualifies as even because x=x|-x| = |x|, producing a V-shaped graph that is perfectly mirrored across the y-axis. Even functions are typically defined on domains symmetric about zero, such as intervals of the form (a,a)(-a, a) where a>0a > 0, to ensure the symmetry condition applies consistently across the entire domain. This symmetry contrasts with that of odd functions, which exhibit antisymmetry about the origin.

Odd Functions

An odd function is a function ff defined on a domain symmetric about such that f(x)=f(x)f(-x) = -f(x) for all xx in the domain. This property implies that the function values at xx and x-x are negatives of each other, reflecting an antisymmetric behavior with respect to the origin. Geometrically, the graph of an odd function exhibits point symmetry about the origin, meaning that rotating the graph 180 degrees around the origin maps it onto itself. This rotational symmetry distinguishes odd functions from even functions, which are symmetric about the y-axis. For the definition to hold, the domain must be symmetric about zero, so that if xx is in the domain, then x-x is also in the domain. If zero is in the domain of an odd function, then f(0)=f(0)f(0) = -f(0), which implies f(0)=0f(0) = 0. Common examples include the f(x)=xf(x) = x, which passes through the origin and satisfies the condition linearly; the sine function f(x)=sinxf(x) = \sin x, a periodic odd function with antisymmetry in each cycle; and the f(x)=x3f(x) = x^3, which maintains odd symmetry while curving away from the origin. Constant functions f(x)=cf(x) = c where c0c \neq 0 satisfy f(x)=f(x)f(-x) = f(x), making them even rather than odd, while the zero function f(x)=[0](/page/0)f(x) = [0](/page/0) is both even and odd.

Algebraic Properties

Basic Operations

The basic operations on even and odd functions preserve or alter parity in predictable ways, depending on the parities of the functions involved. For and , the sum or difference of two even functions is even. To see this, let ff and gg be even functions, so f(x)=f(x)f(-x) = f(x) and g(x)=g(x)g(-x) = g(x). Then, (f+g)(x)=f(x)+g(x)=f(x)+g(x)=(f+g)(x),(f + g)(-x) = f(-x) + g(-x) = f(x) + g(x) = (f + g)(x), and similarly, (fg)(x)=f(x)g(x)=f(x)g(x)=(fg)(x).(f - g)(-x) = f(-x) - g(-x) = f(x) - g(x) = (f - g)(x). The sum or difference of two odd functions is odd: if ff and gg are odd, then f(x)=f(x)f(-x) = -f(x) and g(x)=g(x)g(-x) = -g(x), so (f+g)(x)=f(x)g(x)=(f(x)+g(x))=(f+g)(x),(f + g)(-x) = -f(x) - g(x) = -(f(x) + g(x)) = -(f + g)(x), and (fg)(x)=f(x)(g(x))=f(x)+g(x)=(f(x)g(x))=(fg)(x).(f - g)(-x) = -f(x) - (-g(x)) = -f(x) + g(x) = -(f(x) - g(x)) = -(f - g)(x). However, the sum or difference of an even function and an odd function is neither even nor odd in general, unless one is the zero function. For multiplication, the product of two even functions or two odd functions is even, while the product of an even function and an odd function is odd. Let ff and gg be even: then (f \cdot g)(-x) = f(-x) g(-x) = f(x) g(x) = (f \cdot g)(x). $$ If both are odd, (f \cdot g)(-x) = (-f(x)) (-g(x)) = f(x) g(x) = (f \cdot g)(x). $$ For one even and one odd, say ff even and gg odd, (fg)(x)=f(x)g(x)=f(x)(g(x))=(f(x)g(x))=(fg)(x).(f \cdot g)(-x) = f(-x) g(-x) = f(x) (-g(x)) = - (f(x) g(x)) = - (f \cdot g)(x). Division follows analogous rules where defined, but requires the denominator to be non-zero and the domain to be symmetric about the origin to preserve the function's parity classification. The of two even functions or two odd functions is even: for even ff and gg with g(x)0g(x) \neq 0, (fg)(x)=f(x)g(x)=f(x)g(x)=(fg)(x),\left( \frac{f}{g} \right)(-x) = \frac{f(-x)}{g(-x)} = \frac{f(x)}{g(x)} = \left( \frac{f}{g} \right)(x), and similarly for two odd functions. The of an even function by an odd function (or vice versa) is odd.

Composition and Inverse

The composition of even and odd functions exhibits specific parity properties that can be determined by examining the behavior under the transformation xxx \to -x. Let ff and gg be functions defined on appropriate domains such that the composition fgf \circ g is well-defined. The parity of fgf \circ g is analyzed as follows. If both ff and gg are even, then (fg)(x)=f(g(x))=f(g(x))=(fg)(x)(f \circ g)(-x) = f(g(-x)) = f(g(x)) = (f \circ g)(x), so fgf \circ g is even. For example, the composition of f(x)=x2f(x) = x^2 (even) and g(x)=cosxg(x) = \cos x (even) yields f(g(x))=cos2xf(g(x)) = \cos^2 x, which is even. If ff is even and gg is odd, then (fg)(x)=f(g(x))=f(g(x))=f(g(x))=(fg)(x)(f \circ g)(-x) = f(g(-x)) = f(-g(x)) = f(g(x)) = (f \circ g)(x) since ff is even, so fgf \circ g is even. An example is f(x)=xf(x) = |x| (even) composed with g(x)=x3g(x) = x^3 (odd), giving x3=x3|x^3| = |x|^3, which is even. In general, any even function composed with any function (even or odd) results in an even function. If ff is odd and gg is even, then (fg)(x)=f(g(x))=f(g(x))=(fg)(x)(f \circ g)(-x) = f(g(-x)) = f(g(x)) = (f \circ g)(x), so fgf \circ g is even. For instance, f(x)=x3f(x) = x^3 (odd) composed with g(x)=x2g(x) = x^2 (even) gives (x2)3=x6(x^2)^3 = x^6, which is even. If both ff and gg are odd, then (fg)(x)=f(g(x))=f(g(x))=f(g(x))=(fg)(x)(f \circ g)(-x) = f(g(-x)) = f(-g(x)) = -f(g(x)) = -(f \circ g)(x), so fgf \circ g is odd. An example is f(x)=sinxf(x) = \sin x (odd) composed with g(x)=xg(x) = x (odd), yielding sinx\sin x, which is odd. Even functions are generally not invertible over domains symmetric about the origin, such as R\mathbb{R}, because they fail to be one-to-one: for x0x \neq 0, f(x)=f(x)f(x) = f(-x) implies multiple inputs map to the same output. In contrast, odd functions that are bijective possess inverses that are also odd. To see this, suppose y=f(x)y = f(x) where ff is odd and invertible. Then y=f(x)-y = f(-x), so applying f1f^{-1} gives f1(y)=x=f1(y)f^{-1}(-y) = -x = -f^{-1}(y). For example, the inverse of f(x)=x3f(x) = x^3 (odd) is f1(y)=y1/3f^{-1}(y) = y^{1/3}, which satisfies f1(y)=(y)1/3=(y1/3)=f1(y)f^{-1}(-y) = (-y)^{1/3} = - (y^{1/3}) = -f^{-1}(y) and is thus odd.

Even-Odd Decomposition

Uniqueness of Decomposition

In , any function ff defined on a domain symmetric about the origin—such as [a,a][-a, a] or R\mathbb{R}—admits a unique into an even function ee and an odd function oo such that f=e+of = e + o. This establishes that every such function can be expressed as the sum of components with distinct parity properties, where even functions satisfy e(x)=e(x)e(-x) = e(x) and odd functions satisfy o(x)=o(x)o(-x) = -o(x). To outline the proof of existence, the even component is given by e(x)=f(x)+f(x)2,e(x) = \frac{f(x) + f(-x)}{2}, and the odd component by o(x)=f(x)f(x)2.o(x) = \frac{f(x) - f(-x)}{2}. Direct substitution confirms that e(x)+o(x)=f(x)e(x) + o(x) = f(x). Furthermore, e(x)=e(x)e(-x) = e(x) verifies the evenness of ee, while o(x)=o(x)o(-x) = -o(x) confirms the oddness of oo. The uniqueness follows from the fact that the only function that is both even and odd is the zero function. Suppose f=e1+o1=e2+o2f = e_1 + o_1 = e_2 + o_2, where e1,e2e_1, e_2 are even and o1,o2o_1, o_2 are odd. Then e1e2=o2o1e_1 - e_2 = o_2 - o_1. The left side is even, while the right side is odd, implying that both sides equal zero (as their sum would otherwise contradict parity). Thus, e1=e2e_1 = e_2 and o1=o2o_1 = o_2. This unique decomposition enables parity-based analysis for arbitrary functions, even without inherent symmetry, which simplifies computations in integration, differentiation, and series expansions by isolating even and odd behaviors.

Construction Methods

The even and odd parts of a function ff defined on a domain symmetric about the origin can be explicitly constructed using the averaging formulas: e(x)=f(x)+f(x)2,e(x) = \frac{f(x) + f(-x)}{2}, o(x)=f(x)f(x)2.o(x) = \frac{f(x) - f(-x)}{2}. These expressions yield the even component e(x)e(x) and the odd component o(x)o(x), satisfying f(x)=e(x)+o(x)f(x) = e(x) + o(x). As an illustrative example, consider f(x)=x+x2f(x) = x + x^2. Then f(x)=x+x2f(-x) = -x + x^2, so e(x)=(x+x2)+(x+x2)2=x2,e(x) = \frac{(x + x^2) + (-x + x^2)}{2} = x^2, o(x)=(x+x2)(x+x2)2=x.o(x) = \frac{(x + x^2) - (-x + x^2)}{2} = x. The even part x2x^2 is symmetric about the y-axis, while the odd part xx exhibits antisymmetry about the origin. This decomposition separates the polynomial into its naturally even and odd terms. The formulas ensure the constructed parts satisfy the required . For the even part, e(x)=f(x)+f(x)2=e(x),e(-x) = \frac{f(-x) + f(x)}{2} = e(x), demonstrating y-axis . For the odd part, o(x)=f(x)f(x)2=f(x)f(x)2=o(x),o(-x) = \frac{f(-x) - f(x)}{2} = -\frac{f(x) - f(-x)}{2} = -o(x), confirming point about the origin. These verifications follow directly from the definitions and the of . If the domain of ff is not about the origin, such as [0,)[0, \infty), the formulas require extension of ff to a symmetric domain via reflection to define values at negative arguments. An even reflection sets f(x)=f(x)f(-x) = f(x) for x>0x > 0, mirroring the graph over the y-axis, while an odd reflection sets f(x)=f(x)f(-x) = -f(x), reflecting through the origin. The choice of extension influences the resulting parts but enables application of the construction on the full symmetric domain. Graphically, this decomposition isolates symmetric and antisymmetric behaviors. The even part e(x)e(x) appears as the y-axis-symmetric portion of f(x)f(x), formed by averaging the original graph with its y-axis reflection, emphasizing mirrored features across the vertical axis. The odd part o(x)o(x) captures the origin-symmetric component, obtained by averaging the original graph with its 180-degree about the origin, highlighting opposing values at xx and x-x. This method provides the unique even-odd decomposition, as justified by the .

Analytic Properties

Differentiation and Integration

If a function ff is even and differentiable at a point xx, then its ff' is odd at that point. To see this, consider the definition of the : f(x)=limh0f(x+h)f(x)h.f'(x) = \lim_{h \to 0} \frac{f(x + h) - f(x)}{h}. For f(x)f'(-x), substitute into the limit: f(x)=limh0f(x+h)f(x)h.f'(-x) = \lim_{h \to 0} \frac{f(-x + h) - f(-x)}{h}. Since ff is even, f(x+h)=f(xh)f(-x + h) = f(x - h) and f(x)=f(x)f(-x) = f(x), so f(x)=limh0f(xh)f(x)h=limk0f(x+k)f(x)k(1)=f(x),f'(-x) = \lim_{h \to 0} \frac{f(x - h) - f(x)}{h} = \lim_{k \to 0} \frac{f(x + k) - f(x)}{-k} \cdot (-1) = -f'(x), where k=hk = -h. Thus, f(x)=f(x)f'(-x) = -f'(x), confirming that ff' is odd. Conversely, if ff is odd and differentiable at xx, then ff' is even. The proof follows similarly: substituting the odd condition f(x+h)=f(xh)f(-x + h) = -f(x - h) and f(x)=f(x)f(-x) = -f(x) into the derivative limit for f(x)f'(-x) yields f(x)=limh0f(xh)+f(x)h=limh0f(xh)f(x)h=f(x),f'(-x) = \lim_{h \to 0} \frac{-f(x - h) + f(x)}{h} = -\lim_{h \to 0} \frac{f(x - h) - f(x)}{h} = f'(x), after the substitution k=hk = -h. Examples include f(x)=sinxf(x) = \sin x, which is odd with even derivative f(x)=cosxf'(x) = \cos x. These properties hold under the assumption of differentiability, typically requiring continuity of ff at the point. For integration, the parity of a function affects definite integrals over symmetric intervals [a,a][-a, a] where a>0a > 0. If ff is even and continuous on [a,a][-a, a], then aaf(x)dx=20af(x)dx.\int_{-a}^{a} f(x) \, dx = 2 \int_{0}^{a} f(x) \, dx. This arises from the symmetry: the areas from a-a to 0 and 0 to aa are equal due to f(x)=f(x)f(-x) = f(x). For instance, with f(x)=x2f(x) = x^2, the integral from 1-1 to 1 is 201x2dx=232 \int_0^1 x^2 \, dx = \frac{2}{3}. If ff is odd and continuous on [a,a][-a, a], then aaf(x)dx=0.\int_{-a}^{a} f(x) \, dx = 0. The positive and negative areas cancel due to f(x)=f(x)f(-x) = -f(x). An example is f(x)=xf(x) = x, where 11xdx=0\int_{-1}^{1} x \, dx = 0. More generally, for any integrable f=e+of = e + o where ee is the even part and oo the odd part, the integral decomposes as aaf(x)dx=20ae(x)dx\int_{-a}^{a} f(x) \, dx = 2 \int_0^a e(x) \, dx, with the odd part contributing zero. These results extend to Riemann or Lebesgue integrability, assuming the integral exists.

Series Representations

If an even function has a expansion centered at the origin, it contains only even powers of the variable, while if an odd function has such an expansion, it contains only odd powers. For instance, the power series for the cosine function, which is even, is given by cosx=n=0(1)n(2n)!x2n,\cos x = \sum_{n=0}^{\infty} \frac{(-1)^n}{(2n)!} x^{2n}, valid for all real xx. Similarly, the sine function, which is odd, has the expansion sinx=n=0(1)n(2n+1)!x2n+1,\sin x = \sum_{n=0}^{\infty} \frac{(-1)^n}{(2n+1)!} x^{2n+1}, also valid for all real xx. The Taylor series expansion of a function at zero, known as the Maclaurin series, directly reflects the parity of the function through its derivatives evaluated at the origin. For an even function ff, all odd-order derivatives vanish at zero (f(k)(0)=0f^{(k)}(0) = 0 for odd kk), resulting in a series with only even powers. Conversely, for an odd function ff, all even-order derivatives (except possibly the zeroth, where f(0)=0f(0) = 0) vanish at zero (f(k)(0)=0f^{(k)}(0) = 0 for even k>0k > 0), yielding only odd powers in the series. This property arises because the derivative of an even function is odd, and vice versa, leading to the alternation and vanishing conditions at the symmetric point zero. In Fourier series representations of periodic functions over symmetric intervals like [π,π][-\pi, \pi], even functions expand solely in terms of cosine functions, which form an even basis. The series takes the form f(x)=a02+n=1ancos(nx)f(x) = \frac{a_0}{2} + \sum_{n=1}^{\infty} a_n \cos(nx), where the coefficients ana_n are computed via integrals that exploit the of cosines. Odd functions, by contrast, expand only in sine terms, an odd basis, yielding f(x)=n=1bnsin(nx)f(x) = \sum_{n=1}^{\infty} b_n \sin(nx), with sine coefficients bnb_n from corresponding orthogonal integrals. Any sufficiently smooth periodic function can be decomposed into its even and odd parts, and its naturally separates these components: the cosine terms capture the even part, while the sine terms represent the odd part. This decomposition leverages the of the trigonometric basis, allowing the even and odd contributions to be isolated independently in the expansion.

Applications

Harmonic Functions

In the context of physics, even and odd functions play a fundamental role in describing vibrations. Symmetric vibrations, which exhibit mirror about the equilibrium position, are modeled using even functions such as cosines, corresponding to even harmonics that maintain the same sign on both sides of the axis. In contrast, antisymmetric vibrations, which invert across the axis, are represented by odd functions like , aligning with odd harmonics that produce opposite displacements on either side. This distinction arises naturally from the properties required to satisfy boundary conditions in wave equations for oscillatory systems. Decomposition of periodic functions into even and odd components in simplifies the study of in wave phenomena. By separating a function into its even part (yielding only cosine terms) and odd part (yielding only sine terms), the resulting series representation highlights how symmetric and antisymmetric behaviors contribute to the overall signal structure. This approach is particularly useful in , where the even-odd split reduces and reveals underlying symmetries in the . For instance, the even component corresponds to basis functions that are cosine-like, aiding in the identification of balanced harmonic contributions without cross-terms from opposite symmetries. A representative example appears in standing waves on a taut string fixed at both ends, where modes are classified by their symmetry about the . Odd modes are symmetric, with mirror-image displacements across the center and antinodes at the , such as the first harmonic where the entire string moves in phase without a central node. Even modes, conversely, are antisymmetric, with displacements inverting across the center, as seen in the second harmonic with a node at the and equal but opposite lobes on either side. These symmetries directly tie to even and odd function properties in the mode shapes, facilitating solutions to the wave equation via . The conceptual framework of even and odd functions in harmonics traces back to 18th- and 19th-century developments in solving the . Jean le Rond d'Alembert's 1747 formulation of the one-dimensional for vibrating strings incorporated initial conditions that preserved even or odd parity, enabling general solutions via traveling waves. Leonhard Euler extended this work in the 1750s by applying series expansions—precursors to —to arbitrary initial displacements, implicitly leveraging even-odd symmetries to match boundary conditions and decompose vibrations. These contributions laid the groundwork for using even and odd functions as basis elements in harmonic solutions to wave problems. In modern applications, such as audio synthesis, the distinction between even and odd harmonics influences tonal qualities. Even harmonics, derived from even function components, generate "warm" tones by adding consonant overtones that blend smoothly with the fundamental, evoking richness in analog-style sounds. Odd harmonics, stemming from odd functions, produce "bright" or edgy timbres through dissonant higher frequencies that enhance clarity and presence, commonly used to sharpen synthesized waveforms. This selective emphasis on even or odd components allows engineers to tailor harmonic content for desired auditory effects in music production.

Signal Processing

In signal processing, even signals exhibit symmetry about the time origin, satisfying x(t)=x(t)x(t) = x(-t) for all tt, while odd signals demonstrate antisymmetry, satisfying x(t)=x(t)x(t) = -x(-t). These properties are leveraged in and , where separating signals into even and odd components enables efficient processing, such as in symmetric filter impulse responses that reduce computational demands in linear systems. Any arbitrary signal can be uniquely decomposed into even and odd parts using xe(t)=x(t)+x(t)2x_e(t) = \frac{x(t) + x(-t)}{2} and xo(t)=x(t)x(t)2x_o(t) = \frac{x(t) - x(-t)}{2}, allowing independent manipulation that preserves overall while simplifying operations like time reversal and scaling. In the (DFT) and its fast implementation (FFT), the spectrum of an even signal is real-valued and even, effectively reducing to a , whereas an odd signal's spectrum is purely imaginary and odd, corresponding to a discrete sine transform. This from even-odd decomposition facilitates signal compression by enabling sparse representations and reduced data storage, as seen in transform-based coding schemes where only real or imaginary components need processing. For instance, in electrocardiogram (ECG) analysis, even-odd splitting within lifting-based wavelet transforms decomposes noisy signals into subsampled even and odd subsets, enabling targeted denoising that suppresses artifacts like baseline wander while retaining diagnostic features such as QRS complexes. In image processing, even-symmetric components in phase congruency models, derived from pairs, enhance by identifying points of maximum phase alignment, improving robustness to noise and illumination variations in applications like imagery. Even-odd properties also streamline convolution, a core operation in filtering: the convolution of two even signals or two odd signals yields an even result, while an even signal convolved with an odd signal produces an odd result, allowing parity to guide efficient kernel designs and output predictions without full recomputation. Software tools support these techniques in practice; MATLAB's Signal Processing Toolbox includes utilities like fft for spectral analysis and custom scripts for even-odd extraction via averaging over time-reversed copies, while Python's SciPy library offers scipy.signal functions for decomposition and symmetry-based filtering in DSP workflows.

Generalizations

Multivariate Real Functions

In the context of functions from Rn\mathbb{R}^n to R\mathbb{R}, a function ff is defined as even if f(x)=f(x)f(-\mathbf{x}) = f(\mathbf{x}) for all xRn\mathbf{x} \in \mathbb{R}^n, and odd if f(x)=f(x)f(-\mathbf{x}) = -f(\mathbf{x}) for all xRn\mathbf{x} \in \mathbb{R}^n. This extends the univariate notion of parity symmetry to vector arguments, where x-\mathbf{x} denotes component-wise negation. Functions of multiple variables often exhibit partial symmetries, being even or odd with respect to specific variables while independent of parity in others. For instance, the function f(x,y)=x2yf(x,y) = x^2 y is even in xx since f(x,y)=(x)2y=x2y=f(x,y)f(-x,y) = (-x)^2 y = x^2 y = f(x,y), but odd in yy because f(x,y)=x2(y)=x2y=f(x,y)f(x,-y) = x^2 (-y) = -x^2 y = -f(x,y). Such mixed parities arise naturally when analyzing dependencies on individual coordinates. In physics, these concepts appear under parity transformations, where position-dependent quantities like V(r)V(\mathbf{r}) are even functions, satisfying V(r)=V(r)V(-\mathbf{r}) = V(\mathbf{r}) due to the scalar nature of the potential and its dependence on the magnitude r|\mathbf{r}|. Conversely, momentum p\mathbf{p} transforms as an odd vector, with p(r)=p(r)\mathbf{p}(-\mathbf{r}) = -\mathbf{p}(\mathbf{r}), reflecting its pseudovector behavior under spatial inversion.) These parities ensure conservation laws and simplify symmetry analyses in classical and . Properties of even and odd multivariate functions extend component-wise from the univariate case: the sum of even functions is even, the sum of odd functions is odd, and the product of two even or two odd functions is even. However, mixed parities complicate compositions and products, as the overall parity depends on the specific symmetries involved—for example, the product of an even and an odd function is odd. For integration over domains symmetric about the origin, such as balls or hypercubes centered at zero, the of an odd function vanishes: Df(x)dx=0\int_D f(\mathbf{x}) \, d\mathbf{x} = 0 if D=DD = -D. This follows from pairing points x\mathbf{x} and x-\mathbf{x}, where contributions cancel due to the antisymmetry f(x)=f(x)f(-\mathbf{x}) = -f(\mathbf{x}). Even functions, by contrast, yield twice the over the positive subdomain.

Complex-Valued Functions

In the theory of , even and odd functions are generalized from their real-variable counterparts to functions f:ΩCf: \Omega \to \mathbb{C}, where ΩC\Omega \subseteq \mathbb{C} is an open domain symmetric about the origin. A function ff is defined as even if it satisfies f(z)=f(z)f(-z) = f(z) for all zΩz \in \Omega, and odd if f(z)=f(z)f(-z) = -f(z) for all zΩz \in \Omega. These definitions preserve the symmetry properties under inversion through the origin, but analyticity imposes additional constraints: if ff is holomorphic (complex differentiable) in Ω\Omega, its Taylor or expansion around 0 contains only even powers for even functions and only odd powers for odd functions. For instance, the eze^z is neither even nor odd, as ez=eze^{-z} = e^z only holds trivially at specific points and ezeze^{-z} \neq -e^z in general. In contrast, the cosine function cosz=eiz+eiz2\cos z = \frac{e^{iz} + e^{-iz}}{2} is even, satisfying cos(z)=cosz\cos(-z) = \cos z, while the sine function sinz=eizeiz2i\sin z = \frac{e^{iz} - e^{-iz}}{2i} is odd, satisfying sin(z)=sinz\sin(-z) = -\sin z; both are entire (holomorphic everywhere in C\mathbb{C}). A related but distinct symmetry involves complex conjugation, leading to Hermitian and anti-Hermitian functions. A function ff is Hermitian even if f(zˉ)=f(z)f(\bar{z}) = \overline{f(z)} for all zΩz \in \Omega, meaning it maps conjugates to conjugates, analogous to real-valued functions on the real axis. Conversely, an anti-Hermitian odd function satisfies f(zˉ)=f(z)f(\bar{z}) = -\overline{f(z)}, reflecting an antisymmetry under conjugation. These properties are particularly relevant for functions that are analytic in domains symmetric with respect to the real axis, as they ensure compatibility with the Cauchy-Riemann equations, which express holomorphicity via ux=vy\frac{\partial u}{\partial x} = \frac{\partial v}{\partial y} and uy=vx\frac{\partial u}{\partial y} = -\frac{\partial v}{\partial x} for f(z)=u(x,y)+iv(x,y)f(z) = u(x,y) + iv(x,y). For even or odd analytic functions, the parity condition further symmetrizes the real part uu and imaginary part vv: in an even holomorphic function, both u(x,y)=u(x,y)u(-x,-y) = u(x,y) and v(x,y)=v(x,y)v(-x,-y) = v(x,y); for odd, u(x,y)=u(x,y)u(-x,-y) = -u(x,y) and v(x,y)=v(x,y)v(-x,-y) = -v(x,y). This interplay ensures that the Cauchy-Riemann equations hold alongside the parity symmetry without additional singularities. Such functions find significant applications in , where the parity operator P^\hat{P} acts on wavefunctions ψ(z)\psi(z) by P^ψ(z)=ψ(z)\hat{P} \psi(z) = \psi(-z), classifying states as even (eigenvalue +1) or odd (eigenvalue -1) under spatial inversion. In systems with inversion , such as the or , the yields solutions with definite parity, simplifying the analysis of selection rules in and processes; for example, even-parity wavefunctions couple only to even operators, preserving the . This framework extends to complex representations of quantum states, where holomorphic wavefunctions in inherit even or odd properties to model coherent states or -protected topological phases.

Discrete Sequences

In and , the concepts of even and odd functions extend to indexed by integers, adapting the properties to bidirectional or finite indexing. A discrete {an}n=\{a_n\}_{n=-\infty}^{\infty} is defined as even if an=ana_{-n} = a_n for all integers nn, exhibiting about n=0n=0; it is odd if an=ana_{-n} = -a_n for all nn, showing antisymmetry about n=0n=0 with a0=0a_0 = 0. For finite sequences of length NN, even and odd symmetries are defined relative to the center of the sequence, often in the context of periodic extensions used in transforms like the (DFT). A real-valued {x(n)}n=0N1\{x(n)\}_{n=0}^{N-1} is symmetric (even) if x(n)=x(Nn)x(n) = x(N - n) for n=1,,N1n = 1, \dots, N-1, requiring only N/2+1\lfloor N/2 + 1 \rfloor independent values to specify it fully. It is antisymmetric (odd) if x(0)=0x(0) = 0 and x(Nk)=x(k)x(N - k) = -x(k) for k=1,,N1k = 1, \dots, N-1, determined by N/21\lceil N/2 - 1 \rceil independent values. In the DFT, the NN-point transform of an even yields purely real coefficients that are symmetric (X(k)=X(Nk)X(k) = X(N - k)), while an odd produces purely imaginary coefficients that are antisymmetric (X(k)=X(Nk)X(k) = -X(N - k)). Representative examples include cosine sequences, which are even (cos(ωkn)\cos(\omega_k n)), and sine sequences, which are odd (sin(ωkn)\sin(\omega_k n)), leading to real and imaginary DFT components, respectively; this symmetry simplifies computations in frequency-domain analysis. Any discrete sequence can be uniquely decomposed into its even and odd parts as an=an+an2+anan2,a_n = \frac{a_n + a_{-n}}{2} + \frac{a_n - a_{-n}}{2}, where the first term is even and the second is odd; for real-valued sequences, these parts are orthogonal. Convolution of discrete sequences preserves parity in a manner analogous to continuous functions: the convolution of two even sequences is even, of two odd sequences is even, and of an even and an odd sequence is odd. In the Z-transform domain, an even sequence {x}\{x\} with x=x[n]x = x[-n] satisfies X(z)=X(z1)X(z) = X(z^{-1}), implying pole-zero symmetry where poles and zeros occur in reciprocal pairs, and for real-valued even sequences, they appear in complex-conjugate reciprocal quartets. These properties facilitate efficient analysis in and related fields.

References

Add your contribution
Related Hubs
User Avatar
No comments yet.