You're reading the public-facing archive of the Category Theory Zulip server.
To join the server you need an invite. Anybody can get an invite by contacting Matteo Capucci at name dot surname at gmail dot com.
For all things related to this archive refer to the same person.
Hi folks!
Happily working through How To Prove It and ran into an interesting struggle on simplifying set statements. I was given this problem:
Simplify the statement. Which variables are free and which are bound? If the statement has no free variables, say wheter it is true or false:
and the following is my attempt:
and x is a bound variable and c is a free variable
Does that look like I simplified it about right? The part that I am still a bit confused about is the part of and whether I can simplify that further. Otherwise I think that is all I can do from what I can tell.
Thanks!
P.S. I meant to title this post “Simplifying Set Expressions” but am unsure how to fix the post title. :frown:
EDIT: Figured it out!
Jacob Zelko said:
and the following is my attempt:
and x is a bound variable and c is a free variable
Does that look like I simplified it about right? The part that I am still a bit confused about is the part of and whether I can simplify that further. Otherwise I think that is all I can do from what I can tell.
Thanks!
It's almost all good except for the , how did you get that ?
Additionally, another problem that I ran into which I found very challenging was this one (it has the same requirements in trying to determine an answer):
I took a few steps to figure this one out as best as possible. What I first did is say that represents the statement x is a prime number. Then I simplified this first to which I then finally simplified to and said that the statement is false and that and are bound variables. Does that seem to make sense? My question more was about if I did my simplification step of using a statement correctly for the statement about primes.
@Jean-Baptiste Vienney — sorry about that, just saw your response while I was still typing up my challenges! Let me get you that piece of work. Hang on just a moment…
AH you’re right I’m crazy. I did a small arithmetic error. That part should be
Not
Jacob Zelko said:
Additionally, another problem that I ran into which I found very challenging was this one (it has the same requirements in trying to determine an answer):
I took a few steps to figure this one out as best as possible. What I first did is say that represents the statement x is a prime number. Then I simplified this first to
There is a small issue here (although the general idea is good), does it make sense to say that where is "x > 4"
for instance?
Jacob Zelko said:
Simplify the statement. Which variables are free and which are bound? If the statement has no free variables, say wheter it is true or false:
I am not sure what the book is trying to get you to do, but if someone asked me to simplify this, I would write , and I couldn't say whether it is true or false because that depends ont the value of which is free as you said. I don't know if your attempt counts as a simplified expression.
For the other one :
I would say " is a prime number and " and this is false. because is not a prime number.
Additionally, writing is not great use of the set-builder notation imo. It is understandable, but usually the left part of set builder is only to say which set we are starting from and what notation will we use for elements of that set. I would prefer something like: Let be the set of prime numbers, then consider the set .
Hm. I see what you mean @Jean-Baptiste Vienney . That doesn't make sense because that would just be the expression as an element in some set. Would it make more sense then to say using your definition of ? I would read the latter formulation I presented as the set of all 's greater than and that is true.
Oh @Ralph Sarkis this is super helpful! Yea, the textbook confused me on what exactly the left and right parts of set builder notation precisely are used for. They may’ve been abusing the notation slightly in an effort to provide greater challenge but i really like the presentation you laid out there.
Jacob Zelko said:
Hm. I see what you mean Jean-Baptiste Vienney . That doesn't make sense because that would just be the expression as an element in some set. Would it make more sense then to say using your definition of ? I would read the latter formulation I presented as the set of all 's greater than and that is true.
Yeah, that's exactly the problem. The usual notation is , so you can say that is true.
or better that is true.
I’m interested to know how you got to in your formulation of the element hood test in the first problem I showed @Ralph Sarkis . How did you get to that?
I am unrolling all symbols one by one to get something that I find as simple as I want. We start with the statement
This is the same thing as (by looking at the definition of :
I can simplify what is inside the NOT by replacing by in the right part (because that is what set-builder notation means):
A bit of algebra gives me:
Finally, I put the NOT back insider: (EDIT: I fixed my arithmetic mistake noted by Jean-Baptiste)
I think you wanted to write
Oh wow. There were a few examples on how to do what you just did but I was struggling to follow them. This was super clarifying. Thanks @Ralph Sarkis. Imma go back to my problems and retry this simplification process Better now that it is more clear to me
Thanks for the help you both!!! :clap: