Krull–Schmidt theorem

In mathematics, the Krull–Schmidt theorem states that a group subjected to certain finiteness conditions on chains of subgroups, can be uniquely written as a finite direct product of indecomposable subgroups.

Definitions

We say that a group G satisfies the ascending chain condition (ACC) on subgroups if every sequence of subgroups of G:

is eventually constant, i.e., there exists N such that GN = GN+1 = GN+2 = ... . We say that G satisfies the ACC on normal subgroups if every such sequence of normal subgroups of G eventually becomes constant.

Likewise, one can define the descending chain condition on (normal) subgroups, by looking at all decreasing sequences of (normal) subgroups:

Clearly, all finite groups satisfy both ACC and DCC on subgroups. The infinite cyclic group satisfies ACC but not DCC, since (2) > (2)2 > (2)3 > ... is an infinite decreasing sequence of subgroups. On the other hand, the -torsion part of (the quasicyclic p-group) satisfies DCC but not ACC.

We say a group G is indecomposable if it cannot be written as a direct product of non-trivial subgroups G = H × K.

Statement

If is a group that satisfies either ACC or DCC on normal subgroups, then there is a unique way of writing as a direct product of finitely many indecomposable subgroups of . Here, uniqueness means direct decompositions into indecomposable subgroups have the exchange property. That is: suppose is another expression of as a product of indecomposable subgroups. Then and there is a reindexing of the 's satisfying

  • and are isomorphic for each ;
  • for each .

Proof

Proving existence is relatively straightforward: let S be the set of all normal subgroups that can not be written as a product of indecomposable subgroups. Moreover, any indecomposable subgroup is (trivially) the one-term direct product of itself, hence decomposable. If Krull-Schmidt fails, then S contains G; so we may iteratively construct a descending series of direct factors; this contradicts the DCC. One can then invert the construction to show that all direct factors of G appear in this way.[1]

The proof of uniqueness, on the other hand, is quite long and requires a sequence of technical lemmas. For a complete exposition, see [2].

Remark

The theorem does not assert the existence of a non-trivial decomposition, but merely that any such two decompositions (if they exist) are the same.

Krull–Schmidt Theorem for Modules

If is a module that satisfies the ACC and DCC on submodules (that is, it is both Noetherian and Artinian or – equivalently – of finite length), then is a direct sum of indecomposable modules. Up to a permutation, the indecomposable components in such a direct sum are uniquely determined up to isomorphism.[3]

In general, the theorem fails if one only assumes that the module is Noetherian or Artinian.[4]

History

The present-day Krull–Schmidt theorem was first proved by Joseph Wedderburn (Ann. of Math (1909)), for finite groups, though he mentions some credit is due to an earlier study of G.A. Miller where direct products of abelian groups were considered. Wedderburn's theorem is stated as an exchange property between direct decompositions of maximum length. However, Wedderburn's proof makes no use of automorphisms.

The thesis of Robert Remak (1911) derived the same uniqueness result as Wedderburn but also proved (in modern terminology) that the group of central automorphisms acts transitively on the set of direct decompositions of maximum length of a finite group. From that stronger theorem Remak also proved various corollaries including that groups with a trivial center and perfect groups have a unique Remak decomposition.

Otto Schmidt (Sur les produits directs, S. M. F. Bull. 41 (1913), 161–164), simplified the main theorems of Remak to the 3 page predecessor to today's textbook proofs. His method improves Remak's use of idempotents to create the appropriate central automorphisms. Both Remak and Schmidt published subsequent proofs and corollaries to their theorems.

Wolfgang Krull (Über verallgemeinerte endliche Abelsche Gruppen, M. Z. 23 (1925) 161–196), returned to G.A. Miller's original problem of direct products of abelian groups by extending to abelian operator groups with ascending and descending chain conditions. This is most often stated in the language of modules. His proof observes that the idempotents used in the proofs of Remak and Schmidt can be restricted to module homomorphisms; the remaining details of the proof are largely unchanged.

