The key to the Hard Lefschetz Theorem for combinatorial intersection cohomology of polytopes is to prove the Hodge-Riemann bilinear relations. In these notes, we strive to present an easily accessible proof. The strategy essentially follows the original approach of [Ka], applying inductionà la [BreLu 2 ], but our guiding principle here is to emphasize the geometry behind the algebraic arguments by consequently stressing polytopes rather than fans endowed with a strictly convex conewise linear function. It is our belief that this approach makes the exposition more transparent since polytopes are more appealing to our geometric intuition than convex functions on a fan.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.