• No results found

A Fermionic Ito Product Formula

N/A
N/A
Protected

Academic year: 2020

Share "A Fermionic Ito Product Formula"

Copied!
6
0
0

Loading.... (view fulltext now)

Full text

(1)

ISSN 2348 – 7968

803

A Fermionic ITO Product Formula

Cristina Şerbănescu

University “Politehnica” Bucharest, Department of Mathematics, Bucharest, 060042,Romania

Abstract

We prove an Ito product formula for stochastic integral on Fermion Fock space by analogy with the same kind of integral on Boson Fock space. Because of the noncommutativity relation, the appropriate theory of stochastic intregration must distinguish between the left and right integral. We have four such possibilities.

Keywords: stochastic integrals, Fermion Fock space,C*-algebra,inner product.

1. Introduction

First we construct a stochastic integral on Fermion Fock space [7][2] by analogy with the same kind of integral on Boson Fock space [4], first of simple processes. We define the Fermion stochastic integral for square-integrable integrands. We present the infinitesimal operators like infinite sums, but we assume they are continuous. Because of the canonical anticommutation relation we have left, right and mixt stochastic integrals[1].

We recall, giving only the necessary details some concepts and notations.

Definition 1.1. Let

F G H

, ,

be simple processes and write

1

0

,

n n n n

F

F

t t

 

,

1

0

,

n n n n

G

G

t t

 

,

1

0

,

n n n n

H

H t t

 

0 1

0

  

t

t

  

t

n

The family of operators

M

M t t

 

,

0

with

 

0

t t

D M t

  

h

h

defined by

M

 

0

0

,

 

 

 

 

 

 

n L L n n

n L L n n n

M t

M t

A

t

A

t

F

G

A t

A t

t

t

H

 

 

for

t

n

 

t

t

n1 is called right stochastic integral of

F G H

, ,

and is denoted by:

 

0

t

L L

M t

dA F

GdA

Hds

Similarly we can define the left stochastic integral of

F G H

, ,

denoted by

 

 

 

 

 

 

n L L n n

L L n n n n

N t

N t

A

t

A

t

F

A t

A t

G

t

t

H

 

 

For

t

n

 

t

t

n1 t

 

0

t

L L

N t

dA F

dA G

Hds

And the mixt stochastic integral of

F G H

, ,

denoted by:

 

1 0

t

L L

P t

FdA

dA G

Hds

or

 

2 0

t

L L

P t

dA F

GdA

Hds

Theorem 1.2. Let

F G H

, ,

be simple processes and we assume that

F

has a parity

which means that all

F t

 

have the parity

and let be

L L

dM

dA F

GdA

Hdt

If

u v

,

h

0

x

  

x

1

x

r

x

1

,

x

r

H

1 w

(2)

ISSN 2348 – 7968

804 Then:

 

 

 

 

 

1 0

1 1

0

0

,

0

,

1

1

,

1

,

,

t w

k r w F

p ck kp

p J k

t r

j

p Cj jp

p J j t

M t

u

x v

y

M

u

x v

y

L

F

u

x v

y

y

G L

x

v

y x

H u

x v

y

    

 





Proof: see in [3].

Theorem 1.3. Let

F G H

, ,

be simple processes,

L L

dM

dA F

GdA

Hdt

For

u

h

0,

x

  

x

1

x

r

x

1

,

x

r

H

and

v

h

s,

y

y

1

 

y

w

y

1

,

y

w

H

s

Then:

 

 

 

 

 

1 0

1 1

0 0

,

1

1

,

1

,

,

t w

k r w F

p ck kp

p J k

t r

j

p Cj jp

p J j t

M t

M s

u

x v

y

L

F

u

x v

y

y

G L

x

v

y x

H u

x v

y

    

 





We generalize the relations of theorem 1.2. as :

1 1

1

'

' ' '

w b w

w b

v y y v y y

v y y

 

      

   

 

with

v

'

 

v

y

1

 

y

b

, hence we replace

k

with

k

b

and

w

with

w b

but 1

, ,

S w

y

y

H

and

s

v

. Proof: see in [3].

2. Operator’s parity

Definition 2.1. We assume that

h

is

Z

2 – graded with even and odd subspaces

h

,

h

and we denote by

the

parity operator, that is the self – adjoint unitary operator wich is 1 on

h

and –1 on

h

.

An operator

T k

:

 

h

h

is said to be even if

T

T

 

 and odd if

 

T

 

T

and

T

has the parity

0

sau

1

if

 

1

T

T

 

 

Let

H

be a Hilbert space. We define the antisymmetric Fock space

a

 

H

over

H

as the linear hull of all

x

1

  

x

2

x n

n

, 0,

x

i

H

(where for

n

0

,

we have the unit element, namely 1) with the following inner product:

