FractalPark
ClassicEasy

Lambda Fractal

A centered complex logistic map: one parameter both stretches an orbit and turns it back on itself.

Open in Explorer
Black Lambda set against blue-green space, its edge trailing branching threads
The centered complex logistic map’s parameter plane: a disk-like core, attached bulbs, and a threadlike edge.

Overview

On the real line, the logistic map became a small laboratory for chaos. Let its values roam the complex plane and it opens into the Lambda, or λ-, fractal. FractalPark uses a centered form: c scales two complementary factors pulling in opposite directions.

An affine change of coordinates makes this formula conjugate to the standard quadratic map z² + c. It shares the Mandelbrot set’s family traits, but not its outline: here there is a disk where the Mandelbrot set has a cardioid, and the attached bulbs arrange themselves by their own periods.

Here c turns two knobs at once—growth and rotation. Fix it for a Julia view, then nudge it: a nearly round basin can become a boundary of branches and spirals.

The Mathematics

Complex logistic iteration

z(n+1) = c times (z(n) + 1/2) times (1/2 - z(n))

At each step, shift the current value halfway either side of center, multiply (z + ½) by (½ − z), then scale the product with c. The two factors make ¼ − z², so the same step reads z → c(¼ − z²).

Try c = 2 with z₀ = 0. The first step is z₁ = 2 × (½) × (½) = 0.5; the next is z₂ = 2 × 1.0 × 0 = 0. The orbit now shuttles between 0 and 0.5: a stable 2-cycle. Turn c up to 4 and the pull changes: z₁ = 4 × ½ × ½ = 1, then z₂ = 4 × 1.5 × (−0.5) = −3. The orbit diverges, so c = 4 lies outside the bounded set. In Julia mode, hold c still and vary z₀ across the image; the dividing line between trapped and escaping appears.

History

The map z → λz(1 − z) began as the complex extension of the real logistic map, studied extensively in the 1970s as a simple model of population dynamics and chaotic behavior. In 1980, Benoit B. Mandelbrot took the iteration to unrestricted complex λ and z. His paper, "Fractal Aspects of the Iteration of z → λz(1−z) for Complex λ and z," introduced the λ-plane parameter set—now the Lambda fractal—and placed it in the broader theory of iterated rational maps.

The groundwork was already there. Around 1917–1918, Pierre Fatou and Gaston Julia developed the general theory of iterated rational functions that later made families such as the logistic map available to explore. In 1986, Heinz-Otto Peitgen and Peter H. Richter brought the Lambda fractal to a wider audience in "The Beauty of Fractals," with some of the first widely seen computer-generated images of the set.

Visual Characteristics

At full scale, the Lambda set begins with an almost circular body—the countershape to the Mandelbrot set’s heart-like cardioid. Smaller bulbs cling to the disk; each marks a stable periodic cycle, and the largest marks a period-2 cycle. Beyond them lie branching channels, tiny disk islands, and spirals.

The islands give away the difference: they are round here, not cardioid-shaped, because the algebra has changed. In Julia mode, c can select a filled disk or a many-armed vortex.

Remix and Examples

Start from the canonical Document

Open the same approved formula state used by this guide, then change the view, coloring, transforms, or animation in the interactive Explorer.

Frequently Asked Questions

What does lambda control?

The complex parameter c—often written λ in the literature—sets both the orbit’s growth rate and its rotation. Its magnitude controls the strength of expansion or contraction; its argument supplies the turn at each step.

Why does Julia mode look especially varied?

Fix c and the question shifts to the starting point: does it stay bounded or escape? With linear and quadratic terms in the same formula, the border may be a smooth closed curve or a heavily branched connected set. The chosen c decides what the renderer reveals.

References

Source walkthrough

  1. frm-v1:a265807bb53747d256b0cbfee89991527a72e8bb9ceac9a41888c3ad1419448e:init/0

    In lambda, this node executes if ismand: z = 0; otherwise z = pixel.

  2. frm-v1:a265807bb53747d256b0cbfee89991527a72e8bb9ceac9a41888c3ad1419448e:loop/0

    In lambda, this node executes actualZ = z + (0.5, 0).

  3. frm-v1:a265807bb53747d256b0cbfee89991527a72e8bb9ceac9a41888c3ad1419448e:loop/2

    In lambda, this node executes z = c * (actualZ * oneMinusZ).

  4. frm-v1:a265807bb53747d256b0cbfee89991527a72e8bb9ceac9a41888c3ad1419448e:bailout

    In lambda, this node executes |z| <= 256.

Syntax features

state-flow

These annotations trace the formula-specific state flow: if ismand: z = 0; otherwise z = pixel; actualZ = z + (0.5, 0); z = c * (actualZ * oneMinusZ).

stopping-test

This annotation is the stopping test, |z| <= 256, rather than a state update.

Parameter experiment

Steps

  1. Run lambda with 48 iterations while keeping the pinned profile’s other controls fixed, and record the result.
  2. Run lambda at the pinned profile iteration count of 96, compare the two runs, and record whether a difference occurs.

What to observe

Record whether actualZ = z + (0.5, 0), oneMinusZ = (1, 0) - actualZ, then z = c * (actualZ * oneMinusZ) produces a visible-result or |z| <= 256 stopping-behavior difference from the baseline; the pinned definition does not guarantee a difference.

Exercise

Trace lambda through its annotations, explaining the source operation actualZ = z + (0.5, 0), oneMinusZ = (1, 0) - actualZ, then z = c * (actualZ * oneMinusZ) and the stopping test |z| <= 256.

Completion check

Your trace explains all 4 annotations for lambda, including actualZ = z + (0.5, 0), oneMinusZ = (1, 0) - actualZ, then z = c * (actualZ * oneMinusZ), and distinguishes |z| <= 256 from a state update.

Sources and rights

This teaching unit is grounded in runtime:a265807bb53747d256b0cbfee89991527a72e8bb9ceac9a41888c3ad1419448e and decision:c1c898f3-c9a3-583d-9a0a-d09968ba0db3.

rightsStatus is project-owned; implementationBasis is project-owned; publicationDecision is publish; decisionReason is publish-project-owned-native-recipe. This statement does not make broader claims about any third-party original.

Formula Record

lambda

This canonical FractalPark implementation is published and runnable.

Deterministic preview of lambda

Canonical source

Language
frm-like/1
Standard library
1
Profile mode
parameter-plane
Profile center
-0.5, 0
Profile zoom
0.4
Profile iterations
96
Profile evidence
mechanical

Parameters

No declared parameters

Canonical source

This verified canonical revision is read-only. Remix creates a separate editable fork.

Loading canonical source…

Source and implementation

Formula ID
c1c898f3-c9a3-583d-9a0a-d09968ba0db3
Canonical name
lambda
Original name
lambda
Historical source
FractalPark
Current implementation
Project-owned

This is a FractalPark project-owned implementation. The linked file is the pinned canonical Definition.

Rights or attribution concern?

Send the Formula ID and supporting evidence. The maintainer can hold or withdraw the implementation while the claim is reviewed. contact@fractalpark.com