Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Concept
Five lemma
Summary
In mathematics, especially homological algebra and other applications of theory, the five lemma is an important and widely used lemma about commutative diagrams.
The five lemma is not only valid for abelian categories but also works in the , for example.
The five lemma can be thought of as a combination of two other theorems, the four lemmas, which are to each other.
Consider the following commutative diagram in any (such as the category of abelian groups or the category of vector spaces over a given field) or in the category of groups.
The five lemma states that, if the rows are exact, m and p are isomorphisms, l is an epimorphism, and q is a monomorphism, then n is also an isomorphism.
The two four-lemmas state:
The method of proof we shall use is commonly referred to as diagram chasing. We shall prove the five lemma by individually proving each of the two four lemmas.
To perform diagram chasing, we assume that we are in a category of modules over some ring, so that we may speak of elements of the objects in the diagram and think of the morphisms of the diagram as functions (in fact, homomorphisms) acting on those elements.
Then a morphism is a monomorphism if and only if it is injective, and it is an epimorphism if and only if it is surjective.
Similarly, to deal with exactness, we can think of kernels and s in a function-theoretic sense.
The proof will still apply to any (small) abelian category because of Mitchell's embedding theorem, which states that any small abelian category can be represented as a category of modules over some ring.
For the category of groups, just turn all additive notation below into multiplicative notation, and note that commutativity of abelian group is never used.
So, to prove (1), assume that m and p are surjective and q is injective.
Let c′ be an element of C′.
Since p is surjective, there exists an element d in D with p(d) = t(c′).
By commutativity of the diagram, u(p(d)) = q(j(d)).
Since im t = ker u by exactness, 0 = u(t(c′)) = u(p(d)) = q(j(d)).
Since q is injective, j(d) = 0, so d is in ker j = im h.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.