Просмотр кода страницы Sperner's Lemma

'''Sperner's Lemma''' --- Лемма Шпернера. 

''' Lemma.''' Let <math>T</math> be a triangulation of <math>\Delta_{n}</math> and let <math>\chi</math>
be a coloring of the points of <math>T</math> by <math>n+1</math> colors, which satisfies
the following conditions:

1. Each vertex of <math>\Delta_{n}</math> is colored by a different color.

2. The points of <math>T</math> on a face <math>\tau</math> of <math>\Delta_{n}</math> are colored
by the vertices of <math>\tau</math>.

Then there exists a simplex in the triangulation, whose vertices
receive all <math>n+1</math> colors.