Blog Archive

Monday, July 17, 2023

ODE and Differential Operator Ring-module

Abstract

In the previous essay, "ODE: An Algebraic Approach (1)(2)(3)(4),

Math Essays: ODE, An Algebraic Approach (1) (wuyulanliulongblog.blogspot.com)

Math Essays: ODE An Algebraic Approach (2) (wuyulanliulongblog.blogspot.com)

Math Essays: ODE, An Algebraic Approach (3) (wuyulanliulongblog.blogspot.com)

Math Essays: ODE An Algebraic Approach (4) (wuyulanliulongblog.blogspot.com)

I focused on solving ODEs algebraically.

In this essay, I will concentrate on the algebraic structure we used.

An Isomorphism and a Module

Let's consider the algebra (both ring and module) C[X].

Now, let's look at the algebra isomorphism h:C[X]C[D], which is specifically a ring isomorphism.

Since C[X] is commutative, C[D] is also commutative.

Now, we can consider C[D] acting on C since C[D] is a subring of EndAb(H(Ω)), where H(Ω) is the space of holomorphic functions on an open set Ω.

This gives us a C[D]-module. More generally, we can consider C[D] acting on C.

Reviewing ODEs like P(D)y=g, it is similar to considering ra=b in an R-module.

In ODE (1), we solve for ra=0, and in ODE (2), we consider ra=b where a=r¯1b+Ker(r)...

Corresponding between Quotient|Module and particular solution

If we consider C[D] acting on Pn, where Pn is the polynomial space, we can view Pn=H(Ω)/(zn+1) with 0Ω.

Then, we have a natural quotient and an interesting correspondence.

Let πn:H(Ω)H(Ω)/(zn+1)=Ker(Dn+1) be the quotient map.

It will deduce the quotient map πn:C[D]C[D]/(Dn+1) when C[D] acti on Ker(Dn+1).

One way to understand this is by considering the duality between znn! and Dn|0.

In other words, considering 1,z,z2,...,zn,... as the basis, we have Dj|0zin!={1,i=j0,ij.

Thus, Dj|0 forms the dual basis.

We can denote an R-module as a pair (R,M),

therefore we have (πn,πn):(C[D],H(Ω))(C[D]/(Dn+1),H(Ω)/(zn+1)).

This module relate to the solution of P(D)y=q(x),degqn,p00.

Since the particular solution of P(D)y=q(x),yp=1P(D)q(x)(C[D]/(Dn+1),H(Ω)/(zn+1))

Using the identity Dλ=eλxDeλx, we get:

πn:eλzH(Ω)eλzH(Ω)/(eλxzn+1)

πn:C[D]C[D]/((Dλ)n+1)

Module (C[D]/((Dλ)n+1,eλzH(Ω)/(eλxzn+1))

relate to the particular solution of P(Dλ)y=eλxq(x),degqn,p00

Similarly, 1P(Dλ)eλxq(x)=(a0+...+an(Dλ)n)eλxq(x)(C[D]/((Dλ)n+1,eλzH(Ω)/(eλxzn+1))

Something really interesting

An intriguing discovery is that Ceix=Ker(D2+1).

Thus, Acos(x)+Bsin(x)=Ker(D2+1)C(R).

If we consider the space Ker(D2+1)=Span(cos(x),sin(x)).

Let R[D] act on Ker(D2+1), we deduce π:R[D]R[D]/(D2+1)C.

But if we consider Ceix,or Cex+iy Let R[D] or R[y] act on it, we get R[D](D2+1) or R[y]/((y)2+1)

Now we see that (a+bi)(cosx+isinx)=(a+bD)(cosx+isinx)

or (a+bi)(ex(cosy+isiny))=(a+by)(ex(cosy+isiny))

There are no difference for C act on it or R[D](D2+1) /R[y]/((y)2+1) act on it !

Remember how to find the particular solution of P(D)y=eλx ? P(D)eλx=P(λ)eλx

Consider Acoshx+Bsinh(x)=Ker(D21)

Let R[D] act on Ker(D21), we deduce π:R[D]R[D]/(D21)H

Similarly, we can consider Cejx=C(coshx+jsinhx), Let R[D] act on it, we deduce that R[D]/(D21)

We have(a+bj)(coshx+jsinhx)=(a+bD)(coshx+jsinhx) as well.

If we consider Q[D], let it act on edx,d is a square free natural number. (it is so natural, from eix,ejx,edx...)

Cedx=Ker(D2d), we dedeuce Q[D](D2d)Q[d], and (a+bd)edx=(a+bD)edx

And a convenient way to count P(D)y, y belong to KerH(D)

If you need count sth like P(D)y,yKerH(D), then we can consider P(D)=Q(D)H(D)+R(D)

It just consider this ring R[D]/(H(D)), P(D)R(D)modH(D)

Then P(D)y=R(D)y, that is what we do in ODE (4)!

Why we can consider Euclidean division? Since R[D],C[D] is Euclidean Domain !

And we already know what is the kernel of H(D) in ODE(1)

For example, if you want to count(D3+D2+D)(3cosx+4sinx)

Actually you can stop at here D3+D2+D=D(D2+1)+D2

D3+D2+DD2modD2+1

since we already know that D2(3cosx+4sinx)=(3cosx+4sinx)

But you can continue to do that, (D3+D2+D)=(D+1)(D2+1)1

Thus (D3+D2+D)(3cosx+4sinx)=(3cosx+4sinx)

Is that smart? In partuclualr, I mean in this example, it is stupid.

Why? We can substitute i in D3+D2+D directly! i3+i2+i=1...

If P(i) is not real number, substute inversely, iD back.

Another example is, if you want to count (D3+2D2+3D)exx,

since D3+2D2+3D=(D+4)(D22D+1)+10D4

Thus (D3+2D2+3D)exx=(10D4)exx=(10(D1)+6)exx=10ex+6exx

 

Popular Posts