SlideShare una empresa de Scribd logo
1 de 30
Descargar para leer sin conexión
Existence and Uniqueness of Algebraic Closure: Artin’s
Proof
Ayan Sengupta
March 15, 2015
Ayan Sengupta March 15, 2015 1 / 16
Recall
A relation ≤R on a set S is called partial ordering if
a ≤R b and b ≤R a =⇒ a = b ∀a, b ∈ S
a ≤R b and b ≤R c =⇒ a ≤R c ∀a, b, c ∈ S
Ayan Sengupta March 15, 2015 2 / 16
Recall
A relation ≤R on a set S is called partial ordering if
a ≤R b and b ≤R a =⇒ a = b ∀a, b ∈ S
a ≤R b and b ≤R c =⇒ a ≤R c ∀a, b, c ∈ S
A subset T of a partially ordered set S is called Totally ordered if
∀s, t ∈ T s ≤R t or, t ≤R s.
Ayan Sengupta March 15, 2015 2 / 16
Recall
A relation ≤R on a set S is called partial ordering if
a ≤R b and b ≤R a =⇒ a = b ∀a, b ∈ S
a ≤R b and b ≤R c =⇒ a ≤R c ∀a, b, c ∈ S
A subset T of a partially ordered set S is called Totally ordered if
∀s, t ∈ T s ≤R t or, t ≤R s.
An upper bound of a totally ordered subset T of a partially ordered set
(S, ≤R) is an element s ∈ S such that t ≤R s ∀t ∈ T.
Ayan Sengupta March 15, 2015 2 / 16
Recall
A relation ≤R on a set S is called partial ordering if
a ≤R b and b ≤R a =⇒ a = b ∀a, b ∈ S
a ≤R b and b ≤R c =⇒ a ≤R c ∀a, b, c ∈ S
A subset T of a partially ordered set S is called Totally ordered if
∀s, t ∈ T s ≤R t or, t ≤R s.
An upper bound of a totally ordered subset T of a partially ordered set
(S, ≤R) is an element s ∈ S such that t ≤R s ∀t ∈ T.
A maximal element of (S, ≤R) is an element s ∈ S such that s ≤R s =⇒
s = s .
Ayan Sengupta March 15, 2015 2 / 16
Zorn’s Lemma
Zorn’s Lemma
If every totally ordered subset of (S, ≤R) has an upper bound, then S has
a maximal element.
Ayan Sengupta March 15, 2015 3 / 16
Zorn’s Lemma
Corollary 1
Every commutative ring R has a maximal ideal M.
Proof : Straight forward!
Take the partially ordered set to be S, the set of all proper ideals of R
with the ordering ⊆.
Take any chain of ideals (totally ordered subset) of R -
I0 ⊆ I1 ⊆ I2....
It can easily verified that I = ∪Ii =< 1 > is a proper ideal of R and every
Ii ⊆ I.Hence, I is an upper bound of the chain in S.Hence, Zorn’s lemma
implies that S has a maximal element i.e. a maximal ideal in R.
Ayan Sengupta March 15, 2015 4 / 16
Some Definitions
Definition : Algebraically Closed Field
every f (x) ∈ F[x] of degree ≥ 1 has a root in F.
Quick fact :
To show a field algebraically closed it is sufficient to show that every
monic polynomial over it has a root in it.
Ayan Sengupta March 15, 2015 5 / 16
Some Definitions
Definition : Algebraically Closed Field
every f (x) ∈ F[x] of degree ≥ 1 has a root in F.
Quick fact :
To show a field algebraically closed it is sufficient to show that every
monic polynomial over it has a root in it.
Definition : Algebraic Closure
E ⊇ F is said to be algebraic closure of F if E is algebraic over F and E is
algebraically closed.
e.g. - C is the algebraic closure of R.
Ayan Sengupta March 15, 2015 5 / 16
Theorem (Proposition 1)
Every field F has an algebraic closure which is unique upto isomorphism.
Proof : This proof was constructed by Emil Artin.
Ayan Sengupta March 15, 2015 6 / 16
Existence of Algebraic Closure
S = {f (x) ∈ F[x]| f is monic }. For each element f (x) in S we assign an
indeterminant xf .
Consider the ring F[S], the polynomial ring with indeterminants xf .
Consider the ideal I =< f (xf ) >f ∈S in F[S].
Ayan Sengupta March 15, 2015 7 / 16
Existence of Algebraic Closure
S = {f (x) ∈ F[x]| f is monic }. For each element f (x) in S we assign an
indeterminant xf .
Consider the ring F[S], the polynomial ring with indeterminants xf .
Consider the ideal I =< f (xf ) >f ∈S in F[S].
Claim : I =< 1 >.
Ayan Sengupta March 15, 2015 7 / 16
Existence of Algebraic Closure
S = {f (x) ∈ F[x]| f is monic }. For each element f (x) in S we assign an
indeterminant xf .
Consider the ring F[S], the polynomial ring with indeterminants xf .
Consider the ideal I =< f (xf ) >f ∈S in F[S].
Claim : I =< 1 >.
Suppose I =< 1 >. Then
r
i=1
gi .fki
(xfki
) = 1 (1)
for some indexing ki and gi ∈ F[S]. Now, we have r polynomials fki
for
i = 1, 2, ...r. Take F0 = F[S]. If fk1 is irreducible in F0 then take
F1 = F0/ < fk1 >.
Else F1 = F0.
In this way we can generate Fr such that every polynomial fk1 , fk2 , ...fkr has
a root in it.
Ayan Sengupta March 15, 2015 7 / 16
Existence of Algebraic Closure
Precisely, if the image of xfki
in Fi−1[S]/ < fki
> is ¯xfki
, then
f ( ¯xfki
) = ¯f (xfki
) = 0 in Fi .
In Fr , if we substitute xfki
by ¯xfki
in equation (1) then we get
1 =
r
i=1
gi .fki
( ¯xfki
) = 0 (2)
Ayan Sengupta March 15, 2015 8 / 16
Existence of Algebraic Closure
Precisely, if the image of xfki
in Fi−1[S]/ < fki
> is ¯xfki
, then
f ( ¯xfki
) = ¯f (xfki
) = 0 in Fi .
In Fr , if we substitute xfki
by ¯xfki
in equation (1) then we get
1 =
r
i=1
gi .fki
( ¯xfki
) = 0 (2)
contradiction.
Hence our claim is verified.
Now, as I = 1 we can conclude from the above corollary that some
maximal ideal m of F[S] contains I.
Ayan Sengupta March 15, 2015 8 / 16
Existence of Algebraic Closure
Precisely, if the image of xfki
in Fi−1[S]/ < fki
> is ¯xfki
, then
f ( ¯xfki
) = ¯f (xfki
) = 0 in Fi .
In Fr , if we substitute xfki
by ¯xfki
in equation (1) then we get
1 =
r
i=1
gi .fki
( ¯xfki
) = 0 (2)
contradiction.
Hence our claim is verified.
Now, as I = 1 we can conclude from the above corollary that some
maximal ideal m of F[S] contains I.
Now we take E0 = F[S] and E1 = E0/m.
Ayan Sengupta March 15, 2015 8 / 16
Existence of Algebraic Closure
Precisely, if the image of xfki
in Fi−1[S]/ < fki
> is ¯xfki
, then
f ( ¯xfki
) = ¯f (xfki
) = 0 in Fi .
In Fr , if we substitute xfki
by ¯xfki
in equation (1) then we get
1 =
r
i=1
gi .fki
( ¯xfki
) = 0 (2)
contradiction.
Hence our claim is verified.
Now, as I = 1 we can conclude from the above corollary that some
maximal ideal m of F[S] contains I.
Now we take E0 = F[S] and E1 = E0/m.
In E1 every f (x) ∈ S has a root. Moreover, in E1 every f (x) ∈ F[x] has a
root. (Precisely, roots are ¯xf )
Ayan Sengupta March 15, 2015 8 / 16
Inductively, we construct E0 ⊆ E1 ⊆ E2....
We take E = ∪Ei . Then E is a field extension of F.
Ayan Sengupta March 15, 2015 9 / 16
Inductively, we construct E0 ⊆ E1 ⊆ E2....
We take E = ∪Ei . Then E is a field extension of F.
E is also algebraically closed.
Ayan Sengupta March 15, 2015 9 / 16
Inductively, we construct E0 ⊆ E1 ⊆ E2....
We take E = ∪Ei . Then E is a field extension of F.
E is also algebraically closed.
Consider E = {u ∈ E|u is algebraic over F}.
Ayan Sengupta March 15, 2015 9 / 16
Inductively, we construct E0 ⊆ E1 ⊆ E2....
We take E = ∪Ei . Then E is a field extension of F.
E is also algebraically closed.
Consider E = {u ∈ E|u is algebraic over F}. We will show that E is an
algebraic extension of F (which is clear from our construction) and it is
algebraically closed.
Ayan Sengupta March 15, 2015 9 / 16
Uniqueness of Algebraic Closure
Theorem
If Ω is an algebraically closed field containing F, and let E be an algebraic
extension of F. Then there exists an F-homomorphism from E → Ω.
Moreover, if E is algebraically closed then this homomorphism is an
isomorphism.
Proof :
Consider the inclusion map σ : F → Ω
Ayan Sengupta March 15, 2015 10 / 16
Uniqueness of Algebraic Closure
Theorem
If Ω is an algebraically closed field containing F, and let E be an algebraic
extension of F. Then there exists an F-homomorphism from E → Ω.
Moreover, if E is algebraically closed then this homomorphism is an
isomorphism.
Proof :
Consider the inclusion map σ : F → Ω
Now, if E = F[α1, α2, ...αn] then, we can construct our F-homomorphism
¯σ as follows:
for each αi take the minimal polynomial over F. Let αi is a root of the
minimal polynomial in Ω then ¯σ(αi ) = αi
Ayan Sengupta March 15, 2015 10 / 16
Uniqueness of Algebraic Closure
Theorem
If Ω is an algebraically closed field containing F, and let E be an algebraic
extension of F. Then there exists an F-homomorphism from E → Ω.
Moreover, if E is algebraically closed then this homomorphism is an
isomorphism.
Proof :
Consider the inclusion map σ : F → Ω
Now, if E = F[α1, α2, ...αn] then, we can construct our F-homomorphism
¯σ as follows:
for each αi take the minimal polynomial over F. Let αi is a root of the
minimal polynomial in Ω then ¯σ(αi ) = αi
It is clear that this procedure will give us a homomorphism ¯σ : E → Ω
such that ¯σ|F = σ.
Ayan Sengupta March 15, 2015 10 / 16
Uniqueness of Algebraic Closure
For general case,
Let S be the set of all fields M, F ⊆ M ⊆ E along with the corresponding
F-homomorphism (M, σM) and let the partial ordering be
(M, σM) ≤R (N, σN) if M ⊆ N and σN|M = σM.
Now take a totally ordered subset T of S.
M = ∪M∈T M is a field containing F and we define the corresponding
F-homomorphism, σM as follows:
if a ∈ M is in Mi , then σM (a) = σMi
(a). Hence, (M , σM ) is an upper
bound of T.
Hence, Zorn’s lemma implies that S has a maximal element (Mmax , σMmax ).
Claim : Mmax = E.
Ayan Sengupta March 15, 2015 11 / 16
Uniqueness of Algebraic Closure
For general case,
Let S be the set of all fields M, F ⊆ M ⊆ E along with the corresponding
F-homomorphism (M, σM) and let the partial ordering be
(M, σM) ≤R (N, σN) if M ⊆ N and σN|M = σM.
Now take a totally ordered subset T of S.
M = ∪M∈T M is a field containing F and we define the corresponding
F-homomorphism, σM as follows:
if a ∈ M is in Mi , then σM (a) = σMi
(a). Hence, (M , σM ) is an upper
bound of T.
Hence, Zorn’s lemma implies that S has a maximal element (Mmax , σMmax ).
Claim : Mmax = E.
Proof :
Ayan Sengupta March 15, 2015 11 / 16
Uniqueness of Algebraic Closure
If E is algebraically closed, then ¯σ : E → Ω is an isomorphism.
Ayan Sengupta March 15, 2015 12 / 16
Any Questions ?
Ayan Sengupta March 15, 2015 13 / 16
References
J.S.Milne (2012)
Fields and Galois Theory
Patrick Morandi (2004)
Artin’s Construction of an Algebraic Closure
Ayan Sengupta March 15, 2015 14 / 16
Thank you
Ayan Sengupta March 15, 2015 15 / 16

