Metraipolis › archive › dc_ecdfa33262d9

Semi-simplicity — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Semi-simplicity
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T18:21:45.469Z
SHA-256 of the archived text
16c3eee78c7d5f20a543d2f7bdf2771e7736c1e03aedecf7db71c79316c2e210
Stable URL of this page
https://metraipolis.com/documento/dc_ecdfa33262d9

How to cite

Semi-simplicity — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Semi-simplicity (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_ecdfa33262d9 (Metraipolis archive dc_ecdfa33262d9, sha256 16c3eee78c7d5f20a543d2f7bdf2771e7736c1e03aedecf7db71c79316c2e210)
BibTeX
@misc{dcecdfa33262d9,
  title = {Semi-simplicity — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Semi-simplicity},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_ecdfa33262d9; sha256 16c3eee78c7d5f20a543d2f7bdf2771e7736c1e03aedecf7db71c79316c2e210},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Semi-simplicity. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In mathematics, semi-simplicity is a widespread concept in disciplines such as linear algebra, abstract algebra, representation theory, category theory, and algebraic geometry. A semi-simple object is one that can be decomposed into a sum of simple objects, and simple objects are those that do not contain non-trivial proper sub-objects. The precise definitions of these words depends on the context. For example, if G is a finite group, then a nontrivial finite-dimensional representation V over a field is said to be simple if the only subrepresentations it contains are either {0} or V (these are also called irreducible representations). Now Maschke's theorem says that any finite-dimensional representation of a finite group is a direct sum of simple representations (provided the characteristic of the base field does not divide the order of the group). So in the case of finite groups with this condition, every finite-dimensional representation is semi-simple. Especially in algebra and representation theory, "semi-simplicity" is also called complete reducibility. For example, Weyl's theorem on complete reducibility says a finite-dimensional representation of a semisimple compact Lie group is semisimple. A square matrix (in other words a linear operator T : V → V {\displaystyle T:V\to V} with V a finite-dimensional vector space) is said to be simple if its only invariant linear subspaces under T are {0} and V. If the field is algebraically closed (such as the complex numbers), then the only simple matrices are of size 1-by-1. A semi-simple matrix is one that is similar to a direct sum of simple matrices; if the field is algebraically closed, this is the same as being diagonalizable. These notions of semi-simplicity can be unified using the language of semi-simple modules, and generalized to semi-simple categories.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; categoria «Linear algebra»).
Fonte: Wikipedia in inglese, voce «Semi-simplicity» — https://en.wikipedia.org/wiki/Semi-simplicity
Wikidata Q3478415 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q3478415
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Semi-simplicity?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1365996547, consultata il 2026-10-07T17:52:12.129Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 739e75860336f1b58e00c2983e609d9382affd7762a887341c71d936785dcf91