technical lemma
Смотреть что такое "technical lemma" в других словарях:
Forking lemma — The forking lemma is any of a number of related lemmas in cryptography research. The lemma states that if an adversary (typically a probabilistic Turing machine), on inputs drawn from some distribution, produces an output that has some property… … Wikipedia
Johnson–Lindenstrauss lemma — In mathematics, the Johnson–Lindenstrauss lemma is a result concerning low distortion embeddings of points from high dimensional into low dimensional Euclidean space. The lemma states that a small set of points in a high dimensional space can be… … Wikipedia
Gauss's lemma (polynomial) — This article is about Gauss s lemma for polynomials. See also Gauss s lemma. In algebra, in the theory of polynomials, Gauss s lemma, named after Carl Friedrich Gauss, is either of two related statements about polynomials with integral… … Wikipedia
Rasiowa-Sikorski lemma — In axiomatic set theory, the Rasiowa Sikorski lemma is one of the most fundamental facts used in the technique of forcing. In the area of forcing, a subset D of a forcing notion ( P , ≤) is called dense in P if for any p ∈ P there is d ∈ D with d … Wikipedia
Zassenhaus lemma — In mathematics, the butterfly lemma or Zassenhaus lemma, named after Hans Julius Zassenhaus, is a technical result on the lattice of subgroups of a group. Lemma: Suppose (G, Omega) is a group with operators and A and C are subgroups. Suppose:B… … Wikipedia
Slepian's lemma — In probability theory, Slepian s lemma (1962), named after David Slepian, states that for any two finite state Gaussian stochastic processes :X, Y with non singular covariance matrices :A, Bsatisfying :a {ii}=b {ii},,a {ij}>b {ij}, the… … Wikipedia
Whitehead's lemma — is a technical result in abstract algebra, used in algebraic K theory, It states that a matrix of the form : egin{bmatrix}u 0 0 u^{ 1} end{bmatrix} is equivalent to identity by elementary transformations (here elementary matrices means… … Wikipedia
Approximately finite dimensional C*-algebra — In C* algebras, an approximately finite dimensional, or AF, C* algebra is one that is the inductive limit of a sequence of finite dimensional C* algebras. Approximate finite dimensionality was first defined and described combinatorially by… … Wikipedia
Cuntz algebra — In C* algebras, the Cuntz algebra (after Joachim Cuntz) is the universal C* algebra generated by n isometries satisfying certain relations. It is the first concrete example of a separable infinite simple C* algebra. Every simple infinite C*… … Wikipedia
Turing's proof — First published in January 1937 with the title On Computable Numbers, With an Application to the Entscheidungsproblem , Turing s proof was the second proof of the assertion (Alonzo Church proof was first) that some questions are undecidable :… … Wikipedia
List of lemmas — This following is a list of lemmas (or, lemmata , i.e. minor theorems, or sometimes intermediate technical results factored out of proofs). See also list of axioms, list of theorems and list of conjectures. 0 to 9 *0/1 Sorting Lemma ( comparison… … Wikipedia
