was a deep zoom into a “quiet” area. It appears that an infinite grid
with ever finer lines is everywhere. At every intersection, a deep zoom holds
something interesting. Here is a distorted minibrot.
With z^2+c and a little algebra, you can show that if |z| > 2 + |c| then z escapes. Yesterday I showed a similar argument for bugI() which concludes that if |x| > a + 1 + |c| then z =x + yi escapes. So for both of these formulas, there are easily identified large areas where the orbit is guaranteed to escape. Also we saw that this type of simple algebra argument breaks down for bugR(). That does not prove that no such area exists, only that if it does, it will be difficult to find. Let’s dig deeper
Since this is a blog, not a book, I should recap frequently. We are iterating
If a>.5 (an easy assumption, it has been true for every picture so far), u(p)=-.5 has a solution. In fact many solutions when you find one, is also a solution for any integer n.
Look at . where n and m are arbitrary integers.
These points lie on a grid. Equal space horizontally, decreasing spacing vertically because of the square root. But extending to infinity in all directions. Where ever you are in the plane you are surrounded by these points. The following will show that none of these points escape, in fact every one is a 2-cycle.
Lets iterate bugR(z^2+c)
So every one of these points generates a two cycle.
It is embarrassing to admit how much time I spent on this. My math skills are rusty.
I wanted visual confirmation that the webbing is everywhere. Here is a deep zoom into the nearly empty area in the top right of yesterday’s image. The color has been changed from previous image to enhance the features. The lines get thin very quickly. You see a horizontal line, intersected by many vertical lines, and each of them connected by almost invisible horizontal lines. Because the lines in this third set are thinner than the pixels in the image, Moiré patterns appear.
To save typing and simplify some calculations, define . Note that .
With this notation, . Set and expand the iteration .
After the first step, we always have . With a little algebra, it is seen that if . So the real part of the iteration keeps getting larger, and we have many orbits escaping to infinity.
A similar analysis fails with . On each iteration step,
The real part is always bounded, , so the only hope of escape lies with the imaginary part. But if x is a multiple of a*pi, then u(x) = 0, and y has to start over.
As was done earlier with bugI, the next few posts explore bugR from a more mechanical or mathematical perspective.
Compare this image with Bugs #8. Same location, zoom, and color, same parameter a = 2.5, but with the R version replacing the I version of bug. The webbing appears to be everywhere, although it quickly becomes too thin to see at this image resolution.
Here is another more artistic rendering of bugR. a = 2.0. Compare the web like structures with the bugI images, such as Bugs #12 and Bugs #6. Here the strands are thinner, but are everywhere.
There are several pictures on my hard drive that are queued up to post here. The plan was to introduce the bug formula, provide some nerdy math descriptions and examples, then start posting the more artistic images. I am done with the nerd stuff, and then noticed a problem with that plan; most of the images I have are based on another version of the bug formula. I won’t keep you in suspense. You may have guessed the other variation. I added a letter to the name to keep track of which part is gets modified.
As a quick recap, the bug formula is combined with the usual , and the images are generated in a typical escape-time fashion. There are two variations of the combined formula, depending on who goes first.
Most of the pictures
here use the second “bug last” variant.
The pictures of the
last two weeks have been based on bugI(). Today’s picture is based on bugR(),
with a = 1.5.