[permalink] [id link]
Sperner's lemma, from 1928, states that every Sperner coloring of a triangulation of an n-dimensional simplex contains a cell colored with a complete set of colors.
from
Wikipedia
Some Related Sentences
Sperner's and lemma
* Sperner's lemma
** Sperner's lemma
In mathematics, Sperner's lemma is a combinatorial analog of the Brouwer fixed point theorem, which follows from it.
Sperner's lemma states that every Sperner coloring ( described below ) of a triangulation of an n-dimensional simplex contains a cell colored with a complete set of colors.
* Sperner's lemma
It is sometimes called Sperner's lemma, but that name also refers to another result on coloring.
By contrast, the Brouwer fixed-point theorem is a non-constructive result: it says that any continuous function from the closed unit ball in n-dimensional Euclidean space to itself must have a fixed point, but it doesn't describe how to find the fixed point ( See also Sperner's lemma ).
Sperner's and from
* Sperner's photos – from the Mathematical Research Institute of Oberwolfach
Sperner's and states
Sperner's theorem ( a special case of Dilworth's theorem ) states that these families are the largest possible Sperner families over an n-set.
A graded partially ordered set is said to have the Sperner property when one of its largest antichains is formed by a set of elements that all have the same rank ; Sperner's theorem states that the poset of all subsets of a finite set, partially ordered by set inclusion, has the Sperner property.
Sperner's and Sperner
To differentiate the two results, the result on the size of a Sperner family is now more commonly known as Sperner's theorem.
Sperner's and set
: You may be looking for Sperner's theorem on set families
The latter question is answered by Sperner's theorem, which gave rise to much of extremal set theory.
Sperner's and .
Sperner's students included Kurt Leichtweiss and Gerhard Ringel.
In one dimension, Sperner's Lemma can be regarded as a discrete version of the Intermediate Value Theorem.
Sperner's Lemma can be used to get as close an approximation as desired to an envy-free solutions for many players.
This inequality has many applications in combinatorics ; in particular, it can be used to prove Sperner's theorem.
using Sperner's theorem.
lemma and from
In the course of the proof, he made use of a lemma that from any countable cover of the interval by smaller open intervals, it was possible to select a finite number of these that also covered it.
Furthermore, if b < sub > 1 </ sub > and b < sub > 2 </ sub > are both coprime with a, then so is their product b < sub > 1 </ sub > b < sub > 2 </ sub > ( modulo a it is a product of invertible elements, and therefore invertible ); this also follows from the first point by Euclid's lemma, which states that if a prime number p divides a product bc, then p divides at least one of the factors b, c.
In general, if R is a ring and S is a simple module over R, then, by Schur's lemma, the endomorphism ring of S is a division ring ; every division ring arises in this fashion from some simple module.
The following lemma, which Gödel adapted from Skolem's proof of the Löwenheim-Skolem theorem, lets us sharply reduce the complexity of the generic formula for which we need to prove the theorem:
In mathematics, a lemma ( plural lemmata or lemmas ) from the Greek λῆμμα ( lemma, “ anything which is received, such as a gift, profit, or a bribe ”) is a proven proposition which is used as a stepping stone to a larger result rather than as a statement of interest by itself.
According to his lemma, a group of four manuscripts including Codex Monacensis 1086 are copies directly from the original.
The morphology functions of the software distributed with the database try to deduce the lemma or root form of a word from the user's input ; only the root form is stored in the database unless it has irregular inflected forms.
Yoneda's lemma concerns functors from a fixed category C to the category of sets, Set.
There is a contravariant version of Yoneda's lemma which concerns contravariant functors from C to Set.
Given an arbitrary contravariant functor G from C to Set, Yoneda's lemma asserts that
An important special case of Yoneda's lemma is when the functor F from C to Set is another hom-functor h < sup > B </ sup >.
Both follow easily from the second Borel – Cantelli lemma.
The natural transformations from a representable functor to an arbitrary functor are completely known and easy to describe ; this is the content of the Yoneda lemma.
This follows from the naturality of the sequence produced by the snake lemma.
It follows immediately from the five lemma.
The essence of the lemma can be summarized as follows: if you have a homomorphism f from an object B to an object B ′, and this homomorphism induces an isomorphism from a subobject A of B to a subobject A ′ of B ′ and also an isomorphism from the factor object B / A to B ′/ A ′', then f itself is an isomorphism.
This follows from Schur's lemma.
The maps δ < sup > n </ sup > are called the " connecting homomorphisms " and can be obtained from the snake lemma.
But the general case follows from the projective case with the aid of Chow's lemma.
Both of these naturalities follow from the naturality of the sequence provided by the snake lemma.
lemma and 1928
His 1920 proof employed the axiom of choice, but he later ( 1922 and 1928 ) gave proofs using König's lemma in place of that axiom.
lemma and states
One lemma states that the difference of the cubes of two rational numbers is equal to the sum of the cubes of two other rational numbers, i. e. given any a and b, with a > b, there exist c and d, all positive and rational, such that
In the theory of formal languages in computability theory, a pumping lemma or pumping argument states that, for a particular language to be a member of a language class, any sufficiently long string in the language contains a section, or sections, that can be removed, or repeated any number of times, with the resulting string remaining in that language.
In this case, the covariant version of Yoneda's lemma states that
The lemma states that, under certain conditions, an event will occur with probability zero or with probability one.
The Borel – Cantelli lemma states:
In topology, Urysohn's lemma is a lemma that states that a topological space is normal if and only if any two disjoint closed subsets can be separated by a function.
Urysohn's lemma states that a topological space is normal if and only if any two disjoint closed sets can be separated by a continuous function.
Zorn's lemma, also known as the Kuratowski – Zorn lemma, is a proposition of set theory that states:
We can prove the cancellation law easily using Euclid's lemma, which generally states that if an integer b divides a product rs ( where r and s are integers ), and b is relatively prime to r, then b must divide s. Indeed, the equation
The five lemma states that, if the rows are exact, m and p are isomorphisms, l is an epimorphism, and q is a monomorphism, then n is also an isomorphism.
In mathematics, and more specifically in homological algebra, the splitting lemma states that in any abelian category, the following statements for short exact sequence are equivalent.
The form of König's lemma most convenient for this purpose is the one which states that any infinite finitely branching subtree of < math >
In the mathematical theory of queues, Little's result, theorem, lemma, law or formula is a theorem by John Little which states:
In its simplest form, Itō's lemma states the following: for an Itō drift-diffusion process
In higher dimensions, Ito's lemma states
Zorn's lemma states that every partially ordered set for which every totally ordered subset has an upper bound contains at least one maximal element.
The ultrafilter lemma states that every filter on a set is contained within some maximal ( proper ) filter — an ultrafilter.
Conversely, a complete variety is close to being a projective variety: Chow's lemma states that if X is a complete variety, there is a projective variety Z and a birational morphism Z → X.
The diagonal lemma states that there is a sentence φ such that φ ↔ ψ (< u >#( φ )</ u >) is provable in T.
In mathematics, Dickson's lemma states that every set of-tuples of natural numbers has finitely many minimal elements.
* The Morse lemma states that non-degenerate critical points of certain functions are isolated.
0.414 seconds.