Más contenido relacionado

La actualidad más candente

La actualidad más candente (8)

resource management
  resource management  resource management
resource management
 
LeetCode Solutions In Java .pdf
LeetCode Solutions In Java .pdfLeetCode Solutions In Java .pdf
LeetCode Solutions In Java .pdf
 
Secure electronic transaction (set)
Secure electronic transaction (set)Secure electronic transaction (set)
Secure electronic transaction (set)
 
Database ,7 query localization
Database ,7 query localizationDatabase ,7 query localization
Database ,7 query localization
 
Trace Scheduling
Trace SchedulingTrace Scheduling
Trace Scheduling
 
Pgp
PgpPgp
Pgp
 
Identity Based Encryption
Identity Based EncryptionIdentity Based Encryption
Identity Based Encryption
 
The rsa algorithm JooSeok Song
The rsa algorithm JooSeok SongThe rsa algorithm JooSeok Song
The rsa algorithm JooSeok Song
 

Similar a Existence and Uniqueness of Algebraic Closure

2. Solutions_to_Atiyah_and_MacDonald
2. Solutions_to_Atiyah_and_MacDonald2. Solutions_to_Atiyah_and_MacDonald
2. Solutions_to_Atiyah_and_MacDonaldNguyễn Loan
 
Measure Theory and important points with booklet
Measure Theory and important points with bookletMeasure Theory and important points with booklet
Measure Theory and important points with bookletNaeemAhmad289736
 