1 2 1 2

, , 1, ,

,

det

,

n k

n k i i i j n

x

x

x y

y

y

x y

  

 

for

n

 

k

0

the determinant is considered to be 1). About this space we mention the following:

i. a

 

0 n n

H

H

 

, where n

H

is the closed linear hull

of all

1 2 n

,

i

x

  

x

x

x

H

ii.

x

y 1

 

x

y n 

 

 

x

y 1

 

x

y n  where

 

 

is 1 or -1 if

is even or odd.

If two

x

i with different indexes i are equal this product is

null.

iii.

 

0

,

0

n

a n n n

n

H

x x

H

n x

finite

is

an associative algebra, with unit element 1 and

1 n

x

 

x

is the product of

x

1

, , ,

x

n

x

i

H

H

1,

in established order.

iv. If

H

K

, then

a

 

H

 

a

 

K

.

Let be

a

 

H

 

a

 

H

 

a

 

H

 

n

a

n even

H

H

 

 

n

a

n odd

H

H

 

We denote the parity operator on

a

 

H

by

I

and

1

  

1

1

r

r r

(3)

ISSN 2348 – 7968

805

Remark The operators

A v

 

and

A

 

v

have the parity 1 on

h

.

We can write:

 

1

 

A

v

 

A

v

1

L

 

L

And if s 0

 

s

s a s

h

 

h

h

  

h

H

h

, we can

decompose

 

 

 ,

L L p s t p

p j

A

t

A

s

L

I

A

e

 

respectively

 

 

 ,

L L p s t p

p j

A t

A

s

L

I

A

e

 

3. An ITO Product Formula

Theorem 3.1. Let

F G H

, ,

be simple processes and

L L

dM

dA

GdA

Hdt

. We assume that all

L

have the same parity.

For

u v

,

h

t, 1 t n i

x

  

x

x

x

H

,

1 t

w i

y

  

y

y

y

H

we have:

 

  

 

  

 

 

 

 

0

1, , 2, , 1

2, , 1, ,

,

0

,

0

,

,

,

t

p p

p J w

k p k

p J k M

p k k

M t

u

x M t

v

y

M

u

x M

v

y

L F u

x

L F v

y

M a u

x

v

y

u

x

M a

v

y

da

 

 

 

 

  

 

where

P

 

and

x

i k, , will be specificated in the followings.

Proof: Let be

u v

,

h

0

1 1

'

''

'

''

a S

S

a n

x

x

x

x

x

x

H

x

x

x

H

 

   

  

1 1

'

''

'

''

a S

S

b n

y

y

y

y

y

y

H

y

y

y

H

 

 

 

Using the theorem 1.3. we have :

1)

  

 

(A(t) A(s))F(u x),(A(t) A(s))F(v y) L

L L

L

 



 

 

 

1 ,

1 1

1 1

, 1 1

1 ,

1

'

''

,

' ,

'

1

'' , ''

q Hs s t q p J

p q

p J w

p q

p q J k b

j a t

t j a

k p s jq Cj Ck s

L

I

e

F

u

x

x

L F u

x

L F v

y

t

s

L F u

x

L F v

y

y

x

x

y

    

 

 

 

We remark that

x

'' , ''

Cj

y

Ck

0

implies

1

1

r

    

a

w b

hence

a b

  

r

w

. Hence we have:

 

 

 

 

 

 

  

 

 

1 1

, 1 1

1 ,

1 1

, 1

1

1

, ,

1

, 1

, 1

1

p q

p J w

p Cj q Ck

p q J k b

j a

t

t r w k j

k p s jq s

p q

p J

t w

k k p

p J s

k b

r a

r w k j

p Cj q Ck s jq

q J j a

a r w j

jq s

L F u x L F v y t s L F u x L F v y

y x

L F u x L F v y t s

y a

L F u x L F v y x

x

    

   

  

    

 

 

   

  

 

 

    

 

 

 

   

 

 

  

1

, ,

, 1

q J

t k

p Cj q Ck k p

p k s

a

L F u x L F v y y da

  

  

 

(4)

ISSN 2348 – 7968

806

 

 

 

1

, '

''

1

