Singleton (set theory)/Definition

From Maths
Jump to: navigation, search
Grade: B
This page requires references, it is on a to-do list for being expanded with them.
Please note that this does not mean the content is unreliable, it just means that the author of the page doesn't have a book to hand, or remember the book to find it, which would have been a suitable reference.
The message provided is:
Book reference would be great!

Definition

Let X be a set. We call X a singleton if[1]:

  • t[tXs(sXs=t)]Caveat:See:[Note 1]
    • In words: X is a singleton if: there exists a thing such that ( the thing is in X and for any stuff ( if that stuff is in X then the stuff is the thing ) )

More concisely this may be written:

  • tXsX[t=s][Note 2]

Notes

  1. Jump up Note that:
    • t[tXs(sXs=t)]
    Does not work! As if tX by the nature of logical implication we do not care about the truth or falsity of the right hand side of the first ! Spotted when starting proof of "A pair of identical elements is a singleton"
  2. Jump up see rewriting for-all and exists within set theory

References

  1. Jump up Warwick lecture notes - Set Theory - 2011 - Adam Epstein - page 2.75.