Lemma (mathematics)

Last updated

In mathematics, informal logic and argument mapping, a lemma (pl.: lemmas or lemmata) is a generally minor, proven proposition which is used as a stepping stone to a larger result. For that reason, it is also known as a "helping theorem" or an "auxiliary theorem". [1] [2] In many cases, a lemma derives its importance from the theorem it aims to prove; however, a lemma can also turn out to be more important than originally thought. [3]

Contents

It is also used generally in scholarship and philosophy. [4] [5]

Etymology

From the Ancient Greek λῆμμα, (perfect passive εἴλημμαι) something received or taken. Thus something taken for granted in an argument. [6]

Comparison with theorem

There is no formal distinction between a lemma and a theorem, only one of intention (see Theorem terminology). However, a lemma can be considered a minor result whose sole purpose is to help prove a more substantial theorem – a step in the direction of proof. [3]

Well-known lemmas

Some powerful results in mathematics are known as lemmas, first named for their originally minor purpose. These include, among others:

While these results originally seemed too simple or too technical to warrant independent interest, they have eventually turned out to be central to the theories in which they occur.

See also

Related Research Articles

<span class="mw-page-title-main">Conjecture</span> Proposition in mathematics that is unproven

In mathematics, a conjecture is a conclusion or a proposition that is proffered on a tentative basis without proof. Some conjectures, such as the Riemann hypothesis or Fermat's Last Theorem, have shaped much of mathematical history as new areas of mathematics are developed in order to prove them.

<span class="mw-page-title-main">Fundamental theorem of arithmetic</span> Integers have unique prime factorizations

In mathematics, the fundamental theorem of arithmetic, also called the unique factorization theorem and prime factorization theorem, states that every integer greater than 1 can be represented uniquely as a product of prime numbers, up to the order of the factors. For example,

Q.E.D. or QED is an initialism of the Latin phrase quod erat demonstrandum, meaning "which was to be demonstrated". Literally it states "what was to be shown". Traditionally, the abbreviation is placed at the end of mathematical proofs and philosophical arguments in print publications, to indicate that the proof or the argument is complete.

<span class="mw-page-title-main">Theorem</span> In mathematics, a statement that has been proved

In mathematics, a theorem is a statement that has been proved, or can be proved. The proof of a theorem is a logical argument that uses the inference rules of a deductive system to establish that the theorem is a logical consequence of the axioms and previously proved theorems.

Jargon is the specialized terminology associated with a particular field or area of activity. Jargon is normally employed in a particular communicative context and may not be well understood outside that context. The context is usually a particular occupation, but any ingroup can have jargon. The key characteristic that distinguishes jargon from the rest of a language is its specialized vocabulary, which includes terms and definitions of words that are unique to the context. This can lead outgroups to misunderstand communication attempts. Jargon is sometimes understood as a form of technical slang and then distinguished from the official terminology used in a particular field of activity.

<span class="mw-page-title-main">Mathematical proof</span> Reasoning for mathematical statements

A mathematical proof is a deductive argument for a mathematical statement, showing that the stated assumptions logically guarantee the conclusion. The argument may use other previously established statements, such as theorems; but every proof can, in principle, be constructed using only certain basic or original assumptions known as axioms, along with the accepted rules of inference. Proofs are examples of exhaustive deductive reasoning which establish logical certainty, to be distinguished from empirical arguments or non-exhaustive inductive reasoning which establish "reasonable expectation". Presenting many cases in which the statement holds is not enough for a proof, which must demonstrate that the statement is true in all possible cases. A proposition that has not been proved but is believed to be true is known as a conjecture, or a hypothesis if frequently used as an assumption for further mathematical work.

In mathematics, Tychonoff's theorem states that the product of any collection of compact topological spaces is compact with respect to the product topology. The theorem is named after Andrey Nikolayevich Tikhonov, who proved it first in 1930 for powers of the closed unit interval and in 1935 stated the full theorem along with the remark that its proof was the same as for the special case. The earliest known published proof is contained in a 1935 article of Tychonoff, A., "Uber einen Funktionenraum", Mathematical Annals, 111, pp. 762–766 (1935).

In mathematics, and more specifically in algebraic topology and polyhedral combinatorics, the Euler characteristic is a topological invariant, a number that describes a topological space's shape or structure regardless of the way it is bent. It is commonly denoted by .

