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 ∅ ∀A∈P(S),AΔA=∅

To prove that it is associative,

consider F2 , for AΔB,x∈A,x∈B, then x∉AΔ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 x∈A,x∈B, then x∈A∩B. 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 T⊆S, all the subsets of T, P(T)

The duality between Set and Bool

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

f−1:P(Y)→ P(X) is a Boolean Ring homomorphism

So we need to prove that f−1 preserves symmetry difference Δ and intersection

And to prove f−1 preserves symmetry difference Δ ,

we need to prove that f−1 preserves ∪ ∩ and complement

To prove that f−1(A∪B)=f−1(A)∪f−1(B)

We just need to consider the universal property

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

or consider f(x)∈A∪B⇔f(x)∈A∨f(x)∈B

To prove that f−1(A∩B)=f−1(A)∩f−1(B)

f(x)∈A∩B⇔f(x)∈A∧f(x)∈B

As a corollary, A⊆B⇒f−1(A)⊆f−1(B)

Because A⊆B⇔A∩B=A⇔A∪B=B

Consider f:X→Y, we need to prove that f−1(Ac)=f−1(A)c

Because Y=A∪Ac,A∩Ac=∅

So X=f−1(A)∪f−1(Ac),f−1(A)∩f−1(Ac)=∅

Thus f−1(Ac)=f−1(A)c

Or we can prove f−1(A−B)=f−1(A)−f−1(B)

Because f(x)∈A−B⇔f(x)∈A∧f(x)∉B

Thus f−1 preserves Δ and ∩

Because AΔB=(A∪B)∩(A∩B)c

f−1(AΔB)=f−1(A)Δf−1(B),f−1(A∩B)=f−1(A)∩f−1(B), f−1(Y)=X

The kernel of this ring homomorphism is P(Y−imf)

Because f−1 send all the element of Y−imf to ∅, P(Y)P(Y−imf)≅imf−1

 

No comments:

Post a Comment

Popular Posts