(lexicography, rare) Any form of a lexeme that is not its lemma.

(mathematics) A combinatorial analog of the Brouwer fixed-point theorem, stating that every Sperner coloring of a triangulation of an n-dimensional simplex contains a cell colored with a complete set of colors.

(number theory) The proposition that if a prime number p divides an arbitrary product ab of integers, then p divides a or b or both;

Synonym of Teichmüller-Tukey lemma

Synonym of Bézout's identity

(statistics) A lemma stating that when performing a hypothesis test between two point hypotheses H₀: θ = θ₀ and H₁: θ = θ₁, then the likelihood-ratio test which rejects H₀ in favour of H₁ when 𝛬(x)=(L(𝜃₀∣x))/(L(𝜃₁∣x))≤𝜂 where P(𝛬(X)≤𝜂∣H_0)=𝛼 is the most powerful test of size α for a threshold η.

(mathematics) A lemma, of importance in harmonic analysis and asymptotic analysis, stating that the Fourier transform or Laplace transform of an L1 function vanishes at infinity.

(mathematics) A lemma stating that every non-empty collection of finite character has a maximal element with respect to inclusion.