Skip to content

[理论/模函数] critical torus rank-law 极值:hexagonal modulus 是否全局最小化 c*(tau) 与 source-zero 距离 #781

Description

@LightChainr

目标

Draft #773 已把 Q=1 critical torus aggregate rank law 从 Arguin/Pinson homology sums 写成

P0(tau)=P2(tau),
c_*(tau)=P1/(2P0),
Z_tau(s)=P1+2P0 cosh s.

矩形 tori 已发现 universal source-zero collision aspect r*=1.787829352679657...。继续在标准 modular fundamental domain 做独立数值扫后,当前最强候选是:

c_*(tau) 在 hexagonal/equianharmonic modulus tau_hex=exp(i*pi/3) 取得全局最小。

高精度候选值:

P0=P2 = 0.316053412701401686065271069685098217779...
P1    = 0.367893174597196627869457860629803564442...
c_min = 0.582011077578161892499173198398907452715...
theta_min/pi = 0.697733976613595963671671899150823610675...

square tau=ic=0.615371746084117...;向 cusp 走时 c->infinity。粗 fundamental-domain grid 也把 minimum 放在 hexagonal elliptic point,但这不是证明。

若猜想成立,直接得到

  1. 对所有 critical percolation torus moduli:
P1(tau) >= P1(tau_hex) > 1/3,
P0=P2 <= P0(tau_hex) < 1/3.

所以 aggregate rank law 永远达不到 uniform (1/3,1/3,1/3)

  1. bounded topological source 的临界 continuum zero-free strip 可从一般 |Im s|<pi/2 强化为
|Im s| < theta_min
          = pi * 0.6977339766...

因为最近 source zero 的 imaginary distance在 c<1 时为 acos(-c),c>=1 时为 pi。

  1. tau_hextau=i 都是 modular elliptic fixed points,因此一阶 modulus derivative 必须消失;二阶 Hessian 的符号可区分 global min/saddle,并作为 [P2 theory/analysis] Map-resolved torus tomography: fit modular-covariance solution spaces, not isolated shape rays #585 的强 modular regression。

Phase A — independent numerical certificate

  • 独立实现 Arguin Q=1 homology sums,不复用 analysis: integrate topological scaling program and solvable rank-source sector #773 脚本;
  • 扫 standard fundamental domain |Re tau|<=1/2, |tau|>=1,包含 cusp tail bound;
  • 用 interval/high-precision arithmetic enclosure c(tau_hex)
  • 给出 hex 与 square 的 local Hessian in (tau_R,tau_I),处理 modular fixed-point coordinates;
  • 若发现更低点,直接给 counterexample,停止 theorem 路线。

Phase B — theorem / literature route

目标是证明或明确最小缺口:

c_*(tau) >= c_*(exp(i*pi/3)).

优先检查:

  • Montgomery / Rankin / theta-function lattice extremum theorems;
  • modular-invariant Gaussian lattice sums在 hex lattice 上的 extremality;
  • Arguin/Pinson homology sum能否 Möbius/primitive 分解成已知完全单调 theta combinations;
  • 若 gcd-dependent signs 阻止直接套 theorem,写出最小 unresolved inequality。

不要因为“hex lattice通常最优”就默认结论。

Phase C — generic Q extension(可选)

若 Q=1 证明路径成立,检查 source-centered generic-Q even shape c_Q(tau) 的 minimum 是否仍在 hex modulus;Q=4 endpoint 单独处理,不用对 Q>4 做实参数延拓。

交付

notes/critical-rank-modular-extremum-YYYYMMDD.md
results/.../modular-extremum.json

最终 verdict:PROVED / NUMERICALLY_CERTIFIED_ONLY / COUNTEREXAMPLE / BLOCKED_ON_SIGNED_THETA_INEQUALITY

不做

  • 不把 source-zero double point称作 Jordan;
  • 不新增 Monte Carlo;
  • 不从该极值识别 continuum field;
  • 不修改 original-U contract。

相关:draft #773, #585, #636, #776

Activity

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

No one assigned

    Labels

    priority:P2Deferred research or on-demand support; no default new compute allocation.

    Projects

    No projects

      Milestone

      No milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions