dbo:abstract
|
- 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.
* Abel's lemma (mathematical series)
* Abhyankar's lemma (algebraic geometry)
* Archimedes's lemmas (euclidean geometry)
* Artin–Rees lemma (commutative algebra)
* Aubin–Lions lemma
* Barbalat's lemma (dynamical systems)
* Berge's lemma (graph theory)
* Bézout's lemma (number theory)
* Bhaskara's lemma (Diophantine equations)
* Borel's lemma (partial differential equations)
* Borel–Cantelli lemma (probability theory)
* Bramble–Hilbert lemma (numerical analysis)
* Burnside's lemma also known as the Cauchy–Frobenius lemma (group theory)
* Céa's lemma (numerical analysis)
* Closed map lemma (topology)
* Cotlar–Stein lemma (functional analysis)
* Cousin's lemma (integrals)
* Covering lemma (set theory)
* Craig interpolation lemma (mathematical logic)
* Crossing lemma (knot theory, graph theory)
* Danielson–Lanczos lemma (Fourier transforms)
* Dehn's lemma (geometric topology)
* Delta lemma (set theory)
* Diagonal lemma (mathematical logic)
* Dickson's lemma (combinatorics)
* Doob–Dynkin lemma (probability theory)
* Dwork's lemma (number theory)
* Dynkin lemma (set theory)
* Ehrling's lemma (functional analysis)
* Ellis–Numakura lemma (topological semigroups)
* Estimation lemma (contour integrals)
* Euclid's lemma (number theory)
* Expander mixing lemma (graph theory)
* Factorization lemma (measure theory)
* Farkas's lemma (linear programming)
* Fatou's lemma (measure theory)
* Fekete's lemma (mathematical analysis)
* Feld–Tai lemma (electromagnetism)
* Finsler's lemma (control theory)
* Fitting lemma (abstract algebra)
* Five lemma (homological algebra)
* Fixed-point lemma for normal functions (axiomatic set theory)
* Fodor's lemma (set theory)
* Forking lemma (cryptography)
* Frattini's lemma (finite groups)
* Frostman's lemma (geometric measure theory)
* Fundamental lemma (Langlands program)
* Fundamental lemma of calculus of variations
* Fundamental lemma of sieve theory (sieve theory)
* Gauss's lemmas (polynomials | number theory | Riemannian geometry)
* Glivenko–Cantelli lemma (statistics)
* Gödel's diagonal lemma (mathematical logic)
* Goursat's lemma (algebra)
* Grönwall's inequality Grönwall's lemma (inequalities)
* Handshaking lemma (graph theory)
* Hartogs's lemma (several complex variables)
* Hensel's lemma (commutative rings)
* Higman's lemma (order theory)
* Hopf lemma
* Horseshoe lemma (homological algebra)
* Hotelling's lemma (microeconomics)
* Hua's lemma (analytic number theory)
* Injective test lemma (homological algebra)
* Itô's lemma (stochastic calculus)
* Johnson–Lindenstrauss lemma (Euclidean geometry)
* Jónsson's lemma
* Jordan's lemma (complex analysis)
* Kac's lemma (ergodic theory)
* Kalman–Yakubovich–Popov lemma (system analysis, control theory)
* Kelly's lemma (graph theory)
* Knaster–Kuratowski–Mazurkiewicz lemma (fixed-point theory)
* Kőnig's lemma (graph theory)
* Kronecker's lemma (infinite sums)
* Krull's separation lemma
* Lax–Milgram lemma (differential equations)
* Lebesgue's number lemma (dimension theory)
* Leftover hash lemma (cryptography)
* Lindelöf's lemma (topology)
* Lindenbaum's lemma (mathematical logic)
* Little's lemma (queuing theory)
* Littlewood–Offord lemma (combinatorics)
* Lovász local lemma (probability theory)
* Malliavin's absolute continuity lemma (measure theory)
* Margulis lemma (hyperbolic geometry)
* Matrix determinant lemma (matrix theory)
* Matrix inversion lemma
* Mautner's lemma (representation theory)
* Morse lemma (differential topology)
* Moschovakis coding lemma (set theory)
* Mostowski collapse lemma (mathematical logic)
* Nakayama lemma (commutative algebra)
* Newman's lemma (term rewriting)
* Neyman–Pearson lemma (statistics)
* Nine lemma (homological algebra)
* Noether's normalization lemma (commutative algebra)
* Ogden's lemma (formal languages)
* Ping-pong lemma (geometric group theory)
* Piling-up lemma (linear cryptanalysis)
* Poincaré lemma of closed and exact differential forms (differential forms)
* Pólya–Burnside lemma
* Prime avoidance lemma
* Pugh's closing lemma
* Pumping lemma (formal languages) sometimes called the Bar-Hillel lemma
* Rasiowa–Sikorski lemma (set theory)
* Riemann–Lebesgue lemma (harmonic analysis)
* Riesz's lemma (functional analysis)
* Robbins lemma (statistics)
* Sard's lemma (mathematical analysis, singularity theory)
* Schanuel's lemma (projective modules)
* Schreier's subgroup lemma (group theory)
* Schur's lemma (representation theory)
* Schwarz lemma (complex analysis)
* Schwartz–Zippel lemma (polynomials)
* Shadowing lemma (geometry)
* Shephard's lemma (microeconomics)
* Short five lemma (homological algebra)
* Siegel's lemma (Diophantine approximation)
* Snake lemma (homological algebra)
* Sperner's lemma (combinatorics)
* Splitting lemma (homological algebra)
* Stechkin's lemma (functional and numerical analysis)
* Stein's lemma (probability theory)
* Stewart–Walker lemma (tensors)
* Switching lemma (computational complexity theory)
* Szemerédi regularity lemma (graph theory)
* Tube lemma (topology)
* Tukey's lemma (metamathematics) also known as the Teichmüller–Tukey lemma
* Ultrafilter lemma (order theory)
* Urysohn's lemma (general topology)
* Vaughan's lemma (analytic number theory)
* Vitali covering lemma (real analysis)
* Wald's lemma (probability theory)
* Watson's lemma
* Weyl's lemma (Laplace equation) (partial differential equations)
* Whitehead's lemma (Lie algebras)
* Yao's XOR lemma (cryptography)
* Yoneda lemma, (category theory)
* Zassenhaus lemma (group theory)
* Zolotarev's lemma (number theory)
* Zorn's lemma also known as the Kuratowski–Zorn lemma (set theory) (en)
- Cet article est une liste de lemmes. En mathématiques, un lemme est un énoncé prouvé, mais jugé moins important que ce qu'on appelle un théorème, qu'il sert généralement à établir au cours d'une démonstration. Cette terminologie reste cependant subjective et relative à l'histoire d'une discipline. Pour l'établissement de l'ordre alphabétique, il a été convenu ce qui suit :
* si le nom des lemmes comprend des noms de scientifiques, on se base sur le premier nom propre cité ;
* si le nom du lemme ne comprend pas de nom de scientifiques, on se base sur le premier nom commun apparaissant en dehors du mot « lemme ». (fr)
|
dbo:wikiPageID
| |
dbo:wikiPageLength
|
- 8207 (xsd:nonNegativeInteger)
|
dbo:wikiPageRevisionID
| |
dbo:wikiPageWikiLink
| |
dbp:wikiPageUsesTemplate
| |
dcterms:subject
| |
gold:hypernym
| |
rdfs:comment
|
- 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. (en)
- Cet article est une liste de lemmes. En mathématiques, un lemme est un énoncé prouvé, mais jugé moins important que ce qu'on appelle un théorème, qu'il sert généralement à établir au cours d'une démonstration. Cette terminologie reste cependant subjective et relative à l'histoire d'une discipline. Pour l'établissement de l'ordre alphabétique, il a été convenu ce qui suit : (fr)
|
rdfs:label
|
- Liste de lemmes (fr)
- List of lemmas (en)
|
owl:sameAs
| |
prov:wasDerivedFrom
| |
foaf:isPrimaryTopicOf
| |
is dbo:wikiPageRedirects
of | |
is dbo:wikiPageWikiLink
of | |
is foaf:primaryTopic
of | |