Lasserre Hierarchy: SOS Relaxations, Root System A_n, and Lattice Symmetry — E8 Intelligence Research

FINDING: Lasserre hierarchy (sum-of-squares SDP) provides a convergent sequence of semidefinite relaxations for polynomial optimization, with strong links to root system A_n and lattice symmetry. MATH: - Lasserre hierarchy: For polynomial optimization \( minx ∈ K p(x) \), the \( r \)-th relaxation solves an SDP of size \( O(n²ʳ) \) using moment matrices \( M_r(y) 0 \) and localizing matrices. - Sum-of-squares (SOS) representation: A polynomial \( f(x) \) is SOS if \( f(x) = ∑_i q_i(x)^2 \). The hierarchy uses SOS certificates of nonnegativity. - Root system \( A_n \): The lattice \( A_n = \{ x ∈ Zⁿ⁺¹ : ∑_i x_i = 0 \} \) with simple roots \( e_i - eᵢ₊₁ \). The symmetry group is the Weyl group \( Sₙ₊₁ \). - Lattice \( D_n \): \( D_n = \{ x ∈ Z^n : ∑_i x_i ≡ 0 {2} \} \), with root system of type \( D_n \). CONNECTION: - The moment matrix \( M_r(y) \) in Lasserre hierarchy has a block-diagonal structure that c Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com