Boolean degree one functions on the Grassmann scheme

Ferdinand Ihringer proved that Boolean degree one functions on the Grassmann scheme $J_q(n,k)$ are trivial when $\min (k,n-k)\ge 2$ and $n$ is large enough. We provide a mostly self-contained exposition of this result.