|
Lemma (logic)
In mathematics, informal logic and argument mapping, a lemma (plural 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". 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. The word "lemma" derives from the Ancient Greek ("anything which is received", such as a gift, profit, or a bribe). 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. Well-known lemmas A good stepping stone can lead to many others. Some powerful results in mathematics are known as lemmas, first named for their originally min ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting points of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Jordan's Lemma
In complex analysis, Jordan's lemma is a result frequently used in conjunction with the residue theorem to evaluate contour integrals and improper integrals. The lemma is named after the French mathematician Camille Jordan. Statement Consider a complex-valued, continuous function , defined on a semicircular contour :C_R = \ of positive radius lying in the upper half-plane, centered at the origin. If the function is of the form :f(z) = e^ g(z) , \quad z \in C , with a positive parameter , then Jordan's lemma states the following upper bound for the contour integral: :\left, \int_ f(z) \, dz \ \le \frac M_R \quad \text \quad M_R := \max_ \left, g \left(R e^\right) \ . with equality when vanishes everywhere, in which case both sides are identically zero. An analogous statement for a semicircular contour in the lower half-plane holds when . Remarks * If is continuous on the semicircular contour for all large and :then by Jordan's lemma \lim_ \int_ f(z)\, dz = 0. * ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Co-premise
A co-premise is a premise in reasoning and informal logic which is not the main supporting reason for a contention or a lemma, but is logically necessary to ensure the validity of an argument. One premise by itself, or a group of co-premises can form a reason. Logical structure Every significant term or phrase appearing in a premise of a simple argument, should also appear in the contention/conclusion or in a co-premise. But this by itself does not guarantee a valid argument, see the fallacy of the undistributed middle for an example of this. Sometimes a co-premise will not be explicitly stated. This type of argument is known as an 'enthymematic' argument, and the co-premise may be referred to as a 'hidden' or an 'unstated' co-premise and will often be subject to an inference objection. In this argument map An argument map or argument diagram is a visual representation of the structure of an argument. An argument map typically includes the key components of the argument, tr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Corollary
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 (e.g., violence as a corollary of revolutionary social changes). Overview In mathematics, a corollary is a theorem connected by a short proof to an existing theorem. The use of the term ''corollary'', rather than ''proposition'' or ''theorem'', is intrinsically subjective. More formally, proposition ''B'' is a corollary of proposition ''A'', if ''B'' can be readily deduced from ''A'' or is self-evident from its proof. In many cases, a corollary corresponds to a special case of a larger theorem, which makes the theorem easier to use and apply, even though its importance is generally considered to be secondary t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Axiom
An axiom, postulate, or assumption is a statement that is taken to be true, to serve as a premise or starting point for further reasoning and arguments. The word comes from the Ancient Greek word (), meaning 'that which is thought worthy or fit' or 'that which commends itself as evident'. The term has subtle differences in definition when used in the context of different fields of study. As defined in classic philosophy, an axiom is a statement that is so evident or well-established, that it is accepted without controversy or question. As used in modern logic, an axiom is a premise or starting point for reasoning. As used in mathematics, the term ''axiom'' is used in two related but distinguishable senses: "logical axioms" and "non-logical axioms". Logical axioms are usually statements that are taken to be true within the system of logic they define and are often shown in symbolic form (e.g., (''A'' and ''B'') implies ''A''), while non-logical axioms (e.g., ) are actually ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Yoneda Lemma
In mathematics, the Yoneda lemma is arguably the most important result in category theory. It is an abstract result on functors of the type ''morphisms into a fixed object''. It is a vast generalisation of Cayley's theorem from group theory (viewing a group as a miniature category with just one object and only isomorphisms). It allows the embedding of any locally small category into a category of functors (contravariant set-valued functors) defined on that category. It also clarifies how the embedded category, of representable functors and their natural transformations, relates to the other objects in the larger functor category. It is an important tool that underlies several modern developments in algebraic geometry and representation theory. It is named after Nobuo Yoneda. Generalities The Yoneda lemma suggests that instead of studying the locally small category \mathcal , one should study the category of all functors of \mathcal into \mathbf (the category of sets with ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Vitali Covering Lemma
In mathematics, the Vitali covering lemma is a combinatorial and geometric result commonly used in measure theory of Euclidean spaces. This lemma is an intermediate step, of independent interest, in the proof of the Vitali covering theorem. The covering theorem is credited to the Italian mathematician Giuseppe Vitali.. The theorem states that it is possible to cover, up to a Lebesgue-negligible set, a given subset ''E'' of R''d'' by a disjoint family extracted from a ''Vitali covering'' of ''E''. Vitali covering lemma There are two basic version of the lemma, a finite version and an infinite version. Both lemmas can be proved in the general setting of a metric space, typically these results are applied to the special case of the Euclidean space \mathbb^d. In both theorems we will use the following notation: if B = B(x,r) is a ball and c \in \mathbb, we will write cB for the ball B(x,cr). Finite version Theorem (Finite Covering Lemma). Let B_, \dots, B_ be any finite coll ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Urysohn's Lemma
In topology, Urysohn's lemma is a lemma that states that a topological space is normal if and only if any two disjoint closed subsets can be separated by a continuous function. Section 15. Urysohn's lemma is commonly used to construct continuous functions with various properties on normal spaces. It is widely applicable since all metric spaces and all compact Hausdorff spaces are normal. The lemma is generalised by (and usually used in the proof of) the Tietze extension theorem. The lemma is named after the mathematician Pavel Samuilovich Urysohn. Discussion Two subsets A and B of a topological space X are said to be separated by neighbourhoods if there are neighbourhoods U of A and V of B that are disjoint. In particular A and B are necessarily disjoint. Two plain subsets A and B are said to be separated by a function if there exists a continuous function f : X \to , 1/math> from X into the unit interval , 1/math> such that f(a) = 0 for all a \in A and f(b) = 1 for all b \ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sperner's Lemma
In mathematics, Sperner's lemma is a combinatorial result on colorings of triangulations, analogous to the Brouwer fixed point theorem, which is equivalent to it. It states that every Sperner coloring (described below) of a triangulation of an simplex contains a cell whose vertices all have different colors. The initial result of this kind was proved by Emanuel Sperner, in relation with proofs of invariance of domain. Sperner colorings have been used for effective computation of fixed points and in root-finding algorithms, and are applied in fair division (cake cutting) algorithms. Finding a Sperner coloring or equivalently a Brouwer fixed point is now believed to be an intractable computational problem, even in the plane, in the general case. The problem is PPAD-complete, a complexity class invented by Christos Papadimitriou. According to the Soviet ''Mathematical Encyclopaedia'' (ed. I.M. Vinogradov), a related 1929 theorem (of Knaster, Borsuk and Mazurkiewicz) had als ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Schwarz's Lemma
In mathematics, the Schwarz lemma, named after Hermann Amandus Schwarz, is a result in complex analysis about holomorphic functions from the open unit disk to itself. The lemma is less celebrated than deeper theorems, such as the Riemann mapping theorem, which it helps to prove. It is, however, one of the simplest results capturing the rigidity of holomorphic functions. Statement Let \mathbf = \ be the open unit disk in the complex plane \mathbb centered at the origin, and let f : \mathbf\rightarrow \mathbb be a holomorphic map such that f(0) = 0 and , f(z), \leq 1 on \mathbf. Then , f(z), \leq , z, for all z \in \mathbf, and , f'(0), \leq 1. Moreover, if , f(z), = , z, for some non-zero z or , f'(0), = 1, then f(z) = az for some a \in \mathbb with , a, = 1.Theorem 5.34 in Proof The proof is a straightforward application of the maximum modulus principle on the function :g(z) = \begin \frac\, & \mbox z \neq 0 \\ f'(0) & \mbox z = 0, \end which is holomorphic on the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Schur's Lemma
In mathematics, Schur's lemma is an elementary but extremely useful statement in representation theory of groups and algebras. In the group case it says that if ''M'' and ''N'' are two finite-dimensional irreducible representations of a group ''G'' and ''φ'' is a linear map from ''M'' to ''N'' that commutes with the action of the group, then either ''φ'' is invertible, or ''φ'' = 0. An important special case occurs when ''M'' = ''N'', i.e. ''φ'' is a self-map; in particular, any element of the center of a group must act as a scalar operator (a scalar multiple of the identity) on ''M''. The lemma is named after Issai Schur who used it to prove the Schur orthogonality relations and develop the basics of the representation theory of finite groups. Schur's lemma admits generalisations to Lie groups and Lie algebras, the most common of which are due to Jacques Dixmier and Daniel Quillen. Representation theory of groups Representation theory is the study of homomorphi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