PaperNo10-KaramiHabibiSafariZarrabi-IJCMS
PaperNo10-KaramiHabibiSafariZarrabi-IJCMSPaperNo10-KaramiHabibiSafariZarrabi-IJCMS
PaperNo10-KaramiHabibiSafariZarrabi-IJCMSMezban Habibi
 
Fundamental Theorem of Calculus
Fundamental Theorem of CalculusFundamental Theorem of Calculus
Fundamental Theorem of Calculusgizemk
 
Steiner Tree Parameterized by Treewidth
Steiner Tree Parameterized by TreewidthSteiner Tree Parameterized by Treewidth
Steiner Tree Parameterized by TreewidthASPAK2014
 
Congruence Distributive Varieties With Compact Intersection Property
Congruence Distributive Varieties With Compact Intersection PropertyCongruence Distributive Varieties With Compact Intersection Property
Congruence Distributive Varieties With Compact Intersection Propertyfilipke85
 
Some forms of N-closed Maps in supra Topological spaces
Some forms of N-closed Maps in supra Topological spacesSome forms of N-closed Maps in supra Topological spaces
Some forms of N-closed Maps in supra Topological spacesIOSR Journals
 
PaperNo1-ErshadYousefiHabibi-IJMS
PaperNo1-ErshadYousefiHabibi-IJMSPaperNo1-ErshadYousefiHabibi-IJMS
PaperNo1-ErshadYousefiHabibi-IJMSMezban Habibi
 
the fourier series
the fourier seriesthe fourier series
the fourier seriessafi al amu
 
On The Inverse Function Theorem and its Generalization in the Unitary Space
On The Inverse Function Theorem and its Generalization in the Unitary SpaceOn The Inverse Function Theorem and its Generalization in the Unitary Space
On The Inverse Function Theorem and its Generalization in the Unitary SpaceBRNSS Publication Hub
 
The Chase in Database Theory
The Chase in Database TheoryThe Chase in Database Theory
The Chase in Database TheoryJan Hidders
 
5.6 Function inverse. Dynamic slides.
5.6 Function inverse. Dynamic slides.5.6 Function inverse. Dynamic slides.
5.6 Function inverse. Dynamic slides.Jan Plaza
 
Section 18.3-19.1.Today we will discuss finite-dimensional.docx
Section 18.3-19.1.Today we will discuss finite-dimensional.docxSection 18.3-19.1.Today we will discuss finite-dimensional.docx
Section 18.3-19.1.Today we will discuss finite-dimensional.docxkenjordan97598
 
Section 18.3-19.1.Today we will discuss finite-dimensional.docx
Section 18.3-19.1.Today we will discuss finite-dimensional.docxSection 18.3-19.1.Today we will discuss finite-dimensional.docx
Section 18.3-19.1.Today we will discuss finite-dimensional.docxrtodd280
 
Tychonoff's theorem.pdf
Tychonoff's theorem.pdfTychonoff's theorem.pdf
Tychonoff's theorem.pdfgexola9244
 
ON OPTIMALITY OF THE INDEX OF SUM, PRODUCT, MAXIMUM, AND MINIMUM OF FINITE BA...
ON OPTIMALITY OF THE INDEX OF SUM, PRODUCT, MAXIMUM, AND MINIMUM OF FINITE BA...ON OPTIMALITY OF THE INDEX OF SUM, PRODUCT, MAXIMUM, AND MINIMUM OF FINITE BA...
ON OPTIMALITY OF THE INDEX OF SUM, PRODUCT, MAXIMUM, AND MINIMUM OF FINITE BA...UniversitasGadjahMada
 

Similar a Existence and Uniqueness of Algebraic Closure (20)

2. Solutions_to_Atiyah_and_MacDonald
2. Solutions_to_Atiyah_and_MacDonald2. Solutions_to_Atiyah_and_MacDonald
2. Solutions_to_Atiyah_and_MacDonald
 
Measure Theory and important points with booklet
Measure Theory and important points with bookletMeasure Theory and important points with booklet
Measure Theory and important points with booklet
 
PaperNo10-KaramiHabibiSafariZarrabi-IJCMS
PaperNo10-KaramiHabibiSafariZarrabi-IJCMSPaperNo10-KaramiHabibiSafariZarrabi-IJCMS
PaperNo10-KaramiHabibiSafariZarrabi-IJCMS
 
Fundamental Theorem of Calculus
Fundamental Theorem of CalculusFundamental Theorem of Calculus
Fundamental Theorem of Calculus
 
Steiner Tree Parameterized by Treewidth
Steiner Tree Parameterized by TreewidthSteiner Tree Parameterized by Treewidth
Steiner Tree Parameterized by Treewidth
 
