Splitting Lemma
   HOME
*





Splitting Lemma
In mathematics, and more specifically in homological algebra, the splitting lemma states that in any abelian category, the following statements are equivalent for a short exact sequence : 0 \longrightarrow A \mathrel B \mathrel C \longrightarrow 0. If any of these statements holds, the sequence is called a split exact sequence, and the sequence is said to ''split''. In the above short exact sequence, where the sequence splits, it allows one to refine the first isomorphism theorem, which states that: : (i.e., isomorphic to the coimage of or cokernel of ) to: : where the first isomorphism theorem is then just the projection onto . It is a categorical generalization of the rank–nullity theorem (in the form in linear algebra. Proof for the category of abelian groups and First, to show that 3. implies both 1. and 2., we assume 3. and take as the natural projection of the direct sum onto , and take as the natural injection of into the direct sum. To prove that 1 ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Splitting Lemma (functions)
In mathematics, especially in singularity theory, the splitting lemma is a useful result due to René Thom which provides a way of simplifying the local expression of a function usually applied in a neighbourhood of a degenerate critical point. Formal statement Let f:(\mathbb^n, 0) \to (\mathbb, 0) be a smooth function germ, with a critical point at 0 (so (\partial f/\partial x_i)(0) = 0 for i = 1, \dots, n). Let ''V'' be a subspace of \mathbb^n such that the restriction ''f'' , ''V'' is non-degenerate, and write ''B'' for the Hessian matrix of this restriction. Let ''W'' be any complementary subspace to ''V''. Then there is a change of coordinates \Phi(x, y) of the form \Phi(x, y) = (\phi(x, y), y) with x \in V, y \in W, and a smooth function ''h'' on ''W'' such that :f\circ\Phi(x,y) = \frac x^TBx + h(y). This result is often referred to as the parametrized Morse lemma, which can be seen by viewing ''y'' as the parameter. It is the ''gradient version'' of the impl ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Rank–nullity Theorem
The rank–nullity theorem is a theorem in linear algebra, which asserts that the dimension of the domain of a linear map is the sum of its rank (the dimension of its image) and its ''nullity'' (the dimension of its kernel). p. 70, §2.1, Theorem 2.3 Stating the theorem Let T : V \to W be a linear transformation between two vector spaces where T's domain V is finite dimensional. Then \operatorname(T) ~+~ \operatorname(T) ~=~ \dim V, where \operatorname(T) ~:=~ \dim(\operatorname(T)) \qquad \text \qquad \operatorname(T) ~:=~ \dim(\operatorname (T)). In other words, \dim (\operatorname T) + \dim (\ker T) = \dim (\operatorname T). This theorem can be refined via the splitting lemma to be a statement about an isomorphism of spaces, not just dimensions. Explicitly, since induces an isomorphism from V / \operatorname (T) to \operatorname (T), the existence of a basis for that extends any given basis of \operatorname(T) implies, via the splitting lemma, that \operatorname(T) \oplus ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Direct Product Of Groups
In mathematics, specifically in group theory, the direct product is an operation that takes two groups and and constructs a new group, usually denoted . This operation is the group-theoretic analogue of the Cartesian product of sets and is one of several important notions of direct product in mathematics. In the context of abelian groups, the direct product is sometimes referred to as the direct sum, and is denoted G \oplus H. Direct sums play an important role in the classification of abelian groups: according to the fundamental theorem of finite abelian groups, every finite abelian group can be expressed as the direct sum of cyclic groups. Definition Given groups (with operation ) and (with operation ), the direct product is defined as follows: The resulting algebraic object satisfies the axioms for a group. Specifically: ;Associativity: The binary operation on is associative. ;Identity: The direct product has an identity element, namely , where is the identity e ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Semidirect Product
In mathematics, specifically in group theory, the concept of a semidirect product is a generalization of a direct product. There are two closely related concepts of semidirect product: * an ''inner'' semidirect product is a particular way in which a group can be made up of two subgroups, one of which is a normal subgroup. * an ''outer'' semidirect product is a way to construct a new group from two given groups by using the Cartesian product as a set and a particular multiplication operation. As with direct products, there is a natural equivalence between inner and outer semidirect products, and both are commonly referred to simply as ''semidirect products''. For finite groups, the Schur–Zassenhaus theorem provides a sufficient condition for the existence of a decomposition as a semidirect product (also known as splitting extension). Inner semidirect product definitions Given a group with identity element , a subgroup , and a normal subgroup , the following statements ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Normal Subgroup
In abstract algebra, a normal subgroup (also known as an invariant subgroup or self-conjugate subgroup) is a subgroup that is invariant under conjugation by members of the group of which it is a part. In other words, a subgroup N of the group G is normal in G if and only if gng^ \in N for all g \in G and n \in N. The usual notation for this relation is N \triangleleft G. Normal subgroups are important because they (and only they) can be used to construct quotient groups of the given group. Furthermore, the normal subgroups of G are precisely the kernels of group homomorphisms with domain G, which means that they can be used to internally classify those homomorphisms. Évariste Galois was the first to realize the importance of the existence of normal subgroups. Definitions A subgroup N of a group G is called a normal subgroup of G if it is invariant under conjugation; that is, the conjugation of an element of N by an element of G is always in N. The usual notation for this re ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Category Of Groups
In mathematics, the category Grp (or Gp) has the class of all groups for objects and group homomorphisms for morphisms. As such, it is a concrete category. The study of this category is known as group theory. Relation to other categories There are two forgetful functors from Grp, M: Grp → Mon from groups to monoids and U: Grp → Set from groups to sets. M has two adjoints: one right, I: Mon→Grp, and one left, K: Mon→Grp. I: Mon→Grp is the functor sending every monoid to the submonoid of invertible elements and K: Mon→Grp the functor sending every monoid to the Grothendieck group of that monoid. The forgetful functor U: Grp → Set has a left adjoint given by the composite KF: Set→Mon→Grp, where F is the free functor; this functor assigns to every set ''S'' the free group on ''S.'' Categorical properties The monomorphisms in Grp are precisely the injective homomorphisms, the epimorphisms are precisely the surjective homomorphisms, and the isomorphisms are precise ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Abstract Nonsense
In mathematics, abstract nonsense, general abstract nonsense, generalized abstract nonsense, and general nonsense are terms used by mathematicians to describe abstract methods related to category theory and homological algebra. More generally, "abstract nonsense" may refer to a proof that relies on category-theoretic methods, or even to the study of category theory itself. Background Roughly speaking, category theory is the study of the general form, that is, categories of mathematical theories, without regard to their content. As a result, mathematical proofs that rely on category-theoretic ideas often seem out-of-context, somewhat akin to a non sequitur. Authors sometimes dub these proofs "abstract nonsense" as a light-hearted way of alerting readers to their abstract nature. Labeling an argument "abstract nonsense" is usually ''not'' intended to be derogatory,Michael Monastyrsky, ''Some Trends in Modern Mathematics and the Fields Medal.'' Can. Math. Soc. Notes, March and Apr ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Bijection
In mathematics, a bijection, also known as a bijective function, one-to-one correspondence, or invertible function, is a function between the elements of two sets, where each element of one set is paired with exactly one element of the other set, and each element of the other set is paired with exactly one element of the first set. There are no unpaired elements. In mathematical terms, a bijective function is a one-to-one (injective) and onto (surjective) mapping of a set ''X'' to a set ''Y''. The term ''one-to-one correspondence'' must not be confused with ''one-to-one function'' (an injective function; see figures). A bijection from the set ''X'' to the set ''Y'' has an inverse function from ''Y'' to ''X''. If ''X'' and ''Y'' are finite sets, then the existence of a bijection means they have the same number of elements. For infinite sets, the picture is more complicated, leading to the concept of cardinal number—a way to distinguish the various sizes of infinite sets. ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Injective
In mathematics, an injective function (also known as injection, or one-to-one function) is a function that maps distinct elements of its domain to distinct elements; that is, implies . (Equivalently, implies in the equivalent contrapositive statement.) In other words, every element of the function's codomain is the image of one element of its domain. The term must not be confused with that refers to bijective functions, which are functions such that each element in the codomain is an image of exactly one element in the domain. A homomorphism between algebraic structures is a function that is compatible with the operations of the structures. For all common algebraic structures, and, in particular for vector spaces, an is also called a . However, in the more general context of category theory, the definition of a monomorphism differs from that of an injective homomorphism. This is thus a theorem that they are equivalent for algebraic structures; see for more details. ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Restriction (mathematics)
In mathematics, the restriction of a function f is a new function, denoted f\vert_A or f , obtained by choosing a smaller domain A for the original function f. The function f is then said to extend f\vert_A. Formal definition Let f : E \to F be a function from a set E to a set F. If a set A is a subset of E, then the restriction of f to A is the function _A : A \to F given by _A(x) = f(x) for x \in A. Informally, the restriction of f to A is the same function as f, but is only defined on A. If the function f is thought of as a relation (x,f(x)) on the Cartesian product E \times F, then the restriction of f to A can be represented by its graph where the pairs (x,f(x)) represent ordered pairs in the graph G. Extensions A function F is said to be an ' of another function f if whenever x is in the domain of f then x is also in the domain of F and f(x) = F(x). That is, if \operatorname f \subseteq \operatorname F and F\big\vert_ = f. A '' '' (respectively, '' '', etc.) of ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Intersection (set Theory)
In set theory, the intersection of two sets A and B, denoted by A \cap B, is the set containing all elements of A that also belong to B or equivalently, all elements of B that also belong to A. Notation and terminology Intersection is written using the symbol "\cap" between the terms; that is, in infix notation. For example: \\cap\=\ \\cap\=\varnothing \Z\cap\N=\N \\cap\N=\ The intersection of more than two sets (generalized intersection) can be written as: \bigcap_^n A_i which is similar to capital-sigma notation. For an explanation of the symbols used in this article, refer to the table of mathematical symbols. Definition The intersection of two sets A and B, denoted by A \cap B, is the set of all objects that are members of both the sets A and B. In symbols: A \cap B = \. That is, x is an element of the intersection A \cap B if and only if x is both an element of A and an element of B. For example: * The intersection of the sets and is . * The number 9 is in t ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Image (function)
In mathematics, the image of a function is the set of all output values it may produce. More generally, evaluating a given function f at each element of a given subset A of its domain produces a set, called the "image of A under (or through) f". Similarly, the inverse image (or preimage) of a given subset B of the codomain of f, is the set of all elements of the domain that map to the members of B. Image and inverse image may also be defined for general binary relations, not just functions. Definition The word "image" is used in three related ways. In these definitions, f : X \to Y is a function from the set X to the set Y. Image of an element If x is a member of X, then the image of x under f, denoted f(x), is the value of f when applied to x. f(x) is alternatively known as the output of f for argument x. Given y, the function f is said to "" or "" if there exists some x in the function's domain such that f(x) = y. Similarly, given a set S, f is said to "" if there ex ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]