Loading web-font TeX/Math/Italic

The Stacks project

Lemma 55.3.10. Let n, m_ i, a_{ij}, w_ i, g_ i be a numerical type. Let e be the number of pairs (i, j) with i < j and a_{ij} > 0. Then the expression g_{top} = 1 - n + e is \geq 0.

Proof. If not, then e < n - 1 which means there exists an i such that a_{ij} = 0 for all j \not= i. This contradicts assumption (3) of Definition 55.3.1. \square


Comments (0)


Your email address will not be published. Required fields are marked.

In your comment you can use Markdown and LaTeX style mathematics (enclose it like $\pi$). A preview option is available if you wish to see how it works out (just click on the eye in the toolbar).

Unfortunately JavaScript is disabled in your browser, so the comment preview function will not work.

All contributions are licensed under the GNU Free Documentation License.