O. Ore unified the proofs from various categories include finite groups, abelian operator groups, rings and algebras by proving the exchange theorem of Wedderburn holds for modular lattices with descending and ascending chain conditions. This proof makes no use of idempotents and does not reprove the transitivity of Remak's theorems.

Kurosh's The Theory of Groups and Zassenhaus' The Theory of Groups include the proofs of Schmidt and Ore under the name of Remak–Schmidt but acknowledge Wedderburn and Ore. Later texts use the title Krull–Schmidt (Hungerford's Algebra) and Krull–Schmidt–Azumaya (Curtis–Reiner). The name Krull–Schmidt is now popularly substituted for any theorem concerning uniqueness of direct products of maximum size. Some authors choose to call direct decompositions of maximum-size Remak decompositions to honor his contributions.

gollark: What if you implement Go in Go?
gollark: \@everyone
gollark: Go(lang) = bad.
gollark: ``` [...] MIPS is short for Millions of Instructions Per Second. It is a measure for the computation speed of a processor. Like most such measures, it is more often abused than used properly (it is very difficult to justly compare MIPS for different kinds of computers). BogoMips are Linus's own invention. The linux kernel version 0.99.11 (dated 11 July 1993) needed a timing loop (the time is too short and/or needs to be too exact for a non-busy-loop method of waiting), which must be calibrated to the processor speed of the machine. Hence, the kernel measures at boot time how fast a certain kind of busy loop runs on a computer. "Bogo" comes from "bogus", i.e, something which is a fake. Hence, the BogoMips value gives some indication of the processor speed, but it is way too unscientific to be called anything but BogoMips. The reasons (there are two) it is printed during boot-up is that a) it is slightly useful for debugging and for checking that the computer[’]s caches and turbo button work, and b) Linus loves to chuckle when he sees confused people on the news. [...]```I was wondering what BogoMIPS was, and wikipedia had this.
gollark: ```Architecture: x86_64CPU op-mode(s): 32-bit, 64-bitByte Order: Little EndianCPU(s): 8On-line CPU(s) list: 0-7Thread(s) per core: 2Core(s) per socket: 4Socket(s): 1NUMA node(s): 1Vendor ID: GenuineIntelCPU family: 6Model: 42Model name: Intel(R) Xeon(R) CPU E31240 @ 3.30GHzStepping: 7CPU MHz: 1610.407CPU max MHz: 3700.0000CPU min MHz: 1600.0000BogoMIPS: 6587.46Virtualization: VT-xL1d cache: 32KL1i cache: 32KL2 cache: 256KL3 cache: 8192KNUMA node0 CPU(s): 0-7Flags: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good nopl xtopology nonstop_tsc cpuid aperfmperf pni pclmulqdq dtes64 monitor ds_cpl vmx smx est tm2 ssse3 cx16 xtpr pdcm pcid sse4_1 sse4_2 x2apic popcnt tsc_deadline_timer aes xsave avx lahf_lm pti tpr_shadow vnmi flexpriority ept vpid xsaveopt dtherm ida arat pln pts```

See also

References

  1. Thomas W. Hungerford (6 December 2012). Algebra. Springer Science & Business Media. p. 83. ISBN 978-1-4612-6101-8.
  2. Hungerford 2012, p.86-8.
  3. Jacobson, Nathan (2009). Basic algebra. 2 (2nd ed.). Dover. p. 115. ISBN 978-0-486-47187-7.
  4. Facchini, Alberto; Herbera, Dolors; Levy, Lawrence S.; Vámos, Peter (1 December 1995). "Krull-Schmidt fails for Artinian modules". Proceedings of the American Mathematical Society. 123 (12): 3587–3587. doi:10.1090/S0002-9939-1995-1277109-4.

Further reading

  • A. Facchini: Module theory. Endomorphism rings and direct sum decompositions in some classes of modules. Progress in Mathematics, 167. Birkhäuser Verlag, Basel, 1998. ISBN 3-7643-5908-0
  • C.M. Ringel: Krull–Remak–Schmidt fails for Artinian modules over local rings. Algebr. Represent. Theory 4 (2001), no. 1, 77–86.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.