52

Remembering Benoit Mandelbrot

  • Upload
    tobit

  • View
    54

  • Download
    0

Embed Size (px)

DESCRIPTION

Remembering Benoit Mandelbrot. 20 November 1924 – 14 October 2010. First Citizen of Science. (1924 – 2010). Father of Fractal Geometry. (1924 – 2010). Theory of Roughness. The Fractal Geometry of Nature. (1924 – 2010). 1977. 1982. 1985. December 6, 1982 Leo Kadanoff - PowerPoint PPT Presentation

Citation preview

Page 1: Remembering Benoit Mandelbrot
Page 2: Remembering Benoit Mandelbrot

RememberingBenoit

Mandelbrot

20 November 1924 – 14 October 2010

Page 3: Remembering Benoit Mandelbrot

First Citizenof

Science

(1924 – 2010)

Page 4: Remembering Benoit Mandelbrot

Fatherof

Fractal Geometry

(1924 – 2010)

Page 5: Remembering Benoit Mandelbrot

Theoryof

Roughness

(1924 – 2010)

The FractalGeometryof Nature

Page 6: Remembering Benoit Mandelbrot

1977

1982

Page 7: Remembering Benoit Mandelbrot

1985

The year when I metBenoit Mandelbrot

andRichard F. Voss

December 6, 1982

Leo Kadanoff

University of Utah

Page 8: Remembering Benoit Mandelbrot
Page 9: Remembering Benoit Mandelbrot

Mandelbrot Set 1980

Page 10: Remembering Benoit Mandelbrot

1986

The mathematics behindthe Mandelbrot Set

Page 11: Remembering Benoit Mandelbrot

University of California at Santa Cruz, October 1987

Page 12: Remembering Benoit Mandelbrot

1988

Publishing all the algorithms

known at that time

Page 13: Remembering Benoit Mandelbrot

How Mountains turn into Clouds …

A Masterpiece by Richard F. Voss

A completely synthetic mathematical

construction of mountains and clouds

Page 14: Remembering Benoit Mandelbrot

1991...

Page 15: Remembering Benoit Mandelbrot

1991...MaletskyPerciante

Yunker

PeitgenJürgensSaupe

Page 16: Remembering Benoit Mandelbrot

1992

Page 17: Remembering Benoit Mandelbrot

Mandelbrot Set:

The most complex object mathematics has ever seen

Page 18: Remembering Benoit Mandelbrot

Iteration

Iteration of rational functions

Theory of Julia & Fatou~1918

Page 19: Remembering Benoit Mandelbrot

Choose z0 in the complex plane.

Then iterate, which means compute

zn+1 = f (zn ) for n = 0,1,2,3,...

f (z) =p(z)

q(z), where p(z) and q(z) are polynomials

Example : f (z) =2z3 +1

3z2

I studied thatin the fall of 1982

at the University of Utah

Newton's Method for x3-1

Page 20: Remembering Benoit Mandelbrot

Julia Sets

Given a rational function f (z),

collect all starting points z for which the

iteration does not go to infinity

J = z | z→ f (z) → f ( f (z)) → ...{ → ∞}

"The iteration does not escape to infinity"

"The Prisoner Set"

Page 21: Remembering Benoit Mandelbrot

The Set of Complex Numbers C

z = a+ bi, i = −1

Addition

z = a+ bi, w = c + di

z + w = (a+ c) + (b+ d)i

Multiplication

z = a+ bi, w = c + di

z • w = (a+ bi) + (c + di) = (ac −bd) + (ad + bc)i

a

b z

Page 22: Remembering Benoit Mandelbrot

The Set of Complex Numbers C

z = a+ bi, i = −1

Division? Find inverse to z = a+ bi :

1

z=

1

a+ bi=

1

a+ bi•a−bi

a−bi=a−bi

a2 + b2

a

b z

1/z

Page 23: Remembering Benoit Mandelbrot

The Set of Complex Numbers C

z = a+ bi, i = −1

Modulus

z = a+ bi

| z | = a2 + b2

a

b z

Page 24: Remembering Benoit Mandelbrot

The Quadratic Family

f (z) = z2 + c, c ∈ C

z0,

z1 = z02 + c,

z2 = z12 + c = z0

2 + c( )2

+ c = z04 + 2cz0

2 + c 2 + c

z3 = z22 + c = z0

4 + 2cz02 + c 2 + c( )

2+ c = ...

Page 25: Remembering Benoit Mandelbrot

Julia Set

Jc = z | z→ z2 + c → (z2 + c)2 + c → ...{ → ∞}

i.e. choose c and then

collect all starting points for which the iteration

does not go to infinity (Prisoner Set)

Page 26: Remembering Benoit Mandelbrot

Theorem of Julia & Fatou

Jc = z | z→ z2 + c → (z2 + c)2 + c → ...{ → ∞}

is

- either one piece (connected)

- or an infinite dust (Cantor Set)

Page 27: Remembering Benoit Mandelbrot

Theorem of Julia & Fatou

