# Julia Set Distance Estimate
# 1 Standard Formulas
The standard formulas for Julia set distance estimates are:
Reference: Colouring the Julia set (wikibooks) (accessed 2025-02-20).
# 2 (Non Super-) Attracting Case
# 2.1 Problem
There is a problem with the third formula when implemented on a computer: “spots” at pre-images of the attracting orbit, worse for strong (but not super) attraction.
See my decade-old math.stackexchange question (accessed 2025-02-20).
For example, the Julia set of :

# 2.2 Derivation Using Koenigs Linearisation
See Chapter 6 of:
Dynamics in one complex variable: introductory lectures, John W. Milnor, 1990, https://arxiv.org/abs/math/9201272
Corollary 6.4 introduces as linearisation near an attractive fixed point with multiplier .
When using this for distance estimation, one calculates , and the factor cancels.
However, as Milnor points out,
Note that has zeros at all iterated preimages of , and critical points at all iterated preimages of the critical point . The function is unbounded, and oscillates wildly as tends to .
This means that is zero and infinite at various points inside the attractive basin , and thus it isn’t really useful as a distance estimate.
# 2.3 Doomed Attempt Using L’Hospital’s Rule
L’Hospital’s Rule for limits says that (under some conditions) if cannot be evaluated as , then it might be evaluated as .
Applying L’Hospital’s Rule to the third formula gives a sequence of distance estimates:
Then define a combined distance estimate as the maximum of all of these
In practice, only a finite number can be calculated.
This is unprincipled as the pre-conditions for l’Hospital’s rule are not checked, and it’s not obvious that taking the maximum is always the right thing to do.
Anyway it doesn’t really work: the problem is not the evaluation of the limit, but that the value of the limit is bad as a distance estimate.