<電子ブック>
Introduction to the Galois Correspondence / by Maureen H. Fenrick
版 | 1st ed. 1992. |
---|---|
出版者 | Boston, MA : Birkhäuser Boston : Imprint: Birkhäuser |
出版年 | 1992 |
本文言語 | 英語 |
大きさ | online resource |
著者標目 | *Fenrick, Maureen H author SpringerLink (Online service) |
件 名 | LCSH:Group theory LCSH:Algebraic fields LCSH:Polynomials LCSH:Algebra FREE:Group Theory and Generalizations FREE:Field Theory and Polynomials FREE:Algebra |
一般注記 | I. Preliminaries - Groups and Rings -- 1. Introduction to Groups -- 2. Quotient Groups and Sylow Subgroups -- 3. Finite Abelian Groups and Solvable Groups -- 4. Introduction to Rings -- 5. Factoring in F[x] -- II. Field Extensions -- 1. Simple Extensions -- 2. Algebraic Extensions -- 3. Splitting Fields and Normal Extensions -- III. The Galois Correspondence -- 1. The Fundamental Correspondence -- 2. The Solvable Correspondence -- IV. Applications -- 1. Constructibility -- 2. Roots of Unity -- 3. Wedderburn’s Theorem -- 3. Dirichlet’s Theorem and Finite Abelian Groups In this presentation of the Galois correspondence, modem theories of groups and fields are used to study problems, some of which date back to the ancient Greeks. The techniques used to solve these problems, rather than the solutions themselves, are of primary importance. The ancient Greeks were concerned with constructibility problems. For example, they tried to determine if it was possible, using straightedge and compass alone, to perform any of the following tasks? (1) Double an arbitrary cube; in particular, construct a cube with volume twice that of the unit cube. (2) Trisect an arbitrary angle. (3) Square an arbitrary circle; in particular, construct a square with area 7r. (4) Construct a regular polygon with n sides for n > 2. If we define a real number c to be constructible if, and only if, the point (c,O) can be constructed starting with the points (0,0) and (1,0), then we may show that the set of constructible numbers is a subfield of the field R of real numbers containing the field Q of rational numbers. Such a subfield is called an intermediate field of Rover Q. We may thus gain insight into the constructibility problems by studying intermediate fields of Rover Q. In chapter 4 we will show that (1) through (3) are not possible and we will determine necessary and sufficient conditions that the integer n must satisfy in order that a regular polygon with n sides be constructible HTTP:URL=https://doi.org/10.1007/978-1-4684-0026-7 |
目次/あらすじ
所蔵情報を非表示
電子ブック | 配架場所 | 資料種別 | 巻 次 | 請求記号 | 状 態 | 予約 | コメント | ISBN | 刷 年 | 利用注記 | 指定図書 | 登録番号 |
---|---|---|---|---|---|---|---|---|---|---|---|---|
電子ブック | オンライン | 電子ブック |
|
|
Springer eBooks | 9781468400267 |
|
電子リソース |
|
EB00236634 |
類似資料
この資料の利用統計
このページへのアクセス回数:6回
※2017年9月4日以降