Congruence Distributive Varieties With Compact Intersection Property
Congruence Distributive Varieties With Compact Intersection PropertyCongruence Distributive Varieties With Compact Intersection Property
Congruence Distributive Varieties With Compact Intersection Property
 
Some forms of N-closed Maps in supra Topological spaces
Some forms of N-closed Maps in supra Topological spacesSome forms of N-closed Maps in supra Topological spaces
Some forms of N-closed Maps in supra Topological spaces
 
PaperNo1-ErshadYousefiHabibi-IJMS
PaperNo1-ErshadYousefiHabibi-IJMSPaperNo1-ErshadYousefiHabibi-IJMS
PaperNo1-ErshadYousefiHabibi-IJMS
 
the fourier series
the fourier seriesthe fourier series
the fourier series
 
On The Inverse Function Theorem and its Generalization in the Unitary Space
On The Inverse Function Theorem and its Generalization in the Unitary SpaceOn The Inverse Function Theorem and its Generalization in the Unitary Space
On The Inverse Function Theorem and its Generalization in the Unitary Space
 
The Chase in Database Theory
The Chase in Database TheoryThe Chase in Database Theory
The Chase in Database Theory
 
03 propsem
03 propsem03 propsem
03 propsem
 
5.6 Function inverse. Dynamic slides.
5.6 Function inverse. Dynamic slides.5.6 Function inverse. Dynamic slides.
5.6 Function inverse. Dynamic slides.
 
Supremum And Infimum
Supremum And InfimumSupremum And Infimum
Supremum And Infimum
 
Taylor series
Taylor seriesTaylor series
Taylor series
 
Section 18.3-19.1.Today we will discuss finite-dimensional.docx
Section 18.3-19.1.Today we will discuss finite-dimensional.docxSection 18.3-19.1.Today we will discuss finite-dimensional.docx
Section 18.3-19.1.Today we will discuss finite-dimensional.docx
 
Section 18.3-19.1.Today we will discuss finite-dimensional.docx
Section 18.3-19.1.Today we will discuss finite-dimensional.docxSection 18.3-19.1.Today we will discuss finite-dimensional.docx
Section 18.3-19.1.Today we will discuss finite-dimensional.docx
 
Tychonoff's theorem.pdf
Tychonoff's theorem.pdfTychonoff's theorem.pdf
Tychonoff's theorem.pdf
 
ON OPTIMALITY OF THE INDEX OF SUM, PRODUCT, MAXIMUM, AND MINIMUM OF FINITE BA...
ON OPTIMALITY OF THE INDEX OF SUM, PRODUCT, MAXIMUM, AND MINIMUM OF FINITE BA...ON OPTIMALITY OF THE INDEX OF SUM, PRODUCT, MAXIMUM, AND MINIMUM OF FINITE BA...
ON OPTIMALITY OF THE INDEX OF SUM, PRODUCT, MAXIMUM, AND MINIMUM OF FINITE BA...
 
smtlecture.7
smtlecture.7smtlecture.7
smtlecture.7
 

Más de Ayan Sengupta

Elliptic Curve Cryptography: Arithmetic behind
Elliptic Curve Cryptography: Arithmetic behindElliptic Curve Cryptography: Arithmetic behind
Elliptic Curve Cryptography: Arithmetic behindAyan Sengupta
 
Pricing of Apple iPhone
Pricing of Apple iPhonePricing of Apple iPhone
Pricing of Apple iPhoneAyan Sengupta
 
Applications of Machine Learning in High Frequency Trading
Applications of Machine Learning in High Frequency TradingApplications of Machine Learning in High Frequency Trading
Applications of Machine Learning in High Frequency TradingAyan Sengupta
 
Case Study on Housing.com
Case Study on Housing.comCase Study on Housing.com
Case Study on Housing.comAyan Sengupta
 
Cab travel time prediction using ensemble models
Cab travel time prediction using ensemble modelsCab travel time prediction using ensemble models
Cab travel time prediction using ensemble modelsAyan Sengupta
 
Nike Stock Pitch: Analysis and Valuation
Nike Stock Pitch: Analysis and ValuationNike Stock Pitch: Analysis and Valuation
Nike Stock Pitch: Analysis and ValuationAyan Sengupta
 
2-Approximation Algorithm of Semi-Matching Problem
2-Approximation Algorithm of Semi-Matching Problem2-Approximation Algorithm of Semi-Matching Problem
2-Approximation Algorithm of Semi-Matching ProblemAyan Sengupta
 

Más de Ayan Sengupta (7)

Elliptic Curve Cryptography: Arithmetic behind
Elliptic Curve Cryptography: Arithmetic behindElliptic Curve Cryptography: Arithmetic behind
Elliptic Curve Cryptography: Arithmetic behind
 
Pricing of Apple iPhone
Pricing of Apple iPhonePricing of Apple iPhone
Pricing of Apple iPhone
 
Applications of Machine Learning in High Frequency Trading
Applications of Machine Learning in High Frequency TradingApplications of Machine Learning in High Frequency Trading
Applications of Machine Learning in High Frequency Trading
 
Case Study on Housing.com
Case Study on Housing.comCase Study on Housing.com
Case Study on Housing.com
 
Cab travel time prediction using ensemble models
Cab travel time prediction using ensemble modelsCab travel time prediction using ensemble models
Cab travel time prediction using ensemble models
 
Nike Stock Pitch: Analysis and Valuation
Nike Stock Pitch: Analysis and ValuationNike Stock Pitch: Analysis and Valuation
Nike Stock Pitch: Analysis and Valuation
 
2-Approximation Algorithm of Semi-Matching Problem
2-Approximation Algorithm of Semi-Matching Problem2-Approximation Algorithm of Semi-Matching Problem
2-Approximation Algorithm of Semi-Matching Problem
 

Último

User Guide: Orion™ Weather Station (Columbia Weather Systems)
User Guide: Orion™ Weather Station (Columbia Weather Systems)User Guide: Orion™ Weather Station (Columbia Weather Systems)
User Guide: Orion™ Weather Station (Columbia Weather Systems)Columbia Weather Systems
 
