What does Detours and the Depth of Thinking conclude, in numbers, about “The Brachistochrone: Why the Straight Line Loses to the Cycloid”?
Answer: In a gravitational field the quickest route is the cycloid, not the straight line. Program p11 finds that in the square case the cycloid takes 0.9128 of the line's time, and the advantage grows with horizontal distance. Program p12 shows that dropping first and travelling second has a best depth, and that dropping too far is slower than the line. Program p13 marks two boundaries: the advantage vanishes when the target is directly below, and the cycloid stalls halfway once friction passes 0.793. Business analogies borrow the structure, never the numbers, and each use has to check whether potential can be converted, whether speed persists, and whether the target is far enough away.
Scope of the numbers: Parameters are illustrative and all calculations are generated by the book's programs. This is not investment advice or advice on any particular business decision, and it promises no return.
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: 0.793, 0.9128
| A. Frictionless: shape L/H against the cycloid/line time ratio | |||
| L/H | theta_end | dips_below_B | t_cyc/t_line |
| 0.25 | 0.7364 | no | 0.9924 |
| 0.50 | 1.4014 | no | 0.9720 |
| 1.00 | 2.4120 | no | 0.9128 |
| 1.50 | 3.0688 | no | 0.8517 |
| 2.00 | 3.5084 | yes | 0.7979 |
| 3.00 | 4.0516 | yes | 0.7132 |
| 5.00 | 4.5946 | yes | 0.6027 |
| B. Friction mu on the L=H=1 case (cycloid shape kept) | |||
| mu | t_line | t_cycloid | ratio |
| 0.00 | 0.6386 | 0.5829 | 0.9128 |
| 0.20 | 0.7139 | 0.6411 | 0.8980 |
| 0.40 | 0.8244 | 0.7172 | 0.8700 |
| 0.60 | 1.0096 | 0.8307 | 0.8227 |
| 0.70 | 1.1658 | 0.9241 | 0.7927 |
| 0.80 | 1.4278 | stuck | n/a |
| 0.90 | 2.0193 | stuck | n/a |
| cycloid shape stops beating the line near mu = 0.793 |
Show the full program
# Chapter 1. p13: where the cycloid's advantage shrinks or reverses
# Part A: frictionless cycloid / line time ratio against the shape L/H;
# the cycloid dips below B once theta_end > pi (L/H > pi/2).
# Part B: Coulomb friction mu. Along the path the normal force is
# g cos(a) + v^2 k (k = curvature), so a curved path pays friction for
# its own bending; v^2 is marched piece by piece and each piece time is
# 2 d / (v0 + v1). The cycloid shape is kept fixed, not re-optimised.
# All parameters are illustrative.
import math
G = 9.81
def cyc(L, H):
lo, hi = 1e-9, 2 * math.pi - 1e-9
for _ in range(200):
mid = 0.5 * (lo + hi)
if (mid - math.sin(mid)) / (1 - math.cos(mid)) > L / H:
hi = mid
else:
lo = mid
th = 0.5 * (lo + hi)
return th, H / (1 - math.cos(th))
def fric_time(pts, mu):
# d(v^2)/ds = 2 g sin(a) - 2 mu (g cos(a) + v^2 k); k = turn / length
v2, parts, prev = 0.0, [], None
for (x0, y0), (x1, y1) in zip(pts, pts[1:]):
d = math.hypot(x1 - x0, y1 - y0)
ang = math.atan2(y1 - y0, x1 - x0)
k = 0.0 if prev is None else abs(prev - ang) / d
prev = ang
acc = G * math.sin(ang) - mu * (G * math.cos(ang) + v2 * k)
v2n = v2 + 2 * d * acc
if v2n <= 0:
return None
parts.append(2 * d / (math.sqrt(v2) + math.sqrt(v2n)))
v2 = v2n
return math.fsum(parts)
def pts_cyc(L, H, n=4000):
th, r = cyc(L, H)
return [(r * (t - math.sin(t)), 2 * r * math.sin(t / 2) ** 2)
for t in (th * k / n for k in range(n + 1))]
def pts_line(L, H, n=4000):
return [(L * k / n, H * k / n) for k in range(n + 1)]
print("A. Frictionless: shape L/H against the cycloid/line time ratio")
print(" L/H theta_end dips_below_B t_cyc/t_line")
for ratio in (0.25, 0.5, 1.0, 1.5, 2.0, 3.0, 5.0):
th, r = cyc(ratio, 1.0)
tc = th * math.sqrt(r / G)
tl = math.sqrt(2 * (ratio * ratio + 1.0) / G)
print(" {:5.2f} {:7.4f} {:<12} {:8.4f}".format(
ratio, th, "yes" if th > math.pi else "no", tc / tl))
print("B. Friction mu on the L=H=1 case (cycloid shape kept)")
print(" mu t_line t_cycloid ratio")
for mu in (0.0, 0.2, 0.4, 0.6, 0.7, 0.8, 0.9):
tl = fric_time(pts_line(1.0, 1.0), mu)
tc = fric_time(pts_cyc(1.0, 1.0), mu)
f = lambda t: " stuck " if t is None else "{:8.4f}".format(t)
rt = " n/a" if (tl is None or tc is None) else \
"{:7.4f}".format(tc / tl)
print(" {:4.2f} {} {} {}".format(mu, f(tl), f(tc), rt))
lo, hi = 0.0, 0.95
for _ in range(80):
mid = 0.5 * (lo + hi)
tl = fric_time(pts_line(1.0, 1.0), mid)
tc = fric_time(pts_cyc(1.0, 1.0), mid)
if tc is not None and tl is not None and tc < tl:
lo = mid
else:
hi = mid
print("cycloid shape stops beating the line near mu = {:.3f}".format(lo))Single source and citation
Fan, Y. (2026). When the Shortest Path Fails: Brachistochrone Detours, Second-Order Consequence Mapping and Holographic Deep Thinking (Version 1.0.0), Chapter 1: The Brachistochrone: Why the Straight Line Loses to the Cycloid. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-384 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026384,
author = {Fan, Yafu},
title = {When the Shortest Path Fails: Brachistochrone Detours, Second-Order Consequence Mapping and Holographic Deep Thinking},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 2 · Roundabout Preparation: the Break-even of Building the Road First
- Chapter 3 · The Limits of Greed: Inside and Outside the Matroid
- Chapter 4 · One More Road and Everyone Is Slower: Braess's Paradox and Selfish Routing
- Chapter 5 · The Second-Order Interest on First-Order Shortcuts: Hidden Rework Liability
- Chapter 6 · The Optimal Depth of Deliberation: Consequence Trees, Evidence For and Against, and Tail Stress
- Chapter 7 · Classical Sources: the Sunzi on Manoeuvring, the Twenty-Second Chapter of the Laozi, and Bernoulli's Challenge
- Chapter 8 · Closing the Loop: the Holographic Decision Ledger, Field Tools and Checker Specifications