Blog Archive

Sunday, May 5, 2024

Galois Connection: The Initial One and Its Application to Hilbert's Nullstellensatz

The coslice category of field extension and Galois Group

闪烁的春光:法国印象派画家雷诺阿 - 知乎

We already talk about lots of Galois Connections

Math Essays: Galois Connection in various branches (marco-yuze-zheng.blogspot.com)

Math Essays: An example of Galois Connection in module theory (marco-yuze-zheng.blogspot.com)

Math Essays: Categorical Logic 1. disjuction, conjuction, implies, quantifer as adjoint. (marco-yuze-zheng.blogspot.com)

However, we have not talk about the initial one! The Galois Connection in algebraic Galois theory!

In this essay, we will deal with the Galois Connection between subsetes of Gal(K/L) and intermediate field.

The coslice category of field extension and Galois Group

In category of field, the morphism is field extension since the only proper ideal of a field is 0.

Hence if we have a field L, we could consider the coslice category L/Field.

image-20240505094631488

Here the object is ιB:L→B, the morphism is such a h∗(ιB)=ιC​.

In particular, we are interested in the automorphism of a field extension from L.

image-20240505095547869

Definition. The Galois Group of a field extension is defined as Gal(H/L):=AutL/Field(H/L).

This essay will consider the relation between the subset of Gal(K/L) and the intermediate field L⊆M⊆K.

Definition. Let S⊆Gal(K/L) be a subset, define:

(1)F(S):={a∈K|σ(a)=a,∀σ∈S}

Obviously F(S) is a subfield of K​, and L⊆F(S)⊆K. Easy to see that if S⊆S′ then F(S′)⊆F(S).

Similarly, For a intermediate field M we could define:

(2)G(M):=Gal(K/M)

Easy to see that

(3)M⊆M′⟹G(M′)⊆G(M)

Galois Connection in Algebraic Galois theory

Lemma. If S⊆Gal(K/L), then S⊆Gal(K/F(S))=GF(S).

Proof. By definition, GF(S) consists of all the automorphism of K fixed F(S), hence S⊆GF(S).◻

Lemma. FG(M)⊇M.

Proof. By definition, G(M)=Gal(K/M) and FG(M) is the subfield fixed by Gal(K/M).

Since Gal(K/M) is all the automorphism of K that fixed M, FG(M)⊇M.◻​

Proposition. Galois Connection between subset of Gal(K/L) and L⊆M⊆K.

(4)F(S)⊇M⟺S⊆G(M)

Proof.

⟹.

F(S)⊇M⟹GF(S)⊆G(M). According to the lemma, S⊆GF(S)⊆G(M).

⟸.

S⊆G(M)⟹F(S)⊇FG(M). According to the lemma, F(S)⊇FG(M)⊇M.◻

Corollary.

By the property of Galois Connecton, if f(a)≤b⟺a≤g(b). Then

(5)fgf=f,gfg=g

See Math Essays: Galois Connection in various branches (marco-yuze-zheng.blogspot.com)

There exists a poset isomorphism Im(f)≅Im(g).

(6)g:Im(f)→Im(g),f(a)⟼gf(a),f:Im(g)→Im(f),g(b)⟼fg(b)

Since fgf(a)=f(a), fg=IdIm(f). Similarly, gfg(b)=g(b)⟹gf=IdIm(g).

Hence if M=F(S), then FGF(S)=F(S)=M. Similarly, if S=G(M), then GFG(M)=G(M)=S.

Hence there exists a isomorphism between the set of F(S) and G(M).

Galois Connection, redefined.

Proposition. Let f:L→P,g:P→L be two monotone map between poset.

Then f and g form a pair of Galois Connection iff idL≤gf,fg≤idP​.

Proof.

Assume that idL≤gf,fg≤idP,

then f(a)≤b⟹gf(a)≤g(b). Since idL≤gf, a≤gf(a)≤g(b),a≤g(b).

Similarly, a≤g(b)⟹f(a)≤fg(b)≤b,f(a)≤b​. Hence we have

(7)[idL≤gf,fg≤idP]⟹[f(a)≤b⟺a≤g(b)]

Another direction was already proved in Math Essays: Galois Connection in various branches (marco-yuze-zheng.blogspot.com). ◻

Closure operator and Galois Connection

Let (L,≤) be a poset, then a closure operator on L is defined as

(8)x≤c(x),x≤y⟹c(x)≤c(y),c(c(x))=c(x)

By duality, we could define a interior operator as

(9)i(x)≤x,x≤y⟹i(x)≤i(y),i(i(x))=i(x)

Let (L,∧) be a complete semi-lattice and sup(L) exists. Let (S,∧) be a semi-latticeand sup(S) exists.

