Galois Theories Of Fields And Rings

[Farid-Khan]

English | 2024 | ISBN: 3031584597 | 184 pages | True PDF | 2.13 MB​

Algebraic Geometry in Coding Theory and Cryptography (Harald Niederreiter) (2009)
Catergory: Mathematics, Nonfiction
Publisher: Princeton University Press

This textbook arises from a master's course taught by the author at the University of Coimbra. It takes the reader from the very classical Galois theorem for fields to its generalization to the case of rings. Given a finite-dimensional Galois extension of fields, the classical bijection between the intermediate field extensions and the subgroups of the corresponding Galois group was extended by Grothendieck as an equivalence between finite-dimensional split algebras and finite sets on which the Galois group acts. Adding further profinite topologies on the Galois group and the sets on which it acts, these two theorems become valid in arbitrary dimension. Taking advantage of the power of category theory, the second part of the book generalizes this most general Galois theorem for fields to the case of commutative rings. This book should be of interest to field theorists and ring theorists wanting to discover new techniques which make it possible to liberate Galois theory from its traditional restricted context of field theory. It should also be of great interest to category theorists who want to apply their everyday techniques to produce deep results in other domains of mathematics.

Contents of Download:
Galois Theories Of Fields And Rings.pdf (Harald Niederreiter) (2009) (2.13 MB)

️ Galois Theories Of Fields And Rings (2.13 MB)

NitroFlare Link(s) (Premium Link)

            
                
                
                    
                   ⚠
                    A kód megtekintéséhez jelentkezz be.
					Please log in to view the code.
                
            
        

RapidGator Link(s)

            
                
                
                    
                   ⚠
                    A kód megtekintéséhez jelentkezz be.
					Please log in to view the code.