Findings:

• Neyman-Pearson Lemma
• Using Bayes' theorem and the Neyman-Pearson Lemma to decide
• Fatou's lemma
• Lebesgue number lemma
• Steinitz Exchange Lemma
• Burnside's Lemma
• Preservation Lemma
• Progress Lemma
• Canonical Forms Lemma
• Euclid's lemma
• Sperner's Lemma
• Schur's Lemma
• Lemma of Choice
• diagram lemma
• rising sun lemma
• the fundamental lemma of variational calculus
• Vitali's covering lemma
• Caratheodory's lemma
• The basic lemma
• Leapfrog Lemma
• Gauss's Lemma
• pumping lemma
• pumping lemma proof that the balanced braces language is not regular
• pumping lemma proof that the "a^n b^n" language is not regular
• Zorn's lemma
• Schwarz lemma
• Proof of the Schwarz lemma
• five lemma
• Kronecker's lemma
• NSA: Robinson's "overspill" lemma
• Jordan's Lemma
• Urysohn lemma
• Ito's Lemma
• Weyl's lemma
• short five lemma
• Lemma

If you Log in you could create a "Nayman-Pearson lemma" node. If you don't already have an account, you can register here.