• Keine Ergebnisse gefunden

Problem set 11

N/A
N/A
Protected

Academic year: 2021

Aktie "Problem set 11"

Copied!
2
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Fachbereich Physik SoSe 02

Freie Universit¨ at Berlin Set 11

Theoretische Physik 7/3/02

Theorie der W¨ arme – Statistical Physics (Prof. E. Frey)

Problem set 11

Problem 11.1 Ising model (6 pts)

Use Bogoliubov’s inequality (Problem 6.6) to find an upper bound for the free energy of the Ising model on a d-dimensional cubic lattice

H = −J X

hiji

σ

i

σ

j

− H X

i

σ

i

, σ

i

= ±1 , i = 1, .., N = L

d

where the first sum is restricted to nearest neighbors, in terms of the solvable model

H

0

= −H

0

X

i

σ

i

, σ

i

= ±1 , i = 1, .., N = L

d

Determine the effective field H

0

that minimizes the bound.

Problem 11.2 Ising model in one dimension (6 pts)

Evaluate the partition sum Z (T, N ; {J

i

}) for a one dimensional Ising chain with N spins:

H

N

= −

N−1

X

i=1

J

i

σ

i

σ

i+1

, σ

i

= ±1 .

Here the couplings J

i

are fixed numbers dependent on the site i. It is favorable to sum over the bond variables τ

i

= σ

i

σ

i+1

instead over the spin variables σ

i

. Convince yourself that each configuration is characterized by one end spin and the sequence of bonds. An important quantity is the spatial correlation function G

i,n

= hσ

i

σ

i+n

i that characterizes the decay of spin correlation as a function of distance n. Show that one can also write

G

i,n

= h

i+n−1

Y

k=i

τ

k

i = Z(T, N; {J

i

})

−1

"

i+n−1

Y

k=i

∂(J

k

/k

B

T )

#

Z(T, N; {J

i

})

and evaluate G

i,n

. For the case of equal couplings J

i

≡ J , demonstrate that the spatial correlation function decreases exponentially with increasing distance G

i,n

= exp(−n/ξ). Determine the correlation length ξ and derive its leading low-temperature behavior. Also for equal couplings, calculate the extensive part of the susceptibility

χ = 1 k

B

T

N

X

i,j=1

i

σ

j

i

and discuss χ as a function of temperature.

Problem 11.3 critical properties of the van-der Waals fluid (6 pts) The empirical equation of state of a van-der Waals fluid reads

P + N

2

a V

2

(V − N b) = N k

B

T ,

(2)

where P, V = N v, T and N denote the pressure, volume, temperature, and the number of particles, respectively, and a, b are some non-universal constants. Show that by introducing reduced variables ˆ P = P/P

c

, v ˆ = v/v

c

, T ˆ = T /T

c

with P

c

= a/27b

2

, v

c

= 3b, k

B

T

c

= 8a/27b one obtains a parameter-free form

P ˆ + 3

ˆ v

2

(3ˆ v − 1) = 8 ˆ T .

Demonstrate that ˆ P = ˆ v = ˆ T = 1 corresponds to a critical point, i.e. (∂P/∂v)

T

= (∂

2

P/∂v

2

)

T

= 0. Expand the reduced pressure for small t = ˆ T − 1, φ = ˆ v − 1 [Answer: ˆ P = 1 + 4t − 6tφ − 3φ

3

/2 + O(φ

4

, tφ

2

) ]. Derive the free energy per particle. Convince yourself that one has to use a Maxwell construction for t < 0 and discuss the shape of the coexistence curve in a P –v diagram. Evaluate the specific heat per particle c

V

= C

V

/N above and below T

c

at v = v

c

. Calculate the isothermal compressibility κ

T

(a) at v = v

c

for temperatures T > T

c

. (b) at the coexistence boundary for T < T

c

.

Termine f¨ ur ¨ Ubungsgruppen:

Do 12-14 in T3, 1.3.48 (Franosch)

Do 16-18 in T1, 1.3.21 (Parmeggiani, Lattanzi) in englischer Sprache Fr 12-14 in E2, 1.1.53 (Falcke)

Abgabe: In der Vorlesung vom 10.7.02

Referenzen

ÄHNLICHE DOKUMENTE

Generalize Karger’s contract algorithm such that it finds an r-cut and give a lower bound on the probability that it outputs a

For each edge, the first number is the capacity, the second number is

The idea behind the core algorithm is the hope that the optimal solution for the fractional knapsack problem as computed by the greedy algorithm on page 105, ¯ x, typically differs

• Let every place compute a coreset, communicate these coresets to a central server and then merge these sets as shown in task 2 to obtain the final coreset. • Again let every

Give a short proof that changing the costs of the five edges by choosing them according to independent density functions f e : [0, 1] → [0, φ] implies that the SSP algorithm

Find better upper bounds on Pr(∆ ≤ ) than the bound provided by Lemma 7.3 for the following scenarios:1. For each edge, the first number is the capacity, the second number is

As a first result it should be stated that the image of the social group connected with heroin is that of Spanish people and has nothing to do with immigration, since

We show that the resource augmentation is necessary by proving polyno- mial lower bounds on the max-stretch and total flow time for the case where online and offline algorithms