Boolean Rings: System of Switches.

In summary, the book defines a Boolean lattice as a graph which has a vertex set of subsets of the set \{1,2,3,\cdots ,n\) and the rest of the structure is similar to that of a Boolean Algebra. The book defines a semi ring as a graph which has a vertex set of subsets of the set \{1,...,n\} and the rest of the structure is similar to that of a Boolean Algebra. The book defines a semiring as a graph which has a vertex set of subsets of the set \{1,...,n\} and the rest of the structure is similar to that of a Boolean Algebra.
  • #1
Tenshou
153
1
Okay, So I just got done reading and re-reading Chapter one of Introductory Real Analysis by Andrei Kolmogorov and S.V Fomin, I have to say it is a lot easier to read than the symbolic logic book I have. But to the point, There is this section which talks about Boolean Rings and it defines them just as you would define any Boolean Algebra by the intersection of any sets must be in the Algebra(Ring) and the symmetric difference between any two sets must be in the Algebra(Ring).

My problem begins not with the definition, but with the concept of the Boolean Lattice ##BL_n## and n is at least 1. So when you create this Boolean Lattice and it's similar to a Boolean Algebra's/(Ring's) Power Set, right? Also, If it is the power set of The Boolean Algebra(Ring), then would it mean that the ##BL_n## is a semi ring of the Boolean Algebra(Ring), or what? I mean the definition of a semi ring is that, if you take any two subsets of The ring, let's call it ##\mathcal{X}## and take their intersection then, this intersection must be in ##\mathcal{X}##. Furthermore, that ##\mathcal{X}## contains the empty set and all sets can be represented as a finite, or countably infinite cover of that set. Next natural question, is the semi ring ##\mathcal{X}## a powerset?
 
Physics news on Phys.org
  • #2
I'm not really sure what you're asking.

First, you talk about ##BL_n##, what is the definition of this? And what is a semi ring?
 
  • #3
The Boolean lattice? Oh, it is graphs who has a vertex set of subsets of ##\{1,2,3,\cdots , n\}## and the rest of the structure is similar to that of a Boolean Algebra. I am asking two questions, my first one is Is this ##BL_n## similar to the power set of a Boolean ring, and would this make a semi ring, since ##BL_n## contains the null set? I guess my second question is just a restatement of the first but with the definition of a semiring :/
 
  • #4
You define a Boolean lattice as a graph?? No, that can't be right. Do you have a reference?
 
  • #5
Yeah, Graph Theory by J.A Bondy, but I am only trying to equate the Boolean semiring to ##BL_n## and if I can do that I believe that it should be a powerset, if and only if the semiring is a power set and ##BL_n## is a powerset. Maybe, I am not asking the right question. I apologize for any confusion :(
 
  • #7
micromass said:
Again, how do you define a semi ring?

As I see it, the book defines ##BL_n## as the Hasse diagram of the lattice ##\mathcal{P}(\{1,...,n\})##: http://en.wikipedia.org/wiki/Hasse_diagram

You are right I see it now, it does say the set of all subsets of the vertex set, I guess I have been reading that wrong, but still leaves the second part, is the semi ring a power set too? I am probably not right in saying that it is, but since it contains the null set it is kind of hard for me not to think that it is, I just don't want to be making a huge mistake and have to turn back D:
 
  • #8
For the last time, what do you mean with a semi ring?
 
  • #9
Okay, in the book it defines ##\mathcal{X}## as the system of semi rings (of sets) if
i.) ##\emptyset \in \mathcal{X}##
ii.) ##\bigcap_{n=1}^{m}A_{n} \in \mathcal{X}## when ever ##A_{n} \in \mathcal{X}##
iii.) When ##A \in \mathcal{X}## and ##A_{1} \subset A##, then ##A## can be represented as a finite union of ##A = \bigcup_{n=1}^{m}A_{n}## and then it begins to list some examples :/
 
  • #10
Your definition has some errors, but now I finally know what kind of semiring you mean.

So, you want to ask whether a semiring is a power set? The answer is no. You can very easily construct semirings which are not the entire power set.
For example, take ##\mathcal{X}\subseteq \mathcal{P}(\{0,1\})## and take ##\mathcal{X} = \{ \emptyset, \{0\}, \{1\} \}##. This is a semiring, but not the power set.
 
  • #11
Okay I get what you are saying , I think... So, there are some instances in which the semiring acts as a power set, but in general it need not be a power set. Okay, thank you, that cleared it up.
 

1. What is a Boolean Ring?

A Boolean Ring is a mathematical structure that consists of a set of elements along with two binary operations, addition and multiplication. These operations follow specific rules and properties, and can be used to represent a system of switches or logic gates.

2. What are the properties of a Boolean Ring?

The properties of a Boolean Ring include closure, associativity, commutativity, identity elements, and inverse elements. These properties ensure that the operations of addition and multiplication are well-defined and produce consistent results.

3. How is a Boolean Ring used to represent a system of switches?

A Boolean Ring can be used to represent a system of switches by assigning the values of 0 and 1 to the two elements in the ring. The addition operation represents the OR logic gate, while the multiplication operation represents the AND logic gate. This allows for the manipulation of the switches to produce different logical outputs.

4. What is the relationship between Boolean Rings and Boolean Algebra?

Boolean Rings and Boolean Algebra are closely related, as Boolean Rings can be used to represent Boolean Algebraic expressions. Boolean Algebra is a system of mathematical logic that deals with binary variables and logical operations, while Boolean Rings provide a mathematical structure for performing these operations.

5. What are some real-world applications of Boolean Rings?

Boolean Rings have various real-world applications, including in computer science for circuit design and digital logic, in cryptography for creating secure systems and encryption algorithms, and in mathematical modeling for representing complex systems with logical components.

Similar threads

Replies
2
Views
1K
  • Linear and Abstract Algebra
Replies
1
Views
1K
  • Linear and Abstract Algebra
Replies
2
Views
1K
  • Linear and Abstract Algebra
Replies
16
Views
3K
  • Linear and Abstract Algebra
Replies
2
Views
2K
  • Linear and Abstract Algebra
Replies
2
Views
1K
  • Linear and Abstract Algebra
Replies
2
Views
2K
Replies
23
Views
4K
  • Linear and Abstract Algebra
Replies
4
Views
2K
Replies
1
Views
1K
Back
Top