MHB Proof of a set union and intersection

bargaj
Messages
2
Reaction score
0
Hello!
Lately, I've been struggling with this assignment. (angle brackets represent closed interval)
Screenshot_20211116_184448(1).png


I figured out that:

a)
union = R
intersection = {0}
b)
union = (0, 2)
intersection = {1}

I asked my prof about this and she explained to me that it should be shown that if a set is an intersection of sets, then it belongs to each of those sets and, conversely, nothing else belongs to the intersection, so every other element does not belong to at least one of those sets. But I don't really know how to interpret this or where to even start. (normally, when proving the equality of two sets, I would try to prove that A⊆B and B⊆A, but I don't see how that's applicable here).

Thank you for your help!
 
Physics news on Phys.org
bargaj said:
angle brackets represent closed interval
Never seen this notation. Usually closed intervals are denoted by square brackets.

bargaj said:
a)
union = R
intersection = {0}
b)
union = (0, 2)
intersection = {1}
I agree.

bargaj said:
I asked my prof about this and she explained to me that it should be shown that if a set is an intersection of sets, then it belongs to each of those sets and, conversely, nothing else belongs to the intersection, so every other element does not belong to at least one of those sets.
So we reached a consensus, right?

bargaj said:
But I don't really know how to interpret this or where to even start.
You not only started, but also finished solving these problems.The professor just described the definition of intersection, which you have successfully applied, so you must have understood it.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top