关于「最速降线:直线为什么输给摆线」,《非最短路径与推演深度》给出的定量结论是什么?

结论:重力场里,最快的路线是摆线,而不是直线。程序 p11 在边长相等时算出摆线用时是直线的 0.9128,水平距离越长优势越大。程序 p12 显示「先降再走」有最佳深度,降过头反而比直线慢。程序 p13 标出两条边界:目标在正下方时优势消失,摩擦越过 0.793 时摆线停在半路。商业类比只借结构,不借数字,每次使用都要核对势能能否转换、速度能否保持、目标是否够远。

数据口径:书中参数为示意,全部计算由书中程序生成。 本书不是投资意见,也不是任何具体经营决策意见,不承诺任何收益。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.793, 0.9128

A. Frictionless: shape L/H against the cycloid/line time ratio
L/Htheta_enddips_below_Bt_cyc/t_line
0.250.7364no0.9924
0.501.4014no0.9720
1.002.4120no0.9128
1.503.0688no0.8517
2.003.5084yes0.7979
3.004.0516yes0.7132
5.004.5946yes0.6027
B. Friction mu on the L=H=1 case (cycloid shape kept)
mut_linet_cycloidratio
0.000.63860.58290.9128
0.200.71390.64110.8980
0.400.82440.71720.8700
0.601.00960.83070.8227
0.701.16580.92410.7927
0.801.4278stuckn/a
0.902.0193stuckn/a
cycloid shape stops beating the line near mu = 0.793
查看完整验算程序
# 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))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《非最短路径最优解、二阶连锁效应全息推演与周密思考复利母典》第 1 章「最速降线:直线为什么输给摆线」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 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}
}

本书其他章节结论