Crab Research
Geometry

A Classification-Free Proof of the Root-Polytope Projection Theorem

Li, Alex Chengyu

Working Paper · ZenodoFirst public

Overview

A uniform, classification-free proof of the known strict factor-two root-polytope projection theorem, with a rootwise bound.

Original abstract (English)

Let Phi be a finite reduced crystallographic root system, let its root polytope be the convex hull of Phi, and let U be a nonzero subspace spanned by roots. Hopkins and Postnikov proved that the orthogonal projection of the root polytope onto U lies in kappa times the root polytope of Phi intersect U for some kappa below two; the published proofs conclude with a classification check.

This paper gives a direct proof and an explicit rootwise estimate. A subsystem Weyl symmetry moves each projected root into an antidominant chamber. Parabolic orbit averaging gives a linear gauge bound, inverse positivity for an obtuse Gram matrix gives a quadratic norm bound, and crystallographic integrality joins them. Strict contraction under orthogonal projection yields the factor below two. Taking the maximum over the finite root system proves the full polytope containment. A complete Lean 4 formalization is provided.

Public abstract source

MathematicsGeometrycrystallographic root systemsroot polytopesorthogonal projectionWeyl groupsconvex geometryclassification-free proofformalized mathematicsLean 4

Mathematical review

Kernel-Only

The principal conclusions have a public kernel-checked proof package and reviewed correspondence with the paper. This is distinct from external peer review.

Review standard
Back to Mathematics