(

(

),

,

(

)

a t

r w j k

kp p Cj

s

j k p J s

jq q Ck

p J

y

b L F u

x

x

a L F v

y

da

   

 

The sums

k j,

and

 

 '  '' ,

J p q J

are finite. Now

J

'

J

,

J

''

J

and the integrand

 

J'

q

q jq a L

x converges to

 

J q

q jq a L

x .

 

|| || || || ||

|| || ||

), (

 

     

   

      

 

 

 

v F L x u F L y

da y

v F L a x x

u F L y

Ck

Cj y

J q

q jq x

J p

p a

s kp J

p q J

Ck q

jq Cj

p a

s kp

 

 

1/2 1/2 1/2

2 1/2

2

a

p p s kp q q

p p q

jq q

M

L L

y

L L

x

a

Now we have :

 

 

 

 

  

 

 

 

 

 

 

 

 

 

 

 

,

,

,

,

1

,

1

1

1

L L L L

p p

p

t k F

kp p s

p k

L L Ck

t j F

jq L L Cj

s q j

p

A t

A s F u

x

A t

A s F v

y

L F u

x L F v

y

t s

y

a L F u

x

A a

A s

F v

y

da

x

a

A a

A s

F u

x

L F v

y da

   

 

 

We assume that all

L

phave the same parity

 

L

. Then

of

A

L

 

a

A

L

 

s

moves in front using

 

1

 L , then through

a b

,

a

,

b

in front of

L

p, then in the right and

 

1

 L

disappears.

We assume that

u

and

v

have opposite parities, that is

u

 

 

1

 u

u

.

Then

L F u

p

x

Lp  F(u  x) has the parity

     

L

F

u

r

, and

 

 

A

L

a

A

L

s

F

v

y

Ck

has the parity

   

L

F

1

 

v

w

1

 

 

.

For

,

 

 

1

 

0

p L L Ck

L F u

x

A

a

A

s

F

v

y

     

L

F

u

r

 

L

1

   

F

v

w

1

 

 

 

or

 

v

w

Hence

L

pmust have the same parity.

We generalize to

u v

,

arbitrary writing

u

u

u

and

v

v

v

. Since

t

s ykp 0 ,

k

b

t

sxjq

0 ,

j

a

using theorem 1.3 we can consider

u v

,

h

s and

1

;

S

r i

x

  

x

x

x

H

1

;

S

w i

y

y

 

y

y

H

Hence:

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

,

,

,

1 ,

1 ,

L L L L

t k F r w

kp p s

p k

L L Ck

t j F r w

jq L L Cj

s p j p

A t A s F u x A t A s F v y

y a L F u x

A a A s F u y da

x a A a A s F u x

L F v y da

 

 

   

  

 

    

    

  

  

   

In the same manner we obtain the value of:

2)

A tL

 

A s F uL

 

x G A t

,

L

 

A sL

 

vy

3) G A t

L

 

A sL

 

ux G A t

,

L

 

A sL

 

vy

4)

A tL

 

AL

 

s

F u

x

 

,H ts



vy

5) G A t

L

 

AL

 

s

F u

x

 

,H ts



vy

(5)

ISSN 2348 – 7968

807 We summarise these formulas in the following way .We

consider three possibilities, exactly

F G H

, ,

and if

is one of them, we define :

 

 

 

 

 

 

 

,

,

t L L

t L L t

F

A

t

A

s

F

G

G A

t

A

s

H

H t

s

 

 

with fixed

s

. We consider 2 of them

1 and

2 and we have:

 

  

 

   

   

 

1 2

2 2

1 1

1 2

, ,

1 1, , 2 2 2, , ,

*

1 1 2, , 2 1, ,

,

,

,

,

t

F F p p

p s

a k kp p k

k p

kp p k a k

u

x

v

y

L F u

x L F v

y

u

x

v

y

u

x

v

y

da

 

 

 

 

 

 

 

   

   

 

where:

 

,

 

,

 

.

,

p

F

L

p

F

p

G

GL

p p

H

H

p o

 

 

 

 

1, , 1, , 1, , 1

2, , 2, , 1

,

1

,

1

,

,

k r w F k F Ck k G k H

k

k G Ck k H k

x

x

x

x

x

x

x

x

x

   

 

 

 

 

 

 

 

 

 

 

 

* * *

,

,

1,

,

kp kp kp kp

kp kp kp kp kp

F

x

a

G

y

a

H

F

y

a

G

x

a

We recall that

p

N

and when

2

H

we have only

one term:

We consider , 1

0

n tn tn n

F

F

where

0

0

 

t

 

t

n

and

F

n

F

n,1

1

relative to

tn tn

h

h

h

and similarly , 1

0

n tn tn n

G

G

and

 , 1

0

n tn tn n

H

H

We define

 

 

 

 

 

 

1 0

1 1

0

b L n L n n

n

n L n L n n n

M t

M

A

s

A

s

F

G

A

s

A

s

H s

s

 

 

 

for

t

b

 

t

t

b1 and

s

i

t

i for

i

0, , ,

b s

b1

t

Then

M t

 

M t

 

b b

 

 

where in

b we replace

s

with

t

b.

We consider

M

,

b

 

M

M s

 

,then

M t

 

b and we remark that the formula

 

1

  

,

2

b

u

x

b

v

