MCS 275 Spring 2024
Emily Dumas
Reminders and announcements:
trees.py
updatedOur work on pillow and numpy has involved a lot of low-level discussion of features, rather than fully developed application examples.
Today we'll work on changing that.
Start with a function, e.g. $f(x) = x^2$, and a number, $a$.
Apply $f$ over and over again to get a sequence:
$a, f(a), f(f(a)), f(f(f(a))), ...$
This sequence $\{ f^{n}(a) \}_{n \geq 0}$ is the orbit of $a$ (under $f$). What can we say about it?
Let's start with a simple example, $f(x) = x^2$.
$2\to4\to16\to256 \to 65536\to\cdots$
$\frac{1}{2} \to \frac{1}{4} \to \frac{1}{16} \to \frac{1}{256} \to \frac{1}{65536} \to \cdots$
What happens for other starting points?
For real numbers, orbits under $f(x)=x^2$ are easy:
For $f(z)=z^2$ with complex numbers, it's the same!
$f(z)=z^2$
The filled Julia set of a polynomial $f$, denoted $K_f$, is the set of complex numbers that have bounded orbits under $f$.
(So $a \in K_f$ is a statement about the behavior of an infinite sequence—the orbit of $a$)
Named for mathematician Gaston Julia (1893-1978) who studied these sets starting in the 1920s.
$f(z)=z^2$
Next, let's look at $f(z) = z^2 - 1$.
For $f(z) = z^2-1$, if $|a|\geq 2$, then $f^n(a) \to \infty$ as $n \to \infty$.