A Correction on a Proof of a Combinatorial Property of the Set of Minimal Vectors in Root Lattices $\mathbb{A}_n$

TL;DR

This paper identifies and corrects errors in a proof concerning the combinatorial properties of minimal vectors in root lattices, which are crucial for classifying perfect lattices in Euclidean space.

Contribution

It provides a corrected proof of a key combinatorial property of minimal vectors in root lattices $ ext{A}_n$, clarifying foundational aspects for lattice classification.

Findings

Corrected proof of the combinatorial property

Clarification of the role of minimal vectors in lattice classification

Enhanced understanding of root lattice structures

Abstract

In this papar, we point out some mistakes in a proof of an important combinatorial property of $S(\mathbb{A}_n)$, the set of all minimal vectors of lattice $\mathbb{A}_n$, and correct them in the last section. This property plays an essential role in classifying perfect lattices in euclidean space.