GenBio2 - Lesson 1 - Introduction to Genetics.pptx
GenBio2 - Lesson 1 - Introduction to Genetics.pptxGenBio2 - Lesson 1 - Introduction to Genetics.pptx
GenBio2 - Lesson 1 - Introduction to Genetics.pptxBerniceCayabyab1
 
Microphone- characteristics,carbon microphone, dynamic microphone.pptx
Microphone- characteristics,carbon microphone, dynamic microphone.pptxMicrophone- characteristics,carbon microphone, dynamic microphone.pptx
Microphone- characteristics,carbon microphone, dynamic microphone.pptxpriyankatabhane
 
Citronella presentation SlideShare mani upadhyay
Citronella presentation SlideShare mani upadhyayCitronella presentation SlideShare mani upadhyay
Citronella presentation SlideShare mani upadhyayupadhyaymani499
 
FREE NURSING BUNDLE FOR NURSES.PDF by na
FREE NURSING BUNDLE FOR NURSES.PDF by naFREE NURSING BUNDLE FOR NURSES.PDF by na
FREE NURSING BUNDLE FOR NURSES.PDF by naJASISJULIANOELYNV
 
Microteaching on terms used in filtration .Pharmaceutical Engineering
Microteaching on terms used in filtration .Pharmaceutical EngineeringMicroteaching on terms used in filtration .Pharmaceutical Engineering
Microteaching on terms used in filtration .Pharmaceutical EngineeringPrajakta Shinde
 
Pests of Bengal gram_Identification_Dr.UPR.pdf
Pests of Bengal gram_Identification_Dr.UPR.pdfPests of Bengal gram_Identification_Dr.UPR.pdf
Pests of Bengal gram_Identification_Dr.UPR.pdfPirithiRaju
 
REVISTA DE BIOLOGIA E CIÊNCIAS DA TERRA ISSN 1519-5228 - Artigo_Bioterra_V24_...
REVISTA DE BIOLOGIA E CIÊNCIAS DA TERRA ISSN 1519-5228 - Artigo_Bioterra_V24_...REVISTA DE BIOLOGIA E CIÊNCIAS DA TERRA ISSN 1519-5228 - Artigo_Bioterra_V24_...
REVISTA DE BIOLOGIA E CIÊNCIAS DA TERRA ISSN 1519-5228 - Artigo_Bioterra_V24_...Universidade Federal de Sergipe - UFS
 
Call Girls In Nihal Vihar Delhi ❤️8860477959 Looking Escorts In 24/7 Delhi NCR
Call Girls In Nihal Vihar Delhi ❤️8860477959 Looking Escorts In 24/7 Delhi NCRCall Girls In Nihal Vihar Delhi ❤️8860477959 Looking Escorts In 24/7 Delhi NCR
Call Girls In Nihal Vihar Delhi ❤️8860477959 Looking Escorts In 24/7 Delhi NCRlizamodels9
 
Good agricultural practices 3rd year bpharm. herbal drug technology .pptx
Good agricultural practices 3rd year bpharm. herbal drug technology .pptxGood agricultural practices 3rd year bpharm. herbal drug technology .pptx
Good agricultural practices 3rd year bpharm. herbal drug technology .pptxSimeonChristian
 
LIGHT-PHENOMENA-BY-CABUALDIONALDOPANOGANCADIENTE-CONDEZA (1).pptx
LIGHT-PHENOMENA-BY-CABUALDIONALDOPANOGANCADIENTE-CONDEZA (1).pptxLIGHT-PHENOMENA-BY-CABUALDIONALDOPANOGANCADIENTE-CONDEZA (1).pptx
LIGHT-PHENOMENA-BY-CABUALDIONALDOPANOGANCADIENTE-CONDEZA (1).pptxmalonesandreagweneth
 
Vision and reflection on Mining Software Repositories research in 2024
Vision and reflection on Mining Software Repositories research in 2024Vision and reflection on Mining Software Repositories research in 2024
Vision and reflection on Mining Software Repositories research in 2024AyushiRastogi48
 
Pests of safflower_Binomics_Identification_Dr.UPR.pdf
Pests of safflower_Binomics_Identification_Dr.UPR.pdfPests of safflower_Binomics_Identification_Dr.UPR.pdf
Pests of safflower_Binomics_Identification_Dr.UPR.pdfPirithiRaju
 
User Guide: Magellan MX™ Weather Station
User Guide: Magellan MX™ Weather StationUser Guide: Magellan MX™ Weather Station
User Guide: Magellan MX™ Weather StationColumbia Weather Systems
 
Transposable elements in prokaryotes.ppt
Transposable elements in prokaryotes.pptTransposable elements in prokaryotes.ppt
Transposable elements in prokaryotes.pptArshadWarsi13
 
Environmental Biotechnology Topic:- Microbial Biosensor
Environmental Biotechnology Topic:- Microbial BiosensorEnvironmental Biotechnology Topic:- Microbial Biosensor
Environmental Biotechnology Topic:- Microbial Biosensorsonawaneprad
 
Harmful and Useful Microorganisms Presentation
Harmful and Useful Microorganisms PresentationHarmful and Useful Microorganisms Presentation
Harmful and Useful Microorganisms Presentationtahreemzahra82
 
Base editing, prime editing, Cas13 & RNA editing and organelle base editing
Base editing, prime editing, Cas13 & RNA editing and organelle base editingBase editing, prime editing, Cas13 & RNA editing and organelle base editing
Base editing, prime editing, Cas13 & RNA editing and organelle base editingNetHelix
 
Bioteknologi kelas 10 kumer smapsa .pptx
Bioteknologi kelas 10 kumer smapsa .pptxBioteknologi kelas 10 kumer smapsa .pptx
Bioteknologi kelas 10 kumer smapsa .pptx023NiWayanAnggiSriWa
 
THE ROLE OF PHARMACOGNOSY IN TRADITIONAL AND MODERN SYSTEM OF MEDICINE.pptx
THE ROLE OF PHARMACOGNOSY IN TRADITIONAL AND MODERN SYSTEM OF MEDICINE.pptxTHE ROLE OF PHARMACOGNOSY IN TRADITIONAL AND MODERN SYSTEM OF MEDICINE.pptx
THE ROLE OF PHARMACOGNOSY IN TRADITIONAL AND MODERN SYSTEM OF MEDICINE.pptxNandakishor Bhaurao Deshmukh
 

