Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »
Q&A

Comments on Otherwise similar functions with opposite parity, were they considered, are they useful? Case of polynomials

Post

Otherwise similar functions with opposite parity, were they considered, are they useful? Case of polynomials

+0
−1

So, can we transform an even function into an odd function and vice versa? Let's consider this method:

Transformation even->odd:

Suppose $f_{even}(x)$ is a function which satisfies the following condition:

$$f_{even}(x)=\sum_{k=0}^\infty G(2k)\frac{x^{2k}}{(2k)!}$$

Where the coefficient function $G^*(x)=G(2s)$ is equal to its Newton series expansion:

$$G^*(s) = \sum_{k=0}^\infty \binom{s}k \Delta_s^k G^* \left (0\right)$$

What we are doing here, is Newtonian interpolation of consecutive derivatives over even points so to get the values at odd points.

The function $f_{even}(x)$ is evidently even. Now the operator

$$\operatorname{oddify} f_{even}(x)=\sum_{k=0}^\infty G(2k+1)\frac{x^{2k+1}}{(2k+1)!}$$

transforms an even function to an odd counterpart. The operator is linear.

The opposite process is similar, for odd function:

$$f_{odd}(x)=\sum_{k=0}^\infty G(2k+1)\frac{x^{2k+1}}{(2k+1)!}$$

and $G^*(s)=G(2s+1)$, satisfying the same Newton series condition,

the following operator gives an even counterpart:

$$\operatorname{evenize} f_{odd}(x)=\sum_{k=0}^\infty G(2k)\frac{x^{2k}}{(2k)!}$$

Examples.


$f_{even}(x)=\cosh x$;

$f_{odd}(x)=\sinh x$;

$G(s)=1$

enter image description here


$f_{even}(x)=x \coth \left(\frac{x}{2}\right)$

$f_{odd}(x)=x$

$G(s)=-2s\zeta(1-s,1)=2 B_s(1)$

enter image description here


$f_{even}(x)=\csc ^2(x)-\frac{1}{x^2}$

$f_{odd}(x)=\frac{\psi ^{(1)}\left(1-\frac{x}{\pi }\right)}{\pi ^2}-\frac{\psi ^{(1)}\left(\frac{x}{\pi }+1\right)}{\pi ^2}$

$G(s)=\frac{2 (-1)^s \psi ^{(s+1)}(1)}{ \pi ^{s+2}}$

enter image description here


What one can notice in these examples is that one counterpart function can be much more complicated than the other, even one can be elementary while the other is not.

Regarding the second example. Obviously, the method cannot work into the direction from $f(x)=x$. First thought I had when thinking about an even counterpart of this function was "what function can have non-zero even values while all dd values except at 1 equal to zero?@, and, oops, the obvious solution is Bernoulli numbers (in this case, $B_n(1)$ so to be equal to Newton's expansion).


Now, can we find the counterparts to polynomials? For some, yes! We just have to integrate the solution for $f(x)=x$. We also divide the result by 2 so to make a better plot.

$f_{even}=\frac{x^2}{4}+\frac{\pi^2}6$

$f_{odd}=\text{Li}_2\left(e^x\right)+ x \log \left(1-e^x\right)-\left(\frac{x^2}{4}+\frac{\pi ^2}{6}\right)$

$G(s)=B_{s-1}(1)$

(here, Bernoulli polynomials of negative order should be understood as their generalization via Hurwitz Zeta)

enter image description here

$f_{even}=2 \text{Li}_3\left(e^x\right)-x \text{Li}_2\left(e^x\right)-\left(\frac{x^3}{12}+\frac{\pi ^2 x}{6}\right)$

$f_{odd}=\frac{x^3}{12}+\frac{\pi ^2 x}{6}$

$G(s)=B_{s-2}(1)$

enter image description here

And so on. The both functions are infinitely differentiable, so this gives us a family of functions, asymptotically equal to the polynomials, but with the opposite parity.

The pairs of "polynomials" can be constructed this way:

$$f_n(x)=(n-1)\operatorname{Li}_n\left(e^x\right)-x\operatorname{Li}_{n-1}\left(e^x\right)$$$$feven_n(x)=\frac{f(x)+f(-x)}2$$$$fodd_n(x)=\frac{f(x)-f(-x)}2$$

At even $n$ the even part is polynomial, the odd part is "pseudo-polynomial", at odd $n$ the even part is pseudo-polynomial, the odd part is polynomial.

Via differentiation we can also construct an odd counterpart of constant function:

$f_{even}=1$

$f_{odd}=\frac{\sinh (x)-x}{\cosh (x)-1}$

$G(s)=2 B_{s+1}(1)$

enter image description here


That said, I wonder whether anyone ever considered this family of functions that asymptotically behave as polynomial, but have opposite parity.

Would not it be cool (and applicable in technology) to have an analytic function that behaves as $x^2$ but is odd?

Why such function counterparts are so much more complicated than the original functions?

This question on Stackexchange

History

1 comment thread

What's the point of $G^\$? I don't see how it accomplishesbecause there's no indication of how ... (4 comments)
What's the point of $G^\$? I don't see how it accomplishesbecause there's no indication of how ...
Peter Taylor‭ wrote 4 months ago

What's the point of $G^*$? I don't see how it accomplishes

interpolation of consecutive derivatives over even points so to get the values at odd points

because there's no indication of how to derive $\Delta_s^k$ for half-integer $s$ from the values for integer $s$.

Anixx‭ wrote 4 months ago · edited 4 months ago

In simplier words. We have an even function with coefficients $G^*(k)=G_{2k}$ in the Taylor's series expansion $f_{\text{even}}(x)=\sum_{k=0}^\infty G(2k)\frac{x^{2k}}{(2k)!}$. Then we take the Newton series of the function $G^*(s)= \sum_{k=0}^\infty \binom{s}k \Delta_s^k G^* \left (0\right)$. It is interpolation. It has defined values at all points. Now we expand the definition of $G(x)=G^*(x/2)$. It is also defined everywhere. Now, the function $f_{\text{odd}}(x)=\sum_{k=0}^\infty G(2k+1)\frac{x^{2k}}{(2k)!}$ is the odd counterpart of the original function. We use Newton interpolation to get the missing coefficients.

Peter Taylor‭ wrote 4 months ago · edited 4 months ago

Anixx‭, it's the notation that I don't understand, although I think maybe I've figured it out. Is $\Delta_s^k$ supposed to denote the $k$th difference operator with respect to $s$? If so, I think it would be a lot clearer to write the initial function as $f_{even}(x)=\sum_{k=0}^\infty G(k)\frac{x^{2k}}{(2k)!}$, the interpolation as $G^*(s) = \sum_{k=0}^\infty \binom{s}k (\Delta^k G)(0)$, and $\operatorname{oddify} f_{even}(x)=\sum_{k=0}^\infty G^*(k+\tfrac12)\frac{x^{2k+1}}{(2k+1)!}$

System‭ wrote 4 months ago

Thread renamed from "What's the point of $G^$? I don't see how it accomplishes

because there's no indication of how ..." to "What's the point of $G^$? I don't see how it accomplishesbecause there's no indication of how ..." by Peter Taylor‭