Let ι:(L,∧)→(S,∧) is a faithful embedding and sup(L)=sup(S).

Then for s∈S, define c(s)=ι(inf{x∈L|ι(x)≥s})​​, easy to see that this form a closure operator.

Similarly, you can use this way to get an interior operator.

From Galois connection to Closure and Interior operator.

As you can see, for a pair of Galois connection f(a)≤b⟺a≤g(b) between P,L, we have

(10)f(x)≤f(x)⟹x≤gf(x),x≤y⟹gf(x)≤gf(y),gfgf(x)=gf(x)

Hence gf:P→P is a closure operator on P. Similarly, fg:L→L is an interior operator on L​​.

From Closure operator to Galois Connection.

Proposition. Let (L,≤) be a poset, and (c(L),≤) be the image of c, where c is a closure operator.

Then c(x)≤y⟺x≤ι(y), here i:c(L)→L,ι(y)=y​.

Proof. c(x)≤y⟹x≤ι(y) is obviously since x≤c(x). If x≤ι(y), then c(x)≤c(ι(y))=ι(y)=y.​

Similarly, we have ι(x)≤y⟺x≤i(y). Between​ (i(L),≤) and (L,≤).

Basic result of Galois Connection

Proposition.

If there exist a pair of Galois Connection F⊣G, (C,⪯),(D,≤) and H⊣K,(D,≤),(E,⊆) , then we get

(11)HF⊣GK,(C,⪯),(E,⊆)

Proof.

The idea is consider F:C→D and K:E→D.

Take any c∈C and e∈E we have F(c)≤K(e)⟺c⪯GK(e) by F⊣G.

Similarly we have F(c)≤K(e)⟺HF(c)⊆e. i.e.

(12)HF(c)⊆e⟺c⪯GK(e)◻

Proposition.

If F⊣G is a pair of Galois connection between (C,⪯),(D,≤), then

†.Gd=sup{c∈C|Fc≤d}​

†. Fc=inf{d∈D|c⪯Gd}

Proof.

By definition of Galois connection, we have Fc≤d⟺c⪯Gd.

Hence we have Gd is an upper bound of {c∈C|Fc≤d}. But also, FGd≤d, hence Gd∈{c∈C|Fc≤d}.

Therefore, Gd is both upper bound and a member of {c∈C|Fc≤d}. Hence Gd is the least upper bound.

Similarly, c⪯Gd⟺Fc≤d , hence we have Fc is a lower bound of {d∈D|c⪯Gd}.

To see Fc is the greatest lower bound, consider c⪯GFc, hence Fc∈{d∈D|c⪯Gd}.

Therefore, Fc is both lower bound and a member of {d∈D|c⪯Gd}. ◻

Another example of Galois Connection.

Let (L,≤) be a partial order set. Let (P(L),⊆) be the power set of L.

For any S⊆L, define Su be the set of upper bound of S, Sl be the set of lower bound of S.

(13)Su:={x∈L|x≥s,∀s∈S},Sl:={x∈L|x≤s,∀s∈S}

Notice that S⊆T⟹Su⊇Tu∧Sl⊇Tl.​

Proposition. (−)u⊣(−)l. i.e. Au⊇B⟺Al⊆B. Whcih is obviously.

Appendix: Using Galois connection to prove Hilbert's Nullstellensatz

Definition.

Fix a natural number n and a field K, consider the polynomial ring K[X1,...,Xn] and affine space Kn​.

Let S⊆K[X1,...,Xn], define V(S)={x∈Kn|f(x)=0∀f∈S}.

Let X⊆Kn, define I(X)={f∈K[X1,...,Xn]|f(x)=0∀x∈X}.

Proposition. Galois Connection between subsets of Kn and ideals of K[X1,...,Xn]

(14)I(X)⊇J⟺X⊆V(J)

Proof.

Assume I(X)⊇J, then let f∈J, ∀x∈X,f(x)=0. Hence x∈X is a common zero of J. Hence X⊆V(J).

Suppose that X⊆V(J), then I(X)⊇IV(J). Since IV(J) is all the polynomial vanishing at V(J), and J vanishing at V(J), I(X)⊇IV(J)⊇J,I(X)⊇J. ◻

Recall that for a pair of Galois Connection f,g, Im(f)≅Im(g).

Since fgf(a)=f(a), fg=IdIm(f). Similarly, gfg(b)=g(b)⟹gf=IdIm(g)​.

Observe that ImI is the set of radical ideal. Since if fn∈I(X) then f∈I(X), and ImV is the set of variety.

Corollary. Hilbert's Nullstellensatz

There exists a order reversed isomorphism between the poset of variety and radical ideal.

No comments:

Post a Comment

Popular Posts