请输入您要查询的字词:

 

单词 ProofOfTheJordanHolderDecompositionTheorem
释义

proof of the Jordan Hölder decomposition theorem


Let |G|=N. We first prove existence, using inductionMathworldPlanetmath on N. If N=1 (or, more generally, if G is simple) the result is clear. Now suppose G is not simple. Choose a maximal proper normal subgroup G1 of G. Then G1 has a Jordan–Hölder decomposition by induction, which produces a Jordan–Hölder decomposition for G.

To prove uniqueness, we use induction on the length n of the decomposition series. If n=1 then G is simple and we are done. For n>1, suppose that

GG1G2Gn={1}

and

GG1G2Gm={1}

are two decompositions of G. If G1=G1 then we’re done (apply the induction hypothesis to G1), so assume G1G1. Set H:=G1G1 and choose a decomposition series

HH1Hk={1}

for H. By the second isomorphism theorem, G1/H=G1G1/G1=G/G1 (the last equality is because G1G1 is a normal subgroupMathworldPlanetmath of G properly containing G1). In particular, H is a normal subgroup of G1 with simple quotientPlanetmathPlanetmath. But then

G1G2Gn

and

G1HHk

are two decomposition series for G1, and hence have the same simple quotients by the induction hypothesis; likewise for the G1 series. Therefore n=m. Moreover, since G/G1=G1/H and G/G1=G1/H (by the second isomorphism theorem), we have now accounted for all of the simple quotients, and shown that they are the same.

随便看

 

数学辞典收录了18232条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/4 8:03:44