International scientific vocabulary (ISV) comprises scientific and specialized words whose language of origin may or may not be certain, but which are in current use in several modern languages.

In mathematics and logic, a corollary is a theorem of less importance which can be readily deduced from a previous, more notable statement. A corollary could, for instance, be a proposition which is incidentally proved while proving another proposition; it might also be used more casually to refer to something which naturally or incidentally accompanies something else.

<i>Theorema Egregium</i> Differential geometry theorem

Gauss's Theorema Egregium is a major result of differential geometry, proved by Carl Friedrich Gauss in 1827, that concerns the curvature of surfaces. The theorem says that Gaussian curvature can be determined entirely by measuring angles, distances and their rates on a surface, without reference to the particular manner in which the surface is embedded in the ambient 3-dimensional Euclidean space. In other words, the Gaussian curvature of a surface does not change if one bends the surface without stretching it. Thus the Gaussian curvature is an intrinsic invariant of a surface.

Tarski's undefinability theorem, stated and proved by Alfred Tarski in 1933, is an important limitative result in mathematical logic, the foundations of mathematics, and in formal semantics. Informally, the theorem states that "arithmetical truth cannot be defined in arithmetic".

Rigour or rigor describes a condition of stiffness or strictness. These constraints may be environmentally imposed, such as "the rigours of famine"; logically imposed, such as mathematical proofs which must maintain consistent answers; or socially imposed, such as the process of defining ethics and law.

<i>Disquisitiones Arithmeticae</i> Book written by Carl Friedrich Gauss

Disquisitiones Arithmeticae is a textbook on number theory written in Latin by Carl Friedrich Gauss in 1798, when Gauss was 21, and published in 1801, when he was 24. It had a revolutionary impact on number theory by making the field truly rigorous and systematic and paved the path for modern number theory. In this book, Gauss brought together and reconciled results in number theory obtained by such eminent mathematicians as Fermat, Euler, Lagrange, and Legendre, while adding profound and original results of his own.

In algebra and number theory, Euclid's lemma is a lemma that captures a fundamental property of prime numbers, namely:

<span class="mw-page-title-main">Handshaking lemma</span> Every graph has evenly many odd vertices

In graph theory, a branch of mathematics, the handshaking lemma is the statement that, in every finite undirected graph, the number of vertices that touch an odd number of edges is even. For example, if there is a party of people who shake hands, the number of people who shake an odd number of other people's hands is even. The handshaking lemma is a consequence of the degree sum formula, also sometimes called the handshaking lemma, according to which the sum of the degrees equals twice the number of edges in the graph. Both results were proven by Leonhard Euler (1736) in his famous paper on the Seven Bridges of Königsberg that began the study of graph theory.

<span class="mw-page-title-main">Treatise</span> Formal and systematic written discourse on some subject

A treatise is a formal and systematic written discourse on some subject concerned with investigating or exposing the principles of the subject and its conclusions. A monograph is a treatise on a specialized topic.

<span class="mw-page-title-main">Legendre's three-square theorem</span> Says when a natural number can be represented as the sum of three squares of integers


In mathematics, Legendre's three-square theorem states that a natural number can be represented as the sum of three squares of integers

In mathematics, the closed-subgroup theorem is a theorem in the theory of Lie groups. It states that if H is a closed subgroup of a Lie group G, then H is an embedded Lie group with the smooth structure agreeing with the embedding. One of several results known as Cartan's theorem, it was first published in 1930 by Élie Cartan, who was inspired by John von Neumann's 1929 proof of a special case for groups of linear transformations.

References

  1. Higham, Nicholas J. (1998). Handbook of Writing for the Mathematical Sciences. Society for Industrial and Applied Mathematics. pp.  16. ISBN   0-89871-420-6.
  2. "Definition of lemma | Dictionary.com". www.dictionary.com. Retrieved 2019-11-28.
  3. 1 2 Richeson, Dave (2008-09-23). "What is the difference between a theorem, a lemma, and a corollary?". David Richeson: Division by Zero. Retrieved 2019-11-28.
  4. "Lemma." Merriam-Webster.com Dictionary, Merriam-Webster.
  5. Loewen, Nathan R. B. Beyond the Problem of Evil. Lexington Books. March 12, 2018. ISBN   9781498555739 p. 47
  6. "Oxford English Dictionary". www.oed.com. Oxford University Press. Retrieved 26 April 2023.

This article incorporates material from Lemma on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License.