Jc = z | z→ z2 + c → (z2 + c)2 + c → ...{ → ∞}

is connected if and only if

c → c 2 + c → (c 2 + c)2 + c → ... → ∞

Page 28: Remembering Benoit Mandelbrot

connected not connected

dust

Page 29: Remembering Benoit Mandelbrot

connected not connected

(super) infinite dust

Cantor Set

Page 30: Remembering Benoit Mandelbrot
Page 31: Remembering Benoit Mandelbrot
Page 32: Remembering Benoit Mandelbrot

Two simple Julia Sets

Jc = z | z→ z2 + c → (z2 + c)2 + c → ...{ → ∞}

c = 0 :

z→ z2 → z4 → z8 → ...

Page 33: Remembering Benoit Mandelbrot

Two simple Julia Sets

Jc = z | z→ z2 + c → (z2 + c)2 + c → ...{ → ∞}

1

z <1⇒ z2 = z2

= z • z < z

z >1⇒ z2 = z2

= z • z > z

c = 0 :

z→ z2 → z4 → z8 → ...

Page 34: Remembering Benoit Mandelbrot

Two simple Julia Sets

Jc = z | z→ z2 + c → (z2 + c)2 + c → ...{ → ∞}

1

c = 0 :

z→ z2 → z4 → z8 → ...

Is it connected? Need to check :

c → c 2 + c → (c 2 + c)2 + c → ...

c = 0, compute

c → c 2 + c → (c 2 + c)2 + c → ...

Page 35: Remembering Benoit Mandelbrot

Two simple Julia Sets

Jc = z | z→ z2 + c → (z2 + c)2 + c → ...{ → ∞}

+2

−2 ≤ z ≤ 2 ⇔ z ≤ 2

⇒ z2 − 2 ≤ 4 − 2 = 2

-2€

c = −2 :

z→ z2 − 2 → (z2 − 2)2 − 2 → ...

Page 36: Remembering Benoit Mandelbrot

Two simple Julia Sets

Jc = z | z→ z2 + c → (z2 + c)2 + c → ...{ → ∞}

+2-2€

c = −2 :

z→ z2 − 2 → (z2 − 2)2 − 2 → ...

Is it connected? Check for c = −2 :

c → c 2 + c → (c 2 + c)2 + 2 → ...

Page 37: Remembering Benoit Mandelbrot

The Mandelbrot Set

M = c | Jc is connected{ }

M = c | c → c 2 + c → (c 2 + c)2 + c → ...→ ∞{ }

{−2,0}∈ M

Page 38: Remembering Benoit Mandelbrot

The Mandelbrot Set

M = c | c → c 2 + c → (c 2 + c)2 + c → ...→ ∞{ }

sequence becomes unbounded"escapes"

sequence remains bounded"imprisoned"

Making a picture:(b/w)

1980

Computer (Pixel) Graphics

C64: 1982 16 colors

Macintosh: 1984 b/w--------------------------RGB 256x256x256only in few research labsUniversity of Utah

Page 39: Remembering Benoit Mandelbrot

1/4-2

1

-1

Page 40: Remembering Benoit Mandelbrot

The Mandelbrot Set

M = c | c → c 2 + c → (c 2 + c)2 + c → ...→ ∞{ }

all sequences become unbounded"escape"

some sequences remain bounded"imprisoned"

2

Making a picture:b/w

Page 41: Remembering Benoit Mandelbrot

c 2 + c − c ≤ c 2 + c + c ⇒

c 2 + c ≥ c 2 − c

=c 2

When c > 2 then c → c 2 + 2 → c 2 + 2( )2

+ c → ... escapes

Whe need the Triangle Inequality :

a +b ≤ a + b

Whe will show :

c > 2⇒ c 2 + c > c

⇒ c 2 + c ≥ c 2 − c = c c −1( )

⇒ c 2 + c > c

Page 42: Remembering Benoit Mandelbrot

The Mandelbrot Set

M = c | c → c 2 + c → (c 2 + c)2 + c → ...→ ∞{ }

"imprisoned"

2

"escapes"takes 5 steps to land

outside circle

"escapes"takes 13 steps to land

outside circle

Making a picture:(color)

1982/83Salt Lake City

Page 43: Remembering Benoit Mandelbrot

Around the Mandelbrot Set

Powers of Ten

Page 44: Remembering Benoit Mandelbrot
Page 45: Remembering Benoit Mandelbrot
Page 46: Remembering Benoit Mandelbrot

Similarity between

Julia Sets

and the

Mandelbrot Set

Page 47: Remembering Benoit Mandelbrot

1/(period)2

Page 48: Remembering Benoit Mandelbrot

Mandelbrot Set 1990 (Peitgen/Jürgens/Saupe)

Electrostatic Potential(key for mathematical understanding)

Page 49: Remembering Benoit Mandelbrot
Page 50: Remembering Benoit Mandelbrot

Flying the Mandelbrot Set

Page 51: Remembering Benoit Mandelbrot

Interview Bremen1986

Page 52: Remembering Benoit Mandelbrot

We will always remember