根多胞体投影定理的无分类证明
A Classification-Free Proof of the Root-Polytope Projection Theorem
研究概述
将根多胞体投影到由根张成的非零子空间时,所得图形包含在子根系根多胞体的一个严格小于两倍的膨胀中。本文用平均法以及线性界与二次界的比较,为这个已知定理给出统一的免分类证明,并获得每个根的投影估计。
原始公开问题
OPAC-018:Hopkins 的根多胞体投影问题
Sam Hopkins: Root polytope projections — OPAC-018 (13 October 2019): a uniform, classification-free proof of the known strict factor-two projection bound.
原文摘要(英文)
Let Φ be a finite reduced crystallographic root system, let P_Φ = conv(Φ) be its root polytope, and let U be a nonzero subspace spanned by roots. Hopkins and Postnikov proved that the orthogonal projection of P_Φ onto U lies in κP_(Φ∩U) for some κ < 2. The published proofs conclude with a case check from the classification of finite root systems. Writing γ_P for the Minkowski functional of P, which measures the least dilation needed to contain a vector, we give a direct proof and the rootwise estimate γ_(P_(Φ∩U))(proj_U α) ≤ 2‖proj_U α‖²/‖α‖² < 2 for α ∈ Φ outside U. After a Weyl-group symmetry moves the projected root into an antidominant chamber, its negative is a nonnegative combination of the vectors dual to the simple roots. After division by half the squared length of the original root, the coefficients are integers. A parabolic orbit average gives a linear upper bound for the gauge, while inverse positivity for an obtuse Gram matrix gives a quadratic lower bound for the norm. Integrality joins the two estimates, and strict contraction under orthogonal projection gives the factor below two. Taking the maximum over the finite root system proves the polytope containment and answers the request for a uniform proof. A complete Lean 4 formalization is publicly available.
数学审核
主要结论拥有公开的内核检查证明包,并已审核其与论文的对应关系。这与外部同行评审是不同的验证。
审核标准