Blog Archive

Thursday, May 18, 2023

The inverse function in Set is Boolean Ring homomorphism

Preliminary

We already know that (P(S),Δ,) is a ring. The most efficient way to show it is to consider F2

Firstly, we must prove it is an Abelian Group with Δ.

Obviously, it is close; the identity is AP(S),AΔA=

To prove that it is associative,

consider F2 , for AΔB,xA,xB, then xAΔB

It is just like 1+1=0 in F2 and so on.

Because + in F2 is associative, Δ is also associative

And it is just like × in F2 , if xA,xB, then xAB. Just like 1×1=1 and so on.

The 1 in this ring is S, the biggest set. F2 proves the distributive law,

Actually this Ring is isomorphic to F2n

And The ideal of this ring is for TS, all the subsets of T, P(T)

The duality between Set and Bool

This article aims to prove that f:XY, its inverse, defined as a set value function

f1:P(Y) P(X) is a Boolean Ring homomorphism

So we need to prove that f1 preserves symmetry difference Δ and intersection

And to prove f1 preserves symmetry difference Δ ,

we need to prove that f1 preserves and complement

To prove that f1(AB)=f1(A)f1(B)

We just need to consider the universal property

f=fπ... Then it will be obviously

or consider f(x)ABf(x)Af(x)B

To prove that f1(AB)=f1(A)f1(B)

f(x)ABf(x)Af(x)B

As a corollary, ABf1(A)f1(B)

Because ABAB=AAB=B

Consider f:XY, we need to prove that f1(Ac)=f1(A)c

Because Y=AAc,AAc=

So X=f1(A)f1(Ac),f1(A)f1(Ac)=

Thus f1(Ac)=f1(A)c

Or we can prove f1(AB)=f1(A)f1(B)

Because f(x)ABf(x)Af(x)B

Thus f1 preserves Δ and

Because AΔB=(AB)(AB)c

f1(AΔB)=f1(A)Δf1(B),f1(AB)=f1(A)f1(B), f1(Y)=X

The kernel of this ring homomorphism is P(Yimf)

Because f1 send all the element of Yimf to , P(Y)P(Yimf)imf1

 

No comments:

Post a Comment

Popular Posts