The Kalai flag conjecture asserts that a centrally symmetric 
-dimensional
convex polytope 
has at least 
flags, with equality precisely
for Hanner polytopes. A flag
is a maximal chain of nonempty faces, containing one face of each dimension from 0
through 
.
Write 
for the flag count.
Winter (2026) proved that every full-dimensional convex polytope symmetric about the origin satisfies
 |
where 
is its polar body. Consequently, the symmetric Mahler
volume product conjecture implies the predicted lower bound on 
. This implication does not settle the flag conjecture's
equality classification.
