A one-line proof of a minimax theorem (for a notion of curvature on finite graphs)

TL;DR

This paper presents a concise proof of Steinerberger's minimax theorem, which relates to a notion of curvature on finite graphs, simplifying the understanding of this mathematical concept.

Contribution

The paper provides a novel, one-line proof of Steinerberger's minimax theorem, streamlining previous more complex demonstrations.

Findings

Simplified proof of Steinerberger's minimax theorem

Clarification of curvature notions on finite graphs

Potential for easier application in related mathematical fields

Abstract

A one-line proof of a minimax theorem due to Steinerberger is given.