Último (20)

User Guide: Orion™ Weather Station (Columbia Weather Systems)
User Guide: Orion™ Weather Station (Columbia Weather Systems)User Guide: Orion™ Weather Station (Columbia Weather Systems)
User Guide: Orion™ Weather Station (Columbia Weather Systems)
 
GenBio2 - Lesson 1 - Introduction to Genetics.pptx
GenBio2 - Lesson 1 - Introduction to Genetics.pptxGenBio2 - Lesson 1 - Introduction to Genetics.pptx
GenBio2 - Lesson 1 - Introduction to Genetics.pptx
 
Microphone- characteristics,carbon microphone, dynamic microphone.pptx
Microphone- characteristics,carbon microphone, dynamic microphone.pptxMicrophone- characteristics,carbon microphone, dynamic microphone.pptx
Microphone- characteristics,carbon microphone, dynamic microphone.pptx
 
Citronella presentation SlideShare mani upadhyay
Citronella presentation SlideShare mani upadhyayCitronella presentation SlideShare mani upadhyay
Citronella presentation SlideShare mani upadhyay
 
FREE NURSING BUNDLE FOR NURSES.PDF by na
FREE NURSING BUNDLE FOR NURSES.PDF by naFREE NURSING BUNDLE FOR NURSES.PDF by na
FREE NURSING BUNDLE FOR NURSES.PDF by na
 
Microteaching on terms used in filtration .Pharmaceutical Engineering
Microteaching on terms used in filtration .Pharmaceutical EngineeringMicroteaching on terms used in filtration .Pharmaceutical Engineering
Microteaching on terms used in filtration .Pharmaceutical Engineering
 
Pests of Bengal gram_Identification_Dr.UPR.pdf
Pests of Bengal gram_Identification_Dr.UPR.pdfPests of Bengal gram_Identification_Dr.UPR.pdf
Pests of Bengal gram_Identification_Dr.UPR.pdf
 
REVISTA DE BIOLOGIA E CIÊNCIAS DA TERRA ISSN 1519-5228 - Artigo_Bioterra_V24_...
REVISTA DE BIOLOGIA E CIÊNCIAS DA TERRA ISSN 1519-5228 - Artigo_Bioterra_V24_...REVISTA DE BIOLOGIA E CIÊNCIAS DA TERRA ISSN 1519-5228 - Artigo_Bioterra_V24_...
REVISTA DE BIOLOGIA E CIÊNCIAS DA TERRA ISSN 1519-5228 - Artigo_Bioterra_V24_...
 
Call Girls In Nihal Vihar Delhi ❤️8860477959 Looking Escorts In 24/7 Delhi NCR
Call Girls In Nihal Vihar Delhi ❤️8860477959 Looking Escorts In 24/7 Delhi NCRCall Girls In Nihal Vihar Delhi ❤️8860477959 Looking Escorts In 24/7 Delhi NCR
Call Girls In Nihal Vihar Delhi ❤️8860477959 Looking Escorts In 24/7 Delhi NCR
 
Good agricultural practices 3rd year bpharm. herbal drug technology .pptx
Good agricultural practices 3rd year bpharm. herbal drug technology .pptxGood agricultural practices 3rd year bpharm. herbal drug technology .pptx
Good agricultural practices 3rd year bpharm. herbal drug technology .pptx
 
LIGHT-PHENOMENA-BY-CABUALDIONALDOPANOGANCADIENTE-CONDEZA (1).pptx
LIGHT-PHENOMENA-BY-CABUALDIONALDOPANOGANCADIENTE-CONDEZA (1).pptxLIGHT-PHENOMENA-BY-CABUALDIONALDOPANOGANCADIENTE-CONDEZA (1).pptx
LIGHT-PHENOMENA-BY-CABUALDIONALDOPANOGANCADIENTE-CONDEZA (1).pptx
 
Vision and reflection on Mining Software Repositories research in 2024
Vision and reflection on Mining Software Repositories research in 2024Vision and reflection on Mining Software Repositories research in 2024
Vision and reflection on Mining Software Repositories research in 2024
 
Pests of safflower_Binomics_Identification_Dr.UPR.pdf
Pests of safflower_Binomics_Identification_Dr.UPR.pdfPests of safflower_Binomics_Identification_Dr.UPR.pdf
Pests of safflower_Binomics_Identification_Dr.UPR.pdf
 
User Guide: Magellan MX™ Weather Station
User Guide: Magellan MX™ Weather StationUser Guide: Magellan MX™ Weather Station
User Guide: Magellan MX™ Weather Station
 
Transposable elements in prokaryotes.ppt
Transposable elements in prokaryotes.pptTransposable elements in prokaryotes.ppt
Transposable elements in prokaryotes.ppt
 
Environmental Biotechnology Topic:- Microbial Biosensor
Environmental Biotechnology Topic:- Microbial BiosensorEnvironmental Biotechnology Topic:- Microbial Biosensor
Environmental Biotechnology Topic:- Microbial Biosensor
 
Harmful and Useful Microorganisms Presentation
Harmful and Useful Microorganisms PresentationHarmful and Useful Microorganisms Presentation
Harmful and Useful Microorganisms Presentation
 
Base editing, prime editing, Cas13 & RNA editing and organelle base editing
Base editing, prime editing, Cas13 & RNA editing and organelle base editingBase editing, prime editing, Cas13 & RNA editing and organelle base editing
Base editing, prime editing, Cas13 & RNA editing and organelle base editing
 
Bioteknologi kelas 10 kumer smapsa .pptx
Bioteknologi kelas 10 kumer smapsa .pptxBioteknologi kelas 10 kumer smapsa .pptx
Bioteknologi kelas 10 kumer smapsa .pptx
 
THE ROLE OF PHARMACOGNOSY IN TRADITIONAL AND MODERN SYSTEM OF MEDICINE.pptx
THE ROLE OF PHARMACOGNOSY IN TRADITIONAL AND MODERN SYSTEM OF MEDICINE.pptxTHE ROLE OF PHARMACOGNOSY IN TRADITIONAL AND MODERN SYSTEM OF MEDICINE.pptx
THE ROLE OF PHARMACOGNOSY IN TRADITIONAL AND MODERN SYSTEM OF MEDICINE.pptx
 

