Link on this page

<E-Book>
Introduction to the Galois Correspondence / by Maureen H. Fenrick

Edition 1st ed. 1992.
Publisher (Boston, MA : Birkhäuser Boston : Imprint: Birkhäuser)
Year 1992
Language English
Size online resource
Authors *Fenrick, Maureen H author
SpringerLink (Online service)
Subjects LCSH:Group theory
LCSH:Algebraic fields
LCSH:Polynomials
LCSH:Algebra
FREE:Group Theory and Generalizations
FREE:Field Theory and Polynomials
FREE:Algebra
Notes 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
TOC

Hide book details.

E-Book オンライン 電子ブック

Springer eBooks 9781468400267
電子リソース
EB00236634

Hide details.

Material Type E-Book
Classification LCC:QA174-183
DC23:512.2
ID 4000106468
ISBN 9781468400267

 Similar Items