根多面体射影定理の分類に依存しない証明
A Classification-Free Proof of the Root-Polytope Projection Theorem
研究概要
ルートが張る非零部分空間へルート多面体を射影すると、その像は部分ルート系のルート多面体を2未満の倍率で拡大したものに含まれます。本論文は、平均化と線形評価・二次評価の比較により、この既知の定理を分類に依存せず統一的に証明し、各ルートの射影に対する明示的な評価を与えます。
元の公開問題
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.
数学の検証
主要結論には公開されたカーネル検証済みの証明があり、論文との対応も確認されています。これは外部査読とは別の検証です。
検証基準