Singleton (set theory)
From Maths
Revision as of 15:57, 8 March 2017 by Alec (Talk | contribs) (Created page with "__TOC__ =={{subpage|Definition}}== {{/Definition}} More concisely this may be written: * {{M|\exists t\in X\forall s[s\in X\implies t\eq s]}} ==Significance== Notice that we h...")
Contents
[hide]Definition
Let X be a set. We call X a singleton if[1]:
- ∃t[t∈X∧∀s(s∈X→s=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:
- ∃t∈X∀s∈X[t=s][Note 2]
More concisely this may be written:
- ∃t∈X∀s[s∈X⟹t=s]
Significance
Notice that we have manage to define a set containing one thing without any notion of the number 1.
See next
References
Cite error: <ref>
tags exist for a group named "Note", but no corresponding <references group="Note"/>
tag was found, or a closing </ref>
is missing