[過去ログ]
ガロア第一論文及びその関連の資料スレ (1002レス)
ガロア第一論文及びその関連の資料スレ http://rio2016.5ch.net/test/read.cgi/math/1615510393/
上
下
前次
1-
新
通常表示
512バイト分割
レス栞
抽出解除
レス栞
このスレッドは過去ログ倉庫に格納されています。
次スレ検索
歴削→次スレ
栞削→次スレ
過去ログメニュー
リロード規制
です。10分ほどで解除するので、
他のブラウザ
へ避難してください。
111: 132人目の素数さん [] 2023/01/31(火) 15:56:41.49 ID:tkHk7/Du >>110 つづき In both the cases, the group of the equation can be partitioned by adjunction into groups such that one can pass from one to another by a self-transformation;but the condition that these groups have the same substitutions holds only in thesecond case. This is called proper decomposition. In other words, when a group G contains another, H, the group G can be parti-tioned into groups each of which is obtained by operating on the permutations inH a self-transformation, in such a way that,G = H + H S + H S' + ・・..And we can also partition into groups which have all similar substitutions, such that G = H +TH +T'H +・・ These two types of decompositions generally do not coincide. When they do coin-cide the decomposition is said to be proper. It is easy to see that, when the group of an equation is not susceptible to any proper decomposition, however well we might have transformed this equation, the groupsof the transformed equations will always have the same number of permutations.On the contrary, when the group of an equation is susceptible to a proper decom-position in such a way that we can decompose it into M groups of N permutations,we can resolve the given equation by means of two equations: one will have a groupof M permutations and the other, one of N permutations. つづく http://rio2016.5ch.net/test/read.cgi/math/1615510393/111
112: 132人目の素数さん [] 2023/01/31(火) 15:57:16.75 ID:tkHk7/Du >>111 つづき Hence when we would have exhausted all possible proper decompositions on the group of an equation, we arrive at groups which can be transformed but for whichthe number of permutations will always be the same. If each of these groups has a prime number of permutations then the equation will be solvable by radicals; otherwise, not. The smallest number of permutations that an indecomposable group can have,when this number is not a prime number, is 5・4・3.(=60のA5(交代群)) (引用終り) 以上 http://rio2016.5ch.net/test/read.cgi/math/1615510393/112
メモ帳
(0/65535文字)
上
下
前次
1-
新
書
関
写
板
覧
索
設
栞
歴
スレ情報
赤レス抽出
画像レス抽出
歴の未読スレ
AAサムネイル
Google検索
Wikipedia
ぬこの手
ぬこTOP
0.034s