What does Biophilic Fractal Interfaces and First-Screen Trust conclude, in numbers, about “Symmetry Order and Entropy: Which Entropy Is Low?”?

Answer: Chapter 4 shows that symmetry lowers the cost of description, yet threefold symmetry has an orientation entropy of 3.606 bits, higher than a random pattern.

Scope of the numbers: Parameters are illustrative; all calculations come from its programs; it is neither medical nor personalised business advice. Chapter 3 finds, in an illustrative model, that a first screen of a few seconds retains at most 0.125 of a ten-minute laboratory effect, and that testing 24 markers at once gives a 0.708 chance of at least one false alarm.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 3.606

24 strokes, orientation entropy in bits (max 4.170)
orderfreemean H bitssd H bits
1243.5410.167
2123.0160.234
383.6060.276
463.0420.320
643.0640.380
833.1370.338
1223.2090.465
Show the full program
# Chapter 4. p41: symmetry order, orientation entropy and description cost
# A pattern of 24 strokes is built from a random motif of 24 / n strokes
# repeated n times around the centre (rotational order n). Two kinds of
# "entropy" are compared: the Shannon entropy of the stroke-orientation
# histogram (18 bins over 0 to 180 degrees, length weighted) and the
# description cost, i.e. how many free strokes one must specify. The
# random 24-stroke pattern is the baseline. Seeds fixed; illustrative.
import math
import random

BINS = 18
TOTAL = 24


def motif(k, rng):
    out = []
    for _ in range(k):
        r = 0.2 + 0.7 * rng.random()
        th = rng.uniform(0, 360)
        ln = 0.1 + 0.2 * rng.random()
        ang = rng.uniform(0, 180)
        out.append((r, th, ln, ang))
    return out


def entropy(strokes):
    w = [0.0] * BINS
    for _, _, ln, ang in strokes:
        w[int((ang % 180) / (180 / BINS)) % BINS] += ln
    tot = math.fsum(w)
    return -math.fsum(p / tot * math.log2(p / tot) for p in w if p > 0)


def rotate(m, n):
    out = []
    for j in range(n):
        for r, th, ln, ang in m:
            out.append((r, th + 360 * j / n, ln, ang + 360 * j / n))
    return out


rng = random.Random(41841)
print("24 strokes, orientation entropy in bits (max {:.3f})".format(
    math.log2(BINS)))
print("{:>6} {:>10} {:>14} {:>14}".format(
    "order", "free", "mean H bits", "sd H bits"))
for n in (1, 2, 3, 4, 6, 8, 12):
    hs = []
    for _ in range(400):
        hs.append(entropy(rotate(motif(TOTAL // n, rng), n)))
    m = math.fsum(hs) / len(hs)
    sd = math.sqrt(math.fsum((h - m) ** 2 for h in hs) / (len(hs) - 1))
    print("{:>6} {:>10} {:>14.3f} {:>14.3f}".format(n, TOTAL // n, m, sd))

Single source and citation

Fan, Y. (2026). Biophilic Botanical Fractals and Geometric Symmetry in Interfaces: Subconscious Stress Reduction and First-Impression Trust Lift (Version 1.0.0), Chapter 4: Symmetry Order and Entropy: Which Entropy Is Low?. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-418 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026418,
  author    = {Fan, Yafu},
  title     = {Biophilic Botanical Fractals and Geometric Symmetry in Interfaces: Subconscious Stress Reduction and First-Impression Trust Lift},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book