y

 

 

is still valid with the

following conventions:

p

 

M

0,

x

1, ,k M

,

x

2, ,k M

and

kp

 

M

arbitrary and we add also the

term:

 

  

1 2

, ,

,

MM

M s u

x M s

v

y

 

For

M t

 

b

 

 

we deduce:

 

  

 

   

   

 

1, , 2, ,

, , *

2, , 1, ,

,

,

,

,

b

t

p p

t p

k kp p k

k p M

kp p k k

M tb u

x M tb v

y

L F u

x

L F v

y

M a u

x

v

y

u

x

M a v

y

da

 

 

   

   

Where in the place of

F G H

, ,

we have

F G H

b

,

b

,

b

Summing with

n

0

to

a

we obtain:

 

  

 

  

 

   

   

 

0

1, , 2, ,

, , *

2, , 1, ,

,

0

,

0

,

,

,

t

p p

p

k kp p k

k p M

kp p k k

M t

u

x M t

v

y

M

u

x M

v

y

L F u

x

L F v

y

M a u

x

v

y

u

x

M a v

y

da

 

 

   

   

(6)

ISSN 2348 – 7968

808 Hence:

 

  

 

  

 

 

 

 

0

1, , 2, , 1

2, , 1, ,

,

0

,

0

,

,

,

t

p p

p J w

k p k

p J k M

p k k

M t

u

x M t

v

y

M

u

x M

v

y

L F u

x

L F v

y

M a u

x

v

y

u

x

M a

v

y

da

 

 

 

 

  

 

4. Conclusions

The need to build the non-commutative Markov processes was given by the evolution of probabilities in quantum mechanics. e build these processes on antisymmetric Fock space where we do not have exponential commutative vectors and where the commutative property does not occur between operators describing disjoint time intervals[5]. For this reason the processes are obtained as solutions of stochastic integral equations. This mathematical model creates the possibility to construct physical processes as stochastic integral equations solutions, being at the same time a new method of proving that certain processes are noncommutative. The model may be used in diffusion processes.

References

[1]Barnett, C., Streater, R.F., Wilde, I.F., The Itô-Clifford integral, Journal of Functional Analysis 48(1982), p.172-212. [2]Hudson, R.L., Parthasarathy, K.R., Quantum Itô's formula and stochastic evolutions, Communications in Mathematical Physics 93(1984), p.301-323.

[3]Applebaum, D.B., Hudson, R.L., Fermion Itô's formula and stochastic evolutions, Communications in Mathematical Physics 96(1984), p.473-496.

[4]Hudson, R.L., Parthasarathy, K.R., Stochastic dilations of uniformly continuous completely positive semigroups, Acta Applicanda Mathematica 2(1984), p.353-378.

[5]Parthasarathy, K.R., Bhat, Rajarama B.V., Markov dilations of nonconservative dynamical semigroups and a quantum boundary theory, Annales de l'Institut Henri Poincaré, Probabilités et Statistique 30(1995), p.601-652.

[6]Cuculescu, I., Oprea, A., Noncommutative probabilities, Kluver (1994)

[7]Serbanescu, C., Fermoin Stochastic Integrals of Continuous Processes/ Analele Universităţii Bucureşti pg. 277-288;

Cristina-Mirela Serbanescu

Degrees:

1. Bachelor Degree in Mathematics, Magna Cum Laude, University of Bucharest 1979

2. Master Degree in Probabilities and Stochastic Processes, University of Bucharest 1980

3. PhD in Probabilities and Stochastic Processes, University of Bucharest 1997

Places of employ:

1. University Politehnica Bucharest

Conferences:

1. WSEAS 2. INASE 3. Europment 4. Keystone

Journals:

References

Related documents

The tool verifies programs by first encoding the specified program into a much simpler programming language and then applying the Chalice verifier to the simplified program.. In

macroeconomic models would predict an increase in the unemployment rate if real GDP growth over the next two to four quarters were to fall below the economy’s potential growth

including never-smoking female cotton workers we found a higher prevalence of respiratory symptoms in the last 12 months, higher mean values of spirometric parameters, and

This procedure was carried out for each of the three position groups (Skill group, Combo group, L.O.S. A Proc StepDisc statistical analysis has been performed on each position

To set a breakpoint at a specific line in the code, go to that line (by clicking on the link in the stack trace) and toggle a breakpoint:. The dot on the left side indicates

In the Philippines, De La Salle University is an active Higher Education Institute member of the AIMS Programme offering three study fields: Business, Engineering and

When user is in offline mode or no network connection is available the system uses data stored in the local storage and stops all synchronization processes with main servers.. Also

Our solution uses a model driven approach to service modeling, data mining techniques on small sample sets of terminal QoS reports (from "smarter" end-user