Existence and Uniqueness of Algebraic Closure

  • 1. Existence and Uniqueness of Algebraic Closure: Artin’s Proof Ayan Sengupta March 15, 2015 Ayan Sengupta March 15, 2015 1 / 16
  • 2. Recall A relation ≤R on a set S is called partial ordering if a ≤R b and b ≤R a =⇒ a = b ∀a, b ∈ S a ≤R b and b ≤R c =⇒ a ≤R c ∀a, b, c ∈ S Ayan Sengupta March 15, 2015 2 / 16
  • 3. Recall A relation ≤R on a set S is called partial ordering if a ≤R b and b ≤R a =⇒ a = b ∀a, b ∈ S a ≤R b and b ≤R c =⇒ a ≤R c ∀a, b, c ∈ S A subset T of a partially ordered set S is called Totally ordered if ∀s, t ∈ T s ≤R t or, t ≤R s. Ayan Sengupta March 15, 2015 2 / 16
  • 4. Recall A relation ≤R on a set S is called partial ordering if a ≤R b and b ≤R a =⇒ a = b ∀a, b ∈ S a ≤R b and b ≤R c =⇒ a ≤R c ∀a, b, c ∈ S A subset T of a partially ordered set S is called Totally ordered if ∀s, t ∈ T s ≤R t or, t ≤R s. An upper bound of a totally ordered subset T of a partially ordered set (S, ≤R) is an element s ∈ S such that t ≤R s ∀t ∈ T. Ayan Sengupta March 15, 2015 2 / 16
  • 5. Recall A relation ≤R on a set S is called partial ordering if a ≤R b and b ≤R a =⇒ a = b ∀a, b ∈ S a ≤R b and b ≤R c =⇒ a ≤R c ∀a, b, c ∈ S A subset T of a partially ordered set S is called Totally ordered if ∀s, t ∈ T s ≤R t or, t ≤R s. An upper bound of a totally ordered subset T of a partially ordered set (S, ≤R) is an element s ∈ S such that t ≤R s ∀t ∈ T. A maximal element of (S, ≤R) is an element s ∈ S such that s ≤R s =⇒ s = s . Ayan Sengupta March 15, 2015 2 / 16
  • 6. Zorn’s Lemma Zorn’s Lemma If every totally ordered subset of (S, ≤R) has an upper bound, then S has a maximal element. Ayan Sengupta March 15, 2015 3 / 16
  • 7. Zorn’s Lemma Corollary 1 Every commutative ring R has a maximal ideal M. Proof : Straight forward! Take the partially ordered set to be S, the set of all proper ideals of R with the ordering ⊆. Take any chain of ideals (totally ordered subset) of R - I0 ⊆ I1 ⊆ I2.... It can easily verified that I = ∪Ii =< 1 > is a proper ideal of R and every Ii ⊆ I.Hence, I is an upper bound of the chain in S.Hence, Zorn’s lemma implies that S has a maximal element i.e. a maximal ideal in R. Ayan Sengupta March 15, 2015 4 / 16
  • 8. Some Definitions Definition : Algebraically Closed Field every f (x) ∈ F[x] of degree ≥ 1 has a root in F. Quick fact : To show a field algebraically closed it is sufficient to show that every monic polynomial over it has a root in it. Ayan Sengupta March 15, 2015 5 / 16
  • 9. Some Definitions Definition : Algebraically Closed Field every f (x) ∈ F[x] of degree ≥ 1 has a root in F. Quick fact : To show a field algebraically closed it is sufficient to show that every monic polynomial over it has a root in it. Definition : Algebraic Closure E ⊇ F is said to be algebraic closure of F if E is algebraic over F and E is algebraically closed. e.g. - C is the algebraic closure of R. Ayan Sengupta March 15, 2015 5 / 16
  • 10. Theorem (Proposition 1) Every field F has an algebraic closure which is unique upto isomorphism. Proof : This proof was constructed by Emil Artin. Ayan Sengupta March 15, 2015 6 / 16
  • 11. Existence of Algebraic Closure S = {f (x) ∈ F[x]| f is monic }. For each element f (x) in S we assign an indeterminant xf . Consider the ring F[S], the polynomial ring with indeterminants xf . Consider the ideal I =< f (xf ) >f ∈S in F[S]. Ayan Sengupta March 15, 2015 7 / 16
  • 12. Existence of Algebraic Closure S = {f (x) ∈ F[x]| f is monic }. For each element f (x) in S we assign an indeterminant xf . Consider the ring F[S], the polynomial ring with indeterminants xf . Consider the ideal I =< f (xf ) >f ∈S in F[S]. Claim : I =< 1 >. Ayan Sengupta March 15, 2015 7 / 16
  • 13. Existence of Algebraic Closure S = {f (x) ∈ F[x]| f is monic }. For each element f (x) in S we assign an indeterminant xf . Consider the ring F[S], the polynomial ring with indeterminants xf . Consider the ideal I =< f (xf ) >f ∈S in F[S]. Claim : I =< 1 >. Suppose I =< 1 >. Then r i=1 gi .fki (xfki ) = 1 (1) for some indexing ki and gi ∈ F[S]. Now, we have r polynomials fki for i = 1, 2, ...r. Take F0 = F[S]. If fk1 is irreducible in F0 then take F1 = F0/ < fk1 >. Else F1 = F0. In this way we can generate Fr such that every polynomial fk1 , fk2 , ...fkr has a root in it. Ayan Sengupta March 15, 2015 7 / 16
  • 14. Existence of Algebraic Closure Precisely, if the image of xfki in Fi−1[S]/ < fki > is ¯xfki , then f ( ¯xfki ) = ¯f (xfki ) = 0 in Fi . In Fr , if we substitute xfki by ¯xfki in equation (1) then we get 1 = r i=1 gi .fki ( ¯xfki ) = 0 (2) Ayan Sengupta March 15, 2015 8 / 16
  • 15. Existence of Algebraic Closure Precisely, if the image of xfki in Fi−1[S]/ < fki > is ¯xfki , then f ( ¯xfki ) = ¯f (xfki ) = 0 in Fi . In Fr , if we substitute xfki by ¯xfki in equation (1) then we get 1 = r i=1 gi .fki ( ¯xfki ) = 0 (2) contradiction. Hence our claim is verified. Now, as I = 1 we can conclude from the above corollary that some maximal ideal m of F[S] contains I. Ayan Sengupta March 15, 2015 8 / 16
  • 16. Existence of Algebraic Closure Precisely, if the image of xfki in Fi−1[S]/ < fki > is ¯xfki , then f ( ¯xfki ) = ¯f (xfki ) = 0 in Fi . In Fr , if we substitute xfki by ¯xfki in equation (1) then we get 1 = r i=1 gi .fki ( ¯xfki ) = 0 (2) contradiction. Hence our claim is verified. Now, as I = 1 we can conclude from the above corollary that some maximal ideal m of F[S] contains I. Now we take E0 = F[S] and E1 = E0/m. Ayan Sengupta March 15, 2015 8 / 16
  • 17. Existence of Algebraic Closure Precisely, if the image of xfki in Fi−1[S]/ < fki > is ¯xfki , then f ( ¯xfki ) = ¯f (xfki ) = 0 in Fi . In Fr , if we substitute xfki by ¯xfki in equation (1) then we get 1 = r i=1 gi .fki ( ¯xfki ) = 0 (2) contradiction. Hence our claim is verified. Now, as I = 1 we can conclude from the above corollary that some maximal ideal m of F[S] contains I. Now we take E0 = F[S] and E1 = E0/m. In E1 every f (x) ∈ S has a root. Moreover, in E1 every f (x) ∈ F[x] has a root. (Precisely, roots are ¯xf ) Ayan Sengupta March 15, 2015 8 / 16
  • 18. Inductively, we construct E0 ⊆ E1 ⊆ E2.... We take E = ∪Ei . Then E is a field extension of F. Ayan Sengupta March 15, 2015 9 / 16
  • 19. Inductively, we construct E0 ⊆ E1 ⊆ E2.... We take E = ∪Ei . Then E is a field extension of F. E is also algebraically closed. Ayan Sengupta March 15, 2015 9 / 16
  • 20. Inductively, we construct E0 ⊆ E1 ⊆ E2.... We take E = ∪Ei . Then E is a field extension of F. E is also algebraically closed. Consider E = {u ∈ E|u is algebraic over F}. Ayan Sengupta March 15, 2015 9 / 16
  • 21. Inductively, we construct E0 ⊆ E1 ⊆ E2.... We take E = ∪Ei . Then E is a field extension of F. E is also algebraically closed. Consider E = {u ∈ E|u is algebraic over F}. We will show that E is an algebraic extension of F (which is clear from our construction) and it is algebraically closed. Ayan Sengupta March 15, 2015 9 / 16
  • 22. Uniqueness of Algebraic Closure Theorem If Ω is an algebraically closed field containing F, and let E be an algebraic extension of F. Then there exists an F-homomorphism from E → Ω. Moreover, if E is algebraically closed then this homomorphism is an isomorphism. Proof : Consider the inclusion map σ : F → Ω Ayan Sengupta March 15, 2015 10 / 16
  • 23. Uniqueness of Algebraic Closure Theorem If Ω is an algebraically closed field containing F, and let E be an algebraic extension of F. Then there exists an F-homomorphism from E → Ω. Moreover, if E is algebraically closed then this homomorphism is an isomorphism. Proof : Consider the inclusion map σ : F → Ω Now, if E = F[α1, α2, ...αn] then, we can construct our F-homomorphism ¯σ as follows: for each αi take the minimal polynomial over F. Let αi is a root of the minimal polynomial in Ω then ¯σ(αi ) = αi Ayan Sengupta March 15, 2015 10 / 16
  • 24. Uniqueness of Algebraic Closure Theorem If Ω is an algebraically closed field containing F, and let E be an algebraic extension of F. Then there exists an F-homomorphism from E → Ω. Moreover, if E is algebraically closed then this homomorphism is an isomorphism. Proof : Consider the inclusion map σ : F → Ω Now, if E = F[α1, α2, ...αn] then, we can construct our F-homomorphism ¯σ as follows: for each αi take the minimal polynomial over F. Let αi is a root of the minimal polynomial in Ω then ¯σ(αi ) = αi It is clear that this procedure will give us a homomorphism ¯σ : E → Ω such that ¯σ|F = σ. Ayan Sengupta March 15, 2015 10 / 16
  • 25. Uniqueness of Algebraic Closure For general case, Let S be the set of all fields M, F ⊆ M ⊆ E along with the corresponding F-homomorphism (M, σM) and let the partial ordering be (M, σM) ≤R (N, σN) if M ⊆ N and σN|M = σM. Now take a totally ordered subset T of S. M = ∪M∈T M is a field containing F and we define the corresponding F-homomorphism, σM as follows: if a ∈ M is in Mi , then σM (a) = σMi (a). Hence, (M , σM ) is an upper bound of T. Hence, Zorn’s lemma implies that S has a maximal element (Mmax , σMmax ). Claim : Mmax = E. Ayan Sengupta March 15, 2015 11 / 16
  • 26. Uniqueness of Algebraic Closure For general case, Let S be the set of all fields M, F ⊆ M ⊆ E along with the corresponding F-homomorphism (M, σM) and let the partial ordering be (M, σM) ≤R (N, σN) if M ⊆ N and σN|M = σM. Now take a totally ordered subset T of S. M = ∪M∈T M is a field containing F and we define the corresponding F-homomorphism, σM as follows: if a ∈ M is in Mi , then σM (a) = σMi (a). Hence, (M , σM ) is an upper bound of T. Hence, Zorn’s lemma implies that S has a maximal element (Mmax , σMmax ). Claim : Mmax = E. Proof : Ayan Sengupta March 15, 2015 11 / 16
  • 27. Uniqueness of Algebraic Closure If E is algebraically closed, then ¯σ : E → Ω is an isomorphism. Ayan Sengupta March 15, 2015 12 / 16
  • 28. Any Questions ? Ayan Sengupta March 15, 2015 13 / 16
  • 29. References J.S.Milne (2012) Fields and Galois Theory Patrick Morandi (2004) Artin’s Construction of an Algebraic Closure Ayan Sengupta March 15, 2015 14 / 16
  • 30. Thank you Ayan Sengupta March 15, 2015 15 / 16