Multidimensional Case
In the general case the lemma refers to a n-dimensional simplex
We consider a triangulation T which is a disjoint division of into smaller n-dimensional simplices. Denote the coloring function as f : S → {1,2,3,...,n,n+1}, where S is again the set of vertices of T. The rules of coloring are:
- The vertices of the large simplex are colored with different colors, i. e. f(Ai) = i for 1 ≤ i ≤ n+1.
- Vertices of T located on any k-dimensional subface
- are colored only with the colors
Then there exists an odd number of simplices from T, whose vertices are colored with all n+1 colors. In particular, there must be at least one.
Read more about this topic: Sperner's Lemma
Famous quotes containing the word case:
“... business training in early life should not be regarded solely as insurance against destitution in the case of an emergency. For from business experience women can gain, too, knowledge of the world and of human beings, which should be of immeasurable value to their marriage careers. Self-discipline, co-operation, adaptability, efficiency, economic management,—if she learns these in her business life she is liable for many less heartbreaks and disappointments in her married life.”
—Hortense Odlum (1892–?)